IT 4th sem syllabus RGTU/RGPV Information Technology IT 4th sem syllabus

 Rajiv Gandhi Technological University, Bhopal (MP)
B.E. Information Technology (IT) Syllabus

RGPV/RGTU FOURTH- IV SEMESTER Syllabus

RGTU/RGPV Information Technology IT 4th Semester Syllabus
IT 406 Dot.Net Syllabus

RGTU/RGPV Information Technology IT 4th Semester Syllabus
IT-402 Discrete Structure (Mathematics-IV) Syllabus

RGTU/RGPV Information Technology IT 4th Semester Syllabus
IT-403 Data Base Management System (DBMS)  SYLLABUS

RGTU/RGPV Information Technology IT 4th Semester Syllabus IT-404  Analysis & Design  of Algorithm (ADA) Syllabus

RGTU/RGPV Information Technology IT 4th Semester Syllabus
 IT-405 Analog and Digital Communication (ADC) Syllabus

RGTU/RGPV Information Technology IT 4th Semester Syllabus IT 4th sem syllabus RGTU/RGPV Information Technology  IT 4th sem syllabus

IT 4th sem Analog and Digital Communication (ADC) Syllabus IT 405

IT-405 Analog and Digital Communication (ADC) Syllabus

 RGTU/RGPV Analog and Digital Communication (ADC) SYLLABUS

Information Technology IT 4th Semester Syllabus,

Unit-I Time domain and frequency domain representation of signal, Fourier Transform and its properties, Transform of Gate, Periodic gate, Impulse periodic impulse sine and cosine wave, Concept of energy density and power density (Parseval’s theorem), Power density of periodic gate and impulse function, impulse response of a system, convolutions, convolution with impulse function, causal and non causal system impulse response of ideal low pass filter, Correlation & Auto correlation.

Unit-II Base band signal, need of modulation, Introduction of modulations techniques,Amplitude modulation, Equation and its frequency domain representation, Bandwidth, Power distribution. AM suppressed carrier waveform equation and frequency  domain representation Generation (Balance/Chopper modulator) and synchronous detection technique, errors in synchronous detection, Introduction to SSB and VSB Transmission Angle modulation, Frequency and phase modulation equation and their relative phase and frequency deviations, modulation index frequency spectrum, NBFM and WBFM, Bandwidth comparison of modulation techniques.

Unit-III Sampling of signal, sampling theorem for low pass and Band pass signal, Pulse amplitude modulation (PAM), Time division, multiplexing (TDM). Channel Bandwidth for PAM-TDM signal Type of sampling instantaneous, Natural and flat top, Aperture effect, Introduction to pulse position and pulse duration modulations, Digital signal, Quantization, Quantization error, Pulse code modulation, signal to noise ratio, Companding, Data rate and Baud rate, Bit rate, multiplexed PCM signal, Differential PCM (DPCM), Delta Modulation (DM) and Adaptive Delta Modulation (ADM), comparison of various systems.

Unit-IV Digital modulations techniques, Generation, detection, equation and Bandwidth of amplitude shift keying (ASK) Binary Phase Shift keying (BPSK), Differential phase shift keying (DPSK), offset and non offset quadrature phase shift keying (QPSK), M-Ary PSK, Binary frequency Shift Keying (BFSK), M-Ary FSK Quadrature Amplitude modulation (QAM), MODEM, Introduction to probability of error.
Unit-V Information theory and coding- Information, entropies (Marginal and conditional), Model of a communication system, Mathematical representation of source, channel and receiver characteristics, Mutual information, channel capacity efficiency of noise free channel Binary symmetric channel (BSC) Binary erasure channel (BEC), Repetition of signal, NM symmetric Binary channel, Shannon theorem, Shanon-Hartley theorem (S/N-BW trade off)Source encoding code properties; Shanon, Fano and Huffman coding methods and their efficiency error control coding, Minimum Hamming distance, Linear Block Code, Cyclic code and convolution codes. Line Encoding: Manchester coding, RZ, NRZ coding.

Analog and Digital Communication (ADC) References:
1. Singh & Sapre, Communication System, TMH
2. Taub & shilling, Communication System, TMH
3. Hsu; Analog and digital communication(Schaum); TMH
4. B.P. Lathi, Modern Digital and analog communication system, 
5. Simon Haykins, Communication System. John Willy
6. Wayne Tomasi, Electronic Communication system. 
7. Martin S. Roden, Analog & Digital Communication System;  Discovery Press.
8. Frank R. Dungan, Electronic Communication System, Thomson/Vikas. 

Analog and Digital Communication (ADC) List of Experiments(Expandable)
1. Study of sampling process and signal reconstruction and aliasing.
2. Study of PAM PPM and PDM
3. Study of PCM transmitter and receiver.
4. Time division multiplexing (TDM) and De multiplexing
5. Study of ASK PSK and FSK transmitter and receiver.
6. Study of AM modulation and Demodulation techniques (Transmitter and Receiver) Calculate of parameters
7. Study of FM modulation and demodulation (Transmitter and Receiver) & Calculation of  parameters
8. To construct and verify pre emphasis and de-emphasis and plot the wave forms.
9. Study of super heterodyne receiver and characteristics of ratio radio receiver.
10. To construct frequency multiplier circuit and to observe the waveform
11. Study of AVC and AFC.

IT 4th sem Analysis & Design of Algorithm (ADA) Syllabus IT 404

IT-404  Analysis & Design  of Algorithm (ADA) Syllabus

 RGTU/RGPV  Analysis & Design  of Algorithm (ADA) SYLLABUS

Information Technology IT 4th Semester Syllabus,

Unit I Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations, heap and heap  sort. Introduction to divide and conquer technique, analysis, design and comparison of various  algorithms based on this technique, example binary search, merge sort, quick sort, strassen’s matrix  multiplication.

Unit II Study of Greedy strategy, examples of greedy method like optimal merge patterns, Huffman  coding, minimum spanning trees, knapsack problem, job sequencing with deadlines, single source  shortest path algorithm, etc.

Unit III Concept of dynamic programming, problems based on this approach such as 0/1 knapsack,  multistage graph, reliability design, Floyd-Warshall algorithm, etc.

Unit IV Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle, Graph  coloring problem etc. Introduction to branch & bound method, examples of branch and bound method like traveling salesman problem etc. Meaning of lower bound theory and its use in solving algebraic problem, introduction to parallel algorithms.

Unit V Binary search trees, height balanced trees, 2-3 trees, B-trees, basic search and traversal techniques for trees and graphs (In order, preorder, postorder, DFS, BFS), NP-completeness.

Analysis & Design  of Algorithm (ADA) References:
1. Coremen Thomas, Leiserson CE, Rivest RL; Introduction to Algorithms; PHI.
2. Horowitz & Sahani; Analysis & Design of Algorithm 
3. Dasgupta; algorithms; TMH
4. Ullmann; Analysis & Design of Algorithm;
5. Michael T Goodrich, Robarto Tamassia, Algorithm Design, Wiely India 

List of Experiments Analysis & Design  of Algorithm (ADA) ( expandable):
1. Write a program for Iterative and Recursive Binary Search.
2. Write a program for Merge Sort.
3. Write a program for Quick Sort.
4. Write a program for Strassen’s Matrix Multiplication. 
5. Write a program for optimal merge patterns.
6. Write a program for Huffman coding.
7. Write a program for minimum spanning trees using Kruskal’s algorithm.
8. Write a program for minimum spanning trees using  Prim’s algorithm.
9. Write a program for single sources shortest path algorithm.
10. Write a program for Floye-Warshal algorithm.
11. Write a program for traveling salesman problem.
12. Write a program for Hamiltonian cycle problem

IT 4th Sem Data Base Management System (DBMS) Syllabus IT 403

IT-403 Data Base Management System (DBMS)  SYLLABUS 

 RGTU/RGPV Data Base Management System (DBMS) SYLLABUS

Information Technology IT 4th Semester DBMS Syllabus,

Unit 1 Basic Concepts: DBMS Concepts and architecture Introduction, Review of file organization  techniques, Database approach v/s Traditional tile  accessing approach, Advantages of database  systems, Data models, Schemas and instances, Data independence, Functions of DBA and designer.  Entities and attributes, Entity types, Value, Sets, Key attributes, Relationships, Defining the E-R  diagram of database, 

Unit 2: Data models and Relational Databases Various data models, Basic concepts of Hierarchical  data model, Network data model, and Relational data model, Comparison between the three types of  models, Relational Data models: Domains, Tuples, Attributes, Relations, Characteristics of relations,  Keys, Key attributes of relation, Relational database, Schemas, Integrity constraints, Intension and
Extension, 

Unit 3: Structured Query Language Relational Query languages: Relational algebra and relational  calculus, Relational algebra operations like select, Project, Join, Division, outer union.  SQL: Data  definition in SQL, update statements and views in SQL QUEL & QBE: Data storage and definitions,  Data retrieval queries and update statements.

Unit 4: Database Design Data Base Design: Introduction to normalization, Normal forms, Functional  dependency, Decomposition, Dependency preservation and lossless join, problems with null valued  and dangling tuples, multi-valued dependencies.

Unit 5: Advance Concepts: Introduction to: Distributed databases, protection, security and integrity  constraints, concurrent operation on databases, recovery and transaction processing, basic concepts of  object oriented data base system and design.
 
References:
1. Elmasri, Navathe, “Fundamentals Of Database Systems”, Addision Wesley
2. Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill
3. Toledo; Data base management systems;TMH
4. Panneeselvam “Database Management System” PHI
5. Date C J, “An Introduction To Database System”, Addision Wesley
6. Majumdar ; DBMS; TMH
7. Fundamental of Data Base Management System by Leon & Leon, TMH
8. Oracle 9i Database Administration fundamental – I, volume 1, Oracle Press.

Suggested list of experiments(expandable): -
In this subject the students are supposed to prepare a small database application in complete semester  like financial accounting system, Railway reservation system, institute time-table management system,  student record system, library management system, hospital management system in RDBMS  (preferably ORACLE 9i 10g).

IT 4th sem Discrete Structure/ Discrete Mathematics Syllabus IT 402

IT-402 Discrete Structure  SYLLABUS Discrete Structure Mathematics Syllabus

 RGTU/RGPV Discrete Structure< strong> SYLLABUS

Information Technology IT 4th Semester Syllabus,

 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