MNIT Jaipur Syllabus computer science Computer Network

 

 

MNIT Jaipur Syllabus computer science  Computer Network

 

 

 

 Computer Network 

1. Computer network architecture, Physical layer: Hardware, topology, data encoding,

2. Data Link Layer: Logical link Control: Error detection and Correction, ARQ protocols, Framing

protocols( HDLC, LLC) Medium Access Control: Multiple access protocols, Channel Allocation,

contention, reservation, round robin with Examples.

3. Network Inter connection: Generic switches, switch design issues, switching mechanism : virtual

Circuit switching, datagram switching, source route switching, Bridge and bridge learning , Global

Addressing scheme, fragmentation and reassembly,  Address translation: ARP, RARP, ICMP, IP

Scalability Issues, sub netting and super netting (CIDR) , IP Routing, EGP, BGP protocols

4. End to End protocols: End to end issues, UDP and TCP segment formats, connection establishment

and termination, state transition sliding window protocol, TCP Flow control, Silly window

syndrome, TCP retransmission, RTT Estimation, TCP Congestion Control and congestion avoidance

protocols

5. Internet applications : Client server paradigm, DNS, SMTP, RPC, NFS and General network

security issues.

Text/References:

1. Data Networks: Bertsekas and Gallagher, Phi.

2. Computer Networking A Top down Approach: J.F.Kurose, Pearson.

3. Computer Networks A Systems Approach: L. Peterson and B. Davie, Elsevier

4. Computer Networks and Internet: D.E. Comer, PearsonCP-351 OS  Lab  (0-0-3) 2

The following proposed coverage are broad guiding areas lab. The instructor offering the course in

consultation with the theory offered can adopt further variations in tune with CP-321.

1. Simple Unix-C programs: Programs using system calls, library function calls to display and

write strings

2. Concurrent Programming concepts using fork, semaphore and pipes.

3. Programs for error reporting using errno,perror() function.

4. Programs to simulate process scheduling like FCFS,shortest Jobs First and Round Robin.

5. Programs to simulate page replacement algorithms like FIFO, Optimal and LRU.

6. Programs to simulate Free space management.

7. Programs to simulate virtual memory.

8. Programs to simulate deadlock detection.

9. Any other as per curriculum.

Text/References:

1. Unix concepts and applicaions by Sumitbha Das,TMH applications.

2. Unix Programming by stevens, Pearsons Education.

3. Shell Programming by Yashwant Kanetkar.

4. Operating System concepts by silberschatz, and Peter Galvin.

CP-353 System Programming Lab  (0-0-3) 2

The following proposed coverage are broad guiding areas lab. The instructor offering the course in

consultation with the theory offered can adopt further variations.

Programming exercises to implement typical lexical analyzers, parsers, intermediate code generation.

Assignments using LEX and YACC tools.

Programming exercises to implement assemblers, editors, debuggers etc.

Text/References:

1. Aho, Ullman and Sethi: Compilers, Pearson Education.

2. Levine, Mason and Brown: Lex and Yacc, O’Reilly.

Leave a Comment