Department of Computer Science and Engineering

Module 1 (10 (T) + 7(P) Hours)

Computer Networks and Internet, the network edge, the network core, network access, delay and loss, protocol layers and services, Application layer protocols, Web 2.0, Socket Programming,
Module 2 (10 (T) + 7(P) Hours)

Transport layer services, UDP, TCP, New transport layer Protocols, congestion control, new versions of TCP, Network layer services, routing, IP, routing in Internet, router, IPV6, multicast routing.

Module 3 (10 (T) + 7(P) Hours)

Link layer services, error detection and correction, multiple access protocols, ARP, Ethernet, hubs, bridges, switches, wireless links, mobility, PPP, ATM, MPLS, VLAN.

Module 4 (12 (T) + 7(P) Hours)

Multimedia networking, streaming stored audio and video, real-time protocols, security, Cryptography, authentication, integrity, key distribution, network management.

References:

1. 
   J. F. Kurose and K. W. Ross, Computer Networking: A Top-Down Approach Featuring Internet, 3/e, Pearson Education, 2005.
   
2. 
   Peterson L.L. & Davie B.S., Computer Networks, A systems approach, 3/e, Harcourt Asia, 2003.
   
3. 
   Andrew S. Tanenbaum, Computer Networks, 3/e, PHI, 1996.
   
4. 
   Adrian Farrel, The Internet and its Protocols a Comparative Approach, Elsevier, 2005.
   

CS3301 OBJECT ORIENTED PROGRAMMING

Pre-requisite: Nil

L	T	P	C
3	0	2	4

Module I (10 (T) + 7(P) Hours)

Overview of programming language paradigms – Structured, Procedural, Functional and Logic.

Typed and untyped languages. Abstract Data Types. Introduction to object orientation. Concept of Encapsulation. Examples from any object oriented language.

Module II (13 (T) + 7(P) Hours)

Data and Procedural Abstraction – Class as a combination of both the abstractions. Variables and Methods. Class Hierarchies – Concept of Inheritance. Scope and Visibility. Base, Derived and Abstract Classes. Examples from any object oriented language.

Module III (12 (T) + 7(P) Hours)

Memory Management in object oriented paradigm – Constructors, Destructors. Initialization and garbage collection. Concept of overloading. Concept of polymorphism. Concept of dynamic binding. Examples from any object oriented language.

Module IV (7 (T) + 7(P) Hours)

Object Orientation as a design approach. Introduction to UML – Study of various design diagrams including standard representation methods of Entity Relationships and Algorithms in UML. Introduction to Object Constraint Language. Implementation approaches – Refactoring.

References:

1. 
   Budd T, An Introduction to Object Oriented Programming, 3/e, Pearson, 2003.
   
2. 
   David West, Object Thinking, Microsoft Press, 2004.
   
3. 
   C Thomas Wu , An Introduction to object oriented programming with JAVA", 4/e, The McGraw-Hill, 2001.
   
4. 
   Eckel B, Thinking in C++, Prentice Hall, 2004.
   
5. 
   Eckel B, Thinking in Java, Prentice Hall, 2004.
   
6. 
   Fowler M and Scott K, UML Distilled, Addison Wesley, 2000.
   

ME4104 PRINCIPLES OF MANAGEMENT

Prerequisite: Nil                                                                                       

L	T	P	C
3	0	0	3

Total Hours: 42

Module 1 (9 Hours)

Introduction to management theory, Characteristics of management, Management as an art/profession, Systems approach to management, Task and responsibilities of a professional manager, Levels of managers and skill required. Management process – planning – mission – objectives – goals – strategy – policies – programmes – procedures.

Module 2 (9 Hours)

Organizing – principles of organizing – organization structures, Directing – delegation – span of control – leadership – motivation – communication, Controlling.

Module 3 (12 Hours)

Decision making process – decision making under certainty – risk – uncertainty – models of decision making, Project management – critical path method – programme evaluation and review technique – crashing.

Module 4 (12 Hours)

Introduction to functional areas of management, Operations management, Human resources management, Marketing management, Financial management.

References

1. 
   Koontz, H., and Weihrich, H., Essentials of Management: An International Perspective, 8/e, McGraw Hill, 2009.
   
2. 
   Hicks, Management: Concepts and Applications, Cengage Learning, 2007.
   
3. 
   Mahadevan, B., Operations Management, Theory and Practice, 2/e, Pearson Education Asia, 2009.
   
4. 
   Kotler, P., Keller, K.L., Koshy, A., and Jha, M., Marketing Management, 13/e, Pearson Education Asia, 2009.
   
5. 
   Khan, M.Y., and Jain, P.K., Financial Management: Text, Problems and Cases, McGraw Hill, 2007.
   

CS4021 NUMBER THEORY AND CRYPTOGRAPHY

Pre-requisite: Nil

L	T	P	C
3	0	2	4

Total Hours: 70 Hrs  
Module 1 (8 (T) + 7(P) Hours)

Divisibility theory in integers. Extended Euclid’s algorithm. Modular Arithmetic – exponentiation and inversion. Fermat’s Little Theorem, Euler’s Theorem. Solution to congruences, Chinese Remainder Theorem

Module 2 (12 (T) + 7(P) Hours)

Review of abstract algebra – Study of Ring Zn, multiplicative group Zn* and finite field Zp – Gauss Theorem (cyclicity of Zp*) - Quadratic Reciprocity.

Primality Testing – Fermat test, Carmichael numbers, Solovay Strassen Test, Miller Rabin Test - analysis.
Module 3 (13 (T) + 7(P) Hours)

Notions of security. Introduction to one secret key cryptosystem (DES) and one cryptographic hash scheme (SHA).

Public Key Cryptosystems – Diffie Hellman Key Agreement Protocol, Knapsack crypto systems, RSA. Elgamal’s encryption and signature scheme.
Module 4 (9 (T) + 7(P) Hours)

Authentication Protocols: One way and Mutual Authentication, Challenge Response protocols, Lamport’s scheme, Needham Schroeder protocol. Interactive proof systems, Zero Knowledge Proof systems – soundness and completeness – Fiat-Shamir identification scheme.

References:

1. 
   H. Delfs and H. Knebl, Introduction to Cryptography: Principles and Applications, Springer, 2002.
   
2. 
   Serge Vaudney, A Classical Introduction to Cryptography: Applications for Communications Security, Springer, 2009.
   
3. 
   Bernard Menezes, Network Security and Cryptography. Cengage Learning, 2010.
   
4. 
   B A Forouzan and D Mukhopadyay, Cryptography and Network Security 2/e, Tata McGraw Hill, 2010.
   

CS4022 PRINCIPLES OF PROGRAMMING LANGUAGES

Pre-requisite: Nil

L	T	P	C
3	0	2	4

Total Hours: 70 Hrs