# RGPV Syllabus for 3rd Sem CSE Branch

B.E. 301 – ENGINEERING MATHEMATICS II

Unit I

Fourier Series: Introduction of Fourier series , Fourier series for Discontinuous functions, Fourier series for even and odd function, Half range series Fourier Transform: Definition and properties of Fourier transform, Sine and Cosine transform.

Unit II

Laplace Transform: Introduction of Laplace Transform, Laplace Transform of elementary functions, properties of Laplace Transform, Change of scale property, second shifting property, Laplace transform of the derivative, Inverse Laplace transform & its properties, Convolution theorem, Applications of L.T. to solve the ordinary differential equations

Unit III

Second Order linear differential equation with variable coefficients : Methods one integral is known, removal of first derivative, changing of independent variable and variation of parameter, Solution by Series Method

Unit IV

Linear and Non Linear partial differential equation of first order: Formulation of partial differential equations, solution of equation by direct integration, Lagrange’s Linear equation, charpit’s method. Linear partial differential equation of second and higher order: Linear homogeneous and Non homogeneous partial diff. equation of nth order with constant coefficients. Separation of variable method for the solution of wave and heat equations

Unit V

Vector Calculus: Differentiation of vectors, scalar and vector point function, geometrical meaning of Gradient, unit normal vector and directional derivative, physical interpretation of divergence and Curl. Line integral, surface integral and volume integral, Green’s, Stoke’s and Gauss divergence theorem

References

(i)                 Advanced Engineering Mathematics by Erwin Kreyszig, Wiley India

(ii)               Higher Engineering Mathematics by BS Grewal, Khanna Publication

(iii)             Advance Engineering Mathematics by D.G.Guffy

(iv)              Mathematics for Engineers by S.Arumungam, SCITECH Publuication

(v)                Engineering Mathematics by S S Sastri. P.H.I.

CS- 302 Discrete Structures

Unit-I

Set Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, Equivalence relation, Partial ordering relation, Job-Scheduling problem Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions, pigeonhole principle. Theorem proving Techniques: Mathematical induction, Proof by contradiction.

Unit-II

Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results,

Rings and Fields: definition and standard results.

Unit-III

Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Normal Forms, Universal and existential quantifiers. Introduction to finite state machine Finite state machines as models of physical system equivalence machines, Finite state machines as language recognizers

Unit-IV

Graph Theory: Introduction and basic terminology of graphs, Planer graphs, Multigraphs and weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits, Graph coloring, chromatic number, Isomorphism and Homomorphism of graphs.

Unit V

Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded and complemented lattices. Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multimonial Coefficients Recurrence Relation and Generating Function: Introduction to Recurrence Relation and Recursive algorithms , Linear recurrence relations with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions , Generating functions , Solution by method of generating functions,

Refereences:

1. C.L.Liu, “Elements of Discrete Mathematics” Tata Mc Graw-Hill Edition.
2. Trembley, J.P & Manohar; “Discrete Mathematical Structure with Application CS”, McGraw Hill.
3. Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill.
4. Lipschutz; Discrete mathematics (Schaum); TMH
5. Deo, Narsingh, “Graph Theory With application to Engineering and Computer.Science.”, PHI.
6. Krishnamurthy V; “Combinatorics Theory & Application”, East-West Press Pvt. Ltd., New Delhi.
7. S k Sarkar “ Discrete Mathematics”, S. Chand Pub

CS- 303 Digital Circuit & System

Unit I

Number systems & codes, Binary arithmetic , Boolean algebra and switching function.

Minimization of switching function, Concept of prime implicant , Karnaugh map method, Quine & McCluskey’s method, Cases with don’t care terms, Multiple output switching function.

Unit II

Unit III

Linear wave shaping circuits, Bistable, Monostable & Astable multivibrator, Schmitt trigger circuits & Schmitt-Nand gates. Logic families : RTL, DTL, All types of TTL circuits , ECL, I2L , PMOS, NMOS & CMOS logic, Gated flip-flops and gated multivibrator , Interfacing between TTL to MOS.

Unit IV

Decoders, Encoders, Multiplexers, Demultiplexers, Introduction to various semiconductor memories & designing with ROM and PLA. Introduction to Shift Registers, Counters, Synchronous & asynchronous counters, Designing of Combinational circuits like code converters.

Unit V

Introduction of Analog to Digital & Digital to Analog converters, sample & hold circuits and V-F converters.

References:

1. M. Mano; “Digital Logic & Computer Design”; PHI.
2. Malvino & Leach; “Digital Principles & Applications”; TMH
3. W.H. Gothman; “Digital Electronics”; PHI.
4. Millman & Taub; “Pulse, Digital & Switching Waveforms”; TMH
5. Jain RP; Modern digital Electronics; TMH
6. R.J. Tocci, “Digital Systems Principles & Applications”.

List of experiment (Expandable)

1. To study and test of operation of all logic gates for various IC’s (IC#7400,IC#7403,IC# 7408,IC#74332,IC#7486).
2. Verification of Demorgan’s theorem.
4. To construct of half subtractor and full subtractor circuits
5. Verification of versatility of NAND gate.
6. Verification of versatility of NOR gate.
7. Designing and verification of property of full adder.
8. Design a BCD to excess-3 code converter.
9. Design a Multiplexer/ Demultiplexer.

CS- 304 Electronics Devices & Circuits

Unit I

Semiconductor device, theory of P-N junction, temperature dependence and break down characteristics, junction capacitances. Zener diode, Varactor diode, PIN diode, LED, Photo diode, Transistors BJT, FET, MOSFET, types, working principal, characteristics, and region of operation, load line biasing method. Transistor as an amplifier, gain, bandwidth, frequency response, h- parameters equivalent, type of amplifier.

Unit II

Feedback amplifier, negative feedback, voltage-series, voltage shunt, current series and current shunt feedback, Sinusoidal oscillators, L-C (Hartley-Colpitts) oscillators, RC phase shift, Wien bridge, and Crystal oscillators. Power amplifiers, class A, class B, class A B, C amplifiers, their efficiency and power Dissipation.

Unit III Switching characteristics of diode and transistor, turn ON, OFF time, reverse recovery time, transistor as switch, Multivibrators, Bistable, Monostable, Astable multivibarators. Cllipers and clampers, Differential amplifier, calculation of differential, common mode gain and CMRR using hparameters, Darlington pair, Boot strapping technique. Cascade and cascode amplifier.

Unit IV

Operational amplifier characteristics, slew rate, full power bandwidth, offset voltage, bias current, application ,inverting , non inverting amplifier , summer , averager , differentiator, integrator, differential amplifier , instrumentation amplifier , log and antilog amplifier , voltage to current and current to voltage converters , comparators Schmitt trigger , active filters, 555 timer and its application.

Unit V

Regulated power supplies., Series and shunt regulators, current limiting circuits, Introduction to IC voltage regulators, fixed and adjustable switching regulators, SMPS ,UPS

References:

1. Milliman Hallkias – Integrated Electronics; TMH Pub.
2. Gayakwad; OP-amp and linear Integrated Circuits; Pearson Education
3. Salivahanan; Electronic devices and circuits; TMH
4. Salivahanan; Linear Integrated Circuits; TMH-
5. Miliman Grabel; Micro electronics , TMH
6. RobertBoylestad & Nashetsky; Electronics Devices and circuit Theory; Pearson Ed.

List of Experiments (Expandable):

1. Diode and Transistor characteristics
2. Transistor Applications (Amplifier and switching)
3. OP-Amp and its Applications
4. 555 timer and its Applications

CS- 305 Data Structures

Unit I

Introduction: Basic Terminology, Data types and its classification, Algorithm complexity notations like big Oh,D,D. Array Definition, Representation and Analysis of Arrays, Single and Multidimensional Arrays, Address calculation, Array as Parameters, Ordered List and operations, Sparse Matrices, Storage pools, Garbage collection. Recursion-definition and processes, simulating recursion, Backtracking, Recursive algorithms, Tail recursion, Removal of recursion. Tower of Hanoi Problem.

UNIT II

Stack, Array Implementation of stack, Linked Representation of Stack, Application of stack: Conversion of Infix to Prefix and Postfix Expressions and Expression evaluation, Queue, Array and linked implementation of queues, Circular queues, D-queues and Priority Queues. Linked list, Implementation of Singly Linked List, Two-way Header List, Doubly linked list, Linked List in Array. Generalized linked list, Application: Garbage collection and compaction, Polynomial Arithmetic.

UNIT III

Trees: Basic terminology, Binary Trees, , algebraic Expressions, Complete Binary Tree,

Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees, Binary Search Tree (BsT ), AVL Trees, B-trees. Application: Algebraic Expression, Huffman coding Algorithm.

UNIT IV

nternal and External sorting ,Insertion Sort, Bubble Sort, selection sort Quick Sort, Merge Sort, Heap Sort, Radix sort, Searching & Hashing: Sequential search, binary search, Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation. Symbol Table, Static tree table, Dynamic Tree table.

Unit V

Graphs: Introduction, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees.

Reference:

1. R. Kruse et al, “Data Structures and Program Design in C”, Pearson Education Asia, Delhi-2002
2. ISRD Group; Data structures using C; TMH
3. Lipschutz; Data structure (Schaum); TMH
4. Horowitz and Sahani, “Fundamentals of data Structures”, Galgotia Publication Pvt. Ltd., N Delhi. A. M. Tenenbaum, “Data Structures using C & C++”, Prentice-Hall of India Pvt. Ltd., New Delhi.
5. Data Structures Trembley and Sorenson, TMH Publications
6. Pai; Data structure and algorithm; TMH
7. Introduction to Algorithm- Corman, AWL

List of Experiments (expandable):

Programs in C relating to different theory units.

CS- 306 Java Technology

UNIT-I

Basic Java Features – C++ Vs JAVA, JAVA virtual machine, Constant & Variables, Data Types, Class, Methods, Objects, Strings and Arrays, Type Casting, Operators, Precedence relations,

Control Statements, Exception Handling, File and Streams, Visibility, Constructors, Operator and Methods Overloading, Static Members, Inheritance: Polymorphism, Abstract methods and Classes

UNIT-II

Java Collective Frame Work – Data Structures: Introduction, Type-Wrapper Classes for Primitive Types, Dynamic Memory Allocation, Linked List, Stack, Queues, Trees,

Generics: Introduction, Overloading Generic Methods, Generic Classes, Collections: Interface Collection and Class Collections, Lists, Array List and Iterator, Linked List, Vector.

Collections Algorithms: Algorithm sorts, Algorithm shuffle, Algorithms reverse, fill, copy, max and min Algorithm binary Search, Algorithms add All, Stack Class of Package java. Util, Class Priority Queue and Interface Queue, Maps, Properties Class, Un-modifiable Collections.

UNIT-III

Advance Java Features – Multithreading: Thread States, Priorities and Thread Scheduling, Life Cycle of a Thread, Thread Synchronization, Creating and Executing Threads, Multithreading with GUI, Monitors and Monitor Locks. Networking: Manipulating URLs, Reading a file on a Web Server, Socket programming, Security and the Network, RMI, Networking, Accessing Databases with JDBC: Relational Database, SQL, MySQL, Oracle

UNIT-IV

Advance Java Technologies – Servlets: Overview and Architecture, Setting Up the Apache Tomcat Server, Handling HTTP get Requests, Deploying a web Application, Multitier Applications, Using JDBC from a Servlet, Java Server Pages (JSP): Overview, First JSP Example, Implicit Objects, Scripting, Standard Actions, Directives, Multimedia: Applets and Application: Loading, Displaying and Scaling Images, Animating a Series of Images, Loading and playing Audio clips

UNIT-V

Advance Web/Internet Programming (Overview): J2ME, J2EE, EJB, XML.

References:

1. Deitel & Deitel, ’’JAVA, How to Program”; PHI, Pearson.
2. E. Balaguruswamy, “Programming In Java”; TMH Publications
3. The Complete Reference: Herbert Schildt, TMH
4. Peter Norton, “Peter Norton Guide To Java Programming”, Techmedia.
5. Merlin Hughes, et al; Java Network Programming , Manning Publications/Prentice Hall
6. Cay Horstmann, Big JAVA, Wiely India.

List of Program to be perform (Expandable)

1. Installation of J2SDK
2. Write a program to show Scope of Variables
3. Write a program to show Concept of CLASS in JAVA
4. Write a program to show Type Casting in JAVA
5. Write a program to show How Exception Handling is in JAVA
6. Write a Program to show Inheritance
7. Write a program to show Polymorphism
8. Write a program to show Access Specifiers (Public, Private, Protected) in JAVA
9. Write a program to show use and Advantages of CONTRUCTOR
10. Write a program to show Interfacing between two classes
11. Write a program to Add a Class to a Package
12. Write a program to show Life Cycle of a Thread
13. Write a program to demonstrate AWT.
14. Write a program to Hide a Class
15. Write a Program to show Data Base Connectivity Using JAVA
16. Write a Program to show “HELLO JAVA ” in Explorer using Applet
17. Write a Program to show Connectivity using JDBC
18. Write a program to demonstrate multithreading using Java.
19. Write a program to demonstrate applet life cycle.
20. Write a program to demonstrate concept of servlet.

Objective of Self Study: is to induce the student to explore and read technical aspects of his area of interest / hobby or new topics suggested by faculty.

Evaluation will be done by assigned faculty based on report/seminar presentation and viva.

Objective of GD and seminar is to improve the MASS COMMUNICATION and CONVINCING/ understanding skills of students and it is to give student an opportunity to exercise their rights to express themselves.

Evaluation will be done by assigned faculty based on group discussion and power point presentation.

### 1 thought on “RGPV Syllabus for 3rd Sem CSE Branch”

1. Its pretty interesting that the mainstream media has changed the way it looks at this recently dont you think? Now it seems that it is discussed thoroughly and more in depth. Overall though Im looking for a change.
Longchamp Sale Tj Maxs http://www.ukrinform.ua/asop_copy/WLyx20mR.html