1

Swami Ramanand Teerth Marathwada University, Nanded. Teaching and Examination Scheme

Third Year (Information Technology) With effect from Academic Year – 2010 -11

Part- I

Sr.No.

Name of the Subject Teaching Scheme

(Hrs/week)

Examination Scheme

Paper Test Term work

Practical Total

1 Computer Organization and Architecture

04 80 20 --- --- 100

2 Data Communication and Network

04 80 20 --- --- 100

3 Theory of Computation 04 80 20 --- --- 100

4 Advance Microprocessor and Microcontrollers

04 80 20 --- --- 100

5 Database Management System

04 80 20 --- --- 100

6 Data Communication and Network Lab

02 --- --- 25 25 50

7 Database Management System Lab

02 --- --- 25 25 50

8 Microprocessor and Microcontroller Lab

02 --- --- 25 25 50

9 Computer Laboratory – II 02 (Theory)

And 02 (Lab)

--- --- 50 50 100

Total Of Part-I 30 400 100 125 125 750

2

Part - II Sr.No.

Name of the Subject Teaching Scheme

(Hrs/week)

Examination Scheme

Paper Test Termwork

Practical Total

1 Design and Analysis of Algorithm

04 80 20 --- --- 100

2 Advance Computer Networks

04 80 20 --- --- 100

3 Compiler Construction 04 80 20 --- --- 100

4 Software Engineering 04 80 20 --- --- 100

5 Unix Operating System 04 80 20 --- --- 100

6 Design and Analysis of Algorithm Lab

02 --- --- 25 25 50

7 Advance Computer Network Lab

02 --- --- 25 25 50

8 CC and Unix Lab 02 --- --- 25 25 50

9 Computer Lab – III 02 --- --- 50 25 75

10 Seminar 02 --- --- 25 --- 25

Total pf Part II 30 400 100 125 125 750

3

Third Engineering – Information Technology 1. Computer Organization and Architecture

Paper: 03 Hours Theory: 80 Marks Test: 20 Marks

Course Objective:

• To furnish details of computer organization and Architecture to students. • To elaborate concepts Memory Hierarchy and Cache memory • To furnish details on CPU and its Operations • To introduce enhancement of processing using pipelining • To put some light on Advanced Architecture Concepts

UNIT I: Building Basics (4 Hr) Organization and Architecture, Structure and Function, Why computer organization and Architecture and Assessing and Understanding Performance, Top-level view of Computer Function. UNIT II: Memory (10 Hr) Basic Structure of Memory Hierarchy, Internal Memory: Semiconductor main memory, Error Correction, Advanced DRAM, External Memory: Magnetic Disks, RAID, Optical Memory, Magnetic Tapes, Exploiting Memory Hierarchy: The Basics of Cache, Measuring and improving cache performance, A Common Frame work for memory hierarchies, Fallacies and Pitfalls. Case Study: P4 and AMD Opetran Memory Hierarchy. UNIT III: The Central Processing Unit (6 Hr) Computer Arithmetic’s, Instruction Set Characteristics and Functions, Addressing modes and Formats, Structure and Functions, RISC, The Processor: Data Path and Control UNIT IV: I/O, Networks and Peripherals (10 Hr) Disk Storage Dependability, Networks, Buses and Other Connections (between processors, Memory and I/O), Interfacing I/O Devices (to Processors, Memory and operating System), I/O performance Measures, Designing an I/O System, External Interfaces: Firewire and Infiband. Case Study: A Digital Camera.

4

UNIT V: Pipeline and Instruction level Parallelism (6 Hr) Overview, A Pipelined Data Path, Pipelined Control, Data Hazards and Forwarding, Stalls, Brach Hazards, Exceptions Case Study: The Pentium 4 Pipeline. UNIT VI: Advanced Architectural Concepts (4 Hr) Parallel Processing: Multiple Processor organizations, Symmetric Multiple processors, Cache Coherence and MESI protocol, Clusters, NUMA, and Vector Computation. Text/Reference Books:

1. David Patterson, John Hennessy “Computer Organization And Design”, Third Edition, ELSEVIER publications.

2. William Stallings, “Computer Organization and Architecture”, Sixth Edition 2003,

Pearson Education.

5

Third Engineering – Information Technology 2. Data Communication and Networking

Term work: 25 marks Theory: 80 marks Practical: 25 marks. Paper: 3 Hours Test: 20 marks _______________________________________________________________________ Course Objective :

1) Students will have an overview of Data Communication & Networking. 2) Students should understand the behavior of data signal propagated through

transmission medium. 3) Will be able to understand different modulation schemes in digital communication 4) Students should be able to understand the types of protocol used for data link control. 5) To understand broadly the networking & the devices related with it.

Unit 1: Introduction (8 Hr) Communication Model, Data communication, Analog and Digital Data and Signals, Transmission Impairments , Data Rate limits, Analog & Digital data transmission, Signal processing operations in Digital communication. Channels for digital Communication, Uncertainty, Information & Entropy, Source Coding, Discrete Memory less channel, Mutual information, Channel capacity. Unit 2: Signal Modulation Techniques (6 Hr) Digital Modulation Methods ASK, PSK & FSK, Sampling process, practical Aspects of Sampling & Signal Recovery, Pulse amplitude Modulation, Pulse Code Modulation. Robust Quantization, Differential PCM, Delta Modulation. Unit 3: Error Control Coding (6 Hr) Review of Discrete Memory less Channel, Linear blocks Codes, Hamming Code, Cyclic codes, Convolution Codes, Trellis Code. Unit 4: Reference Model & Physical Layer (6 Hr) OSI model, Layers in OSI model, TCP/ IP protocol suite, Addressing, Switching ,Using Telephone & cable Networks for Data transmission. Unit 5: Data Link Layer (8 Hr) Design Issues, Frame Design Considerations, Flow & Error Control, Protocols: Simplex, Stop – and- Wait Automatic Repeat Request, Go – Back – N ARQ, Selective Repeat ARQ, HDLC, Point to point protocol

6

Unit 6: Multiple Access (6 Hr) Static & Dynamic channel Allocation, Multiple Access protocol, ALOHA, CSMA, CSMA/ CD, CSMA/ CA, Wired LAN’S: Ethernet IEEE 802.2 802.3, 802.802.5 Standards , Wireless LAN’S, Connecting LANs, Backbone Networks, & Virtual LANs . Text Books

1. Simon Haykin, “Digital Communication”, WSE Edition 2. B. A.Forouzan “Data Communication & Networking” 4 th edition Tata McGraw Hill 3. William Stalling: “Data & Computer Communication” Seventh edition PHI

Publication. 4. A. S. Tanenbaum, “Computer Networks” Pearson Education

Data Communication and Networking Laboratory

Termwork : Atleast 10 programs from the below mentioned.

1. Write a program to implement Nyquist theorem. 2. Write a program to implement Shannon’s theorem. 3. Write a program on Error detection & Correction using: a) CRC b) Hamming

Code c) Checksum 4. Write a program to implement Simplest Protocol with no flow or error control. 5. Write a program to implement Stop & Wait protocol. 6. Write a program to implement Stop & Wait ARQ protocol 7. Write a program to implement Go – back- N protocol 8. Write a program to Selective Repeat protocol. 9. Write a program to implementation of the Data Link Layer framing methods such

as character stuffing & bit stuffing. 10. Study of Hubs, Repeaters, Switches, Routers and Bridges. 11. Study of modem communication. 12. A detailed study of different types of cables used in computer networking

7

Third Engineering – Information Technology 3. Theory of Computation

Paper : 3 Hours Theory: 80 marks Test: 20 marks

Course Objective :

• To understand the concepts of Finite Automata. • Students should be able to design turing machine. • Students should be able to design and analyze finite state mahcine.

Unit I:- (5 hr) Finite automata: Finite state systems, DFA, NFA, The equivalence of DFA and NDFA, Finite automata with Epsilon-move, Finite Automata with output. Applications of Finite automata. Unit II:-. (5 Hr) Regular Expression and Languages: Regular expressions, Finite automata and regular expressions, pumping lemma for regular sets. Application of pumping lemma, Closure properties of regular sets. Regular sets and regular grammars, Applications of regular expression. Unit III:- (8 Hr) Context-Free Grammars and Languages: CFG, Parse trees, Ambiguity in CFG. Simplification of CFG, Normal forms of CFG, Application of CFG. Pushdown Automata: Pushdown Automata, The languages of a PDA, DPDA, Context-free languages and properties of CFLs. Unit IV:- (8 Hr) Turing machines and Undecidability: Model, Techniques for turing machine construction, church’s hypothesis, Turing machine as enumerators, properties of enumerable languages, Rice’s Theorem, Undecidability of Post’s Correspondence problem, Greibach Theorem. Unit V:- (8 Hr) The Chomsky hierarchy and deterministic Context- Free languages: Regular and unrestricted grammars, context sensitive languages, relations between classes of languages, Normal forms of DPDA’s, closure of DCFL’s under complementation, additional closure and decision properties of DCFL’s, LR(k) Grammars, closure of families of languages.

8

Unit VI:- (6 Hr)

Computational Complexity Theory: Hierarchy Theorems, relations among complexity measures, properties of general complexity measures, Axiomatic complexity Theory. Reference Books: 1. John E Hopcroft, Rajeev Motwani , Jeffrey D.Ullman, ”Introduction to Automata Theory,

Languages, and Computation”, 2nd

Edition, Addison-Wesley.

2. Daniel I. A. Cohen , ”Introduction to Computer Theory”, 2nd

Edition, John Wiley & Sons. 3. Dexter C. Kozen , “Automata and Computability”, (April 1997),Springer Verlag. 4. K.L.P.Mishra and N. Chandrasekaran, “Theory of Computer Science-Automata languages and Computation “.

9

Third Engineering – Information Technology 4. Advanced microprocessors and Microcontroller

Term work: 25 marks Theory: 80 marks Practical: 25 marks. Paper: 3 Hours Test: 20 marks _______________________________________________________________________ Course Objective :

• Should be able to understand the architecture of 8086 and X86 family. • Should be able to understand the supporting chips to the processor. • Should be able to understand the architecture of microcontroller and programming.

UNIT I 8086 Microprocessors: (8 Hr) Architecture of 8086 Microprocessor,8086 pin signals, timing diagram of 8086 Microprocessor, simplified read/write bus cycles,8086 Addressing modes,8086 instruction formats and instruction set ,Interrupt vector table. 8086 Assembly language programming. UNIT II Interfacing Memory and I/O with 8086/8088: (8 Hr) Basic 8086/8088 bus configuration, memory addressing ,address decoding, memory system design examples, timing consideration for memory interfacing, input/output port addressing and decoding, Programming and interfacing: 8255A,8259,8237. UNIT III Coprocessor 8087: (4 Hr) Architecture of 8087,interfacing with 8086. Data types, instructions and programming UNIT IV Microprocessors and microcontroller. (7 Hr) Introduction, Microprocessors and Microcontrollers, A Microprocessors survey. RISC & CISC CPU Architectures, Harvard & Von-Neumann CPU architecture. 8051 Architecture, Hardware, Input / Output Pins, Ports and Circuits. Memory organization, Counter and Timers, Serial Data Input/Output, Interrupts. UNIT V Assembly language of 8051: (7 Hr) Addressing modes, Instruction set. Programming; Byte level logical Operations, Bit level Logical Operations, Rotate and Swap Operations, Arithmetic Operations: Flags, Incrementing and Decrementing, Addition, Subtraction, Multiplication and Division, Decimal Arithmetic. Programming examples in C.

10

UNIT VI Interfacing with 8051 and Introduction to high end processors (6Hr) Interfacing with keyboards, LEDs, 7 segment LEDs, LCDs, Interfacing with ADCs. Interfacing with DAC, etc. High end processors: Introduction to 80386 and 80486, Protectcted mode operation. Text Books: 1. Walter A Triebel, Awtar Singh The 8088 and 8086 Microprocessors, Pearson Education, Fourth Edition 2. Yu-cheng Liu, Glenn A.Gibson, “Microcomputer systems: The 8086 / 8088 Family architecture, Programming and Design”, PHI 2003 3. Bary B. Brey, The Intel Microprocessors: 8086/8088, 80186, 80286, 80386 & 80486, . Prentice Hall, India 1996. 4. James L.Antonakos The Pentium Microprocessor. 5. Kenneth J. Ayala, Delmar Cengage The 8051 microcontroller, Cengage Learning, 3rd edition, ISBN: 81-315-0200-7 6. Muhammad Ali Mazidi and Janice Gillespie Mazidi and Rollin D. McKinlay; “The 8051 Microcontroller and Embedded Systems – using assembly and C ”- PHI, 2006 / Pearson, 2006 7.Predko ; “Programming and Customizing the 8051 Microcontroller” –, TMH

8. Tom Shultz: “ C and the 8051, 2nd

Ed, 1998, Prentice Hall.

Term Work 1. Software Lab: The Term work shall consists of 8(eight) assembly language programs using MicroAssemsler 2. Hardware Lab:

1. Testing the 8051 I/O ports. 2. Timer programming 3. The 8051 serial interface 4. Interrupt programming. 5. Interfacing MxN key board. 6. Interfacing DAC and ADC to the 8051. 7. Interfacing stepper motor.

11

Third Engineering – Information Technology 5. Database Management Systems

Term work: 25 marks Theory: 80 marks Practical: 25 marks. Paper : 3 Hours Test: 20 marks _______________________________________________________________________ Course Objectives :

To understand the basics of Database Management System. Students should be able to design and implement databases.

To train the students for real world application approach.

Unit I : Introduction (8 Hrs) History of Database Systems, Database-System Applications, Purpose of Database Systems, View of Data, Database Languages, Relational Databases, Database Design, Object-Based and Semistructured Databases, Data Storage and Querying, Transaction Management, Database Architecture, Database Users and Administrators. E-R Model :Overview of the Design Process, The Entity-Relationship Model, Constraints, Entity-Relationship Diagrams, Entity-Relationship Design Issues, Weak Entity Sets, Extended E-R Features, Database Design for Banking Enterprise, Reduction to Relational Schemas, Other Aspects of Database Design, The Unified Modeling Language UML. Relational Model : Structure of Relational Databases, Fundamental Relational-Algebra Operations, Additional Relational-Algebra Operations, Extended Relational-Algebra Operations, Null Values, Modification of the Database, The Tuple Relational Calculus. Unit II : SQL (6 Hrs) Background, Data Definition, Basic Structure of SQL Queries, Set Operations, Aggregate Functions, Null Values, Nested Subqueries, Complex Queries, Views, Modification of the Database, Joined Relations. Advanced SQL : SQL Data Types and Schemas, Integrity Constraints, Authorization, Embedded SQL, Dynamic SQL. Relational Database Design : Features of Good Relational Designs, Atomic Domains and First Normal Form, Decomposition Using Functional Dependencies, Functional-Dependency Theory, Decomposition Using Functional Dependencies, Decomposition Using Multivalued Dependencies, More Normal Forms, Database-Design Process, Modeling Temporal Data. Unit III : Application Design and Development (6 Hrs) User Interfaces and Tools, Web Interfaces to Databases, Web Fundamentals, Servlets and JSP, Building Large Web Applications, Triggers, Authorization in SQL, Application Security. XML : Motivation, Structure of XML Data, XML Document Schema, Querying and Transformation, Application Program Interfaces to XML, Storage of XML Data, XML Applications.

12

Unit IV : Storage and File Structure (8 Hrs) Overview of Physical Storage Media, Magnetic Disks, RAID, Sequential files, File Organization, Organization of Records in Files, Data-Dictionary Storage. Indexing and Hashing : Basic Concepts, Ordered Indices, B+-Tree Index Files, B-Tree Index Files, Index Definition in SQL, and a brief outline of Multiple-Key Access and Static Hashing, and the brief idea of Dynamic Hashing. Unit V : Query Processing (6 Hrs) Overview of Query Processing, Measures of Query Cost, Selection Operation, Join Operation. Transactions : Transaction Concept, Transaction State, Implementation of Atomicity and Durability, Concurrent Executions, Serializability, Recoverability, Implementation of Isolation. Testing for Serializability. Unit VI : Concurrency Control (6 Hrs) Lock-Based Protocols, Timestamp-Based Protocols, Multiple Granularity, Multiversion Schemes, Deadlock Handling, Insert and Delete Operations. Recovery System : Failure Classification, Storage Structure, Recovery and Atomicity, Log-Based Recovery Recovery with Concurrent Transactions, Buffer Management, Failure with Loss of Nonvolatile Storage, Advanced Recovery Techniques. Text Books: 1. Avi Silberschatz, Henry F. Korth, S. Sudarshan “Database System Concepts”, Fifth dition, McGraw-Hill. 2. Elmarsi, Navathe, Somayajulu, Gupta, “Fundamentals of Database Systems”, Pearson, Fifth Edition. References: 1. Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003. 2. Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- “Database System Implementation”- Pearson Education- 2000. 3. Peter Rob and Corlos Coronel- “Database System Concepts”, Cengage Learning Edition 2008.

13

Database Management Systems Lab

1. Database design using E-R model. 2. Creating tables for various relations in SQL using data definition language. 3. Implementing the queries in SQL for

a) Insertion b) Retrieval, Updating and deleting using

i) Logical operations such as =, <, >, AND, OR, NOT, etc.

c) Character, number, date and group functions d) All operations like Union, Intersect, Minus, In, Exist, Aggregate, Min, Max,

Count, etc. e) Extracting data from more than one table f) Sub queries, nested queries

4. Writing Views, Cursors, Assertions and Triggers in SQL. 5. Implementing ROLL BACK, COMMIT & CHECK POINTS. 6. Creating Forms and Reports. 7. Writing Procedures and Functions in SQL. 8. PL/SQL Programs to be written given by faculty/instructor. 9. Embedded SQL Programs. 10. Programs for database connectivity (odbc / jdbc , etc.).

14

Third Engineering – Information Technology COMPUTER LAB – II

Advance Java Term work : 50 Marks Practical : 50 Marks

Course Objective :

o To introduce the students with advance features of Java . o To learn advance concepts and best programming practices. o To train the students on these technologies and approach used in

Industry. UNIT – I : Overview of Core Java Java language features, class, objects, methods, inheritance, package and interface, exception handling, multithreading UNIT – II : Input/Output : Exploring Java.io The Java I/o classes and interface, file, stream classes, Byte streams, Character streams, Serialization, Introduction to Collections framework UNIT – III : Event handling The delegation event model, Event classes, Sources of Events, Event listener, Interfaces, Adapter classes UNIT – IV : Abstract Windows Toolkit (AWT) AWT classes, window fundamentals, working with frame windows, working with Graphics, Color and Fonts, Managing Text, Using AWT controls UNIT – V : Networking and JDBC Networking basics, Java & the Net, InetAddress, TCP/IP client and server sockets, URL, Datagrams, RMI. JDBC concepts, JDBC API Overview, JDBC Architecture, Drivers, Making connectivity, Creating, updating and maintaining tables, Using queries to retrieve information

15

UNIT – VI : Web Servers, Swing and Servlets Web Server: Introduction to Three Tier Architecture, Installation, Configuration and Deployment. JApplet, Icons, Labels, Textfield, Button, ComboBox, Panes, Trees, Tables, Life cycle of servlet, The servlet API, Javax.servlet package, Javax.servlet.http package, Handling HTTP requests and responses, using cookies, session tracking Termwork : At least one program on every Unit and a mini project that makes the use of most of all above features. Practical examination : Practical examination will be of 3 hours that includes oral / practical examination based on the syllabus. Reference Books :

1. Herbert Schildt; The Complete Reference – Java 2 , Tata McGrawHill 2. Deitel & Deitel, Java- How to program, Prentice Hall of India 3. Core Java – Volume I – Fundamentals; Cay S.Horstman, Gary Cornell, Pearson

Education Inc. 4. Bruce Eckel; Thinking in Java, Addison Wesley & Pearson Education, Asia

16

PART- II Third Engineering – Information Technology

6. Design and Analysis of Algorithms Paper: 3 Hours Theory: 80 marks

Test: 20 marks Course Objectives:

• To introduce basic concepts of algorithms. • To introduce mathematical aspects and analysis of algorithms. • To introduce various algorithmic techniques and solution of few problems based on same. • To introduce algorithm design methods solution of few problems based on same.

Unit I: Foundations. (4 Hr) The Role of Algorithms in Computing, Growth of Functions and Asymptotic Notations, Recurrences, Randomized Algorithms. Unit II: Study and Analysis of Searching & Sorting Techniques. (4 Hr) Brute Force, Selection Sort and Bubble Sort, Sequential Search and Brute-force string matching, Divide and conquer, Merge sort, Quick Sort, Binary Search. Unit III: Study of Elementary and Advances Data Structures and Graph Algorithms.

(10 Hr) Elementary Data Structures: Trees, Stack, Queue, Hash Tables, And Binary Search Trees. Advances Data Structures: B-Trees, Data Structure for Disjoint Sets, Binary Heap, Elementary Graph Algorithms: Representation of Graphs, BFS, and DFS. Minimum Cost Spanning Tree: Prim’s & Kruskal’s algorithms. Single Source Shortest Path, All Pair Shortest Path. Unit IV: Dynamic Programming. (6 Hr) Introduction, Elements of Dynamic Programming, Matrix Chain Multiplication, Optimal Binary Search Tree, And Longest Common SubSequence, Knapsack Problem, Reliability Design Problem, Traveling Sales Person Problem. Unit V: Greedy Algorithms. (6 Hr) Introduction, Elements of Greedy Strategy, KnapSack Problem, Huffman Codes, Traveling Sales Person Problem, Job Sequencing with Deadlines, Optimal Merge Patterns.

17

Unit VI: Advanced Topics: Amortized Analysis, NP-Completeness And Approximation Algorithms. (10 Hr) Amortized Analysis: Aggregate Analysis, Accounting Method, And Potential Method. NP-Completeness: Polynomial Time, Polynomial Time Verification, NP-Completeness and Reducibility, Np-Completeness Proofs and problems. Approximation Algorithms : The Vextex Cover Problem, The Travelling Sales Person Problem, The Set Covering Problem, Randomization and linear Programming, The Subset-sum problem. Text Books/Reference Books:

1. Thomas Coreman, Charles Leiserson, Ronald Rivest, Cliffford Stein, “Introduction to Algorithms”, Second Edition May 2001, Prentice Hall Of India.

2. Sartaj Sahani, Ellis Horowitz, Sanguthewar Rajasekaran, “Fundamentals of Computer

Algorithms”, Second Edition October 2007, Universities Press.

Design and Analysis of Algorithms Lab Teamwork: At least 10 programs based on above syllabus. Practical examination: Practical examination will be of 3 hours that includes oral / practical examination based on the syllabus.

18

Third Engineering – Information Technology 7. Advance Computer Networks

Term work: 25 marks Theory: 80 marks Practical: 25 marks. Paper : 3 Hours Test: 20 marks Course Objectives:

i) To understand the services offered by Network, Transport and Application Layers of TCP/IP.

ii) To learn the Techniques of routing, network management. iii) To familiarize with recent trends in networking and multimedia networking.

Unit I: Introduction (4 Hr) Introduction and Overview: The TCP/IP Internet, Internet Services, IAB, Connectionless and connection oriented services, packet switching, TCP/IP Layers, Properties Of The Internet, Internet Architecture, Interconnection Through IP Routers, The User's View, All Networks Are Equal. Unit II: Network Layer – IP (8 Hr) Classful Internet Addresses, Mapping Internet Addresses To Physical Addresses (ARP), RARP. The IPv4 Datagram: Format, Type Of Service & Differentiated Services, Encapsulation, Datagram Size, Network MTU, and Fragmentation, Reassembly Of Fragments, Fragmentation Control, Time to Live (TTL), Other Datagram Header Fields Internet Datagram Options: Record Route Option, Source Route Options, Timestamp Option, Processing Options During Fragmentation. Forwarding IP Datagrams: Forwarding In An Internet, Direct And Indirect Delivery, Table-Driven IP Forwarding, Next-Hop Forwarding, Default Routes, Host-Specific Routes, The IP Forwarding Algorithm, Forwarding With IP Addresses, Handling Incoming Datagrams, Establishing Routing Tables. ICMP, CIDR, Formation of Subnets and Supernets. Unit III: Transport Layer – TCP and UDP (8 Hr) The Need For Stream Delivery, Properties Of The Reliable Delivery Service, Providing Reliability, The Idea Behind Sliding Windows, The Transmission Control Protocol, Ports, Connections, And Endpoints, Passive And Active Opens, Segments, Streams, And Sequence Numbers, Variable Window Size And Flow Control, TCP Segment Format, Out Of Band Data, TCP Options, TCP Checksum Computation, Acknowledgements, Retransmission, And Timeouts, Accurate Measurement Of Round Trip Samples, Karn's Algorithm And Timer Backoff, Responding To High Variance In Delay , Response To Congestion, Fast Recovery And Other Modifications , Explicit Feedback Mechanisms (SACK and ECN), Congestion, Tail Drop, And TCP, Random Early Detection (RED), Establishing A TCP Connection, Initial Sequence Numbers, Closing a TCP Connection , TCP Connection Reset, TCP State Machine, Forcing Data Delivery, Reserved TCP Port Numbers, TCP Performance, Silly Window Syndrome And Small Packets, Avoiding Silly Window Syndrome. User Datagram Protocol (UDP)

19

Unit IV: Routing & Multicasting (8 Hr) Routing: Distance Vector (Bellman-Ford) Routing, Reliability And Routing Protocols, Link-State (SPF) Routing, Exterior Gateway Protocol, BGP Characteristics, BGP Functionality And Message Types, BGP Message Header, Static Vs. Dynamic Interior Routes, RIP, Slow Convergence Problem, Solving The Slow Convergence Problem, RIP1 Message Format, OSPF, OSPF Message Format. Multicasting: Ethernet Multicast, IP Multicast, IP Multicast Addresses, Mapping IP Multicast To Ethernet Multicast, Internet Group Management Protocol, IGMP Message Format, Distance Vector Multicast Routing Protocol. Unit V: Application Layer (8 Hr) BOOTP and DHCP: BOOTP, BOOTP Message Format, DHCP and The DHCP Message Format, DHCP message type options. DNS: Internet Domain Names, Top-Level Domains, Name Syntax And Type, Mapping Domain Names To Addresses, Domain Name Resolution, Domain Name System Message Format. TELNET: TELNET Protocol, Accommodating Heterogeneity, Secure Shell (SSH). FTP: Features, Process Model, TFTP, Anonymous FTP, Secure File Transfer (SSL-FTP, Scp, Sftp). Electronic Mail: Electronic Mail, SMTP, Post Office Protocol, Internet Message Access Protocol, MIME. HTTP and SNMP: Architectural Components, Uniform Resource Locators, Hypertext Transfer Protocol, and SNMP. Unit VI: Recent Trends and Multimedia Networking (4 Hr) VPN, NAT, IPv6, RTP, RTCP, SIP and RSVP. Text Books: 1. D. E. Comer, ‘Internetworking with TCP/IP’ Vol I, Fifth Edition, PHI publications. 2. Behrouz A. Forouzan, ‘TCP/IP Protocol Suite’ Fourth Edition, TMH. Reference Books : 1. A.S. Tanenbaum, Computer Networks, Fourth Edition, Prentice Hall of India. 2. J. Kurose and K.W. Ross, Computer Networking: A Top-Down Approach Featuring the Internet, Addison-Wesley. 3. W. R. Stevens, TCP/IP illustrated, Volume 1: The protocols, Second Edition, Addison Wesley. 4. G. R. Wright. TCP/IP illustrated, Volume 2: The implementation, Addison, Wesley. 5. Douglas E. Comer, Hands-On Networking with Internet Technologies, Pearson Education, Asia, 2002.

20

Advance Computer Network Lab Termwork : Any 12 experiments/ programs based on the list mentioned below.

1. Write a program for shortest path routing algorithm (Dijkstra’s algorithm). 2. Write a program simulating Sliding Window Protocols. 3. Write a program to implement client server application. 4. Write a program to implement Distance Vector Routing algorithm. 5. Write a program to implement Remote Command Execution (Two M/Cs may be used). 6. Write a socket Program for Echo/Ping/Talk commands. 7. Create a socket for HTTP for web page upload & Download. 8. Write a program for TCP module Implementation (TCP services). 9. Write a program for File Transfer in client-server architecture using TCP sockets. 10. Write a program for File Transfer in client-server architecture using UDP sockets. 11. Write a program to implement RMI (Remote Method Invocation). 12. Study of existing LAN and understand the design and various components. Set up a

small network of 3 to 4 computers and Hub/switch as directed by the instructor. Use LAN card, UTP cables and connectors. Install LAN cards and crimp the connectors. Assign unique IP address and share C drive on each machine. Test the network by using PING command.Repeat the same assignment by adding a router. Configure the router and use RIP.

13.Study any protocol analyzer software (such as Ethereal, Wireshark, etc.) to learn and use its important features.

14. Study of FTP and SMTP commands. 15. Write a code simulating ARP /RARP. 16. Study of TELNET. 17. Study of Network Simulators like NS2/GloMoSim.

Practical examination: Practical examination will be of 3 hours that includes oral / practical examination based on the syllabus.

21

Third Engineering – Information Technology 8. Compiler Construction

Term work: 25 marks Theory: 80 marks Practical: 25 marks. Paper : 3 Hours Test: 20 marks Course Objectives :

To understand the process of compiling and construction of compiler. Students should understand the analysis and code generation.

To introduce the students with some compilation tools.

Unit I: Introduction to Compiling (6 Hr) Compilers, Analysis of the source program, the phases of compilers, cousins of compilers, The grouping of phases, Compiler construction tools. Unit II: Syntax Directed Translator (6 Hr) Introduction, Syntax definition, Syntax-Directed Translation, Parsing, A translator for simple expressions, Lexical Analysis, Symbol tables, Intermediate code generation. Unit III: Lexical and Syntax Analysis (8 Hr) The role of Lexical analyzer, Input Buffering, Specification of tokens, Recognition of tokens, The Lexical Analyzer Generator Lex, Finite Automata, From regular expressions to Automata, Design of a Lexical- Analyzer Generator. Syntax Analysis : Introduction, Writing a grammar, Top-Down Parsing, Bottom-up Parsing, LR parsers, Using Ambiguous Grammars, Parser Generators. Unit IV: Syntax directed Translation (6 Hr) Syntax-directed definitions, Evaluation order for SDD’s, Applications of syntax-directed translations, Syntax-Directed Translation Schemes. Unit V: Intermediate Code Generation (8 Hr) Variants of syntax trees, intermediate languages, declarations, assignment statements, Boolean expressions, case statements, Backpatching. Code Generation :Issues in the Design of a code generator, The target machine, Addresses in the target code, Basic Blocks, A simple Code Generator, Register allocations and Assignment, Peephole Optimization, Generating code from DAGS, Dynamic Programming Code Generation Algorithm. Unit VI: Code Optimization (6 Hr) The Principle of sources of optimization, Optimization of basic blocks, Loops in flow graphs, introduction to Data-Flow Analysis, Code-improving transformations, dealing with aliases, Partial-redundancy Elimination, Region-Based Analysis. Run Time Environments :Storage organization, Stack allocation of space, Heap Management, Introduction to garbage collection.

22

Reference Books:

1. Alfred V.Aho, Ravi Sethi, Jeffrey D.Ullman, “Compilers-Principles, Techniques, and tools”, First Edition.

2. Alfred V.Aho, Ravi Sethi, Jeffrey D.Ullman ,“Compilers-Principles, Techniques, and

tools”, Second Edition.

23

Third Engineering – Information Technology 9. Software Engineering

Paper : 3 Hours Theory: 80 marks Test: 20 marks

Course Objectives:

1) To introduce the students with basic principles of Software Engineering 2) To learn the Software Engineering concepts, methodologies and best practices 3) To train the students on Software Engineering principles and approach used in

Industry. Unit 1: The Software Process: (8 Hr) Software, Changing nature of software, Software myths, Software Engineering – a layered technology, A process framework, Product and process, Capability Maturity Model, Software process models – Waterfall model, The Incremental model, The RAD model, Prototyping model, The Spiral model, The Unified Process. Unit II: Software Engineering Practice: (6 Hr) Software Engineering practice, communication practices, planning practices, Modeling practices, Construction practice, Deployment. Unit III: Requirements Engineering: (6 Hr) Requirements Engineering Tasks, Requirements analysis, Analysis modeling approaches- Data Modeling, Object Oriented analysis, Scenario based, Flow oriented modeling, Introduction to Design Concepts Unit IV: Software Architecture and User Interface Design: (6 Hr) Software Architecture – Style, Patterns and Design, User Interface - The Golden Rules, User Interface Analysis and Design, Interface Analysis, Interface Design steps, Design evaluation Unit V: Software Testing: (10 Hr) Fundamentals of Testing Test Levels, Test Types: Target of Testing, Static Techniques, Test Design Techniques, Test Management, Tool Support for Testing, Test Strategies for Object Oriented Software, Object Oriented Testing Methods. Unit VI : Web Engineering : (4Hr) WebApp Engineering Layers, Web Engineering Process and Best Practices, Planning for Web Engineering Projects, Project Management issues for Web Engineering, Metrics for Web Engineering and WebApps.

24

Text Books/Reference Books:

1. Pressman R., “Software Engineering A Practioners Approach”, 6th

Edition, Tata McGraw Hill Publication, 2005, Sixth Edition.

2. Ian Sommerville, “Software Engineering”, Pearson Education, Sixth Edition. 3. Dorothy Graham, Erik Van Veenendaal, Isabel Evans, Rex Black, “Foundations of

Software Testing” Cengage Learning Publications. 4. Pankaj Jalote, “Software Engineering”, Narosa Publishing House. 5. K.K.Aggarwal, Yogesh Singh, “Software Engineering”, New Age International

Publishers

25

Third Engineering – Information Technology 10. Unix Operating System

Paper : 3 Hours Theory: 80 marks Test: 20 marks

Course Objectives:

• To introduce new flavor of operating system • To introduce Algorithms used by UNIX for different Operating System Tasks • To introduce Shell and shell commands/scripts.

UNIT I: Introduction (4 Hr) History, System Structure, User perspective, Operating System Services, Assumptions About Hardware, Architecture of Unix Operating System, Kernel Data Structures. UNIT II: Buffer Cache and File System (8 Hr) Buffer Headers, Structure of Buffer Pool, Scenarios For Retrieval, Reading and Writing Disck Blocks, Advantages & Disadvantages, INODES, Structure of Regular File, Directories, Conversion of Path name to INODE, Super Block, Inode Assignment to new File, Allocation of Disk Block, Open, Read, Write, File And Record Locking, LSEEK, Close, File Creation, Change Directory, Change Root, Change Owner, Change Mode, Mount, Unmount, Link, Unlink, Pipes. UNIT III: Processes in UNIX (8 Hr) States and Transitions, Layout of system memory, Context of Process, Saving Context of a process, Manipulation of Address Space and SLEEP. Process Creation, Signals, Process Termination, Waiting process Termination, Invoking Programs, Size of Process, Shell, Boot & INIT processes. Process Scheduling, System Calls for Time. UNIT IV: Memory Management, I/O and IPC (6 Hr) Swapping, Demand Paging, Hybrid, Driver Interfaces, Disk Drivers, Terminal Drivers, Streams, Process Tracing, System V IPC, Sockets. UNIT V: Fundamentals of Shell & Working with the Files (6 Hr) Understanding the UNIX Command, General Purpose Utilities, The File System, Handling the Ordinary Files, Basic File Attributes, Umask, find, Simple Filters, Filters using regular Expressions UNIT VI: Advanced Shell Programming (8 Hr) The Shell, The Process, Essentials of Shell Programming, TCP/IP Networking, Shells Sub-shell, export, let, eval, exec, File Sharing, stat, creating process, exit & _exit, pipe, signal, killing a process.

26

Reference / Text Books: 1. Maurice J. Bach “Unix Operating System” First Edition August 2003, Prentice

Hall of India. 2. Sumitabha Das “Unix Concepts and Applications” Third Edition 2005, Tata

McGraw –Hill.

Compiler Construction and UNIX Lab Term Work:

a. Compiler Construction: Term Work should consist of a least 10 programs based on syllabus of Compiler Construction using Lex and Yacc Tools.

b. UNIX: Term Work should consist of at least 10 programs as per list mentioned below.

1. Introduction to Unix Environment a. Study of Vi Editor b. Study of basic Unix Environmental Commands.(ls/ll/…..etc)

2. Introduction to perl a. Getting and Installing perl b. Creating code Files c. Statement and Declarations d. Running Code e. Basic Skills. f. Conditional Statements and Loops.

3. Use of Scalar Variables, lists, Arrays, Hashes. 4. Regular Expressions 5. Subroutines. 6. Formatting and string Handlling. 7. References and predefined variables in perl. 8. Built in function (Specifically POSIX functions) and File

Handling. 9. Data Structure and DataBases. 10. Object Oriented Programming in perl. 11. Internet And Socket Programming in Perl. 12. Process Creation and IPC using signals and Pipe 13. Threads in perl. 14. System Administration LAB FOR UNIX

• User Creation and Modification • I/O in Unix • File System • Process Monitoring and Control

Practical Examination:

Practical examination shall be of three hours duration & shall consist of an experiment & oral based on the above syllabus.

27

Third Engineering – Information Technology Computer Laboratory - III

Scripting Languages Termwork : 25 Practical : 25

Course Objective :

o To introduce the students with scripting language. o To learn JavaScript, ASP and Perl concepts and best practices o To train the students on these technologies and approach used in

Industry.

1) Unit I: JavaScript

Introduction to JavaScript, difference between Java and JavaScript, JavaScript syntax, variables and their types, JavaScript operators, arrays and array methods, Program flow: Control statements, exercise, Built-in objects in JavaScript, Array, String, Math, Date objects, documents forms and form elements window location, History object

2) Unit II : ASP and JSP ASP Introduction, ASP File, ASP Basic Syntax Rules, ASP Variables, ASP Procedures, ASP Forms and User Input, ASP Application Object, ASP Including Files, ASP The Global.asa file, ASP Response Object, ASP Request Object, ASP Application Object, Java Server Pages: Life Cycle, Tags

3) Unit III: CGI CGI.pm, Creating HTML Controls, Reading from HTML Controls Using perl script, starting HTML document, creating HTML elements, Lists, Text Area, check Boxes, Scrolling lists, Radio Buttons, Password fields, Pop up Menus, Hidden Data fields, uploading data to Forms, Calling a CGI script from a Web page

4) Unit IV: Introduction to software modeling tool. Student is supposed to study and design any application using IBM Rational Suite or

any other open source modeling tool. Term Work:

Term Work should consist of a least 10 programs based on syllabus. Practical Examination:

Practical examination shall be of three hours duration & shall consist of an experiment & oral based on the above syllabus.

28

Reference Books: 1)Barrett, “Essential JavaScript for web professionals”, Pearson Education 2) Laurence Moroney, Matthew MacDonald (Ed.), “Pro ASP.NET 2.0 in VB 2005”, Special Edition. 3) Dino Esposito, “Programming Microsoft® ASP.NET 3.5” 4) Steve Suehring,"Beginning Perl Web Development From Novice To Professional", Apress 5) Steven Holzner, “Black Book of Perl”, Second Edition 2009, DreamTech Press. 6) Martin C. Brown, “The Complete Reference, Perl”, Second Edition 2008, Tata McGraw-Hill Publications. 7) Steven Holzner “Java 2, Black Book”, 2000 DreamTech Press. 8) Phil Hanna “A Complete Reference -JSP”, 2008, Tata-Mc-Graw Hill publications.

29

Third Engineering – Information Technology

Seminar Termwork : 25

Students should take any relevant topic of their interest in latest trends in Information Technology & Computer Science and deliver a seminar on it. Students are also supposed to prepare a seminar report of 20-25 pages on the topic. The termwork will be awarded based on the performance on seminar talk.

Summer Vacation Task : Mini Project Objective: A Mini Project shall be based on any recent topic selected by the students working in a group. In a group more than three students are not allowed. Students should submit their group names before leaving for vacation and work on it during it. When they join the VIIth semester, should demonstrate and submit it in the department. Due weight age will be given to their performance in Project Part-I of final year examination.