FACULTY OF ENGINEERING & TECHNOLOGY SYLLABUS

FOR

MASTER OF TECHNOLOGY (COMPUTER SCIENCE & ENGG.)
(Course Code: CSB2) (SEMESTER: I & II)
(Under Credit Based Continuous Evaluation Grading System)

(Old System) (SEMESTER: III-IV)

(Two Years)
EXAMINATIONS: 2010-11

________________________________________________________________________________

GURU NANAK DEV UNIVERSITY AMRITSAR
________________________________________________________________________________ Note: Copy rights are reserved. Nobody is allowed to print it in any form. Defaulters will be prosecuted.

Price: Rs. 60-00

1

M.Tech. (Computer Science & Engg.) Semester System (2 Years)

(Under Credit Based Continuous Evaluation Grading System)
Scheme

Sr.No. Subject Code 1 2 3 4 5 CSL570 CSL571 CSL572 CSL573 CSP574

Subject Semester-I Theory of Computer Science Operating System Database Management System Programming Concepts Programming Lab-I Sub Total: Grand Total: Semester-II Computer System Architecture & Organization Algorithm Analysis & Design Computer Networks Elective-I Programming Lab – II Sub Total: Grand Total: List of Electives – I Advanced Software Engineering Network Programming Internet Technologies Wireless Networks Network Security

Credits L 4 4 4 4 0 16 4 4 4 4 0 16 T 0 0 0 0 0 0 22 0 P 1* 1* 1* 1* 2 6 1*

1 2 3 4 5

CSL580 CSL581 CSL582 CSP583

0 1* 0 1* 0 1* 0 2 0 6 22 0 0 0 0 0 1* 1* 1* 1* 1*

1 2 3 4 5

CSL584 CSL585 CSL586 CSL587 CSL588

4 4 4 4 4

2

M.Tech. (Computer Science & Engg.) Semester System (2 Years)

Sr. Subject Code: Subject No. Semester-III 1. MCS-301: Parallel Computing 2. MCS-302: Elective-II 3. MCSD-303: Dissertation (Part-I) Semester-IV 1. MCSD-401: Dissertation (Part-II) Total Marks of the Degree

External
Max 100 100 300 1440 Pass 40 40 120

Internal
Max 30 30 300 Pass 12 12 120

Term Paper
Max 20 20 200 Pass 08 08 -

200 80 860 2500

Note: A candidate will be declared successful in a semester if he/she has obtained 50% marks in the aggregate in the semester.

4. Elective-II Option: Subject (vi) Artificial Neural Networks (vii) Digital Image Processing (viii) Advanced Operating System (ix) Software Project Management . 2.Tech.) Semester System (2 Years) List of Electives: Sr No. No.3 M. 1 2 3 4 5 Elective – I Option: Subject (i) Advanced Software Engineering (ii) Network Programming (iii) Internet Technologies (iv) Wireless Networks (v) Network Security Sr. 1. 3. (Computer Science & Engg.

. 3. 1998. Narosa.D. Chomsky & Greibach normal forms. regular expressions. Context Free Languages: Context free grammars & languages. simulating turing machine on computers and vice versa. Section – B Phase Structure Languages: Turing machines. Satisfiability problem.: Introduction to Automata Theory. and Computation.: Switching and finit Automata Theory.R. decision algorithms for CLF’s. PrenticeHall. pumping lemma & its applications.E. PCP problem. equivalence of PDA & CFG. pumping lemma and its applications. Tata McGraw-Hill. Languages. 1999. 1981. (Computer Science & Engineering) Semester-I (2 Years) (Under Credit Based Continuous Evaluation Grading System) CSL570: Theory of Computer Science L 4 Credits T P 0 1* *Credit for Term Paper Section – A Finite State Systems: DFA. pushdown automata. References: 1. [KO] Kohavi Z. NFA. Arden’s theorem.4 CSB2: M. 1995. undecidability.R.: Elements of the Theory of Computation. Second Edition. Ullman J.P.. NP – complete problems. [HRU] Hopcroft J. ∈-NFA. Second Edition. and Ullman J. Computational complexities. 4. Church’s thesis. Motwani R. Intractable Problems: P and NP classes. [HU] Hopcroft J. minimization of automata. Rics’s theorem. recursive and recursively innumerable languages.E. simplifications of context free grammars. Languages and Computation. and Chandrasekaran: Theory of Computer Science.: An Introduction to Formal Languages and Automata. linear bounded automata. PHI. closure properties of regular sets.Tech. Narosa. closure properties of CFL’s.D. 6. and Papadimitriou C. interconversion of automatas. Addison-Wesley. 5. [LP] Lewis H. 2001. 1979 [MC] Mishra K.L.: Introduction to Automata Theory. 2-way finite automata. Second Edition. Second Edition. [PET] Peter L. 2. extended and restricted turing machines.

Role of I/O traffic controller. Milenkovic : Operating Systems. Madnick and Donovan : Operating Systems. Process Management: The system view of processes.A Introduction: Operating System. Modern perspective. Semaphores. Section B Memory Management: Factors in memory design. Gary Nutt : Operating System. Process scheduling strategies. Process synchronization. 3. Views of an operating system. Process hierarchy. McGraw Hill. Paging. 4. 5. Operating system strategies. Factors in operating system design. Tanenbaum : Modern Operating Systems. Allocation methods. Coordinating processes. I/O scheduler and device handler. Demand paging and Segmentation techniques Device Management: Device management approaches. Device allocation considerations. Process state diagram.5 CSB2: M. A.S. Deadlock handling. M. Memory manager strategy. Prentice Hall. A. Role as resource manager. Galvin : Operating System Concepts. P. Its layered structure and general model. Free space management References: 1.Tech. McGraw Hill. . 2. Memory allocation strategies. Memory hierarchies. (Computer Science & Engineering) Semester-I (2 Years) (Under Credit Based Continuous Evaluation Grading System) CSL571: Operating System L 4 Credits T P 0 1* *Credit for Term Paper Section . Silberschatz. Addison Wesley. Information Management: File system. Process descriptor. Addison Wesley. Resource abstraction.

Section B Database Design & Tuning: Concepts of functional dependencies. USA-1993. Data independence) An architecture. An overview of the E/R Model. Client Server Architecture. McGraw Hill International Editions. Third Ed. for a database system (levels of the architecture. Relational Calculus and SQL language. Prescott. 3. Hoffer. . The Systems Programming Series. Higher Normal Forms. Silberschatz. Jeffery A. Bipin C. Korth & Sudarshan. Inc. BCNF. Integrity Advanced Database Concepts: Introduction to Object and Distributed Databases. 4. West Publishing Company.. C. “Database System Concepts”.J. Security & Authorization. Paul. Reference Books: 1.. McFadden. 3NF. Data Warehousing and Data Mining. Desai. why database. Minnesota. Computer Science Series-1997. Relational Algebra. 1995. E/R diagrams. mappings.Tech. 2NF. (Computer Science & Engineering) Semester-I (2 Years) (Under Credit Based Continuous Evaluation Grading System) CSL572: Data Base Management System *Credit for Term Paper Credits L T P 4 0 1* Section A Basic Concepts: An overview of Database Management (Database. St. Database system.6 CSB2: M. Fred R. DBA’s Role) Introduction to Relational db systems The Relational Model: Relational Data objects. Mary B. Relational Data Integrity. Date: “An Introduction of Database System”. Concurrency. 1NF. Addison-Wesley Publishing Company. 2. “Modern Database Management” 5th Edition. “An Introduction to Database Systems”. 6/Ed. multivalued dependencies. System Implementation Techniques: Recovery. Database design with the E/R model. Domains and relations. An overview of Database Tunning in Relational Systems.

Operators. nested classes. creating dynamic images and documents. ISBN: 9780130384744. 3.7 CSB2: M. (Computer Science & Engineering) Semester-I (2 Years) (Under Credit Based Continuous Evaluation Grading System) CSL573: Programming Concepts L 4 Credits T P 0 1* *Credit for Term Paper Section A Object-Oriented Concepts: Evolution of OOP. Comparison between Functional and OOP approach. Graphs & Trees. virtual function. Creating static pages. ISBN: 157169160X. . 1998. recursion.Tech. preprocessor.* *Implementation through any of the scripting language(s). 2003. Mark Allen Weiss. Control Structure. Web Programming: Internet basics. Robert Lafore. header files and standard function. Section B Data Structures implementations in C++: Stacks and Queues. References: 1. types of function. friend function. Defining a function. Function overloading. storage classes. Markup languages classification. operator overloading. ISBN: 9780201361223. in line member function. pointers file handling. 2. structure and union. Deitel & Deitel. type conversion. (Galgotia). polymorphism. Programming in C++: Introduction to C++. 3rd Edition. Arrays. Classes. Features of OOP Classes. (Pearson Education). C++ How to program. objects. I/O through databases. (Pearson Education). User defined data types. Object Oriented Programming in C++. static class member. Advantages of OOP. Data hiding. constructor and destructor. array of class objects. Inheritance and its types. Linked Lists. Data Structure and algorithm Analysis in C++. member function. 1998.

8 CSB2: M.Tech. . (Computer Science & Engineering) Semester-I (2 Years) (Under Credit Based Continuous Evaluation Grading System) CSP574: Programming Lab-I Credits L T P 0 0 2 Programming exercises based on the subjects covered in first semester.

Superpipelined Design Structures and Algorithms for Array Processors: SIMD Array Processors. Memory Subsystem Organization and Interfacing. Static Connection Networks. Inter-PE Communications SIMD Interconnection Networks: Static versus Dynamic Networks. Decoding Instructions. SIMD Computer Organizations. Designing the Control Unit Using Hardwired Control and Microprogrammed control approach. Hazard Detection and Resolution Superscalar and Superpipeline Design: Superscalar Pipeline Design. Addison Wesley . Parallel Computer Structures: Pipeline Computers.9 CSB2: M. General Pipelines and Reservation Tables Principles of Designing Pipelined Processors: Instruction Prefetch and Branch Handling.Tech. Crossbar Switch and Multiport Memories. Internal Forwarding and Register Tagging. Principles of Linear Pipelining. Computer Systems Organization & Architecture. (Computer Science & Engineering) Semester-II (2 Years) (Under Credit Based Continuous Evaluation Grading System) CSL580: Computer System Architecture & Organization L 4 Credits T P 0 1* *Credit for Term Paper Section . Briggs. Data Buffering and Busing Structures. Faye A. Types of Memories I/O Subsystem Organization and Interfacing Parallelism in Uniprocessor Systems: Trends in parallel processing. Basic Uniprocessor Architecture. Masking and Data Routing Mechanisms. Fetching Instructions from Memory. Tightly Coupled Multiprocessors Interconnection Networks: Time Shared for Common Buses. Instruction Cycles CPU Organization: Design specifications for a Simple CPU. John d. Carpinelli. Multiprocessor Systems Architectural Classification Schemes: Multiplicity of Instruction-Data Streams. Array Computers. Executing Instructions. Classification of Pipeline Processors. Parallel Processing Mechanism.A Introduction to Computers: Basic Computer Organization: System Buses. Computer Architecture and Parallel Processing. Serial versus Parallel Processing. Design of a Simple ALU. Cube Interconnection Networks System Interconnect Architectures: Network Properties and Routing. Dynamic Connection Networks Multiprocessor Architecture: Functional Structures: Loosely Coupled Multiprocessors. References 1. Mesh-Connected Illiac Network. Parallelism versus Pipelining Section-B Pipelining : An overlapped Parallelism. McGraw-Hill International Editions 2.

FFT. Introduction to Algorithms.. linear and binary search algorithms... 1998. 2000 2. Pearson Education Asia. asymptotic notation. simple NP hard problems. hash tables. Narosa Publishing House. Addison-Wesley. The Art of Computer Programming Volume 1 (Fundamental Algorithms). SECTION-B Algorithms on Graphs: Minimum cost spanning tree.E. Ullman J.E. Rivest R.. NP completeness. (Computer Science & Engineering) Semester-II (2 Years) (Under Credit Based Continuous Evaluation Grading System) CSL581: Algorithm Analysis & Design *Credit for Term Paper Credits L T P 4 0 1* SECTION-A Algorithm concepts: Algorithm analysis. Knuth D.. quick sort. heap sort. . Leiserson C. The Design and Analysis of Computer Algorithms. Aho A. Design Strategies: Divide-and-conquer. binary search trees. Sorting & Searching: Simple sorting.. Branch-and-bound.E. 1999. Galgotia Publications. Greedy Method. Dynamic Programming. string processing. Depth/Breadth First search.. Data Structures: Lists. Back-tracking.E.. 1973. complexity analysis. design of efficient algorithms.L. heaps. Path finding problems. Hopcroft J.. References 1. Knuth D. algorithms. 1973 5.D. The Art of Computer Programming Volume 3 (Sorting and Searching). Complexity Theory: Complexity hierarchy.H. graphs and trees. btrees. Rajasekaran S. Sahni S. Computer Algorithms. PHI. Radix sorting. 3..V. Horowitz E.Tech. 1974 4. Advanced Algorithms: Matrix operations. queues.10 CSB2: M. simple parallel & approximation algorithms. Cormen T.

3rd edition. ISDN services. E-mail & Remote login services. 1992. Network Security.S. Data compression techniques and cryptography. Standard Organization. Prentice Hall. Protocol & Standards. Error Control. 4. McMillan Publishing Co. Data Communication & Networking. Black. Services and elements of Transport protocols. MAC protocols and IEEE standards.A. William Stallings. The OSI Model: Layered architecture. Transmission media-Guided & unguided media. multiplexing. Data & Computer Communication. Pearson Education. Congestion control algorithms. 3. Forouzan. data link protocols. SECTION-B Data Link Layer: Framing techniques. Topologies. File transfer access & management. (Computer Science & Engineering) Semester-II (2 Years) (Under Credit Based Continuous Evaluation Grading System) CSL582: Computer Networks L 4 Credits T P 0 1* *Credit for Term Paper SECTION-A Introduction: Data Communication. Performance of media. Computer Networks. Network & Transport layer design Issues: Routing algorithms. Data Networks. Fred Halsall. 5. Flow control. Computer Networks. Switching. Functions of layers.11 CSB2: M. Internetworking.Tech. Categories of Networks. . A. B. Comparison of OSI & TCP/IP models Signals and Transmissions: Digital data transmission. Privacy & Services: Data representation. PHI. 2. References 1. Network Components. Transmission modes. TCP/IP reference model. Tanenbaum. 1988. Data Communications. ATM transmission.

12 CSB2: M. . (Computer Science & Engineering) Semester-II (2 Years) (Under Credit Based Continuous Evaluation Grading System) CSP583: Programming Lab -II L 0 Credits T P 0 2 Programming exercises based on the subjects covered in second semester.Tech.

Method inheritance. Classification of OO metrics. Evolution of Software Economics. Software Reuse and Reengineering. Characteristics & Properties Agents. 2007. Multi-Agent systems. Why metrics?. Software Agents: Definition. Object-Oriented Analysis and Design with Applications. Classes. Improvement of Software Economics. Object Oriented Software Metrics. . Study of Design Metrics. Walker Royce. Conventional Software Management. class inheritance.13 CSB2: M. specifying State. Software project management. Booch. 2001. Abstraction. 3. Hiding.Tech. ISBN: 9780201309584. Applications. Types and Classes. References: 1. Collaboration among Objects.method size. Pearson Education. 3rd Edition. Data Re-engineering and migration. Arnold. IEEE Comp. (Computer Science) Semester-II (2 Years) (Electives) (Under Credit Based Continuous Evaluation Grading System) CSL584: Advanced Software Engineering *Credit for Term Paper Credits L T P 4 0 1* Section – A Software Project Management: Fundamentals of Software project planning. Lorenz and Kidd. Re-engineering existing systems. method internals. class size. Comparison of old and modern ways of Software Management. Software Re-engineering: Introduction Re-engineering. Grouping. Object-Oriented Analysis and Design: What is Object-Oriented Design? Objects. Society. ISBN 978-0131792920. Section-B Object-Oriented (OO) Measurements: Introduction. Class Relationships. Restructuring and Reverse Engineering. Polymorphisms. 2004. Software Re-engineering. Specifying Behavior. Prentice Hall. 4. ISBN: 9780818632723. 2. ISBN: 978-0201895513. Addison-Wesley Professional. 2003. Robert S. class intervals and class externals.

remote command execution. 2000 . Vol. socket option. 1-3. 3 Principles. services. stream and messages. 1. A. external data representation. Vol. Vol. Sockets and signals Transport Lay Interface : Elementary TLI functions. Comer. FIFO’s. SNMP. “Unix Network Programming”. Network file system. reserved parts. Vol. 3. PHI 2002. domain name system. stream and stream pipes. 2004 2. TFTP. Stevens. and architecture. asynchronous I/O I/O multiplexing Remote Procedure calls : Remote login. TCP/IP addressing. PHI. FTP. “Internetworking with TCP/IP. message quues. “TCP/IP Illustrated”. samphorers. transmission control protocol.14 CSB2: M. Section – B Sockets: Sockets system cells. (Computer Science) Semester-II (2 Years) (Electives) (Under Credit Based Continuous Evaluation Grading System) CSL585: Network Programming L 4 Credits T P 0 1* *Credit for Term Paper Section – A Introduction : TCP/IP Architecture. SMTP. Interprocess communications : File and record locking. asynchronous I/O. D. R. 2.E. Stevens. Protocols. pipes. Reference: 1. stream pipes. user datagram protocol.Tech. Pearson Education. transport layer protocols.

Schiller J. web servers. the internet network management framework Section – B Network security: E-mail security. Developing e-Commerce Sites: An Integrated Approach. Cryptography and Network Security Principles and practice.. SET . support for mobility.. transaction-oriented TCP. Goncalves M. Mobile internet .. RSVP. Kurose J. DNS. 2001 .. & Nieto T. Addison Wesley. differentiated services: network management. mobile TCP. Tata McGraw Hill. internet telephony. transmission. file systems. header and payload. Internet And World Wide Web: How to Program. Module IV. Pearson Education.Tech. ad hoc networks. integrated services. The Wireless Application Protocol. 2005 5. email. 2006.J. In-line / On-line: Fundamentals Of The Internet And The World Wide Web. firewalls: design. indirect TCP. Pearson Education Asia. implications of TCP on mobility. RTP.M. Greenlaw R & Hepp E. architecture. References: 1.R. mobile transport layer. 2005. dynamic host configuration protocol. wireless telephony applications. Addison Wesley. FTP. Modules I & II. 2000 8. selective retransmission. 3. Mobile Communications. privacy. web pages design using HTML and XML.F. WAP protocols. Deitel P.mobile network layer. socket programming with TCP/UDP. scheduling and policing mechanisms.. IP security: overview. Multimedia networking: Applications: streaming stored audio and video. authentication.. 6. snooping TCP. systems security : intruders and viruses. Sharma V.W. Pearson Education Asia. WML script. web security: SSL and transport layer security. & Ross K. SMIME. 2005. Firewalls: A Complete Guide. al S. 2. Tata McGraw Hill. key management. 2004. combining security associations. Computer Networking: A Top-Down Approach Featuring the Internet. Deitel H. Module III. (Computer Science) Semester-II (2 Years) (Electives) (Under Credit Based Continuous Evaluation Grading System) CSL586: Internet Technologies *Credit for Term Paper Credits L T P 4 0 1* Section – A Computer networks and the internet: Principles of application-layer protocols .15 CSB2: M. mobile IP. WML . 1999. Addison Wesley. Singhal et. trusted systems. 4. 7. & Sharma R.. Stallings W. HTTP.

Security Issues of Wireless Technology. Overview of Wireless Networks. Books Recommended: Wireless Communications & Networks by Stallings (2005) Pearson Education. WAP and Wireless LANs by Held (2001). Wireless Communication Technology: Antennas & Propagation. Wireless Communication. Wireless Network Standards. Section – B Wireless LANs: Introduction. Pearson Education. Principles of Practice by Rappaport. Introduction to Wireless Technology by Rogers (2003). Wireless LAN Standard. Tata McGraw Hill (Osborne reprint) . Mobile Communications. Cordless Systems and Wireless Local Loop. (Computer Science) Semester-II (2 Years) (Electives) (Under Credit Based Continuous Evaluation Grading System) CSL587: Wireless Networks *Credit for Term Paper Credits L T P 4 0 1* Section – A Introduction to Wireless Systems: History. Signal Encoding Techniques. Security.16 CSB2: M. Types & Range of Wireless Communication. Prentice Hall. Cellular Telephony Operations. IEEE 802. and Components Cellular Technology: Design and Principles pf Cellular Operation. GSM Adhoc & Sensor Networks: Introduction.11. Architecture.Tech. Data Over Wireless Networks: Blue tooth. Spread Spectrum Coding and Error Control. and Applications. Protocols. Benefits. WLANs Configurations and Standards. WAP: History of WAP. Cellular Wireless Networks. Blue tooth. Mobile IP and Wireless Access Protocol. 2nd Edition. Wireless Networking: Satellite Communications.

SETNetwork Management Security. 2006 2. 2005. Pearson Education Asia. Pearson Education Asia. References: 1. services. Section – B Authentication & E mail Security: Kerberos. Key management. New Delhi. Pearson Education Asia. IP Security: IP security overview. location of encryption devices. New Delhi. . William Stallings. security services. New Delhi.Tech. viruses related threats. Kaufman. X. Public Key cryptography and authentication: Approaches to message authentication. Fire Design principles.509 Directory Authentication Services-PGPS/MIME. Authentication Header. Model for network security. Encapsulating Security Pay load. Secure Hash Functions and HMAC. Network Security Essentials Applications and Standards. Trusted Systems. conventional encryption algorithms. cipher block modes of operations. security attacks. William Stallings. SSL and Transport Layer Security. (Computer Science) Semester-II (2 Years) (Electives) (Under Credit Based Continuous Evaluation Grading System) CSL588: Network Security L 4 Credits T P 0 1* *Credit for Term Paper Section – A Introduction: Attacks. Conventional encryption and message confidentiality: Conventional encryption principles. Combing Security Associations. System Security: Intruders. Internet standards. 3. key distribution. mechanisms.17 CSB2: M. Web Security: Web Security Requirements. Public Key Cryptography. Key Management. 2005. Cryptography and Network Security. Network Security: Private Communication in a Public World. Digital signatures. IP Security Architecture. Principles Public Key Cryptography Algorithms.

Conventional Software Management. 6. Grouping. The examinee will attempt five questions in all by selecting at least 2 questions from each section. All questions will carry equal marks. Specifying Behavior. class intervals and class externals. Software Agents: Definition. 2001. Method inheritance. Applications. 7. Lorenz and Kidd. 2004. Arnold. Booch. References: 5. Restructuring and Reverse Engineering. Multi-Agent systems. Section-B Object-Oriented (OO) Measurements: Introduction. Evolution of Software Economics. Data Re-engineering and migration. ISBN: 9780201309584. Comparison of old and modern ways of Software Management. Object-Oriented Analysis and Design: What is Object-Oriented Design? Objects. Re-engineering existing systems. (Computer Science & Engg. ISBN: 978-0201895513. External 100 Marks Internal 30 Term Paper Total 20 150 Note: • Four questions from each section will be set. Software project management. Walker Royce. • Use of only Non-programmable & Non-storage type calculator allowed. 3rd Edition. Object Oriented Software Metrics. Hiding. Classes. Society. Collaboration among Objects. Characteristics & Properties Agents. Pearson Education. Robert S. Improvement of Software Economics. Classification of OO metrics. Section – A Software Project Management: Fundamentals of Software project planning. Class Relationships.method size. Prentice Hall. method internals. Study of Design Metrics. Polymorphisms. specifying State. Software Reuse and Reengineering. Software Re-engineering. ISBN: 9780818632723. Types and Classes.) Semester-II (2 Years) (Elective) Option i: Advanced Software Engineering Time: 3 Hrs. 8. class size. Addison-Wesley Professional.18 M. Object-Oriented Analysis and Design with Applications. IEEE Comp. ISBN 9780131792920.Tech. . Software Re-engineering: Introduction Re-engineering. Why metrics?. 2007. class inheritance. 2003. Abstraction.

pipes. TFTP. Interprocess communications : File and record locking. message quues. 2. SMTP. A. Comer. stream and stream pipes.19 M. PHI 2002. samphorers.E. user datagram protocol. external data representation. Vol. Protocols. TCP/IP addressing. Vol. 1. transport layer protocols. reserved parts.Tech. asynchronous I/O I/O multiplexing Remote Procedure calls : Remote login. “Unix Network Programming”. PHI. FIFO’s. asynchronous I/O. D. remote command execution. FTP. • Use of only Non-programmable & Non-storage type calculator allowed. services. Vol. transmission control protocol. stream and messages. Sockets and signals Transport Lay Interface : Elementary TLI functions. All questions will carry equal marks. Stevens. External 100 Marks Internal 30 Term Paper Total 20 150 Note: • Four questions from each section will be set. Section – B Sockets: Sockets system cells. The examinee will attempt five questions in all by selecting at least 2 questions from each section. Reference: 4. 2004 5. “TCP/IP Illustrated”. socket option. stream pipes. and architecture. Pearson Education. Network file system. Stevens.) Semester-II (2 Years) (Elective) Option ii: Network Programming Time: 3 Hrs. “Internetworking with TCP/IP. 6. Section – A Introduction : TCP/IP Architecture. R. 3 Principles. Vol. 1-3. 2000 . SNMP. domain name system. (Computer Science & Engg.

header and payload. Internet And World Wide Web: How to Program. Mobile internet . Deitel H. 2000 16. 1999. Schiller J. integrated services. Tata McGraw Hill. RSVP. 2006. Computer Networking: A Top-Down Approach Featuring the Internet. mobile transport layer. snooping TCP. WML script. HTTP.J. Cryptography and Network Security Principles and practice. 2005 13. 2004. differentiated services: network management. 2005. web security: SSL and transport layer security. Module IV. Stallings W.. socket programming with TCP/UDP. web pages design using HTML and XML. key management. the internet network management framework Section – B Network security: E-mail security. dynamic host configuration protocol. 11. WML . Mobile Communications. Section – A Computer networks and the internet: Principles of application-layer protocols . Developing e-Commerce Sites: An Integrated Approach. 14. firewalls: design. e-mail. RTP. Pearson Education Asia. Sharma V. Greenlaw R & Hepp E. scheduling and policing mechanisms. Addison Wesley. • Use of only Non-programmable & Non-storage type calculator allowed.mobile network layer. mobile TCP. IP security: overview. DNS. transmission. implications of TCP on mobility. Kurose J. wireless telephony applications. 10. selective retransmission.) Semester-II (2 Years) (Elective) Option iii: Internet Technologies Time: 3 Hrs.W. mobile IP. WAP protocols. The Wireless Application Protocol.R. In-line / On-line: Fundamentals Of The Internet And The World Wide Web. architecture. privacy. support for mobility. authentication. Firewalls: A Complete Guide. Pearson Education Asia. & Nieto T. All questions will carry equal marks. indirect TCP. ad hoc networks. 12. Modules I & II. References: 9.. Addison Wesley.. Module III. al S. & Ross K. Deitel P. 2005.. Pearson Education.. web servers. Multimedia networking: Applications: streaming stored audio and video. SMIME.M.. internet telephony. combining security associations. Singhal et.F. External 100 Marks Internal 30 Term Paper Total 20 150 Note: • Four questions from each section will be set. Goncalves M. SET . The examinee will attempt five questions in all by selecting at least 2 questions from each section. & Sharma R.Tech. FTP. systems security : intruders and viruses. Addison Wesley.. (Computer Science & Engg. 2001 . Tata McGraw Hill. trusted systems. 15. file systems. transaction-oriented TCP.20 M.

Wireless Network Standards. Introduction to Wireless Technology by Rogers (2003). Mobile Communications. WAP: History of WAP. Security Issues of Wireless Technology. and Applications. and Components Cellular Technology: Design and Principles pf Cellular Operation. Security. (Computer Science & Engg. External 100 Marks Internal 30 Term Paper Total 20 150 Note: • Four questions from each section will be set. All questions will carry equal marks. Types & Range of Wireless Communication. Overview of Wireless Networks. Blue tooth. Principles of Practice by Rappaport. The examinee will attempt five questions in all by selecting at least 2 questions from each section. Books Recommended: Wireless Communications & Networks by Stallings (2005) Pearson Education. • Use of only Non-programmable & Non-storage type calculator allowed.) Semester-II (2 Years) (Elective) Option iv : Wireless Networks Time: 3 Hrs.11. Cellular Wireless Networks. Cellular Telephony Operations. IEEE 802. WAP and Wireless LANs by Held (2001). Architecture. Spread Spectrum Coding and Error Control. Data Over Wireless Networks: Blue tooth. Signal Encoding Techniques. Mobile IP and Wireless Access Protocol. Wireless Networking: Satellite Communications. Wireless Communication. Section – A Introduction to Wireless Systems: History. Pearson Education. Protocols. Prentice Hall. Wireless LAN Standard. Section – B Wireless LANs: Introduction. Cordless Systems and Wireless Local Loop. GSM Adhoc & Sensor Networks: Introduction. Wireless Communication Technology: Antennas & Propagation. Benefits.Tech. 2nd Edition. Tata McGraw Hill (Osborne reprint) .21 M. WLANs Configurations and Standards.

Kaufman. Pearson Education Asia. mechanisms. Network Security Essentials Applications and Standards. Digital signatures. SSL and Transport Layer Security. Network Security: Private Communication in a Public World. key distribution. All questions will carry equal marks. Section – A Introduction: Attacks. Conventional encryption and message confidentiality: Conventional encryption principles. New Delhi. cipher block modes of operations. Public Key cryptography and authentication: Approaches to message authentication. Cryptography and Network Security. X. 2005.) Semester-II (2 Years) (Elective) M. Principles Public Key Cryptography Algorithms. Public Key Cryptography. William Stallings. IP Security: IP security overview. conventional encryption algorithms. New Delhi. IP Security Architecture. services. Fire Design principles. References: 4. 2005.Tech (CSE) – 2nd Semester Option v: Network Security Time: 3 Hrs. Trusted Systems. Internet standards. security attacks. Authentication Header. viruses related threats. System Security: Intruders. Key management. Secure Hash Functions and HMAC. security services.22 M. Pearson Education Asia. Encapsulating Security Pay load. Section – B Authentication & E mail Security: Kerberos. SETNetwork Management Security. William Stallings. Pearson Education Asia. Model for network security. (Computer Science & Engg. Web Security: Web Security Requirements. External Marks Internal Term Paper Total 100 30 20 150 Note: • Four questions from each section will be set. • Use of only Non-programmable & Non-storage type calculator allowed. 2006 5.509 Directory Authentication Services-PGPS/MIME. The examinee will attempt five questions in all by selecting at least 2 questions from each section. . 6. New Delhi.Tech. Combing Security Associations. Key Management. location of encryption devices.

distributed memory programming.S. Performance Metrics: Laws governing performance measurements: Amdahl’s law. data-parallel programming. Load Balancing. ISBN: 9780070512948. Abstract Parallel Computational Models: Combinational circuits. Section – A Paradigms of Parallel Computing: Synchronous – Vector/Array. Xavier and S. PRAM Models. Parallelism approaches – Data parallelism.23 M. (Computer Science & Engg. Hardware taxanomy: Flynn’s classification. 4th Edition. efficiency. 1998. Sorting Network. Parallelization of sequential programs.Iyenger. Tata McGraw-Hill. Wilkinision: Parallel Programming. Parallel Computing: Theory and Practice. The examinee will attempt five questions in all by selecting at least 2 questions from each section. 2004. Interconnection RAMs. ISBN: 9780131405639. Loop Scheduling. Introduction to Parallel Algorithms. sizeup. control parallelism. Sun-Ni law.Tech (CSE) – 3rd Semester MCS-301: Parallel Computing Time: 3 Hrs. Prentice Hall. External 100 Marks Internal 30 Term 20 Total 150 Note: • Four questions from each section will be set. Metrics such as Speedup. Systolic Asynchronous – MIMD. All questions will carry equal marks.. Types of scheduling algorithm. Benchmarks. SPMD. utilization. object oriented programming. functional and data flow programming. • Use of only Non-programmable & Non-storage type calculator allowed. . 2004. 2.Tech. Michael J. communication overheads etc. reduction Paradigm. ISBN: 9780471251828. Austafson’s law. C. References: 1. Section-B Scheduling and Parallelization: Load Scheduling.) Semester-III (2 Years) M. 3. Handler’s classification. Overview of Parallel Programming Development & Support Environments: Shared memory programming. isoefficiency. Wiley-Interscience Publication. Quinn. Software taxanomy: Kung’s taxanomy. SIMD.

3rd Edition. Architecture of ANN. External 100 Marks Internal 30 Term 20 Total 150 Note: • Four questions from each section will be set.. (Computer Science & Engg.Tech. pocket algorithm without and with Ratches. All questions will carry equal marks.L.24 M.M. Hopfield’s Model. The examinee will attempt five questions in all by selecting at least 2 questions from each section. Preceptron learning algorithms: Simple learning algorithm. Section – A Neural Network Technology: Evolution of ANN. LMS Algorithm.. Skapura D. [SH] Haykin S. Applications of Back-propagation: NETtalk. Linear Machines. Section-B Single Layer Perceptrons-II: Anderson’s BSB Model. Pattern Recognition. • Use of only Non-programmable & Non-storage type calculator allowed. ISBN: 9780262071451. supervised & unsupervised learning.. Multilayer Perceptrons: Back-Propagation. Neural Networks: A comprehensive Foundation. 1993. Representing Boolean functions. 2007. Topology-Preserving Maps. 2003. ISBN: 9780131471399. [FS] Freeman J. Applications and Programming Techniques. Neural Network Algorithms. Knowledge representation. ISBN: 9780201513769. References: 1.) Semester-III (2 Years) M. MIT Press. 2. Handwritten Character Recognition. Neural Network Learning: Basic learning rules. 3. [SG] Gallant S.. Single Layer Perceptrons-I: Preceptron Model.A. Pearson Education.Tech (CSE) – 3rd Semester Option vi: Artificial Neural Networks Time: 3 Hrs. K-Means Clustering. Prentice Hall. ART1 and ART2. Kessler’s construction. . Neural Networks Learning & Expert Systems. Linear Machines Learning algorithm.

Some basic relationships like Neighbours. 2nd Edition. Image Compression Models. Interactive restoration. Restoration in spatial domain. Section – B Image Compression: Coding. External 100 Marks Internal 30 Term 20 Tota 150 Note: • Four questions from each section will be set. A.Tech (CSE) – 3rd Semester Option vii: Digital Image Processing Time: 3 Hrs. Jain. Colour Image Processing. Image Segmentation: Detection of Discontinuities. Spatial filtering. Distance Measures between pixels. PHI . Image Restoration Degradation Model. Motion based segmentation. Introduction to Morphology. Structural Methods. Homomorphic filtering. Inverse Filtering.Tech. Use of Principal Components for Description. The examinee will attempt five questions in all by selecting at least 2 questions from each section. Image Enhancement: Point Operations. Some basic Morphological Algorithms. Connectivity. 2. • Use of only Non-programmable & Non-storage type calculator allowed. Fundamentals Steps in Image Processing. Elements of Information Theory. Conzalez & Richard E. All questions will carry equal marks. Histograms. Constrained least square restoration. low pass filtering. Image Compression Standards. Frequency domain methods. “Digital Image Processing”. (Computer Science & Engg. Enhancement by point processing. Elements of Digital Image Processing Systems. Edge Linking and Boundary Detection. References: 1. Section – A Introduction and Digital Image Fundamentals : The origins of Digital Image Processing. Region Oriented Segmentation. Wiener Filter. Thresholding. Interpixel and Psychovisual Redundancy. Boundary Descriptors. Algebraic approach to Restoration. Spatial Domain methods. “Fundamental of Digital Image Processing”. Linear and Non Linear Operations. Woods. Regional Descriptors. Image Sampling and Quantization. Decision – Theoretic Methods.) Semester-III (2 Years) M. Error free comparison Lossy Compression.K. Object Recoginition: Patterns and Pattern Classes. Representation and Description: Representation. High pass filtering.25 M. Rafael C.

A. Clustering. Secure Communication Protocols. Transparency. Communication in Distributed Systems : Remote Procedure Call (RPC). Multicompouter Systems. McGraw Hill. All questions will carry equal marks. Section – A Attributes of Distributed Operating System : Performance and Scalability. M.Tech. Synchronization in Distributed Systems : Mutual Exclusion in Distributed Systems : Mutual Exclusion without Shared Memory. Stuart : Operating Systems Principles. 3rd Edition. Distributed Operating Systems. References : 1. Open Source Security.S. Network File System (NFS). Steganography. Process Migration in Distributed Systems. (Computer Science & Engg. Deadlock Detection. Gary Nutt : Operating System. Network Operating Systems. Milenkovic : Operating Systems. . Reliability and Fault Tolerance. Key Agreement Protocols. Grid Computing.26 M. Modern Perspective. Security in Operating System : Cryptography.Tech (CSE) – 3rd Semester Option viii: Advanced Operating System Time: 3 Hrs. 4. 2. Prentice Hall. CORBA (Common Object Request Broker Architecture). Distributed Computing.Tanenbaum : Modern Operating Systems. Deadlock in Distributed Systems : Distributed Deadlock. Security Attacks and Security Solutions. Deitel and Choffnes : Operating Systems.) Semester-III (2 Years) M. Remote Method Invocation (RMI). Pearson Education. Access Control. Deadlock Prevention. Brian L. Design and Applications. 5. Addison Wesley. A Distributed Resource Deadlock Algorithm. Section – B Distrubuted Systems and Web Services : Distributed File System Concepts. 3. Agrawala and Ricart’s Distributed Mutual Exclusion Algorithm. Cengage Learning. External 100 Marks Internal 30 Term 20 Tota 150 Note: • Four questions from each section will be set. • Use of only Non-programmable & Non-storage type calculator allowed. DCOM (Distributed Component Object Model. Connectivity and Security. The examinee will attempt five questions in all by selecting at least 2 questions from each section.

Issues in controlling a software project: Controlling activities. Software Engineering Project Management.Tech. Risk monitoring.) Semester-III (2 Years) M. Pearson Education. Software Management. Matrix organization. Parameter based model. The examinee will attempt five questions in all by selecting at least 2 questions from each section. Section – A Planning Fundamentals: Major issues in software project planning. Reifer. Turnover management. Tata Mc Graw Hill. Staffing. 2. Quality replacements. Work breakdown structures. 2003.27 M. External 100 Marks Internal 30 Term 20 Total 150 Note: • Four questions from each section will be set. (Computer Science & Engg. Function points. 2004. Richard Thayer. Software risk management. COCOMO. Section – B Functional organization: Project organization. Rayleigh model. Directing a software engineering project: Issues. Versions of COCOMO. Experience based model. Cost estimation methods. Conflict management. master schedule. Threads of control. Risk analysis Software cost: Major issues in estimating software cost. activities. Earned value tracking References: 1. Software size estimation. Software project schedule. • Use of only Non-programmable & Non-storage type calculator allowed. All questions will carry equal marks. .Tech (CSE) – 3rd Semester Option ix: Software Project Management Time: 3 Hrs. Planning activities Project. Donald J.

and a comparison with alternative methods. An analysis of the topic within a critical review of the relevant literature. validity. A clear indication. the use of original materials. 2. . including a discussion of the context in which the problem is seen as important. The dissertation will normally contain: 1. their relationship to other research. 2. An account of the process of obtaining the data required for the dissertation and the results obtained. To develop the skills required for originality and creativity of thinking in Information Technology. A discussion of its scope and aims.Tech. 6. (Computer Science & Engg. Although a written report will normally be expected. 3. It is not intended to restrict students to a precisely defined format for the dissertation but it should follow the standard practices of dissertation writing. 4.) Semester-III (2 Years) MCSD-303 Dissertation (Part-I) Marks Internal 300 Total 300 The purpose of the dissertation is: 1. To contribute to the existing body of knowledge of Information Technology. potential implementation difficulties. and the use of comparative approaches to the provision of information technology. their reliability. and 7. An analysis of the results of the dissertation to include a discussion of their significance. of original and creative elements. 3. To extend the students' knowledge considerably in their chosen topic. An evaluation of methods used in the dissertation. and any methodological or theoretical implications. it should be accompanied by soft copy on CD. and its theoretical and professional significance. The level of originality expected is likely to include the application of existing techniques to new environments. The relationship of the findings to existing professional understanding and. the re-working of existing materials. where appropriate. 5. at appropriate stages.28 M.

(CSE) –4th Semester MCSD-401 Dissertation (Part-II) Marks External 300 In continuation from 3rd Semester Internal 200 Total 500 .) Semester-IV (2 Years) M.29 M.Tech. (Computer Science & Engg.Tech.