Documente Academic
Documente Profesional
Documente Cultură
SYLLABUS
FOR
________________________________________________________________________________________________
Eligibility :
OR
BCA/B.Sc. (IT)/ BIT or equivalent there to with atleast 50% marks in aggregate.
OR
Graduate with mathematics as an elective subject and Post-Graduate Diploma in Computer
Applications / PG Diploma in Information Tech. / PG Diploma in E-Commerce & Internet
Application or equivalent with 50% marks in the aggregate
3rd Semester
4th Semester
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Review of algorithm analysis, Binary search trees, balanced binary search trees (red-black trees), B-
trees, AVL Trees, 2-3 trees, 2-3-4 trees.
Binary heaps, heap operations, specifications, implementation and applications. Advanced heap
structures, priority queue operations, and double-ended priority queues.
Dictionaries, binomial heaps, Fibonacci heaps. Data structures for disjoint sets, tables and table
operations.
External data structures - external storage, external files, external sorting searching indexing files,
external hashing.
References:
Alfred V. Aho, Jeffrey D. Uuman, John E. Hopcroft, Data Structures and Algorithms Addision
Wesley, 1983.
Dinesh P. Mehta, I. Sartaj Sahni, Handbook of Data Structures and Applications, Chapman &
Hall/CRC, 2004.
Sorenson and Trembley, An Introduction to Data Structures with Applications, McGraw Hill,
2006 Edition.
4
M.Sc. (Computer Science) (Semester-I)
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
References
Computer Architecture and Parallel Processing, Faye A. Briggs, McGraw-Hill International, 2007
Edition
Computer Systems Organization & Architecture, John d. Carpinelli, Addison Wesley, 2007 Edition.
5
M.Sc. (Computer Science) (Semester-I)
MCS-103
Network Design & Performance Analysis
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Network performance modeling- Creating traffic matrix, design tools, components of design
tools, types of design projects.
Access Network Design- N/W design layers, Access N/W design, access n/w capacity,
Backbone n/w design, Backbone segments, backbone capacity, topologies, Tuning the
network, securing the network, Design for network security.
References:
James D. McCabe, Network Analysis, Architecture and Design, 2nd Edition, Morgan
Kaufman Series in Networking, 2007 Edition.
Youeu Zheng, Shakil Akhtar, Network for Computer Scientists and Engineers, Indian
University, Oxford University Press, 2007 Edition.
A. Forouzan, Data Communications and Networking, Tata McGraw Hill, 2007 Edition.
6
M.Sc. (Computer Science) (Semester-I)
MCS-104
Discrete Structures
Time: 3 Hrs. Max. Marks: 100
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Graph Theory: Graph - Directed and undirected Eulerian chains and cycles. Hamiltonian
chains and cycles Trees, Chromatic number Connectivity and other graphical parameter.
Application.
Sets and Functions : Sets relations functions operations equivalence relations, relation of
partial order partitions binary relations.
Monoids and Groups: Groups Semigroups and monoids Cyclic semigraphs and
submonoids, Subgroups and Cosets. Congruence relations in semigroups. Morphisms.
Normal subgroups. Structure of Cyclic groups permutation groups, dihedral groups
Elementary applications in coding theory.
Rings and Boolean algebra : Rings Subrings morphism of rings ideals and quotient rings.
Euclidean domains Integral domains and fields Boolean Algebra direct product morphisms
Boolean sub-algebra Boolean Rings Application of Boolean algebra in logic circuits and
switching functions.
References :
Ehrig, H., Mahr, B. Fundamentals of Algebraic Specification I, EATCS Monographs on
Theory. Comp. Sc. Vol. 6 spinger, Berlin 1985.
Gersting J. Mathematical Structures for Computer Science, W.H. Freeman, New York,
1987.
Gibbons, A. Algorithmic Graph theory Cambridge University Press, 1985.
Knuth, D.E. The art of Computer Programming Vol. I: Fundamental Algorithms. 2nd ed.
Reading, Mass, Addison Wesley 1973.
Kolman B. Busby R. Discrete Mathematical Structures for Computer Science, Prentice Hall
Englewood Cliffs. 1987.
Sahni, S. Concepts in Discrete Mathematics Fridley MN., Camelot Publ. Comp., 1981.
Schmidt G. Strohlein T. Relations Graphs Program, EATS Monograph on Theor. Comp.
Sc. Vol. 29 Berlin Spinger 1993.
Wheeler W. Universal Algebra for Computer Scientist EATCS Monographs on Theor.
Comp. Sc. Vol. 25 Spinger-Verlag, Berlin 1991.
7
M.Sc. (Computer Science) (Semester-I)
MCS-105
Soft Computing
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Neural Networks
Fuzzy Logic
Introduction to fuzzy logic and fuzzy sets, fuzzy relations, fuzzy graphs, fuzzy arithmetic and
fuzzy if-then rules.
Probabilistic Reasoning
References:
Elements of artificial neural networks by Kishan Mehrotra, Chilkuri K. Mohan and Sanjay
Ranka, 2007 Edition.
Fundamentals of artificial neural networks by Mohammad H. Hassoun, Prentice Hall of
India, 2007 edition.
Neural networks and fuzzy systems by Bart Kosko, Prentice Hall of India, 2007 edition.
Fuzzy logic, intelligence, control and information by John Yen and Reza Langari, Pearson
Education, 2007 edition.
Probability and statistics by Murray R. Spiegel, John Schiller and R. Alu Srinivasan,
Schaums Outlines, Tata McGraw Hill Publishing Company Limited, 2007 edition.
8
M.Sc. (Computer Science) (Semester-I)
MCS-106 P
Programming Laboratory - I
MCS-201
Theory of Computation
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Unrestricted Languages: Normal form and Derivation Graph, Automata and their
Languages: Finite Automata, Push down Automata and Turing Machines, The Equivalence
of the Automata and the appropriate grammars.
Syntax Analysis: Ambiguity and the formal power Series, Formal Properties of LL(k) and
L.R.(k) Grammars.
References:
1. G.E. Reevsz, Introduction to Formal Languages, McGraw Hill 1983.
2. M.H. Harrison, Formal Language Theory Wesley 1978.
3. Wolfman Theory and Applications of Cellular Automata, World Scientific,
Singapore, 1986.
4. K.L.P. Mishra, N. Chandrasekaran, Theory of Computer Science (Automata,
Languages and Computation), 2nd Edition, Prentice Hall of India, 2006.
10
M.Sc. (Computer Science) (Semester-II)
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Background: Introduction to electronic systems for image transmission and storage, computer
processing and recognition of pictorial data, overview of practical applications.
Fundamentals: Mathematical and perceptual preliminaries, human visual system model, image
signal representation, imaging system specification building image quality, role of computers,
image data formats.
Image Processing Techniques: Image enhancement, image restoration, image feature extraction,
image data compression and statistical pattern recognition.
Hardware architecture for image processing: Distributed processing of image data, role of array
processing, standard image processor chips (as example).
Techniques of Colour Image Processing: Colour image signal representation, colour system
transformations, extension of processing techniques to colour domain.
Applications of Image Processing: Picture data archival, machine vision, medical image
processing.
References:
1. Pratt, W.K. Digital Image Processing, John Wiley, N.Y./1978.
2. Rosenfield, A and Kak, A.C., Picture processing, Academic Press N.Y., 1982.
3. Jain, A.K., Fundamentals of Digital Image Processing, Englewood Cliffs, Prentice Hall,
1989.
4. Chris Soloman, Stuart Gibson, Fundamentals of Digital Image Processing: A Practical
Approach using MatLab, John Wiley and Sons, 2007.
5. Digital Image Processing by Gonzalez & Wood, Addison Wesley, 2000.
11
M.Sc. (Computer Science) (Semester-II)
MCS-203
Design & Analysis of Algorithms
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Divide and Conquer: General Method, Binary Search, Finding the Maximum and
Minimum, Quick Sort, Selection.
Greedy Method: General Method, Knapsack Problem,, Minimum Cost Spanning Trees
(Prims Algorithm, Kruskals Algorithm) and Sibnngle-Source Shortest Path.
Dynamic Programming: General Single Method, Multistage Graphs, All Pairs Shortest
Paths, Single-Source Shortest Paths, Optimal Binary Search Tress, 0/1 Knapsack and
Travelling Saleman Problem.
Backtracking: General Method, 8-Queens Problem, Graph Coloring and Hamiltonian
Cycles.
Search and Traversal Technique: Techniques for Binary Trees, Techniques for Graphs.
Alegebric Algorithms: General Method, Evaluation and Interpolation, Fast Fourier
Transformation, Modular Arithmatic.
NP- Hard Problems: Basic Concepts, Nondeterministic Algorithms, Classes NP-Hard and
NP- Complete, NP-Hard Graph Problems (CNDP, DHC, TSP and AOG).
12
M.Sc. (Computer Science) (Semester-II)
References:
1. V. Aho, J.E. Hopcroft, J.D. Ullman, Design and Analysis of Algorithms, Addison
Wesley, 1976.
2. Horowitz, S. Sahni, Fundamentals of Computer Algorithms, Galgotia Publishers,
1984.
3. K. Mehlhorn, Data Structures and Algorithms, Vols. 1 and 2, Springer Verlag, 1984.
4. Purdom, Jr. and C. A. Brown, The Analysis of Algorithms, Holt Rinechart and
Winston, 1985.
5. D. E. Kunth, The Art of Computer Programming, Vols. I and 3, Addison Wesley,
1975.
6. Anany Levitin, Introduction to the Design & Analysis of Algorithms, Addison,
Wesley, 2002.
13
M.Sc. (Computer Science) (Semester-II)
MCS-204
Formal Specification & Verification
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Axiomatic System for first order logic. Proofs by mathematical induction. Hoare Logic,
Techniques for proving non deterministic programs.
References:
1. Apt and Olderog, Program Verification, Springer Verlag, 1991.
2. S. Alagic and M. Arbib, Design of Well Structured and Correct Programs, Springer
Verlag, 1978.
3. A. Pnueli and Z. Manna Temporal Logic of Reactive and Concurrent Systems,
Springer Verlag, 1992.
4. D. Gries, Science of Programming, Narosa Pub.1985.
5. J. Loeckx and K. Siber, Found of Prog. Verification, John Wiley, 1984.
14
M.Sc. (Computer Science) (Semester-II)
MCS-205
Distributed Database Systems
Time: 3 Hrs. Max. Marks: 100
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Introduction to distributed deadlocks, local and global wait for graphs, deadlock detection
using centralized and hierarchical controllers, prevention of deadlocks, 2 and 3 phase
locking and commitment protocols, reliability in commitment and locking protocols,
reliability and concurrency control, reliability and removal of inconsistency.
References:
1. Distributed Databases Principles and Systems by Stefano Ceri and Guiseppe Pelagatti,
McGraw-Hill International Editions, 2004.
2. Distributed Database Systems by David Bell, Jame Grimson, Addison-Wesley, 1992.
3. M.Tamer Ozsu, Patrick Valdureiz, Principles of Distributed Database Systems
Second Edition, Prentice Hall, 2002.
4. Romez Elmasri, Shamkant B.Navathe, Fundamentals of Database Systems Pearson
Education, 2005.
5. Silberschatz, Korth, Sudershan Database System Concepts 4th Ed. McGraw Hill,
2006.
6. Connolly & Begg Database Systems A practical approach to Design,
Implementation and Management, 3rd Ed. Pearson Education, 2005.
15
M.Sc. (Computer Science) (Semester-II)
MCS-206 P
Programming Laboratory II
MCS-301
Advanced Software Engineering
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
References:
MCS-302
System Software
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Assemblers: Overview of assembly process, design of one pass and two assemblers.
Loaders and Linkage Editors: Basic loader functions. Relocation, program linking, linkage,
editors, dynamic linking bootstrap loaders.
Other System Software: Operating system, DBMS, text editors, Interactive debugging systems.
References:
MCS-303
Data Mining and Warehousing
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Data Warehousing:
Concepts of Data Warehousing, Difference between operational database systems and Data
warehousing, Need of a separate Data Warehouse. Multidimensional Data Model.
Data Mining
Basic Concepts;
Data Mining Techniques: Predictive Modeling, Database Segmentation, Link Analysis, Deviation
Detection in details.
Data Mining Query Languages, Applications and Trends in Data Mining.
References:
MCS-304
Concept of Core and Advanced Java
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Applet: Applet basics, Applet architecture, Applet: Display, Repaint, Parameter Passing.
References:
1. Complete Reference: Java, Herbet Schildt & Naughton, Tata Mc Graw, 5Th Edition, 2006.
2. Java Unleashed, Jane Jawoske, SAM5, Tech Me dia 2006.
20
M.Sc. (Computer Science) (Semester-III)
MCS-305
Network Programming
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Sockets and Socket Address structures, Concept of Zombies, Daemon Processes, Super servers,
Concurrent versus Iterative servers, Protocol Independence, Error Handling : Wrapper functions,
OSI Model, Unix standards.
TCP Connection establishment & Termination, Port Numbers and Concurrent Servers, Protocol
Usage by common Internet Applications.
UDP Communication Semantics, UDP Echo Server, Echo Client working, Protocol Usage by
Common Internet Applications.
Sockets Address Structures, Byte ordering & Manipulation Functions, TCP Socket System Calls,
TCP Client-Server E.g., I/O Multiplexing, Signal Handling in Concurrent Servers.
Socket Options, Elementary Names Address Conversions, Ipv4 and Ipv6 Interoperability.
References:
MCS-306 P
Programming Laboratory III
MCS-401
Advanced Web Technologies using ASP.NET
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Standard Controls: Display information, Accepting user input, Submitting form data, Displaying
images, Using the panel control, Using the hyperlink control.
Validation Controls: Using the required field validator control, Using the range validator control
using the compare validator control, Using the regular expression validator control, Using the
custom validator control, Using the validation summary controls.
Designing Website with Master Pages: Creating master pages, Modifying master page content,
Loading master page dynamically.
SQL Data Source Control: Creating database connections, Executing database commands, Using
ASP.NET parameters with the SQL data source controls, Programmatically executing SQL data
source commands, Cashing database data with the SQL data Source controls.
List Controls: Dropdown list control, Radio button list controls, list box controls, bulleted list
controls, custom list controls.
Grid View Controls: Grid view control fundamentals, Using field with the grid view control,
Working with grid view control events extending the grid view control.
Building Data Access Components with ADO.NET: Connected the data access, Disconnected
data access, Executing a synchronous database commands, Building data base objects with the
.NET framework.
Maintaining Application State: Using browser cookies, Using session state, Using profiles.
Caching Application Pages and Data: page output caching, partial page caching, data source
caching, data caching, SQL cache dependences.
Reference:
MCS-402
Microprocessor and Its Applications
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Input/Output Interface of the 8086/8088 Microprocessor: I/O interface, I/O address space and
data transfer, I/O instructions, I/O bus cycles, Output ports, 8255A Programmable Peripheral
Interface (PPI), Serial communication interface (USART and UART) the RS- 232 C interface.
Interrupt Interface of 8086/8088 Microprocessor, Types of Interrupt, Interrupt Vector Table (IVT).
References:
MCS-403
Object Oriented Modeling, Analysis and Design
Note:
(i) The paper setter is required to set eight questions in all and the candidates will
be required to attempt any five questions out of these eight questions. All
questions will carry equal marks.
(ii) The student can use only Non-programmable & Non-storage type calculator.
Object Orientation, OMT Methodology, Object and Class, Link and Association Generalization,
Aggregation Multiple Inheritance, Packages,
Object Meta Modeling, Metadata and Metamodels, Functional Modeling Pseudocode with the
Object navigation Notation, ONN Constructs, Combining ONN Constructs.
Reference:
Object Oriented Modeling and Design By Michael Blaha, William Premerlani, and Prentice Hall.
25
M.Sc. (Computer Science) (Semester-IV)
MCS-404 P
Programming Laboratory IV
MCS405P
Project Work
The Project is to be prepared based on sum current problems from industry / business / academic
domain using some currently available technology / platform.
Note: 1. The end semester project work evaluation is to be conducted by following panel of
examiners:-
a. Internal Examiner
b. External Examiner (to be appointed by GND University, Amritsar)
c. Head/Heads nominee (where Head means Head, DCSE, GND University,
Amritsar.)
2. The Project are to be submitted as per the common ordinances for P.G. courses under
semester system.