RGPV 3rd Sem CBCS IT Syllabus | RGPV Information Technology Syllabus CBCS 3rd Sem 2nd Year www.rgpv.ac.in - CETJob

# RGPV 3rd Sem CBCS IT Syllabus | RGPV Information Technology Syllabus CBCS 3rd Sem 2nd Year www.rgpv.ac.in

## RGPV 3rd Sem CBCS IT Syllabus | RGPV Information Technology Syllabus CBCS 2nd Year

-->

 RGPV 3rd Sem Information Technology Subjects RGPV 4th Sem Information Technology Subjects ·         Mathematics-III (Departmental Mathematics) ·         Analysis and Design of Algorithms ·         DC    Digital Circuit and System ·         Object Oriented ·         Programming & Methodology ·         DC    Discrete Structure ·         HU    Communication Skills ·         DC    Idea Generation ·         DC    Learning Through Experts ·         Data Base Management System ·         EAS    System Engineering ·         DC    Operating System ·         DC    Communication Systems ·         DC    Computer Architecture ·         EAS    Material Science ·         EAS    JAVA ·         HU    NSS/NCC

## RGPV 2nd year CBCS Information Technology Engineering Syllabus (3rd Sem Syllabus)

### RGPV CBCS 3rd Sem Analysis and Design of Algorithms Syllabus

Unit-1: Introduction of Algorithms, Analysis of algorithms: Space Complexity, Time Complexity, recurrence relation and Asymptotic Notation, Divide and Conquer: General Methods, Analysis and Design, Binary Search, Quick sort, Merge sort, Strassen’s matrix multiplication.
Unit-2: Greedy Strategy: Introduction, examples of greedy method like optimal merge pattern, Huffman coding, Minimum spanning trees, knapsack problem, job sequencing with dead lines single source shortest path algorithms.
Unit-3: Dynamic Programming: Introduction, Problem based on this approach such as 0/1 Knapsack Multistage graph, reliability design, Floyd-warshall algorithms.
Unit-4: Backtracking Concept and its example like 8 Queen’s problem, Hamiltonian cycle, Graph coloring problem, 15 Puzzle problem, Least Cost Search
Unit-5: Introduction to branch & bound method, examples of branch & bound methods like traveling sales man problem, meaning of lower bound theory and its use in solving algebraic problem. NP-completeness & NP hard problems. Basic Concept of non deterministic algorithms. NP hard and NP complete classes.
-->

### RGPV CBCS 3rd Sem Analysis and Design of Algorithms Syllabus

Digital Circuits and Systems
Unit-1: Number systems and logic gates: Decimal, Binary, Octal, Hexadecimal number systems and radix
conversion. Codes- BCD, excess 3, gray, ASCII. Boolean algebra- Theorems and properties, Boolean functions, canonical and standard forms, De Morgans theorem, digital logic gates, Karnaugh maps.
Unit-2: Combinational circuits: Introduction to combinational circuits, multilevel NAND, NOR implementation. Designing binary Adders and Subtractors. Decoder, Encoder, Multiplexer, Demultiplexer circuits.
Unit-3: Sequential circuits: Introduction to Sequential circuits, flip-flops, RS, D, T, JK, M/S JK-flip-flops, truth tables, excitation tables and characteristic equations, clocked and edge triggered flip-flops, Registers- Definition, serial, parallel, shift left/right registers, Johnson counter, asynchronous and synchronous counters.
Unit-4: Digital logic families: Bipolar and unipolar logic families, Digital IC specifications, RTL, DTL, All types of TTL circuits, ECL, IIL, PMOS, NMOS & CMOS Logic.
Unit-5: Clocks and timing circuits: Bistable, Monostable & Astable multivibrator, Schmitt trigger circuit,
Introduction of Analog to Digital & Digital to Analog converters, Display devices, 7 and 16 segment LED display,
LCD.
-->

### RGPV CBCS 3rd Sem Object Oriented Programming & Methodology Syllabus

Unit-1: Introduction: Object oriented programming, Introduction, Application, characteristics, difference between object oriented and procedure programming, Comparison of C and C++, Cout, Cin, Data Type, Type Conversion, Control Statement, Loops, Arrays and string arrays fundamentals, Function, Returning values from functions, Reference arguments, Overloaded function, Inline function, Default arguments, Returning by reference.
Unit-2: Object and Classes: Implementation of class and object in C++, access modifiers, object as data type, constructor, destructor, Object as function arguments, default copy constructor, parameterized constructor, returning object from function, Structures and classes, Classes objects and memory, static class data, Arrays of object, Arrays as class Member Data, The standard C++ String class, Run time and Compile time polymorphism.
Unit-4: Pointer and Virtual Function: Addresses and pointers, the address-of operator & pointer and arrays,
Pointer and Function pointer, Memory management: New and Delete, pointers to objects, debugging pointers, Virtual Function, friend function, Static function, friend class, Assignment and copy initialization, this pointer, dynamic type information.
Unit-5: Streams and Files: Streams classes, Stream Errors, Disk File I/O with streams, file pointers, error handling in file I/O with member function, overloading the extraction and insertion operators, memory as a stream object, command line arguments, printer output, Function templates, Class templates Exceptions, Containers, exception handling.
-->

### RGPV CBCS 3rd Sem Discrete Structure Syllabus

Unit-1: 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:
Unit-2: Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings and Fields: definition and standard results.
Unit-3: 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-4: 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-5: 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, 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.