FACULTY OF ENGINEERING & TECHNOLOGYgndu.ac.in/syllabus/201415/ELECENG/MTECH CSE SEMESTER I to IV 2...FACULTY OF ENGINEERING & TECHNOLOGY ... Transmission media-Guided & unguided media,

FACULTY OF ENGINEERING & TECHNOLOGY

SYLLABUS

FOR

MASTER OF TECHNOLOGY(COMPUTER SCIENCE & ENGG.)

(Two Years Course)

(Under Credit Based Continuous Evaluation Grading System)

(Session: I – IV)

SESSION: 2014-15

GURU NANAK DEV UNIVERSITYAMRITSAR

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 0

2. CSL551 Operating System 4 0 0

3. CSL552 Database Management System 4 0 0

4. CSL553 Programming Concepts 4 0 0

5. CSP554 Programming Lab – I 0 0 1

6. CSP555 Term Paper – I 0 0 1

Sub Total: 16 0 2

Grand Total: 18

2

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

CSL–550: THEORY OF COMPUTER SCIENCE

CreditsL T P4 0 0

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

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

UNIT-IIIPhase Structure Languages: Turing machines, extended and restricted turing machines,Church’s thesis, linear bounded automata, undecidability, recursive and recursively innumerablelanguages, Rics’s theorem, PCP problem; simulating turing machine on computers and viceversa.

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, 19794. [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.

3


CSL–551: OPERATING SYSTEM

CreditsL T P4 0 0

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 managerstrategy, Memory allocation strategies, Paging, Demand paging and Segmentation techniques

UNIT-III

Device Management: Device management approaches, Device allocation considerations, Roleof I/O traffic controller, I/O scheduler and device handler.

Information Management: File system, Its layered structure and general model, Allocationmethods, 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.

4


CSL–552: DATABASE MANAGEMENT SYSTEM

CreditsL T P4 0 0

UNIT-I

Basic Concepts: An overview of Database Management (Database, Database system, whydatabase, 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 DataIntegrity, 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, ClientServer 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 HillInternational 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”, KalyaniPublishers, 2010.

5. Fred R. McFadden, Jeffery A. Hoffer, Mary B. Prescott, “Modern DatabaseManagement”, 5th Edition.

5


CSL–553: PROGRAMMING CONCEPTSCredits

L T P4 0 0

UNIT-I

Programming Paradigms: Logic, Procedural, and Object Oriented, differences betweenimperative and object-oriented paradigms, Functional paradigm and concurrent programming,brief survey of other modern languages such as Python, Objective C and C #.

UNIT-II

Programming in C++: Introduction to C++, Operators, type conversion, Control Structure,Arrays, Defining a function, types of function, storage classes, recursion, preprocessor, headerfiles 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, friendfunction, static class member, Inheritance, Polymorphism.

UNIT-III

Advanced Data Structures: Heaps, Binomial heaps, Fibonacci heaps, pairing heaps,Dictionaries, Optimal binary search trees, AVL trees, Red-Black trees, B-trees, B+ and B* trees,Splay trees, BSP trees, R-trees.

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.4. Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein, Introduction to

Algorithms, ISBN: 0-262-03141-8, 2nd Edition, MIT Press.

6


CSP–554: PROGRAMMING LAB-ICredits

L T P0 0 1

Programming exercises based on the subjects covered in first semester.

7


CSP–554: TERM PAPER – ICredits

L T P0 0 1

8


SCHEME:

Sr.No. Subject Code Subject Credits

Semester-II

1. CSL560 Computer System Architecture &

Organization

4 0 0

2. CSL561 Algorithm Analysis & Design 4 0 0

3. CSL562 Computer Networks 4 0 0

4. Elective-I 4 0 0

5. CSP563 Programming Lab – II 0 0 1

6. CSP569 Term Paper – II 0 0 1

Sub Total: 16 0 2

Grand Total: 18

List of Electives – I

1. CSL564 Advanced Software Engineering 4 0 0

2. CSL565 Network Programming 4 0 0

3. CSL566 Internet Technologies 4 0 0

4. CSL567 Wireless Networks 4 0 0

5. CSL568 Network Security 4 0 0

9

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

CSL–560: COMPUTER SYSTEM ARCHITECTURE & ORGANIZATIONCredits

L T P4 0 0

UNIT – IIntroduction to Computers: Basic Computer Organization: System Buses, Instruction CyclesCPU Organization: Design specifications for a Simple CPU, Fetching Instructions fromMemory, Decoding Instructions, Executing Instructions, Designing the Control Unit UsingHardwired Control and Microprogrammed control approach.Parallelism in Uniprocessor Systems: Trends in parallel processing, Basic UniprocessorArchitecture, Parallel Processing Mechanism.

UNIT – IIParallel Computer Structures: Pipeline Computers, Array Computers, MultiprocessorSystems.Architectural Classification Schemes: Multiplicity of Instruction-Data Streams, Serial versusParallel Processing, Parallelism versus Pipelining.Pipelining: An overlapped Parallelism, Principles of Linear Pipelining, Classification of PipelineProcessors.Principles of Designing Pipelined Processors: Instruction Prefetch and Branch Handling, DataBuffering and Busing Structures, Internal Forwarding and Register Tagging, Hazard Detectionand Resolution.Superscalar and Superpipeline Design: Superscalar Pipeline Design, Superpipelined Design.

UNIT – IIIStructures and Algorithms for Array Processors: SIMD Array Processors, SIMD ComputerOrganizations, Inter-PE Communications.SIMD Interconnection Networks: Static versus Dynamic Networks, Mesh-Connected IlliacNetwork, Cube Interconnection Networks.System Interconnect Architectures: Network Properties and Routing, Static ConnectionNetworks, Dynamic Connection Networks.Multiprocessor Architecture: Functional Structures: Loosely Coupled Multiprocessors, TightlyCoupled Multiprocessors.Interconnection Networks: Time Shared for Common Buses, Crossbar Switch and MultiportMemories.

References:1. Computer Architecture and Parallel Processing, Faye A. Briggs, McGraw-Hill

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

10


CSL–561: ALGORITHM ANALYSIS & DESIGNCredits

L T P4 0 0

UNIT-IAlgorithm 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-IISorting & Searching: Simple sorting, algorithms, Radix sorting, heap sort, quick sort, linear andbinary search algorithms.Algorithms on Graphs: Minimum cost spanning tree. Depth/Breadth First search. Path findingproblems.

UNIT-IIIAdvanced 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, 20002. 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, 19744. Knuth D.E., The Art of Computer Programming Volume 1 (Fundamental Algorithms),

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

Addison-Wesley, 1973.

11


CSL–562: COMPUTER NETWORKSCredits

L T P4 0 0

UNIT-I

Introduction: Data Communication, Network Components, Protocol & Standards, StandardOrganization, 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 & unguidedmedia, Performance of media, Switching, multiplexing, ISDN services, ATM transmission.Data Link Layer: Framing techniques, Flow control, Error Control, data link protocols, MACprotocols 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 andcryptography, 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.

12


CSP–563: PROGRAMMING LAB -IICredits

L T P0 0 1

Programming exercises based on the subjects covered in second semester.

13


CSP–569: TERM PAPER – IICredits

L T P0 0 1

14

CSB2: M.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – IIELECTIVES – I


CSL–564: ADVANCED SOFTWARE ENGINEERINGCredits

L T P4 0 0

UNIT-I

Software Project Management: Software Sizing: Function points, Software project models,COCOMO project plan components.

UNIT-II

Software Re-engineering: Introduction Re-engineering, Restructuring and ReverseEngineering, Re-engineering existing systems, Data Re-engineering and migration, SoftwareReuse and Re-engineering.Software Measurements: Introduction, Why metrics?, Classification of Software metrics, Studyof Design Metrics

UNIT-III

Software Quality Assurance: Quality, Quality Models, Quality Metrices, SQA Activities.

Component Based Software Engineering: Basic Concepts, specification of softwarecomponents, Component Models

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-WesleyProfessional, 3rd Edition, ISBN: 978-0201895513, 2007.

5. Pressman, “Software Engineering” Prentice Hall, ISBN 978-0131792920, 2001.6. IvicaCrzKovics Magnus Larsson (eds.) “Building reliable component based software

systems” Artech House, 2002 ISBN – 1-58053327-2.

15



CSL–565: NETWORK PROGRAMMING

CreditsL T P4 0 0

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 streampipes, asynchronous I/O I/O multiplexing.

UNIT-III

Remote Procedure Calls: Remote login, remote command execution, external datarepresentation.

References:

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.

16



CSL–566: INTERNET TECHNOLOGIESCredits

L T P4 0 0

UNIT-IComputer 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 HTMLand 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-IINetwork Security: E-mail security, privacy, SMIME, IP Security: overview, architecture,authentication, header and payload, combining security associations, key management. websecurity: SSL and transport layer security, SET. Systems Security: intruders and viruses,firewalls: design, trusted systems.

UNIT-IIIMobile internet - mobile network layer, mobile IP, dynamic host configuration protocol, ad hocnetworks, mobile transport layer, implications of TCP on mobility, indirect TCP, snooping TCP,mobile TCP, transmission, selective retransmission, transaction-oriented TCP, support formobility, 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, 20055. 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.

17



CSL–567: WIRELESS NETWORKSCredits

L T P4 0 0

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

UNIT-IIWireless Networking: Satellite Communications, Cellular Wireless Networks, CordlessSystems and Wireless Local Loop, Mobile Communications, Mobile IP and Wireless AccessProtocol.Wireless LANs: Introduction, Benefits, WLANs Configurations and Standards, Security, IEEE802.11, Wireless LAN Standard, Blue Tooth.

WAP: History of WAP, Architecture, and Components.

UNIT-IIICellular Technology: Design and Principles of Cellular Operation, Cellular TelephonyOperations, GSMAdhoc & 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)

18



CSL–568: NETWORK SECURITYCredits

L T P4 0 0

UNIT-IIntroduction: Attacks, services, mechanisms, security attacks, security services, Model fornetwork security, Internet standards.Conventional encryption and message confidentiality: Conventional encryption principles,conventional encryption algorithms, cipher block modes of operations, location of encryptiondevices, key distribution.

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

UNIT-IIIIP 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, SET NetworkManagement 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.

19


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

20

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

CSL–650: PARALLEL COMPUTINGCredits

L T P4 0 1*

*Credit for Term Paper

UNIT-IParadigms of Parallel Computing: Synchronous – Vector/Array, SIMD, SystolicAsynchronous – 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, PRAMModels, Interconnection RAMs.

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

UNIT-IIIScheduling and Parallelization: Load Scheduling, Types of scheduling algorithm, LoadBalancing, Loop Scheduling, Parallelization of sequential programs.

Overview of Parallel Programming Development & Support Environments: Shared memoryprogramming, distributed memory programming, object oriented programming, data-parallelprogramming, 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.

21

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

CSD–651: DISSERTATION (PART-I)

CreditsL T P0 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 itshould follow the standard practices of dissertation writing. Although a written report willnormally be expected, it should be accompanied by soft copy on CD.

22

CSB2: M.TECH. (COMPUTER SCIENCE & ENGINEERING) SEMESTER – IIIELECTIVES – II


CSL–652: ARTIFICIAL NEURAL NETWORKS

CreditsL T P4 0 1*


UNIT-I

Neural Network Technology: Evolution of ANN, Architecture of ANN, Knowledgerepresentation.Neural Network Learning: Basic learning rules, supervised & unsupervised learning, LMSAlgorithm.

UNIT-II

Single Layer Perceptrons-I: Preceptron Model, Preceptron learning algorithms: Simplelearning algorithm, pocket algorithm without and with Ratches, Linear Machines, Kessler’sconstruction, 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.

23



CSL–653: DIGITAL IMAGE PROCESSINGCredits

L T P4 0 1*


UNIT-IIntroduction and Digital Image Fundamentals : The origins of Digital Image Processing,Fundamentals Steps in Image Processing, Elements of Digital Image Processing Systems, ImageSampling and Quantization, Some basic relationships like Neighbours, Connectivity, DistanceMeasures between pixels, Linear and Non Linear Operations.Image Enhancement: Point Operations, Histograms, Spatial Domain methods, Frequencydomain methods, Enhancement by point processing, Spatial filtering, low pass filtering, Highpass filtering, Homomorphic filtering, Colour Image Processing.

UNIT-IIImage Restoration Degradation Model, Algebraic approach to Restoration, Inverse Filtering,Wiener Filter, Constrained least square restoration, Interactive restoration, Restoration in spatialdomain.Image Compression: Coding, Interpixel and Psychovisual Redundancy, Image CompressionModels, Elements of Information Theory, Error free comparison Lossy Compression, ImageCompression Standards.

UNIT-IIIImage 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 basicMorphological Algorithms.Object Recoginition: Patterns and Pattern Classes, Decision – Theoretic Methods, StructuralMethods.

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

24



CSL–654: ADVANCED OPERATING SYSTEMCredits

L T P4 0 1*


UNIT-IAttributes of Distributed Operating System: Performance and Scalability, Connectivity andSecurity, Reliability and Fault Tolerance, Transparency, Network Operating Systems,Distributed Operating Systems.Communication in Distributed Systems: Remote Procedure Call (RPC), Remote MethodInvocation (RMI), CORBA (Common Object Request Broker Architecture), DCOM (DistributedComponent Object Model, Process Migration in Distributed Systems.

UNIT-IISynchronization in Distributed Systems: Mutual Exclusion in Distributed Systems : MutualExclusion without Shared Memory, Agrawala and Ricart’s Distributed Mutual ExclusionAlgorithm.Deadlock in Distributed Systems: Distributed Deadlock, Deadlock Prevention, DeadlockDetection, A Distributed Resource Deadlock Algorithm.

UNIT-IIIDistrubuted Systems and Web Services: Distributed File System Concepts, Network FileSystem (NFS).Multicompouter Systems, Clustering, Distributed Computing, Grid Computing.Security in Operating System: Cryptography, Access Control, Security Attacks and SecuritySolutions, Key Agreement Protocols, Secure Communication Protocols, Steganography, OpenSource 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.

25



CSL–655: SOFTWARE PROJECT MANAGEMENT

CreditsL T P4 0 1*


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

UNIT-IIFunctional organization: Project organization, Matrix organization, Staffing, Qualityreplacements, Turnover management.Directing a software engineering project: Issues, activities, Conflict management.

UNIT-IIIIssues in controlling a software project: Controlling activities, Threads of control, Workbreakdown 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.

26


Semester-IV1. Inter-disciplinary subject-I 4 0 02. Inter-disciplinary subject-II 4 0 03. CSD660 Dissertation (Part-II) 0 0 14

Grand Total: 22

27

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

CSD–660: DISSERTATION (PART-II)

CreditsL T P0 0 14

In continuation from 3rd Semester, the evaluation shall be done as per the commonordinances for courses under credit based continuous evaluation grading system.

FACULTY OF ENGINEERING & TECHNOLOGYgndu.ac.in/syllabus/201415/ELECENG/MTECH CSE SEMESTER I to IV 2...FACULTY OF ENGINEERING & TECHNOLOGY ... Transmission media-Guided & unguided media,

Documents