RGTU / RGPV 8th Semester Web Engineering Syllabus

PROGRAMME: B.E. Computer Science and Engineering,
VIII (8th) semester COURSE CONTENTS
Course: CS802 Web Engineering

Unit-I
Introduction: Introduction, layering, DNS - encapsulation, de-multiplexing, client /server model, port numbers, standardization process, the Internet.
Link layer: introduction, Ethernet and IEEE 802 encapsulation, trailer encapsulation, SLIP, PPP- Loop back interface, MTU.
Internet protocol: introduction, IP header, IP routing, subnet addressing, subnet mask- special case of IP addresses, a subnet example.

Unit-II
Address Resolution Protocol
Introduction, an example, ARP cache, ARP packet format, ARP examples, Proxy ARP, ARP command.
RARP: Introduction, RARP packet format, RARP examples, RARP server design.
ICMP: Introduction, ICMP message types, ICMP address mask request and reply-ICMP timestamp request and reply- 4.4 BSD processing of ICMP Messages.

Unit-III
Ping Program Introduction, ping program, IP record route option, IP time stamp option.
Trace route program: Introduction, trace route program operation, LAN output, and WAN output- IP source routing option.
IP routing: Introduction, routing principles, ICMP host, and ICMP redirect errors
Dynamic Routing protocols: introduction, dynamic routing, RIP- OSPF, BGP, CIDR.
UDP: introduction, UDP header, UDP checksum, IP Fragmentation, UDP Server design.

Unit-IV
DNS Introduction- basics, message format, simple example, pointer quires, resource records, caching, UDP
TFTP: introduction, protocol, security. BOOTP: introduction, packet format, server design, through router.
TCP: Introduction, services, headers, connection establishment and termination, timeout of connection establishment- maximum segment size- half, close, state transition diagram, reset segments, simultaneous open and close- options, server design.

Unit-V
SNMPIntroduction, protocol, structure of management information, object identifiers, management information base, instance identification.
Telnet: rlogin protocols, examples, telnet protocol and examples. FTP, protocol, examples, SMTP protocols, examples, NFS, TCP/IP Applications.

References:
• W. Richard Stevens , TCP/IP Illustrated Volume , I “ The Protocols “, Addison Wesley Longman.
• Jaiswal .S, TCP\IP Principles, Architecture, Protocols And Implementation, First Edition, Galgotia Publications Pvt Ltd.

RGTU / RGPV 8th Semester ATM Networks syllabus

PROGRAMME: B.E. Computer Science & Engineering,
VIII (8th) semester COURSE CONTENTS
Course: CS8301 ATM Networks

Unit-I
Introduction to ISDN, B-ISDN, B-ISDN services, ATM basics, ATM Services, Architecture of B-ISDN, virtual channel, Virtual path, ATM performance Parameters, Signaling techniques

Unit-II
ATM – performance Reference Model (PRM) layered architecture, relationship between ATM PRM and OSI reference model. Layer functions, User Network Interface (UNI), Physical layer of UNI, functions of transmission convergence sub layer, physical medium characteristic ATM layer cell headers of B-ISDN, UNI & NNI, ATM adaptation layer, operation and maintenance of B-ISDN UNI.

Unit-III
B-ISDN signaling, meta signaling, ATM adaptation layer for signaling, signaling protocols, switches & cross connects.

Unit-IV
ATM transmission network, Cell transfer functions, transmission systems, network synchronization, B-ISDN local network Topology & Technology, trunk, network structure, ATM network implementation and its equipments.

Unit-V
Evolutionary scenarios for BISDN fiber to the customer, integration of TV distribution, LAN’s, Man’s to BISDN, Voice delay & Eco problem, Tainting in BISDN, Telecommunication management networks, Gigabits LAN’s, Optical switching, ATM standardization.

References:

• Rainer Handel, Huber & Schooder ATM Network, Addison Wesley
• David E Mc Dysan, ATM Theory & application, McGraw Hill
• Tennenbaum, Computer Network
• William Stalling, An Introduction to ISDN, McMillan publishing Co., USA

RGTU / RGPV Network Security 7th Semester Syllabus

B.E. Computer Science & Engineering,
VII (7th) semester COURSE CONTENTS
Course : CS 7201 Network Security

Unit-I
Conventional Encryption
Convention Encryption: Conventional Encryption Model , Steganography , Classical , Encryption Techniques , Simplified DES , Block Cipher Principles , The Data Encryption Standard , The , Strength of DES , Differential and Linear Cryptanalysis , Block Cipher Design Principles , Block Cipher Modes of operation , Conventional Encryption algorithms

Unit-II
Public Key Encryption And Hash Functions
Public Key Cryptography , Principles of Public Key Cryptosystems , The RSA Algorithm , Key Management , Diffie Hellman Key Exchange , Elliptic Curve Cryptography
Message Authentication and Hash Functions
Authentication Requirements, Authentication Functions, Message Authentication Codes , Hash Functions , Security of Hash Functions

Unit-III
Hash And Mac Algorithms, MD5 Message Digest Algorithm , Secure Hash Algorithm (SHA-I) , RIPEMD , HMAC , Digital Signatures and Authentication Protocols, Digital Signatures Authentication Protocols -Digital Signature Standard

Unit-IV
Authentication Applications , IP Security , Web Security

Unit-V
Intruders, Viruses and Worms, Intruders , Viruses and Related Threats ,Firewalls, Firewall Design Principles , Trusted Systems

References: • William Stallings, “ Cryptography and Network Security”, Second edition, Prentice Hall,1999.

RGPV/RGTU Compiler Design 7th sem. Syllabus

PROGRAMME: B.E. Computer Science and Engineering
VII Semester COURSE CONTENTS
Course: CS701 Compiler Design

Unit-I

Compiler, Translator, Interpreter definition, Phase of compiler introduction to one pass & Multipass compilers, Bootstrapping, Review of Finite automata lexical analyzer, Input, buffering, Recognition of tokens, Idea about LEX: A lexical analyzer generator, Error handling

Unit-II
Review of CFG Ambiguity of grammars, Introduction to parsing. Bottom up parsing Top down parsing techniques, Shift reduce parsing, Operator precedence parsing, Recursive descent parsing predictive parsers. LL grammars & passers error handling of LL parser. LR parsers, Construction of SLR, Conical LR & LALR parsing tables, parsing with ambiguous grammar. Introduction of automatic parser generator: YACC error handling in LR parsers.

Unit-III
Syntax directed definitions, Construction of syntax trees, L~attributed definitions, Top down translation. Specification of a type checker, Intermediate code forms using postfix notation and three address code, Representing TAC using triples and quadruples, Translation of assignment statement. Boolean expression and control structures.

Unit-IV
Storage organization, Storage allocation, Strategies, Activation records, Accessing local and non local names in a block structured language, Parameters passing, Symbol table organization, Data structures used in symbol tables.

Unit -V
Definition of basic block control flow graphs, DAG representation of basic block, Advantages of DAG, Sources of optimization, Loop optimization, Idea about global data flow analysis, Loop invariant computation, Peephole optimization, Issues in design of code generator, A simple code generator, Code generation from DAG.

List of Experiments:
• Develop a lexical analyzer to recognise a few patterns in PASCAL and C. (ex: identifiers, constants, comments, operators etc.)
• Write a programme to parse using Brute force technique of Topdown parsing.
• Develop on LL (1) parser (Construct parse table also).
• Develop an operator precedence parser (Construct parse table also)
• Develop a recursive descent parser
PROGRAMME: B.E. Computer Science and Engineering VII Semester
Course: CS701 Compiler Design
• Write a program for generating for various intermediate code forms i) Three address code ii) Polish notation
7. Write a program to simulate Heap storage allocation strategy
8. Generate Lexical analyzer using LEX
9. Generate YACC specification for a few syntactic categories.
10. Given any intermediate code form implement code optimization techniques.

References:
• Aho-Ullman, Principles of compiler Design, Narosa Publishing House.
• Aho-Ullman, Compilers: Principles Techniques & Tools, Addison Wesley.
• Dhamdhere, Compiler Construction.

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.