RGPV/RGTU Computer Networking Syllabus "New Scheme"

Branch: Computer Science & Engineering VI Semester.
Course: CS 6515/ CS604 Computer Networking

Unit I
Importance of computer networks, Broadcast and point to point networks, local area networks, and wide area neworks, Introduction to ISO-OSI reference model, TCP/IP refrece model, Function of each layer, interfaces and services, Protocol data unit, Connection oriented and connection less services, service primitives, comparision of TCP/IP and ISO-OSI reference model, Novel Netware, Arpanet, X.25

Unit II
Evolution of Computer Networks - Layered Network architecture, OSI Layers Model, transmission media – topology, error detection & Correction techniques, Parity checks, CRC, Asynchronous and synchronous transmission, TDM, FDM.

Unit III
Data-Link layer: Different Types of line discipline, simplex, Half duplex and full duplex, Flow control
stop and wait protocol, sliding Window Protocol With their efficiency, AR techniques & their
performance, HDLC.

Unit IV
LAN : Static & Dynamic channel allocation, Media access control for LAN & WAN;ALOHA : pure, slotted ALOHA, CSMA, CSMA/CD IEEE 802 standards for LAN & MAN: 802.3, 802.4,802.5, 802.6 and 802.2 & their comparison Fast LANs : fast Ethernet, FDDI,

Unit V
Routing: Definition, Elements of routing techniques, Least Cost Routing algorithm Dijkstra's algorithm, Bellman-ford algorithm, Routing Strategies, Congestion Control encryption & de-encryption
techniques, Internet working, Internet and Intranet
Suggested Instructional Strategies
All units required the Lecture, Tutorial, Practical and Seminar.

Suggested List of Experiments
1. Study of different types of LANs
2. Channel Capacity
3. B/W - Noise relation
4. Internet
5. Simplex, half duplex, full duplex
6. TDM
7. FDM
Suggested further readings
1. Computer Networks - Tanenbaum A. S. PHI.
2. LANs - Keizer
3. Computer Networks - Stalling W., PHI.
4. ISDN & Broadband
5. ISDN: Stalling W., PHI.

RGPV / RGTU 5th Semester Compiler Design Syllabus Download ( CS / IT)

B.E. Computer Science and Engineering VII Semester
COURSE CONTENTS : CS 5511/ CS505
Theory of Computation

Unit IRGPV 5th Semester, RGPV syllabus, RGTU syllabus, Rgpv 5th sem syllabus, Compiler Design syllabus, cs 5th sem syllabus,RGTU 5th sem syllabus, syllabus

Introduction to theory of Computation and Finite Automata: Mathematical Preliminaries & Notation : Sets, functions and relations, Graphs and Trees, Proof Techniques, Basic concepts , Languages, Grammars, automats, deterministic finite accepters, Deterministic accepters and Transition Graphs, Languages, Non deterministic finite accepters, definition of a NDRA, Equivalent of DFA and NDFA, Reduction of the Number of states in finite automata.

Unit II

Grammers and Languages: Regular expression, Regular Grammer, Regular languages, closure properties of Regular languages, Context free grammars, Simplification of Context free grammars and Normal forms, Properties of context free languages.

Unit III
Push – Down Automata: Non deterministic push down automata: Definition of a push down automata, The language accepted by a push down automata, Push down automata and context free languages, Push down automata for context free languages, CFG’s for PDA, Deterministic Push down automata and Deterministic Context free languages, Grammers and Deterministic context free languages

Unit IV
Turning Machines: The Standard Turning Machine: Definition of a Turning Machine, Turning Machines as language accepters, and Turning Machines as Transducers. Combining Turning Machines for complicated tasks, Turning thesis, Other models of Turning Machines.

Unit V
Limits of algorithmic computation, Some Problems that can not be solved by Turning Machines, Computability and Decidability, the Turning Machine Halting Problem, Reducing one Undecidable Problem to another, Undecidable Problems for Recursively Enumerable languages, The post correspondence problem : Indecidable problems for context free languages, Recursive function, Primitives recursive functions, Ackermanris functions, recursive functions, Post Systems : Rewriting systems : Matrix grammars, Markor Algorithms.