MASTER OF TECHNOLOGY (COMPUTER SCIENCE …gndu.ac.in/syllabus/201213/ELECENG/MTECH CSE SEMESTER I to...

FACULTY OF ENGINEERING & TECHNOLOGY

SYLLABUS

FOR

MASTER OF TECHNOLOGY (COMPUTER SCIENCE & ENGG.)

(Two Years Course)

(Under Credit Based Continuous Evaluation Grading System)

(Semester: I – VI)

Examination: 2012-13

GURU NANAK DEV UNIVERSITY AMRITSAR

Note: (i) Copy rights are reserved.

Nobody is allowed to print it in any form. Defaulters will be prosecuted. (ii) Subject to change in the syllabi at any time. Please visit the University website time to time.

1

CSB2: M.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER SYSTEM

(Under Credit Based Continuous Evaluation Grading System)

SCHEME:

Sr.No. Subject Code Subject Credits Semester-I L T P 1 CSL550 Theory of Computer Science 4 0 1 2 CSL551 Operating System 4 0 1 3 CSL552 Database Management System 4 0 1 4 CSL553 Programming Concepts 4 0 1 5 CSP554 Programming Lab-I 0 0 2 Sub Total: 16 0 6 Grand Total: 22

Semester-II 1 CSL560 Computer System Architecture &

Organization 4 0 1

2 CSL561 Algorithm Analysis & Design 4 0 1 3 CSL562 Computer Networks 4 0 1 4 Elective-I 4 0 1* 5 CSP563 Programming Lab – II 0 0 2 Sub Total: 16 0 6 Grand Total: 22 List of Electives – I 1 CSL564 Advanced Software Engineering 4 0 1 2 CSL565 Network Programming 4 0 1 3 CSL566 Internet Technologies 4 0 1 4 CSL567 Wireless Networks 4 0 1 5 CSL568 Network Security 4 0 1

2

CSB2: M.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER SYSTEM (Under Credit Based Continuous Evaluation Grading System)

Semester-III

1. CSL650 Parallel Computing 4 0 1 2. Elective-II 4 0 1 3. CSD651 Dissertation (Part-I) 0 0 12 Sub Total 8 0 14 List of Electives-II 1 CSL652 Artificial Neural Networks 4 0 1 2 CSL653 Digital Image Processing 4 0 1 3 CSL654 Advanced Operating System 4 0 1 4 CSL655 Software Project Management 4 0 1 Semester-IV 1. Inter-disciplinary subject-I 4 0 0 2. Inter-disciplinary subject-II 4 0 0 3. CSD660 Dissertation (Part-II) 0 0 14 Grand Total: 22

3

CSB2: M.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – I (Under Credit Based Continuous Evaluation Grading System)

CSL–550: THEORY OF COMPUTER SCIENCE

Credits L T P 4 0 1*

*Credit for Term Paper

UNIT-I Finite State Systems: DFA, NFA, -NFA, 2-way finite automata; interconversion of automatas, minimization of automata, regular expressions, Arden’s theorem, pumping lemma and its applications, closure properties of regular sets.

UNIT-II Context Free Languages: Context free grammars & languages, simplifications of context free grammars, Chomsky & Greibach normal forms, pumping lemma & its applications, closure properties of CFL’s, decision algorithms for CLF’s; pushdown automata, equivalence of PDA & CFG.

UNIT-III Phase Structure Languages: Turing machines, extended and restricted turing machines, Church’s thesis, linear bounded automata, undecidability, recursive and recursively innumerable languages, Rics’s theorem, PCP problem; simulating turing machine on computers and vice versa. Intractable Problems: P and NP classes, NP – complete problems; Satisfiability problem. Computational complexities. References:

1. [HRU] Hopcroft J.E., Motwani R. and Ullman J.D.: Introduction to Automata Theory, Languages and Computation, Second Edition, Addison-Wesley, 2001.

2. [PET] Peter L.: An Introduction to Formal Languages and Automata, Second Edition, Narosa, 1998.

3. [HU] Hopcroft J.E. Ullman J.D.: Introduction to Automata Theory, Languages, and Computation, Narosa, 1979

4. [MC] Mishra K.L.P. and Chandrasekaran: Theory of Computer Science, Second Edition, PHI, 1999.

5. [LP] Lewis H.R. and Papadimitriou C.R.: Elements of the Theory of Computation, Prentice-Hall, 1981.

6. [KO] Kohavi Z.: Switching and finit Automata Theory, Second Edition, Tata McGraw-Hill, 1995.

4


CSL–551: OPERATING SYSTEM

Credits

L T P 4 0 1*


UNIT-I Introduction: Operating System, Role as resource manager, Operating system strategies, Factors in operating system design, Views of an operating system. Process Management: The system view of processes, Process descriptor, Process state diagram, Resource abstraction, Process hierarchy, Process scheduling strategies, Process synchronization, Deadlock handling, Coordinating processes, Semaphores.

UNIT-II

Memory Management: Factors in memory design, Memory hierarchies, Memory manager strategy, Memory allocation strategies, Paging, Demand paging and Segmentation techniques

UNIT-III Device Management: Device management approaches, Device allocation considerations, Role of I/O traffic controller, I/O scheduler and device handler. Information Management: File system, Its layered structure and general model, Allocation methods, Free space management. References: 1. Gary Nutt: Operating System, Modern Perspective, Addison Wesley.

2. A. Silberschatz, P. Galvin: Operating System Concepts, Addison Wesley.

3. A.S. Tanenbaum: Modern Operating Systems, Prentice Hall.

4. Madnick and Donovan: Operating Systems, McGraw Hill.

5. M. Milenkovic: Operating Systems, McGraw Hill.

5


CSL–552: DATA BASE MANAGEMENT SYSTEM



UNIT-I Basic Concepts: An overview of Database Management (Database, Database system, why database, Data independence) An architecture, for a database system (levels of the architecture, mappings, DBA’s Role) Introduction to Relational db systems. The Relational Model: Relational Data objects, Domains and relations, Relational Data Integrity, Relational Algebra, Relational Calculus and SQL language.

UNIT-II Database Design & Tuning: Concepts of functional dependencies, multivalued dependencies, 1NF, 2NF, 3NF, BCNF, Higher Normal Forms, An overview of the E/R Model, E/R diagrams, Database design with the E/R model, An overview of Database Tunning in Relational Systems.

UNIT-III System Implementation Techniques: Recovery, Concurrency, Security & Authorization, Integrity Advanced Database Concepts: Introduction to Object and Distributed Databases, Client Server Architecture, Data Warehousing and Data Mining. Reference Books: 1. C.J. Date: An Introduction of Database System”, The Systems Programming Series, 6/Ed,

Addison-Wesley Publishing Company, Inc., 1995. 2. Silberschatz, korth & Sudarshan, “Database System Concepts”, Third Ed., McGraw Hill

International Editions, Computer Science Series-1997. 3. Desai, Bipin C, “An Introduction to Database Systems”, West Publishing Company, St.

Paul, Minnesota, USA-1993. 4. Parteek Bhatia and Gurvinder Singh, “Simplified Approach to DBMS”, Kalyani

Publishers, 2010. 5. Fred R. McFadden, Jeffery A. Hoffer, Mary B. Prescott, “Modern Database

Management” 5th Edition.

6


CSL–553: PROGRAMMING CONCEPTS



UNIT-I Object-Oriented Concepts: Evolution of OOP, Advantages of OOP, Comparison between Functional and OOP approach, Features of OOP Classes, User defined data types. Programming in C++: Introduction to C++, Operators, type conversion, Control Structure, Arrays, Defining a function, types of function, storage classes, recursion, preprocessor, header files and standard function, structure and union, Classes, Data hiding, member function, objects, array of class objects, nested classes, constructor and destructor, in line member function, friend function, static class member.

UNIT-II Inheritance and its types, virtual function, Function overloading, operator overloading, polymorphism, pointers file handling. Data Structures implementations in C++: Stacks and Queues, Linked Lists, Graphs & Trees.

UNIT-III Web Programming: Internet basics, Markup languages classification, Creating static pages, I/O through databases, creating dynamic images and documents.* *Implementation through any of the scripting language(s). References:

1. Deitel & Deitel, C++ How to Program, ISBN: 9780130384744, (Pearson Education), 2003.

2. Robert Lafore, Object Oriented Programming in C++, ISBN: 157169160X, (Galgotia), 3rd Edition, 1998.

3. Mark Allen Weiss, Data Structure and Algorithm Analysis in C++, ISBN: 9780201361223, (Pearson Education), 1998.

7


CSP–554: PROGRAMMING LAB-I

Credits L T P 0 0 2

Programming exercises based on the subjects covered in first semester.

8

CSB2: M.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – II (Under Credit Based Continuous Evaluation Grading System)

CSL–560: COMPUTER SYSTEM ARCHITECTURE & ORGANIZATION



UNIT-I Introduction to Computers: Basic Computer Organization: System Buses, Instruction Cycles CPU Organization: Design specifications for a Simple CPU, Fetching Instructions from Memory, Decoding Instructions, Executing Instructions, Design of a Simple ALU, Designing the Control Unit Using Hardwired Control and Microprogrammed control approach. Memory Subsystem Organization and Interfacing, Types of Memories I/O Subsystem Organization and Interfacing. Parallelism in Uniprocessor Systems: Trends in parallel processing, Basic Uniprocessor Architecture, Parallel Processing Mechanism.

UNIT-II Parallel Computer Structures: Pipeline Computers, Array Computers, Multiprocessor Systems. Architectural Classification Schemes: Multiplicity of Instruction-Data Streams, Serial versus Parallel Processing, Parallelism versus Pipelining. Pipelining: An overlapped Parallelism, Principles of Linear Pipelining, Classification of Pipeline Processors, General Pipelines and Reservation Tables. Principles of Designing Pipelined Processors: Instruction Prefetch and Branch Handling, Data Buffering and Busing Structures, Internal Forwarding and Register Tagging, Hazard Detection and Resolution. Superscalar and Superpipeline Design: Superscalar Pipeline Design, Superpipelined Design.

UNIT-III Structures and Algorithms for Array Processors: SIMD Array Processors, SIMD Computer Organizations, Masking and Data Routing Mechanisms, Inter-PE Communications. SIMD Interconnection Networks: Static versus Dynamic Networks, Mesh-Connected Illiac Network, Cube Interconnection Networks. System Interconnect Architectures: Network Properties and Routing, Static Connection Networks, Dynamic Connection Networks. Multiprocessor Architecture: Functional Structures: Loosely Coupled Multiprocessors, Tightly Coupled Multiprocessors. Interconnection Networks: Time Shared for Common Buses, Crossbar Switch and Multiport Memories. References 1. Computer Architecture and Parallel Processing, Faye A. Briggs, McGraw-Hill

International Editions. 2. Computer Systems Organization & Architecture, John d. Carpinelli, Addison Wesley.

9


CSL–561: ALGORITHM ANALYSIS & DESIGN

Credits L T P 4 0 1

* *Credit for Term Paper

UNIT-I

Algorithm concepts: Algorithm analysis, design of efficient algorithms, complexity analysis, asymptotic notation. Design Strategies: Divide-and-conquer, Dynamic Programming, Greedy Method, Back-tracking, Branch-and-bound. Data Structures: Lists, queues, graphs and trees, hash tables, binary search trees, btrees, heaps.

UNIT-II Sorting & Searching: Simple sorting, algorithms, Radix sorting, heap sort, quick sort, linear and binary search algorithms. Algorithms on Graphs: Minimum cost spanning tree. Depth/Breadth First search. Path finding problems.

UNIT-III Advanced Algorithms: Matrix operations, FFT, string processing, simple parallel & approximation algorithms. Complexity Theory: Complexity hierarchy, simple NP hard problems, NP completeness. References:

1. Cormen T.H., Leiserson C.E., Rivest R.L., Introduction to Algorithms, PHI, 2000 2. Horowitz E., Sahni S., Rajasekaran S., Computer Algorithms, Galgotia Publications,

1999. 3. Aho A.V., Hopcroft J.E. Ullman J.D., The Design and Analysis of Computer Algorithms,

Pearson Education Asia, 1998, 1974 4. Knuth D.E., The Art of Computer Programming Volume 1 (Fundamental Algorithms),

Narosa Publishing House, 1973 5. Knuth D.E., The Art of Computer Programming Volume 3 (Sorting and Searching),

Addison-Wesley, 1973.

10


CSL–562: COMPUTER NETWORKS



UNIT-I

Introduction: Data Communication, Network Components, Protocol & Standards, Standard Organization, Topologies, Transmission modes, Categories of Networks. The OSI Model: Layered architecture, Functions of layers, TCP/IP reference model, Comparison of OSI & TCP/IP models.

UNIT-II

Signals and Transmissions: Digital data transmission, Transmission media-Guided & unguided media, Performance of media, Switching, multiplexing, ISDN services, ATM transmission. Data Link Layer: Framing techniques, Flow control, Error Control, data link protocols, MAC protocols and IEEE standards.

UNIT-III

Network & Transport layer design Issues: Routing algorithms, Congestion control algorithms, Internetworking, Services and elements of Transport protocols. Network Security, Privacy & Services: Data representation, Data compression techniques and cryptography, File transfer access & management, E-mail & Remote login services. References:

1. B.A. Forouzan, Data Communication & Networking.

2. A.S. Tanenbaum, Computer Networks, Prentice Hall, 1992, 3rd Edition.

3. William Stallings, Data & Computer Communication, McMillan Publishing Co.

4. Black, Data Networks, PHI, 1988.

5. Fred Halsall, Data Communications, Computer Networks, Pearson Education.

11


CSP–563: PROGRAMMING LAB -II

Credits L T P 0 0 2

Programming exercises based on the subjects covered in second semester.

12

CSB2: M.TECH. (COMPUTER SCIENCE & ENGINEERING) ELECTIVES – I (Under Credit Based Continuous Evaluation Grading System)

CSL–564: ADVANCED SOFTWARE ENGINEERING



UNIT-I

Software Project Management: Fundamentals of Software project planning, Conventional Software Management, Evolution of Software Economics, Improvement of Software Economics, Comparison of old and modern ways of Software Management.

UNIT-II

Software Re-engineering: Introduction Re-engineering, Restructuring and Reverse Engineering, Re-engineering existing systems, Data Re-engineering and migration, Software Reuse and Re-engineering. Object-Oriented (OO) Measurements: Introduction, Why metrics?, Classification of OO metrics, Study of Design Metrics- method size, method internals, class size, class inheritance, Method inheritance, class intervals and class externals.

UNIT-III

Object-Oriented Analysis and Design: What is Object-Oriented Design? Objects, Abstraction, Collaboration among Objects, Polymorphisms, Classes, specifying State, Specifying Behavior, Class Relationships, Grouping, Hiding. Software Agents: Definition, Applications, Types and Classes, Multi-Agent systems, Characteristics & Properties Agents. References:

1. Walker Royce, Software Project Management, Pearson Education, ISBN: 9780201309584, 2004.

2. Robert S. Arnold, Software Re-engineering, IEEE Comp. Society, ISBN: 9780818632723, 2003.

3. Lorenz and Kidd, Object Oriented Software Metrics, Prentice Hall, ISBN 978-0131792920, 2001.

4. Booch, Object-Oriented Analysis and Design with Applications, Addison-Wesley Professional, 3rd Edition, ISBN: 978-0201895513, 2007.

13


CSL–565: NETWORK PROGRAMMING

Credits

L T P 4 0 1*


UNIT-I

Introduction: TCP/IP Architecture, TCP/IP addressing, services, FTP, SMTP, TFTP, SNMP, Network file system, domain name system, transport layer protocols, user datagram protocol, transmission control protocol.

UNIT-II

Interprocess Communications: File and record locking, pipes, FIFO’s, stream and messages, message quues, samphorers. Sockets: Sockets system cells, reserved parts, stream pipes, socket option, asynchronous I/O, Sockets and signals Transport Lay Interface : Elementary TLI functions, stream and stream pipes, asynchronous I/O I/O multiplexing.

UNIT-III

Remote Procedure Calls: Remote login, remote command execution, external data representation. Reference:

1. A. Stevens, “TCP/IP Illustrated”, Vol. 1-3, Pearson Education, 2004.

2. R. Stevens, “Unix Network Programming”, PHI 2002.

3. D.E. Comer, “Internetworking with TCP/IP, Vol. 1, Vol. 2, Vol. 3 Principles, Protocols,

and Architecture, PHI, 2000.

14


CSL–566: INTERNET TECHNOLOGIES



UNIT-I Computer networks and the internet: Principles of application-layer protocols , HTTP, FTP, e-mail, DNS, socket programming with TCP/UDP, web servers, web pages design using HTML and XML. Multimedia networking: Applications: streaming stored audio and video, internet telephony, RTP, scheduling and policing mechanisms, integrated services, RSVP, differentiated services: network management, the internet network management framework

UNIT-II

Network security: E-mail security, privacy, SMIME, IP security: overview, architecture, authentication, header and payload, combining security associations, key management. web security: SSL and transport layer security, SET . systems security : intruders and viruses, firewalls: design, trusted systems.

UNIT-III Mobile internet - mobile network layer, mobile IP, dynamic host configuration protocol, ad hoc networks, mobile transport layer, implications of TCP on mobility, indirect TCP, snooping TCP, mobile TCP, transmission, selective retransmission, transaction-oriented TCP, support for mobility, file systems, WAP protocols, WML , WML script, wireless telephony applications. References:

1. Kurose J.F. & Ross K.W., Computer Networking: A Top-Down Approach Featuring the Internet, Addison Wesley, Modules I & II, 2006.

2. Stallings W., Cryptography and Network Security Principles and Practice, Pearson Education Asia, Module III, 2005.

3. Schiller J., Mobile Communications, Addison Wesley, Module IV, 2005. 4. Deitel H.M., Deitel P.J. & Nieto T.R., Internet and World Wide Web: How to Program,

Pearson Education, 2005 5. Greenlaw R & Hepp E, In-line / On-line: Fundamentals of the Internet and the World

Wide Web, Tata McGraw Hill, 2004. 6. Sharma V. & Sharma R, Developing e-Commerce Sites: An Integrated Approach,

Addison Wesley, 1999. 7. Singhal et. al S., The Wireless Application Protocol, Pearson Education Asia, 2000. 8. Goncalves M., Firewalls: A Complete Guide, Tata McGraw Hill, 2001.

15


CSL–567: WIRELESS NETWORKS



UNIT-I Introduction to Wireless Systems: History, Overview of Wireless Networks, Types & Range of Wireless Communication, Wireless Network Standards, Security Issues of Wireless Technology. Wireless Communication Technology: Antennas & Propagation, Signal Encoding Techniques, Spread Spectrum Coding and Error Control.

UNIT-II

Wireless Networking: Satellite Communications, Cellular Wireless Networks, Cordless Systems and Wireless Local Loop, Mobile Communications, Mobile IP and Wireless Access Protocol. Wireless LANs: Introduction, Benefits, WLANs Configurations and Standards, Security, IEEE 802.11, Wireless LAN Standard, Blue Tooth. WAP: History of WAP, Architecture, and Components.

UNIT-III

Cellular Technology: Design and Principles of Cellular Operation, Cellular Telephony Operations, GSM Adhoc & Sensor Networks: Introduction, Protocols, and Applications. Books Recommended:

1. Wireless Communications & Networks by Stallings (2005) Pearson Education.

2. Wireless Communication, Principles of Practice by Rappaport, Prentice Hall, 2nd Edition.

3. Introduction to Wireless Technology by Rogers (2003), Pearson Education.

4. Data Over Wireless Networks: Blue tooth, WAP and Wireless LANs by Held (2001), Tata McGraw Hill (Osborne reprint)

16


CSL–568: NETWORK SECURITY



UNIT-I Introduction: Attacks, services, mechanisms, security attacks, security services, Model for network security, Internet standards. Conventional encryption and message confidentiality: Conventional encryption principles, conventional encryption algorithms, cipher block modes of operations, location of encryption devices, key distribution.

UNIT-II Public Key cryptography and authentication: Approaches to message authentication, Secure Hash Functions and HMAC, Public Key Cryptography, Principles Public Key Cryptography Algorithms, Digital signatures, Key management. Authentication & E mail Security: Kerberos, X.509 Directory Authentication Services-PGP-S/MIME.

UNIT-III IP Security: IP security overview, IP Security Architecture, Authentication Header, Encapsulating Security Pay load, Combing Security Associations, Key Management. Web Security: Web Security Requirements, SSL and Transport Layer Security, SETNetwork Management Security. System Security: Intruders, viruses related threats, Fire Design principles, Trusted Systems. References:

1. William Stallings, Network Security Essentials Applications and Standards, Pearson

Education Asia, New Delhi, 2006

2. Kaufman, Network Security: Private Communication in a Public World, Pearson

Education Asia, New Delhi, 2005.

3. William Stallings, Cryptography and Network Security, Pearson Education Asia, New

Delhi, 2005.

17

CSB2: M.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – III (Under Credit Based Continuous Evaluation Grading System)

CSL–650: PARALLEL COMPUTING



UNIT-I Paradigms of Parallel Computing: Synchronous – Vector/Array, SIMD, Systolic Asynchronous – MIMD, reduction Paradigm, Hardware taxanomy: Flynn’s classification, Handler’s classification, Software taxanomy: Kung’s taxanomy, SPMD. Abstract Parallel Computational Models: Combinational circuits, Sorting Network, PRAM Models, Interconnection RAMs.

UNIT-II

Parallelism approaches – Data parallelism, control parallelism. Performance Metrics: Laws governing performance measurements: Amdahl’s law, Austafson’s law, Sun-Ni law, Metrics such as Speedup, efficiency, isoefficiency, utilization, sizeup, communication overheads etc., Benchmarks.

UNIT-III

Scheduling and Parallelization: Load Scheduling, Types of scheduling algorithm, Load Balancing, Loop Scheduling, Parallelization of sequential programs. Overview of Parallel Programming Development & Support Environments: Shared memory programming, distributed memory programming, object oriented programming, data-parallel programming, functional and data flow programming. References:

1. Michael J. Quinn, Parallel Computing: Theory and Practice, Tata McGraw-Hill,

4th Edition, ISBN: 9780070512948, 2004.

2. C. Xavier and S.S.Iyenger, Introduction to Parallel Algorithms, Wiley-Interscience

Publication, ISBN: 9780471251828, 1998.

3. Wilkinision: Parallel Programming, Prentice Hall, ISBN: 9780131405639, 2004.

18

CSB2: M.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – III (Under Credit Based Continuous Evaluation Grading System)

CSD–651: DISSERTATION (PART-I)

Credits

L T P 0 0 12

The dissertation will normally contain:

1. A clear indication, at appropriate stages, of original and creative elements. The level of

originality expected is likely to include the application of existing techniques to new

environments, the use of original materials, the re-working of existing materials, and the

use of comparative approaches to the provision of information technology;

2. A discussion of its scope and aims, and its theoretical and professional significance,

including a discussion of the context in which the problem is seen as important;

3. An analysis of the topic within a critical review of the relevant literature;

4. An evaluation of methods used in the dissertation, their reliability, validity, and a

comparison with alternative methods;

5. An account of the process of obtaining the data required for the dissertation and the

results obtained;

6. An analysis of the results of the dissertation to include a discussion of their significance,

their relationship to other research, and any methodological or theoretical implications;

and

7. The relationship of the findings to existing professional understanding and, where

appropriate, potential implementation difficulties.

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. Although a written report will normally be expected, it should be accompanied by soft copy on CD.

19

CSB2: M.TECH. (COMPUTER SCIENCE & ENGINEERING) ELECTIVES – II (Under Credit Based Continuous Evaluation Grading System)

CSL–652: ARTIFICIAL NEURAL NETWORKS

Credits

L T P 4 0 1*


UNIT-I

Neural Network Technology: Evolution of ANN, Architecture of ANN, Knowledge representation. Neural Network Learning: Basic learning rules, supervised & unsupervised learning, LMS Algorithm.

UNIT-II

Single Layer Perceptrons-I: Preceptron Model, Preceptron learning algorithms: Simple learning algorithm, pocket algorithm without and with Ratches, Linear Machines, Kessler’s construction, Linear Machines Learning algorithm, Representing Boolean functions. Single Layer Perceptrons-II: Anderson’s BSB Model, Hopfield’s Model, K-Means Clustering, Topology-Preserving Maps, ART1 and ART2.

UNIT-III

Multilayer Perceptrons: Back-Propagation, Applications of Back-propagation: NETtalk, Handwritten Character Recognition, Pattern Recognition. References:

1. [SG] Gallant S.L., Neural Networks Learning & Expert Systems, MIT Press, ISBN:

9780262071451, 1993.

2. [SH] Haykin S., Neural Networks: A comprehensive Foundation, Prentice Hall,

3rd Edition, ISBN: 9780131471399, 2007.

3. [FS] Freeman J.A., Skapura D.M., Neural Network Algorithms, Applications and

Programming Techniques, Pearson Education, ISBN: 9780201513769, 2003.

20


CSL–653: DIGITAL IMAGE PROCESSING



UNIT-I Introduction and Digital Image Fundamentals : The origins of Digital Image Processing, Fundamentals Steps in Image Processing, Elements of Digital Image Processing Systems, Image Sampling and Quantization, Some basic relationships like Neighbours, Connectivity, Distance Measures between pixels, Linear and Non Linear Operations. Image Enhancement: Point Operations, Histograms, Spatial Domain methods, Frequency domain methods, Enhancement by point processing, Spatial filtering, low pass filtering, High pass filtering, Homomorphic filtering, Colour Image Processing.

UNIT-II

Image Restoration Degradation Model, Algebraic approach to Restoration, Inverse Filtering, Wiener Filter, Constrained least square restoration, Interactive restoration, Restoration in spatial domain. Image Compression: Coding, Interpixel and Psychovisual Redundancy, Image Compression Models, Elements of Information Theory, Error free comparison Lossy Compression, Image Compression Standards.

UNIT-III

Image Segmentation: Detection of Discontinuities, Edge Linking and Boundary Detection, Thresholding, Region Oriented Segmentation, Motion based segmentation. Representation and Description: Representation, Boundary Descriptors, Regional Descriptors, Use of Principal Components for Description, Introduction to Morphology, Some basic Morphological Algorithms. Object Recoginition: Patterns and Pattern Classes, Decision – Theoretic Methods, Structural Methods. References:

1. Rafael C. Conzalez & Richard E. Woods, “Digital Image Processing”, 2nd Edition. 2. A.K. Jain, “Fundamental of Digital Image Processing”, PHI

21


CSL–654: ADVANCED OPERATING SYSTEM



UNIT-I Attributes of Distributed Operating System: Performance and Scalability, Connectivity and Security, Reliability and Fault Tolerance, Transparency, Network Operating Systems, Distributed Operating Systems. Communication in Distributed Systems: Remote Procedure Call (RPC), Remote Method Invocation (RMI), CORBA (Common Object Request Broker Architecture), DCOM (Distributed Component Object Model, Process Migration in Distributed Systems.

UNIT-II

Synchronization in Distributed Systems: Mutual Exclusion in Distributed Systems : Mutual Exclusion without Shared Memory, Agrawala and Ricart’s Distributed Mutual Exclusion Algorithm. Deadlock in Distributed Systems: Distributed Deadlock, Deadlock Prevention, Deadlock Detection, A Distributed Resource Deadlock Algorithm.

UNIT-III Distrubuted Systems and Web Services: Distributed File System Concepts, Network File System (NFS). Multicompouter Systems, Clustering, Distributed Computing, Grid Computing. Security in Operating System: Cryptography, Access Control, Security Attacks and Security Solutions, Key Agreement Protocols, Secure Communication Protocols, Steganography, Open Source Security. References:

1. Gary Nutt : Operating System, Modern Perspective, Addison Wesley. 2. A.S.Tanenbaum : Modern Operating Systems, Prentice Hall. 3. M. Milenkovic : Operating Systems, McGraw Hill. 4. Deitel and Choffnes : Operating Systems, 3rd Edition, Pearson Education. 5. Brian L. Stuart : Operating Systems Principles, Design and Applications, Cengage

Learning.

22


CSL–655: SOFTWARE PROJECT MANAGEMENT

Credits

L T P 4 0 1*


UNIT-I Planning Fundamentals: Major issues in software project planning, Planning activities Project, master schedule, Software risk management, Risk monitoring, Risk analysis Software cost: Major issues in estimating software cost, Cost estimation methods, Experience based model, Parameter based model, COCOMO, Versions of COCOMO, Software size estimation, Function points, Software project schedule, Rayleigh model.

UNIT-II

Functional organization: Project organization, Matrix organization, Staffing, Quality replacements, Turnover management. Directing a software engineering project: Issues, activities, Conflict management.

UNIT-III

Issues in controlling a software project: Controlling activities, Threads of control, Work breakdown structures, Earned value tracking References:

1. Richard Thayer, Software Engineering Project Management, Tata Mc Graw Hill, 2004. 2. Donald J. Reifer, Software Management, Pearson Education, 2003.

23

CSB2: M.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – IV (Under Credit Based Continuous Evaluation Grading System)

CSD–660: DISSERTATION (PART-II)

Credits L T P 0 0 14

In continuation from 3rd Semester

MASTER OF TECHNOLOGY (COMPUTER SCIENCE …gndu.ac.in/syllabus/201213/ELECENG/MTECH CSE SEMESTER I to...

Documents

Transcript of MASTER OF TECHNOLOGY (COMPUTER SCIENCE …gndu.ac.in/syllabus/201213/ELECENG/MTECH CSE SEMESTER I to...