Mca Tyc Cbegs 2019-20 PDF

FACULTY OF ENGINEERING & TECHNOLOGY
SYLLABUS
FOR
MASTER OF COMPUTER APPLICATIONS

(Three Years Course)
(Credit Based Evaluation and Grading System)
(Semester: I – IV)
(Credit Based Continuous Evaluation Grading System)
(Semester V & VI)
Examination: 2019–20
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
MASTER OF COMPUTER APPLICATIONS (MCA)
Sr. no. Subject Credits Total

Marks
Semester I L T P
CSL410 Computer Fundamentals 4 0 0 100
CSL411 Introduction to Programming 4 0 0 100
CSL412 Computer Oriented Numerical & Statistical Methods 4 0 0 100
ECL491 Principal of Digital Electronics 4 0 0 100
MTL408 Mathematical Elements of Computer Science 4 0 0 100
CSP410 Programming Laboratory-I 0 0 2 100
CSP411 Communication Skills* 0 0 1
Sub Total 20 0 3
Grand Total 18 600
Semester II
CSL420 Data & File Structures 4 0 0 100
CSL421 Computer Organization & Architecture 4 0 0 100
CSL423 Computer Based Optimization Techniques 4 0 0 100
CSL424 Design of Programming Languages 4 0 0 100
CSL426 Computer Networks 4 0 0 100
CSP420 Programming Laboratory–II 0 0 2 100
CSP421 Personality Development * 0 0 1 100
20 0 3 100
Grand Total 23 600
*Credits not to be counted towards SGPA

Note: PSL-053 ID Course Human Rights & Constitutional Duties (Compulsory Paper) Students can
opt. in any semester except Semester 1st. This ID Paper is one of the total ID Papers of this course.
Semester III Total

Marks
CSL511 Theory of Computation 4 0 0 100
CSL512 Microprocessor & its Applications 4 0 0 100
CSL516 Data Base Management System 4 0 0 100
CSL517 Operating System 4 0 0 100
Elective 4 0 0 100
CSP510 Programming Laboratory – III 0 0 2 100
List of Electives
CSL518 Software Testing 4 0 0
CSL519 Object Oriented Programming using JAVA 4 0 0
Sub Total 20 0 2
Grand Total 22 600
2
Semester – IV
CSL525 Information System 4 0 0 100
CSL529 Evolutionary and Intelligent Computing Theories & 4 0 0 100
Applications
CSL530 Web Technologies 4 0 0 100
Elective-I 100
Interdisciplinary Course-I 100
CSP-520 Programming Laboratory – IV 0 0 2 100
List of Electives-I
CSL526 Computer Graphics 4 0 0
CSL528 Digital Image Processing 4 0 0
Sub Total 20 0 2
Grand Total 22
Semester – V
CSL611 System Software 4 0 0 100
CSL612 Software Engineering 4 0 0 100
CSP610 Programming Laboratory – V 0 0 2 100
Elective-I 4 0 0 100
Interdisciplinary Course-II 4 0 0 100
Interdisciplinary Course-III 4 0 0 100
Sub Total 20 0 2
Grand Total 22
List of Electives
CSL614 Artificial Neural Networks 4 0 0
CSL616 Fundamentals of Cloud Computing 4 0 0
CSL632 Distributed Systems 4 0 0
CSL633 System Simulation 4 0 0
CSL637 Introduction to Machine Learning 4 0 0
CSL635 Introduction to Data Analytics 4 0 0
Semester – VI
CSE620 Major Project 0 0 26 500
Sub Total 0 0 26
Grand Total 26
*Credits not to be counted towards SGPA

3
(Credit Based Evaluation and Grading System) (SEMESTER – I)
CSL 410: Computer Fundamentals

Credits
Total Marks: 100 L T P
4 0 0
Mid Semester Examination: 20% weightage
End Semester Examination: 80% weightage
Instructions for the Paper Setters:

Eight questions of equal marks (Specified in the syllabus) are to be set, two in each of the four
Sections (A-D). Questions may be subdivided into parts (not exceeding four). Candidates are
required to attempt five questions, selecting at least one question from each Section. The fifth
question may be attempted from any Section.
Section A
Introduction to Computer: Computer System Characteristics, Hardware – CPU, Memory,
Input, Output & Storage devices, Organization of Secondary Storage Media, Software – System
& Application, Types of processing Batch and On–line. Programming Paradigms and
Development Tools: – Problem Analysis, Program Constructs (Sequential, Decision, Loop),
Algorithms, Flowcharts, Pseudocode. Decision table, Modular Programming, Top–down and
Bottom–up Approaches, functional, Procedural object–oriented, and logic programming,
Programming Languages – Syntax & Semantics.
SECTION –B
Operating System Concepts: Role of an Operating System, Types of operating systems, Batch
processing, Multiprograming, timesharing, real time, mobile, portable etc, Booting procedure
and its types, Components and functions of operating system. Data Communication and
Internet: Introduction to Data Communication, Types of Networks, Transmission Media,
Internet and its applications, Working knowledge of Search engines and use of electronic mail,
Virus, Information level threats, Network level threats , Classification of threats Hacking
Prevention Mechanism: Anti – Viruses, Firewalls, Biometrics Controls for security,
cryptography and encryption.
SECTION –C
Introduction to Cloud Computing: Overview of distributed computing: Trends of computing,
introduction to parallel/distributed computing, Introduction to Cloud Computing including
benefits, challenges, and risks, Different types of clouds, Security and Privacy issues in the
Cloud.. Introduction to distributed and Object Oriented database.
Introduction to Big data: Introduction to database, introduction to data mining,
structural/unstructural data, Define and describe Big Data and its characteristics, Critique,
Applications in different areas, Tools & Techniques of
implementation.
4
SECTION –D
Introduction to DBMS: Database models, fundamental of relational model, 3–Level
architecture, query languages, query optimization, normalization, DBA: security, recovery,
concurrency.
References:
1. Computers Today: Suresh K. Basandra, Galgotia, Updated Edition, 2012.
2. Gurvinder Singh & Rachhpal Singh: A Test Book on Windows Based Computer Courses,
Kalyani Publishers, 10th Edition 2008.
3. Norton, Peter: Introduction to Computers, McGraw Hill
4. Martin, James: Telecommunications and the Computer, PHI
5. Distributed and Cloud Computing, 1st edition, Morgan Kaufmann, 2011 by Hwang &
Dongarra & Fox
6. Cloud Computing: Concepts, Technology & Architecture by Thomas Erl Published May
2013.
7. Rajaraman, A., Ullman, J.D., Mining of Massive Datasets, Cambridge University Press,
United Kingdom, 2012.
5
CSL411: INTRODUCTION TO PROGRAMMING

Credits
L T P
Total Marks: 100 4 0 0

SECTION –A
Introduction to Program Development: Problem Analysis, Designing a solution.
Overview of C: Brief history of C, introduction to different versions of C. General Structure of a
C program, stages in the development of a C program.
Data Types, Operators & Expressions: Constants and variables, data types, declaring
variables, storage classes, different types of expressions and their evaluation, conditional
expression, assignment statement, enumerated data type, redefining/creating data types, type
casting.
Console Input/Output: Standard input/output devices, unformatted input/output functions
(character I/O functions and string I/O functions), formatted input/output functions (scanf( )
function and printf ( ) function).
Control Statements: Decision making using if, if – else, elseif and switch statements, Looping
using for, while and do – while statements, transferring program control using break and
continue statements
Arrays & Strings: Introduction to arrays, declaring arrays, initializing arrays, processing of
arrays, introduction to strings.
Structures & Unions: Introduction to structures, declaring structures, initializing structures,
accessing elements of structures, array of structures, nested structures, passing structures as
arguments to a function, introduction to unions.
SECTION –B
Functions: Defining a function, local variables, return statement, invoking a function, specifying
and passing arguments (including arrays, strings) to a function, function prototyping and use of
header files, building own library, recursion.
Pointers: Why pointers? Declaring pointers, accessing values via pointers, pointer arithmetic,
pointers to arrays, Array of pointers, pointers to strings, pointers to structures, self–referential
structures.
6
Program Structure: Program structure revisited, managing multi–file programs using

traditional approach of separate compilations and project facility of Turbo C compiler, storage
classes revisited.
File I/O: Introduction to files, different ways of file processing (standard I/O & system I/O),
description of various library functions for file handling, updating files.
SECTION –C
Introduction to Object Oriented Paradigm – Object Oriented programming and C++,
Structured Programming methodology, its shortcomings, advantages of OOPS (Object Oriented
Programming Style).
OOP concepts: Abstraction, Encapsulation, Data Hiding, Inheritance, Polymorphism. Overview
of C++ – Data types, Input/output statements, Flow of control – looping statements, branching
statements, Pointers & references, namespaces.
SECTION –D
Class design: constructors, destructors, operator overloading, reuse through inheritance, virtual
functions, exception handling. I/O with stream classes, memory management
The Standard Template Library (STL): containers, algorithms, iterators, adaptors, function
objects.
References:
1. Stephan G. Kochan, Programming in C, Addison–Wesley Professional, 2013.
2. Walter Savitch, Absolute C++, Fifth Edition, Addison Wesley, 2013
3. Ellis Horowitz, Satraj Sahni and Susan Anderson–Freed, Fundamentals of Data Structures
in C, W. H. Freeman and Company.
4. R. G. Dromey, How to Solve it by Computer, Prentice–Hall of India.
5. Cohoon and Davidson, C++ Program Design: An introduction to Programming and
Object–Oriented Design, 3rd Edition, Tata McGraw Hill.
6. Byron Gotterfied, Programming in C, Tata McGraw Hill Publishing Company Ltd., Delhi.
7. Yashvant Kanetkar, Let Us C, BPB Publications, Delhi.
8. R.S. Salaria, Applications Programming in C, Khanna Book Publishing Co. (P) Ltd., Delhi.
7
CSL 412: COMPUTER ORIENTED NUMERICAL & STASTISTICAL METHODS

Credits
L T P
Total Marks: 100
4 0 0

SECTION–A
Floating–Point Numbers: Floating–point representation, Rounding, Chopping, Error analysis.
Non–Linear Equations: Generalized Newton Raphson method,Secant method, Rate of convergence of
secant method, Muller’s method.
Linear Systems of equations: Gauss Elimination and LU– decomposition methods, solution of
tridiagonal system , Jacobi and Gauss–Seidel methods.
Central Difference Interpolation:Gauss forward, Gauss Backward, stirling Interpolation methods.
SECTION –B
Numerical Differentiation and Integration: Numerical differentiation using Interpolation method,
Boole’s Rule, Weddles’s rule of numerical integration, Romberg Integration.
Numerical Solution of Ordinary Differential Equations: Euler’s method,Runge–Kutta
method,Predictor–Corrector method.
Dispersion: Meaning, Characteristics for an ideal measure of dispersion. Measures of dispersion(Mean
deviation, Standard Deviation and variance.)
Principle of least Square: correlation and regression coefficients (two variables only)
SECTION –C
Analysis of Statistical Data: Frequency distribution; Frequency curve and histogram; Measure of
central tendency and dispersion
Random Variables and probability distributions: Basic concepts of probability and its
properties,Conditional probability and independent events; Random variable, Notion of sample space;
distribution functions; Mathematical expectation, Poisson, Rectangular, Exponential and Normal
distributions.
SECTION –D
Sampling distributions: Notion of random sample and sampling distributions; Parameter and statistics;
Standard error; Chi–square, t, F distributions; Basic ideas of testing of hypothesis; Testing of significance
based on normal, Chi–square, t and F distributions.
Recommended Books:
1. Hogg, Robert V, Elliot A Tanis and Rao, Jagan M., Probability and Statistical Inference, Pearson
Education (2009).
2. Meyer P. L., Introductory Probability and Statistical Applications, Oxford and IBH (2008).
3. Conte, S. D. and Boor, C. D., Elementary Numerical Analysis: An Algorithmic Approach, (Third
Edition), Tata McGraw Hill, New York (2006).
4. Jain, M. K., Iyengar, S.R.K. and Jain, R.K., Numerical Methods for Scientific and Engineering
Computation, New Age International Publishers (2008).
8
ECL491: PRINCIPALS OF DIGITAL ELECTRONICS

Credits
4 0 0

SECTION A
Semicondu ctors : Junction d iodes, Bipolarand FET transistors, MOSFET: D and E-type,
biasingtechniques,transistorasaswitch.
InformationRepresentation:Numbersy!>lems,charactercodes(BCD,ASCII,EBCDIC,GRAY
,EXCESS-3),Errordetectingandcorrectingcodes.
SECTION B
DigitalIC's:Logic gates,clocksandtimers.
BooleanAlgebra&CircuitDesign:BasiclawsofBooleanalgebra,K-
Maps:MinimizationTechniques,circuitdesignusingstandard(NAND)gates.
SECTION C
SequentialCircuits:Flip-Flops-SRFl ipFlop,JKFlipFlop,D-
FlipFlop,TFlipFlop,EdgeTriggeredFlipFlops,LevelTriggeredFliprtops,Registers-
SerialInSerialOut(SISO),SerialInParallelOut(SIPO),ParallelInSerialOut(PISO),ParallelInParallel
Out(PIPO),CountersSynchronousandAsynchronousCounters.
Combin ationalCircuits:Adder,decoderIde-multiplexer,encoderImultiplexerdesign.
SECTION D
LogicDesign:ITL,STIL,CMOSlogicfamilies.
DataConverters:AnalogtodigitalandDigitaltoanalogconversiontechniques,Microprocessorcompati
bleADCsandbasicinterfacingtechniques.
DigitalPeripherals:Keyboard,multiplexedsevensegmentd isplay,CRTdisplayschemes,Printers,Co
ntro linterfaces(parallelandserial)fortheperipheralunits.
9
References:
1. Integrated Electronics by Millman, Halkias, McGraw Hill, 2001.
2. Malvino: Digital Computer Electronics, McGrav, I!ill, 3rd Edition.
3. H.Taub & D. Schilling, Digital Integrated Electronics, McGraw Hill. l977.
4. D.A. Hodges & H.G. Jackson, Ana lysis & Design of Digital Integrated, 3rd Edition. 2005.
5. Circuits, International Student Ed., McGraw Hill, 1983.
6. Richard S.Sandige, Modern Digital Design, McGraw Hill, 1990.
7. JohnF.Wakerly, Digital Design: Principles and Practices, PHI 4th Edition, 2005.
8. Uijenbeck, John: Digital Electronics; A Modern Approach, Prentice Hall, 1994.
9. BignellJ.W.: Digital Electronics, 5th Edition, 2006.
10. Mano, M.Morris: Digital Logic and Computer Design, 2004.
10
MTL408: MATHEMATICAL ELEMENTS OF COMPUTER SCIENCE

Credits
L T P
Total Marks: 100
4 0 0

SECTION –A
Logic and Propositional Calculus: Proposition and Compound Propositions, basic Logical
Operations, Propositions and Truth Tables, Tautologies and Contradictions, Logical
Equivalence, Duality law, Algebra of propositions, Conditional and Biconditional Statements,
Arguments, Logical Implication, Propositional Functions, Predicates and Quantifiers, Negation
of Quantified Statements, Inference theory of the predicates calculus.
Algebraic Systems: Operations, Semigroups, Groups, Subgroups, Normal Subgroups and
Homomorphisms, Rings, Fields, Polynomials over a field.
SECTION –B
Graph Theory: Graphs and Multigraphs, Subgraphs, Isomorphic and Homeomorphic Graphs,
Walks, Paths and Cycles, Eulerian Graph, Hamiltonian Graph, Connectivity, Bridges of
Konigsberg, Traversable Multigraphs, Labeled and Weighted Graphs, Complete, regular and
Bipartite Graphs, Tree graphs, Planar Graphs, Regions, Euler’s Formula, Graph Colorings,
Chromatic Number, Welch–Powell Algorithm, Representing Graphs in Computer Memory.
SECTION –C
Recurrence Relations and Generating Functions: Polynomial expressions, recursion theorem,
closed form expression, generating function, solution of recurrence relation using generating
function.
Properties of the Integers: Order and Inequalities, Absolute Value, Mathematical Induction,
Division Algorithm, Greatest Common Divisor, Euclidean Algorithm, Fundamental Theorem of
Arithmetic, Congruence Relation, Congruence Equations.
SECTION –D
Boolean Algebra: Boolean algebra and its duality, Duality, Boolean Algebra as Lattices,
Boolean identities, sub–algebra, Representation Theorem, Sum–of–Products Form for Sets,
Sum–of–Products Form for Boolean Algebra, Minimal Boolean Expressions, Prime Implicants,
Logic Gates and Circuits, Boolean Functions, Karnaugh Maps.
11
Books Recommended:
1. Trambley, J.P. and Manohar,R: Discrete Mathematical Structures with Applications to
Computer Science, Tata McGraw–Hill Education (2001).
2. Liu C.L.: Elements of Discrete Mathematics, Mcgraw Hill (2008).
3. Alan Doerr and Kenneth Levasseur: Applied Discrete Structures Version 2.0, University of
Massachusetts Lowell (2013).
4. Narsingh Deo: Graph Theory with Applications to Engineering and Computer Science,
Prentice–Hall of India (2007).
5. Lipschutz, S. and Lipson, M.: Discrete Mathematics, Schaum’s outlines series (Revised
Third Edition), McGraw Hill Education (2010). 14
12
CSP410: PROGRAMMING LABORATORY–I

Credits
L T P
Practical Exercises on Programming in C/C++
Implementation of numerical & statistical methods using C/C++ language
File management using Linux/Unix/ Windows based operating system

13
CSP 411: COMMUNICATION SKILLS

Credits
L T P


UNIT–I
Theories of communication, Goals- Organizational and Personal, Psychology of communication,
Channels, Cost and Barriers to communication, Informal and Formal communication
UNIT–II
Listening and Speaking Skills, Familiarizing to different tones and accents, Oral communication
practice, Public speaking, Grammar and Vocabulary, Speech, Extempore
UNIT–III
Basics of Telephone Etiquette in Business communication, Practice of Interview skills and
Group Discussions
Students must carry out Group discussions and Mock interviews during the lab session.
Books Recommended:
1. Simon Sweeney, “English for Communication”, 2 nd Edition, CUP, 2003.

2. Leo Jones and Richard Alexander, “New International Business English”, CUP, 2000.
3. Essentials of Business Communication, Rajendra Pal. JS Korlahhi.
14
(Credit Based Evaluation and Grading System) (SEMESTER – II)
CSL420: DATA & FILE STRUCTURES

Credits
4 0 0

Eight questions of equal marks (Specified in the syllabus) are to be set, two in each of the four Sections
(A-D). Questions may be subdivided into parts (not exceeding four). Candidates are required to attempt
five questions, selecting at least one question from each Section. The fifth question may be attempted
from any Section.
SECTION–A
Preliminaries: Various data structures, common operations on data structures, algorithm complexity, big
O notation, time–space tradeoff between algorithms.
Arrays: Arrays defined, representing arrays in memory, various operations on linear arrays, Multi–
dimensional arrays, Records.
Linked Lists: Types of linked lists, representing linked lists in memory, advantage of using linked lists
over arrays, various operation on linked lists
SECTION–B
Stacks: Description of stack structure, implementation of stack using arrays and linked lists. Applications
of stacks – converting arithmetic expression from infix notation to polish and their subsequent evaluation,
quicksort technique to sort an array, parenthesis checker.
Queues: Description of queue structure, implementation of queue using arrays and linked lists,
description of priorities queues. Applications of queues – Operating system simulations
Trees: Description of tree structure and its terminology, binary search tree, implementing binary search
tree using linked lists, various operations on binary search trees, AVL Trees, Threaded Binary Trees, B–
Trees, B+ trees.
SECTION C
Greedy Method: Knapsack Problem, Prim's and Kuruskal's Algorithm to find MSTs.
Heaps: Description of heap structure, implementing heaps using arrays, various operations on heaps,
Applications of heaps – heapsort technique to sort an array, implementation of priority queues.
Graphs: Description of graph structure, implementing graphs in memory using adjacency matrix or
adjacency lists, various graphs traversing algorithms, finding shortest path between two nodes,
Dijkastra’s shortest path algorithm., finding biconnected component, strongly connected
component and finding cycles in the graphs.
15
SECTION D
Searching and Sorting: Sorting Types, External and Internal sort Linear Search, Binary search, Bubble
Sort, Selection Sort, Insertion Sort, Merge Sort, Shell Sort, Quick sort, Radix Sort. Hash Tables: Direct
address tables, hash tables, collision resolution by chaining, hash functions, open addressing – linear
probing, quadratic probing, double hashing.
Files: Operations on files, Types of files, File Organizations: Sequential files, Indexed Sequential file,
Directed files and multi–key files, File performance criteria and terms.
References:
1. Seymour Lipschutz: Theory and Problems of Data Structures, Schaum Outline Series, McGraw–
Hill Book Company. Third Edition
2. Jeffery Esakov: Data Structures – An Advanced Approach Using C, Tom Weiss, Prentice–Hall
International, Inc. 2007
3. Trembley and Sorenson: An Introduction to Data Structures with Application, Tata–McGraw Hill
Company, Delhi. 2003
4. Tanenbaum: Data Structures and C. Second Edition
16
CSL421: COMPUTER ORGANIZATION AND ARCHITECTURE

Credits
4 0 0

from any Section.
SECTION A
Basic computer Organisation and design: Register Transfer and Micro–operations: Register Transfer
Language, various Arithmetic, Logic & Shift micro–operations, instruction codes,
computer registers, timing & control, instruction cycle, design of a complete basic computer & it’s
working.
SECTION B
Programming & controlling the basic computer: Machine & Assembly Language, hardwired &
Micro–programmed control, Design of a control unit.
CPU Architecture: General register & stack organization, instruction formats and addressing modes,
ALU & Control unit architecture.
SECTION C
Memory Organisation: Memory hierarchy, main, auxiliary, cache memory, virtual memory, paging and
segmentation.
I/O Organization: Peripheral Devices, input–output interface, Modes of data transfer, programmed &
interrupt initiated I/O, DMA, I/O Processors.
SECTION D
Parallel & Multiprocessing Environment: Introduction to parallel processing, pipelining, RISC

Architecture, vector & array processing, Multiprocessing concepts, memory & resource sharing,
interprocessor communication & synchronisation.
References:
1. Morris Mano: Computer System Architecture, Pearson, 3rd Edition, 2007.
2. Hayes J.P.: Computer Architecture & Organisation, McGraw Hill, 3rd Edition, 2012.
3. Tanenbaum: Structured Computer Organisation, Pearson, 5th Edition, 2012.
4. Morris Mano: Computer System Architecture, PHI, 3rd Edition, 1993.
5. Stone: Introduction to Computer Architecture: Galgotia, 2nd Edition, 1990.
17
CSL423: COMPUTER BASED OPTIMIZATION TECHNIQUES

Credits
L T P
Total Marks: 100
4 0 0

from any Section.
SECTION A
Linear Programming: Mathematical formulation of linear programming problems, Canonical and
standard forms of linear programming problems, Solution by Graphical & Simplex method, Revised
simplex method, Two phase & Big–M method, Duality, Primal–Dual Relationship, Dual Simplex
method, Economic Interpretation of Optimal simplex Solution. Sensitivity Analysis: Changes in RHS
values, Objective Function Coefficients, Constraint Coefficients, Addition of a new constraint/variable.
(13 Lectures)
SECTION B
Special Types of LPP: Transportation and Assignment Problems, Optimality, Special cases in
Transportation and Assignment Problems, Game Theory: Two–person zero sum games, maximin–
minimax principle, games without saddle points (Mixed strategies), graphical solution of 2 x n and m x 2
games, dominance property, arithmetic method of n x n .
SECTION C
Integer & Dynamic Programming: Integer programming problem, Branch and Bound Techniques.
Characteristics, Deterministic DP Problems, Recursive Approach and Tabular method.
PERT / CPM: Project Planning, Scheduling, Activity cost
SECTION D
Evolutionary Techniques: Introduction to Evolutionary Computing & Genetic Algorithms, GA as a
search and optimization technique. Implementation of SGA using MATLAB/Scilab. Advanced
Computing Techniques: Introduction to Neural Networks, Fuzzy Systems and other Soft Computing
techniques. Introduction to Swarm Intelligence and Optimization.
Books Recommended:
1. Gass, S. L.: Linear Programming
2. Rao S.S.: Optimization Theory and Applications, Wiley Eastern.
3. Manmohan, Gupta P.K.: Operation Research, Sultan Chand & Co., New Delhi.
4. Swrup, Kanti: Operation Research, Sultan Chand & Co., New Delhi.
5. Hadley, G.: Linear Programming, Narosa, 1994.
6. Genetic Algorithms in Search Optimization and Machine Learning by David E. Goldberg,
Pearson Education, 2004.
7. Introduction to Neural Networks using MATLAB, S N Sivanandam S Sumathi S N Deepa Mc
GrawHill, 2015.
18
CSL424: DESIGN OF PROGRAMMING LANGUAGES
Credits
4 0 0

from any Section.
SECTION A
Study of Programming Languages: Brief History, Feature of a good language
Programming Language Processor: Translator and software simulator computer, syntax semantics and
virtual computers.
Specifications and Implementation of Elementary and Structured Data Types. Type equivalence,
checking and conversion.
SECTION B
Vectors and Arrays, Lists, Structures, Sets, Files.
Abstraction, encapsulation and information hiding subprograms, type definitions, abstract data types
Sequence control with Expressions, Conditional Statements, Loops, Exception handling. Subprogram
definition and activation, simple and recursive subprogram, subprogram environment.
SECTION C
Scope – Static and Dynamic, Block structures, Local Data and Shared Data, Parameters and Parameter
Transmission. Local and Common Environments, Tasks and Shared Data.
Static and Stack-Based Storage management. Fixed and Variable size heap storage management, Garbage
Collection.
SECTION D
Syntax and Translation: Syntactic elements of a language, stages in translation, formal definition of
syntax
Operating and Programming Environment: Batch processing, interactive, embedded,

programming environments
Text/References:
1. Programming languages: design and implementation, Terrence W. Pratt., Pearson
2. Programming languages: concepts and constructs, Ravi Sethi, ISBN 9780201590654.
3. Programming Language Pragmatics, Scott, ELSEVIER
19
CSL426: COMPUTER NETWORKS
Credits
4 0 0

from any Section.
SECTION A
Introduction to networks and its Components: Transmission media– Guided media Twisted pair
(Architecture of RJ–45 Connector), Co–axial cable (architecture of BNC), unguided media.
Analog and Digital Transmission and their conversions: composite signals and Fourier analysis.
Switching, ISDN services, Transmission in ATM networks.
SECTION B
Layered Architecture: OSI and TCP/IP reference models.
Data Link layer: Framing, Error detection and correction, Elementary data link and sliding
window protocols, Channel allocation in LAN and WAN, Multiple access protocols.
SECTION C
Design issues of network layer: Routing algorithms, Congestion control algorithms,
internetworking, Repeaters, Routers.
Services and elements of transport protocols
IEEE standards used in Computer networks.
SECTION D
Introduction to wireless networks: IEEE 802.11, Wireless sensor networks, Ad–hoc networks.
Wireless System Architecture: wireless system components, Network Architecture.
Types of wireless networks: WPAN, WLAN, WWAN, Cellular telephony. Network
Security and Privacy: Fundamentals of data Compression techniques and Cryptography.
Text/References:
1. Forouzon Behrouz: Data Communication & networking 5E, Tata McGraw Hill.
2. Jm Geier, Wireless Networks First Step, CISCO Press
3. William Satlllings, Wireless Communication & Networks, Pearson Education
20
CSP420: PROGRAMMING LABORATORY–II

Credits
L T P
 Implementation of Data and File Structures using C/C++
 Implementation of Computer Oriented Optimization Techniques
 Network Administration – User management, File & Resource Sharing

21
CSP421: PERSONALITY DEVELOPMENT

Credits
L T P
0 0 1
Slide Preparation and oral presentation principles
Written Presentation of technical material
Preparation of Bibliography
Basics of Official Correspondence
Preparation of Bio-data/CV
Students should be asked to prepare and present seminars and presentations on their core
subjects of second semester.
Books Recommended:
1. The Chicago Manual of Style, 13th Edition, Prentice Hall of India 1989.
2. Gowers Earnest, “The Complete Plan in Words”, Penguin, 1973.
3. Menzel D.H., Jones H.M., Boyd, L.G., “Writing a Technical Paper”, McGraw
Hill, 1961.
4. Stunk, W., White E.B., “The Elements of Style”, 3 rd Edition, McMillan, 1979.
22
(Credit Based Evaluation and Grading System) (SEMESTER –III)
CSL511: THEORY OF COMPUTATION

Credits
4 0 0

SECTION A
Non Deterministic Finite Automata, Deterministic Finite Automata,  – moves,
regular expressions, crossing sequence. Moore and Mealy machines.
SECTION B
Pumping lemma for regular sets, Minimisation algorithm, Context free grammar,
derivation Trees, Chomesky & Greibach normal forms.
SECTION C
Pushdown automata, pumping lemma for CFL’s, Ogden’s lemma, Turing machines.
Undecidability,
SECTION D
Recursive and recursively enumerable languages, Rice theorem, Post’s correspondence problem.
References:
1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, ‘Introduction to Automata, Languages and
Computations’, Addison Wesley, 1980.
2. H.R. Lewis and C.H. Papdimitrou, ‘ Elements of the Theory of Computation’, Prentice
Hall Inc., 1981.
3. V.J. Rayward Smith, ‘A First Course on Computability’, Blackwell Scientific
Publications, Oxford, 1986.
4. M.Davis and E.J. Weyuker ‘Computability, Complexity and Languages’ Academic Press,
1982.
5. D. Gries, ‘Science of Programming’, Springer Verlag, New York, 1981.
6. Dewire, Dawna Tranis : Client Server Computing, McGraw Hill, 1994.
23
CSL512: MICROPROCESSOR AND ITS APPLICATIONS

Credits
4 0 0
SECTION A
Introduction: Introduction to Microprocessor, Microcontroller and Microcomputer, different
types of microprocessors - Intel, AMD, Motorola, and their suitability to different types of
applications. Evolution of the microprocessor product line.
Architecture of a Microcomputer: General Architecture of a microcomputer system.
Microprocessor unit, input unit, output unit, memory unit and auxiliary storage unit.
SECTION B
Architecture of 8086/ 8088 Microprocessor: Description of various pins, configuring the
8086/8088 microprocessor for minimum and maximum mode systems description of maximum
system mode interfaces, internal architecture of the 8086 / 8088 microprocessor, system clock,
Bus cycle, instruction execution sequence.
Memory Interface of the 8086 / 8088 microprocessor: Address space and Date organization,
generating memory addresses, hardware organization of the memory address space, memory bus
status codes, memory control signals, read/write bus cycles, the role of stack in intrrupts and
subroutine cells; demultiplexing the address data bus, program and data storage memory,
dynamic RAM system.
SECTION C
Input /Output Interface of the 8086 / 8088 microprocessor: I/O Interface, I/O address space
and data transfers, I/O instructions, I/O bus cycles, Output ports, 8255A Programmable
Peripherals Interface (PPI), memory– mapped, I/O, serial communication interface (USART and
UART) – the RS–232 C interface, 8251A programmable communication interface, special
purpose interface controllers.
Interrupt Interface of 8086/8088 microprocessor: What is interrupt? Types of interrupt,
Interrupt Vector Table (IVT)
SECTION D
8086/8088 assembly language programming: General structure of an assembly language
program, steps in the development of an assembly language program, Assembly language V/S
machine language, addressing modes, Instruction set: data movement instructions, arithmetic
instructions, logical instructions, shift and rotate instructions, jumping and looping instructions,
string processing, interrupt instructions, stack operations, subroutines, handling instructions,
defining and using macros.
Programming exercises must be designed to show how the input/output is performed. How
decisions are made and how loops can be set in an assembly language program.
24
References:
1. Walter Triebel: The 8086 Microprocessor – Architecture, Software and Interfacing
Techniques, PHI, Delhi.
2. Walter Triebel: The 8088 Microprocessor – Architecture, Software and
Interfacing Techniques, PHI, Delhi.
3. Douglas V. Hall: Microprocessors and Interfacing – Programming and Hardware, Tata
McGraw Hill Publishing Company Ltd., New Delhi.
4. Peter Abel: IBM PC Assembly Language and Programming, PHI, Delhi.
25
CSL516: DATA BASE MANAGEMENT SYSTEMS

Credits
4 0 0

SECTION A
Basic Concepts: An overview of Database Management System, Architecture for a database

system, Introduction to Relational, Network and Hierarchical database systems.
ER Model: Overview, ER diagrams, Database design using ER model.
The Relational Model: Relational Data Objects: Domains and relations, Integrity Constraints,
Relational Algebra, Relational Calculus and SQL Language.
SECTION B
Working knowledge of DDL, DML and DCL based statements for generating queries is to be
provided.
Relational Database Design: Concepts of functional dependencies, multivalued dependencies,
1NF, 2NF, 3NF, BCNF, Higher Normal Forms.
SECTION C
Advanced Concepts in Relational Databases: Recovery, Concurrency, Security, Integrity,

Query Optimization.
SECTION D
Introduction to Big Data: Structured and Unstructured data, Data Analytics, Big data
management and Big data analytics
Techniques of Data Management: Storage and Analysis of data, Extraction of relevant
information
Applications of Big Data: Distributed databases, Hadoop, NoSQL, NewSQL,
Dimensionality reduction, processing unstructured data
26
Reference:
1. C.J. Date, “An Introduction of Database System”, The Systems Programming Series,
6/Ed, Addison–Wesley Publishing Company, Inc., 1995.
2. Silberscatz, Korth and Sudarshan, “Database System Concepts”, Third Ed., McGraw Hill
International Editions, Computer Science Series–1997.
3. Parteek Bhatia and Gurvinder Singh, “Simplified Approach to DBMS”, Kalyani
Publishers.
4. Desai, Bipin C, “An Introduction to Database Systems”, West Publishing Company,
St.Paul, Minnesota, USA–1993.
5. Michael Minelli, Michele Chambers, AmbigaDhiraj, “Big Data. Big Analytics”, John
Wiley, 2013.
6. Chris Eaton, Dirk Deroos, Tom Deutsch, George Lapis, Paul Zikopoulos,
“Understanding Big Data: Analytics for Enterprise Class Hadoop and Streaming
Data”, Tata McGraw Hill
Education, 2012.
27
CSL517: OPERATING SYSTEM

Credits
4 0 0

SECTION A
Basic Concepts: History & Evolution of Operating System, OS as resource manager, Various
views of OS, System calls, interrupt Mechanism.
Process Management: States of Processes, process scheduling algorithms, race condition,
Critical section Problem, Context Switching, Semaphores, Monitors. Deadlock conditions,
deadlock prevention, avoidance ,detection and recovery.
SECTION B
Memory Management: Basic Memory management Schemes, Partition memory management,
demand paged memory management, segmented memory management, swapping, hierarchy of
memory, Virtual Memory, Working Set Model.
Device Management: Dedicated devices, shared devices, virtual devices, channels, I/O traffic
controller, I/O scheduler, I/O device handlers, Storage devices, buffering, disk scheduling
algorithms.
SECTION C
Information Management: File Attributes, File Organization in directories, Simple file system,
Symbolic file system, logical file systems, physical file systems, security of file systems,
Sequential, Indexed and indexed sequential allocations.
Distributed Systems: Definition, Characteristics, Goals and application of Distributed Systems,
Basic Design issues and User Requirements
SECTION D
Distributed OS: Introduction, The Kernel, Process and Threads, Communication.
Case Studies: Windows NT, Unix / Linux
References:
1. Madnick and Donovan: Operating System, McGraw Hill, 1973.
2. P.B. Henson: Operating System Principles, Prentice Hall, 1973.
3. J.L. Peterson, A. Silberchatz: Operating System Concepts, Addison Wesley, 1983.
4. George Coulouris, Jean Dollimore, Tim Kindberg : Distributed Systems : Concepts
and Design 2nd edition, Addison-Wesley Publishing Company.
5. A.S. Tenenbaum: Operating System: Design and Implementation PHI, 1989.
28
CSP510: PROGRAMMING LABORATORY – III

Credits
L T P
Hands on practice of SQL statements with different clauses available using Oracle 8i or higher
version
Implementation of OO Concepts using C++

29
CSL518: Software Testing (Elective)

Credits
L T P
Total Marks: 100
4 0 0

SECTION A
Introduction Software Testing – software quality, Why software testing, Evolution of software
testing. Psychology of testing, Economics of testing, principles of software testing.
Testing taxonomy - bug, types of bugs, cost of bugs, severity of bugs, reasons of occurrence of
bugs.
Levels of Testing – unit to system testing.
SECTION B
Types of testing - volume testing, stress testing, usability testing, performance testing, security
testing, storage testing, compatibility testing, configuration testing, reliability testing, recovery
testing, acceptance testing.
Testing strategies and techniques – structural versus functional testing, automated versus manual
testing, static versus dynamic testing.
SECTION C
Debugging – debugging by brute force, by induction by deduction, by backtracking, by testing;
debugging principles – for locating errors, repairing errors.
Testing Internet Applications – types of application architectures – e.g. client/server; strategies
for testing; testing tools; testing event driven systems; testing graphical user Interfaces. Working
experience of any one tool.
SECTION D
Software security testing – software vulnerabilities fundamentals; security policy; enforcing
security policy; threat modelling;
Security testing of standalone and web applications
Basic security testing with Kali Linux.
Recommended Readings:
 Introduction to Software Testing by Paul Ammann and Jeff Offutt. published in Feb 2008 by
Cambridge
 Foundations of Software Testing by Aditya P. Mathur. published in Oct 2007 by Pearson
Education
 The Art ofSoftware Testing, Glenford J. Myers, Revised and Updated by Tom Badgett and
Todd M. Thomas with Corey Sandler, John Wiley & Sons, Inc., Second Edition.
 The Art of Software Security Assessment: Identifying and Preventing Software
Vulnerabilities by MarkDowd, JohnMcDonald, JustinSchuh. Publisher: Addison Wesley
Professional, 2006
30
CSL519: OBJECT ORIENTED PROGRAMMING USING JAVA (Elective)
Credits
4 0 0

SECTION A
Evolution of Java, Importance of JAVA to Internet, Features of JAVA, Bytecode, Object
Oriented Approach. Various Data Types and Operators, Type Conversion and Casting, One
Dimensional and Multidimensional arrays, Selection Statements, Iterative Statements, Jumping
statements. Class Fundamentals, Declaring objects, Introducing Methods, Constructors, this
keyword, Overloading constructors and Methods, Recursion, Nested and Inner classes.
SECTION B
Inheritance basics, Creating Multilevel hierarchy, Method Overriding and Abstract Classes.
Packages and Interfaces, Access Protection, Importing Packages, Interfaces, Defining,
Implementing, Applying Interfaces, Extending Interfaces. Exception Handling Fundamentals,
Exception Types, uncaught exceptions, try and catch, Creating own Exceptions.
SECTION C
Multithreaded Programming The Java Thread Model, Thread Priorities, Synchronization,
Interthread communication, Suspending, Resuming and Stopping Threads. Java I/O Basics,
Streams, reading Console input and writing console output, PrintWriter class, Reading & writing
Files, Byte Streams, Character Streams & Serialization.
SECTION D
Applet basics, Applet Architecture, Applet: Display, Repaint, Parameter Passing. Event
Handling: The Delegation Event Model, Event Classes, Event Listener Interfaces, AWT Window
Fundamentals, Working with Frame Windows, Graphics, Color and Fonts.
References:
1. Herbert Schildt: The Complete Reference Java 8, 9th edition, Oracle Press, 2014.
2. Balagurusamy: Programming in JAVA, Tata McGraw Hill, 2004.
3. Java2 Black Book Steven Holzner OT Dreamtech Press, www.idgbooksindia.com, 2007.
4. The Java Tutorial Continued by Compione, Walrath, Huml SUN JAVA Tutorial
Team, Addison Wessley, 2007.
31
(Credit Based Evaluation and Grading System) (SEMESTER –IV)
CSL525: INFORMATION SYSTEMS

Credits
4 0 0


SECTION A
An Introduction to Information System: Information Concepts, System Concepts, Business

Information Systems, Information Systems in society, business and Industry, Ethical and Social
issues, Global Challenges in Information Systems
Information Systems in Organizations: organizations and Information systems, competitive

Advantage, careers in Information System
SECTION B
Management Information System: Fundamental types of Management, Information Systems,

Management Decision, Pitfalls in MIS Development Making Process
Building and Maintaining Information Systems, Information System Security and Control
Decision Support Systems (DSS): Conceptual Foundations of DSS, Concepts of DSS, DSS
Software, Strategies for DSS, Group Support Systems, Executive Support System (ESS)
SECTION C
Knowledge Management systems: Fundamentals of Knowledge Based Decision Support;
Artificial Intelligence and Expert systems, Expert System & its integration with DSS.
Other Information Systems like Supply chain management, Customer Relationship Management
(CRM), Electronic Commerce and Mobile Commerce
SECTION D
Distributed Information System (DIS): Distributed processing systems, Advantages and

disadvantages, Historical context of DIS.
The Internet and Internet Applications as a Distributed Information System
Security, data integrity and availability of DIS, Network management issues
32
References:
1. Principles of Information Systems: A Managerial Approach, Ralph Stair and George

Reynolds, Cenage Learning, 2008
2. Management Information Systems, Laudon C. Kenneth & Laudon P. Janes, Pearson
Education, 2002.
3. Decision Support Systems & Intelligent Systems Turban Ejraini & Aronson E. Jay, Pearson
Education, 2001.
4. Information Systems for Modern Management, Mudrick R.G., Ross, J.E. & Glegge, J.R.,3rd
Edition, Prentice Hall of India, 1987.
5. Information Systems, Alter Steven, 3rd Edition, Pearson Education, 2000.
6. Distributed Systems: Concepts and Design. Jean Dollimore George Coulouris and Tim
Kindberg. Addison Wesley, 5th edition, May 2011.
7. Distributed Systems: Principles and Paradigms. Andrew S. Tanenbaum and Maarten Van
Steen. Prentice Hall, 2nd edition, October 2006
33
CSL529: EVOLUTIONARY AND INTELLIGENT COMPUTING THEORIES AND

APPLICATIONS
Credits
4 0 0

SECTION A
Introduction to AI
AI concept, Importance of AI, Evolution of AI, Applications of AI.
Knowledge
Introduction and Importance of Knowledge, Knowledge based systems, Knowledge
Representation, First Order Predicate Logic (FOPL), Syntax and Semantics of FOPL,
Knowledge Organization and Manipulation.
SECTION B
Un–supervised Learning: Kohonen Self Organization Feature maps and Adaptive Resonance
Theory. Introduction to Fuzzy Logic and Fuzzy Sets, Fuzzy Relations, Fuzzyfication,
Defuzzyfication. Introduction to Hybrid soft Computing. Applications of Advance Computing in
Pattern Recognition, Signal Processing & Image Retrieval.
SECTION C
Introduction to Evolutionary Computing & Genetic Algorithms. Introductionto Genetic
Algorithms, Goals of Optimization, How Genetic Algorithms work, A Simple Genetic
Algorithm’s Computer Implementation highlighting Reproduction by Selection, Crossover,
Mutation.
SECTION D
Advanced GA Techniques Mapping Objective Function to Fitness Form, Fitness scaling,
discretization, Different types of Selection and Crossover techniques. A case study of Travelling
Salesman Problem using GA Techniques. Introduction to other Evolutionary Techniques: PSO,
Simulated Annealing and Ant Colony Optimization.
References:
1. David E. Goldberg, Genetic Algorithms in Search Optimization and Machine
Learning, Pearson Education.
2. S. N. Sivanandam, S. N. Deepa, Principles of Soft Computing, Wiley Publications.
3. How to Solve It: Modern Heuristics, by Zbigniew Michalewicz, David B.Fogel,
second Edition Springer Verilag-2004, ISBN- 3-540-22494-7.
4. Gallant Stephen I, Neural Network Learning & Extent Systems, MIT Press, 1993.
5. Aleksander & Morton, Neural Computing, Chapman & Hall, 1991.
6. Kosko, Neural Networks & Fuzzy Systems, PHI, 1991
7. Dan W. Patterson, ‘Introduction to Artificial Intelligence and Expert Systems’, Prentice-
Hall India Private Limited, 2006.
34
CSL530: WEB TECHNOLOGIES

Credits
L T P
4 0 0
Total Marks: 100


SECTION A
Web Essentials, Markup languages, CSS
Basics of Client side programming, Java script language, java script objects, host objects,
Browsers and DOM
SECTION B
Basics of Server side programming, Java servlets- Life cycle, Servlet API, Reading Servlet
parameters, Handling HTTP requests and responses, Cookies and Session Tracking ASP/JSP,
Basics of ASP/JSP objects, simple ASP and JSP pages
SECTION C
Representing Web data, Data base connectivity, JDBC, Dynamic web pages, XML, DTD, XML
schema, DOM, SAX, XQuery, Building web applications, cookies, sessions, open source
environment
Introduction to PHP, basics, PHP File handling, file upload, cookies, error handling, PHP
MySQL introduction
SECTION D
Middleware technologies, Ecommerce architecture and technologies, Ajax, Advanced web
technologies and tools
Case Studies: PHP and MySQL case studies.
References:
1. Jeffery C Jackson, “Web Technology-A Computer Science Perspective”, Pearson
Education, 2007.
2. Chris Bates, “Web Programming- Building Internet Applications”, Wiley India, 2006.
3. Achyut S Godbole and Atul Kahate, “Web Technologies”, Tata McGraw Hill.
35
(Credit Based Evaluation and Grading System) (SEMESTER –IV) (Electives-I)
CSL526: COMPUTER GRAPHICS

Credits
L T P
Total Marks: 100
4 0 0


Eight questions of equal marks (Specified in the syllabus) are to be set, two in each of the four Sections (A-D).
Questions may be subdivided into parts (not exceeding four). Candidates are required to attempt five questions,
selecting at least one question from each Section. The fifth question may be attempted from any Section.
SECTION A
Elements of Computer Graphics: Introduction to computer graphics; graphics display devices; interactive
control devices; output devices; display processors.
2D Graphics
Elementary Drawing Algorithms: Line drawing using direct method, simple DDA, integer DDA,
incremental method, and Bresenham’s algorithm; Circle drawing using incremental method and Bresenham’s
algorithm, drawing arcs, sectors, etc. Flood Fill Algorithms, Boundary
Fill Algorithms
Geometric Transformations: Translation, rotation, scaling, reflection and shear; concept of homogenous
coordinates, Building composite transformations.
SECTION B
Viewing Transformations: Concept of windows & viewport, window–to–viewport mapping, clipping

operations – point clipping, line clipping algorithms (Cohen – Sutherland, mid–point subdivision, Cyrus –
Beck), Sutherland – Hodgman polygon clipping algorithm.
3D Graphics
Drawing 3D Shapes: Coordinate systems, representation of 3D shapes, designing curves and surfaces
(Hermite, Bezier, and B–Spline).
Geometric Transformations: Translation, rotation, scaling and reflection.
SECTION C
Projective Transformations: Parallel projections – orthographic, axonometric (isometric, diametric and
trimetric), oblique projectios; and perspective projections (one, two and three vanishing points).
Viewing Transformations: Viewing a 3D object, 3D clipping (extension of specified 2D algorithms to handle
3D objects).
36
SECTION D
Hidden line/surface Removal: Back face removal, z–buffer algorithm, Painters (depth sort) algorithm,
subdivision algorithms – Warnock’s algorithm, scan line algorithms – scan line z–
buffer algorithm.
Rendering: Introduction, a simple illumination model, shading – Gouraud shading & Phong shading, ray
tracing, shadows, textures.
References:
1. David F. Rogers: Procedural Elements for Computer Graphics, McGraw Hill Book Company.
2. Adams & David F. Rogers: Mathematical Elements of Computer Graphics, McGraw Hill Book
Company.
3. Roy A. Plastock, Gordon Kalley: Computer Graphics, McGraw Hill Book Company.
4. Donald Hearn & M. Pauline Baker: Computer Graphics, Prentice Hall of India Private Limited.
37
CSL528: DIGITAL IMAGE PROCESSING

Credits
L T P
Total Marks: 100
4 0 0

Eight questions of equal marks (Specified in the syllabus) are to be set, two in each of the four Sections (A-D).
Questions may be subdivided into parts (not exceeding four). Candidates are required to attempt five questions,
selecting at least one question from each Section. The fifth question may be attempted from any Section.
SECTION A
Fundamentals: Introduction to Digital Image Processing, Fundamental steps in Digital Image Processing,
Components of Image Processing System, Applications of Digital Image Processing, Image Sensing and
Acquisition, Image Sampling and Quantization, Relationships between Pixels, Distance Measure between
Pixels.
Image Enhancement and Restoration: Spatial Domain Filtering Techniques, Smoothing spatial filters,
Sharpening spatial filters, Histogram Processing, Introduction to Fourier Transformation, low pass filters, high
pass filters, Image Restoration: A model of the Image Degradation/ Restoration Process, Noise models,
Denoising Techniques.
SECTION B
Color Image Processing: Color Models, Conversions between Color Models, Pseudo Color Image
Processing, Color Transformation, Color Complements, Color Slicing, Color Image Smoothing and
Sharpening, Noise in color Images.
Wavelets and Multi-Resolution Processing: Wavelet functions, Wavelet transformations in one and two
dimensions, fast wavelet transform.
SECTION C
Image Compression: Image Compression Models, Data Redundancies, Lossy Compression Techniques,
Lossless Compression Techniques, Image Compression standards.
Image segmentation: Pont, Line and Edge Detection, Edge linking and boundary detection, Thresholding,
region based segmentation.
38
SECTION D
Representation and Description: Image Representation, Boundary and Regional Descriptors, Relational
Descriptors.
Object Recognition: Pattern and pattern classes, recognition based on Decision Theoretic Methods, Structural
Methods.
References:
1. Rafael C. Gonzalez & Richard E. Woods, “Digital Image Processing”, 2nd Edition.
2. A.K. Jain, “Fundamental of Digital Image Processing”, PHI

39
CSP520: PROGRAMMING LABORATORY – IV
Credits
Total Marks: 100
L T P
0 0 2
Development of Websites, JAVA 2.0 / Front Page 2000 / HTML 4.0, ASP.
Implementation of Computer Graphics using C/C++

40
(Credit Based Continuous Evaluation Grading System) (SEMESTER – V)
CSL611: System Software

Credits
L T P
4 0 0
Total Marks: 100
Note for Paper Setter:

There will be eight questions of equal marks, two in each of the four sections (Section A to D),
corresponding to the distribution of the syllabus. The paper setters are requested to make sub-section (not
exceeding 4) of the questions and allocate appropriate marks to each sub section.
Note for Candidate:

Attempt five questions in all by selecting one question from each section and the fifth question may be
attempted from any sections.
Unit I
Introduction to System Software, Evolution of System software, Components of System software,
Translators, Loaders, Interpreters, Assembler and Compiler
Overview of Assembly Process
Unit II
Design of One pass and Two pass Assembler
Macro definition and expansion, Concatenation of macro parameters, Generation of unique labels,
Conditional macro expansion, Recursive macro expansion
Unit III
Phases of compilation process, Lexical analysis, parsing, Storage management optimisation
Incremental compilers, Cross compilers, P code compilers
Unit IV
Basic loader functions. Relocation, program linking, linkage,editors, dynamic linking bootstrap loaders
Other system software:Operating system, DBMS, text editors, Interactive debugging systems
References:
1. Leland L. Beck: System Software, An introduction to system programming, Addison Wesley.
2. D.M. Dhamdhere: Introduction to System Software, Tata McGraw Hill.
3. D.M. Dhamdhere: System Software and Operating System, Tata McGraw Hill, 1992.
4. Madrich, Stuarte: Operating Systems, McGraw Hill, 1974.
5. Stern Nancy Assembler Language Programming for IBM and IBM compatible computers, John
Wiley, 1991.
41
CSL612: Software Engineering

Credits
L T P
4 0 0
Total Marks: 100

Note for Candidate:
Unit I
Introduction: Introduction to Software Engineering, Software Components, Software Characteristics,
Software Crisis, Software Engineering Processes, Similarity and Differences from Conventional Engineering
Processes, Software Quality Attributes. Software Development Life Cycle (SDLC) Models: Waterfall
Model, Prototype Model, Spiral Model, Evolutionary Development Models, Iterative Enhancement Models.
Estimation of various parameters such as Cost, Effort, Schedule/Duration, Constructive Cost Models
(COCOMO), Resource Allocation Models, Software Risk Analysis, and Management
Software Requirement Specifications (SRS) Requirement Engineering Process: Elicitation, Analysis,
Documentation, Review and Management of User Needs, Feasibility Study
Unit II
Information Modeling, Data Flow Diagrams, Entity Relationship Diagrams, Decision Tables, SRS
Document, IEEE Standards for SRS. Software Quality Assurance (SQA): Verification and Validation, SQA
Plans, Software Quality Frameworks, ISO 9000 Models, SEI–CMM Model
Basic Concept of Software Design, Architectural Design, Low Level Design: Modularization, Design
Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion Measures, Design Strategies: Function
Oriented Design, Object Oriented Design, Top–Down and Bottom–Up Design. Software Measurement and
Metrics: Various Size Oriented Measures: Halestead’s Software Science, Function Point (FP) Based
Measures, Cyclomatic Complexity Measures: Control Flow Graphs
Unit III
Software Testing: Testing Objectives, Unit Testing, Integration Testing, Acceptance Testing, Regression
Testing, Testing for Functionality and Testing for Performance, Top–Down and Bottom–Up Testing
Strategies: Test Drivers and Test Stubs, Structural Testing (White Box Testing), Functional Testing (Black
Box Testing), Test Data Suit Preparation, Alpha and Beta Testing of Products. Static Testing Strategies:
Formal Technical Reviews (Peer Reviews), Walk Through, Code Inspection, Compliance with Design and
Coding Standards.
42
Unit IV
Software Maintenance and Software Project Management: Software as an Evolutionary Entity, Need for
Maintenance, Categories of Maintenance: Preventive, Corrective and Perfective Maintenance, Cost of
Maintenance, Software Re– Engineering, Reverse Engineering. Software Configuration Management
Activities, Change Control Process, Software Version Control, Working knowledge of distributed version
control system Git.
References:
1. R. S. Pressman, Software Engineering: A Practitioners Approach, McGraw Hill.
2. Rajib Mall, Fundamentals of Software Engineering, PHI Publication.
3. K. K. Aggarwal and Yogesh Singh, Software Engineering, New Age International
Publishers.
4. Pankaj Jalote, Software Engineering, Wiley
5. Carlo Ghezzi, M. Jarayeri, D. Manodrioli, Fundamentals of Software Engineering, PHI
Publication.
6. Ian Sommerville, Software Engineering, Addison Wesley.
7. KassemSaleh,”Software Engineering”, Cengage Learning.
8. Pfleeger, Software Engineering, Macmillan Publication
43
CSP610: Programming Laboratory - V

Credits
L T P
0 0 2
Total Marks: 100
Practical Exercises on System Programming concepts and Assembly Language.
Working knowledge of distributed version control system Git.

44
CSL614: Artificial Neural Networks (Elective)

Credits
L T P
4 0 0
Total Marks: 100
Note for Candidate:
Unit I
Basics of Neural Networks: Connectionist Models and their structures, Multilayer Perception &Back
Propagation Networks, Gradient Descent.
Some Representation Issues: Representing Boolean function, Distributed Representation, Representing
Real – valued Functions.
Unit II
Single Layer Models: Perception learning and pocket Algorithm.
Autoassociators and one–shot learning: Linear Autoassociators and the interproduct TrainingRule
Hopfield Model, Associative Memories.
Unit III
Mean Squared Errors (MSE) Algorithms: MSE Approximation, TheWidrow–Hoff Rule,ADALINE
Un–supervised Learning: K–Means Clustering, Topology–Preserving maps, AdaptiveResonance Theory
Unit IV
Back Propagation: Algorithms, Derivation, Practical Considerations
Introduction to Some Applications: NETTALK, Handwritten Character Recognition,Travelling Salesman
Problem.
References:
1. Gallant Stephen I : Neural Network Learning & Extent Systems, MIT Press, 1993.
2. Aleksander&Morton : Neural Computing, Chapman & Hall, 1991.
3. Kosko : Neural Networks & Fuzzy Systems, PHI, 1991.
4. Hertz John, Krough Anders, G. Palmer : Introduction to the theory of Neural Computation, Addison–
Wesley, 1991.
5. Muller B. Reinhardt J., : Neural Networks An Introduction” , Springer Verlag, 1991.
6. Aleksander Igor, : An Introduction to Neural Computing, Chapman and Hall, 1992.
7. Caudill Maureen, Understanding Neural Networks : Computer Explorations, MIT Press, 1993.
8. FausettLaurene : Fundamentals of Neural Networks.

45
CSL616: FUNDAMENTALS OF CLOUD COMPUTING (Elective-I)

Credits
4 0 0
Note for Candidate:
UNIT–I
Introduction: Definition, Vision, Reference Model, Benefits, Limitations, Terminology, OpenChallenges.
Virtualization: Definition, Type of Virtualization, Benefits, Limitations, Virtualization andCloud, Virtual
Appliance.
UNIT–II
Cloud Computing Architecture: Service Models, Deployment Models, Cloud Entities, CloudClients,
Service Level Agreement (SLA) and Quality of Service (QoS) in Cloud Computing.
UNIT–III
Programming Models in Cloud:Thread Programming, Task Programming and Map–ReduceProgramming.
Cloud Security: Infrastructure Security, Data Security, Identity and Access Management,Privacy
Management, Security as a Service on Cloud.
UNIT–IV
Advance Topics in Cloud: Energy Efficiency in cloud, Market Oriented Cloud Computing, Big–Data
Analytics, Federated Cloud Computing.
Textbooks:
1. RajkumarBuyya, Christian Vecchiola and ThamaraiSelvi, Mastering Cloud Computing: Foundation and
Application Programming, Tata McGraw Hill, ISBN–13: 978–1–25– 902995–0, New Delhi, India, Feb
2013.
2. Tim Mather, Subra Kumaraswamy, Shahed Latif, Cloud Security and Privacy, O'Reilly, ISBN–13: 978–
8–18–404815–5.
Reference Books:
1. Barrie Sosinsky, Cloud Computing Bible, Wiley India Pvt. Ltd., ISBN–13: 978–8–12– 652980–3, New
Delhi, India, 2011.
2. Dr. Saurabh Kumar, Cloud Computing: Insights Into New–Era Infrastructure, Wiley India
3. Pvt. Ltd, ISBN–13: 978–8–12–652883–7, New Delhi, India, 2011.
4. Fern Halper, Hurwitz, Robin Bloor, Marcia Kaufman, Cloud Computing for Dummies, Wiley India Pvt.
Ltd, ISBN–13: 978–0–47–059742–2, New Delhi, India, 2011.
46
CSL632: DISTRIBUTED SYSTEMS (Elective-I)

Credits
L T P
Total Marks: 100
4 0 0
Note for Candidate:
Goals:
 To understand how large-scale computational systems are built
 To study the key design principles of distributed systems to understand the challenges of large
systems.
 To realize the importance of coordination in distributed systems.
 To learn to create secure and reliable systems

Pre-requisites: Operating System, Computer System Architecture, Computer Networks
Unit – I
Distributed Systems – Basic characteristics, benefits over centralized systems, challenges, Design Issues,
fallacies; System Models – physical, architectural, and fundamental, client-server and peer to peer systems;
Unit – II
Role of middleware; communication - message passing and distributed shared memory
Inter process communication – direct, multicast, indirect, RPC, RMI, IPC in UNIX.
Unit – III
Operating System support; Time and Global states; Coordination and agreement; Distributed transactions
and concurrency control; Replication.
Security challenges – perimeter defence, authentication schemes, and access control technologies.
47
Unit – IV
Reliable distributed computing – why do systems fail, how to overcome failures.
Computing in the clouds.Google as a case study.
Prescribed Text: Distributed Systems, Concepts and Design, by Coulouris, Dollimore, and Kindberg, 5th
ed., 2012.
1. Andrew S. Tanenbaum, Distributed Operating Systems, ACM Press.
2. Jie Wu, Distributed Systems, CRC Press.
3. HagitAttiya, Jennifer Welch, Distributed Computing: Fundamentals, Simulations and Advanced

Topics, McGraw-Hill.
4. Kai Hwang, Geoffrey Fox, Jack Dongarra, Distributed Computing and Cloud Computing
– from parallel processing to Internet of Things, Morgan Kaufmann, Elsevier, 2012.
5. Kenneth P. Birman, Guide to Reliable Distributed Systems, Springer, 2012.

6. MukeshSinghal and NiranjanShivaratri, Advanced Concepts in Operating Systems, McGraw-Hill.
48
CSL633: SYSTEM SIMULATION (Elective-I)

Credits
L T P
Total Marks: 100
4 0 0
Note for Candidate:
Unit – I
Introduction: Concept of a system, stochastic activities, continue and discrete system, systemmodeling,
mathematical modeling, principle used in modeling.
Simulation of Systems: Concepts of simulation of continuous systems with the help of twoexamples; use of
integration formulas; concepts of discrete system simulation with the help of two examples, Generation of
random numbers, Generation of non–uniformly distributed numbers.
Unit – II
Simulation of Queuing Systems: Rudiments of queuing theory, Simulation of Single–Serverqueue, two–
server queue, general queues.
Simulation in Inventory Control and Forecasting: Elements of inventory theory, inventorymodels
Unit – III
Generation of Poisson and Erlangvariats, forecasting and regression analysis

Design and Evaluation of Simulation Experiments: Experimental layout and validation.
Unit – IV
Simulation Languages: Continuous and discrete simulation languages, Block–Structuredcontinuous
simulation languages, expression based languages, discrete system simulation languages, simscript, GPSS,
SIMULA, Simpack, GASP IV, CSIM, factors in selection of a discrete system simulation languages.
Case Studies: Analytic Vs Simulation Models, Applications to Operating Systems, Databases,Computer
Networks Architectures
1. NarsinghDeo, “System Simulation with Digital Computer”, Prentice–Hall of India Pvt. Ltd. – 1993.
2. Gordon, “System Simulation”, Prentice Hall of India Pvt. Ltd. – 1993
49
CSL637: Introduction to Machine Learning (Elective-I)

Credits
L T P
4 0 0
Total Marks: 100

Note for Candidate:
Unit I
Introduction, linear classification, Perceptron update rule Perceptron convergence, generalization, Maximum
margin classification, Classification errors, regularization, logistic regression, Linear regression, estimator
bias and variance, active learning, Active learning (cont.), non-linear predictions
Unit II
Kernels, Kernel regression, kernels, Support vector machine (SVM) and its implementation in PYTHON,
kernels, kernel optimization, Model selection, Model selection criteria
Description length, feature selection, Combining classifiers, boosting, margin, and complexity, Margin and
generalization.
Unit III
Mixture models, Mixtures and the expectation maximization (EM) algorithm, EM, regularization, clustering,
Spectral clustering
Programming in PYTHON: Markov models, Hidden Markov models (HMMs).
Unit IV
More Programming in PYTHON: Bayesian networks, Learning Bayesian networks, Probabilistic inference,
collaborative filtering, Current problems in machine learning.
References:
1. Bishop, Christopher. Neural Networks for Pattern Recognition. New York, NY: Oxford University
Press, 1995. ISBN: 9780198538646.
2. Duda, Richard, Peter Hart, and David Stork.Pattern Classification. 2nd ed. New York, NY: Wiley-
Interscience, 2000. ISBN: 9780471056690.
3. Hastie, T., R. Tibshirani, and J. H. Friedman. The Elements of Statistical Learning: Data Mining,
Inference and Prediction. New York, NY: Springer, 2001. ISBN: 9780387952840.
4. MacKay, David. Information Theory, Inference, and Learning Algorithms. Cambridge, UK:
Cambridge University Press, 2003. ISBN: 9780521642989. Available on-line here.
5. Mitchell, Tom. Machine Learning. New York, NY: McGraw-Hill, 1997. ISBN: 9780070428072.
50
CSL635: INTRODUCTION TO DATA ANALYTICS (Elective-I)

Credits
L T P
4 0 0
Total Marks: 100

Note for Candidate:
Pre-requisites: This course requires that you are familiar with high-school level linearalgebra, and calculus.
Knowledge of probability theory, statistics, and programming isdesirable.
Unit I
Data Analytics Overview, Applications of Data Analytics, Descriptive Statistics: DescriptiveStatistics,
Probability Distributions, Inferential Statistics: Inferential Statistics through hypothesis tests, Permutation &
Randomization Test.
Unit II
Regression & ANOVA: Regression ANOVA (Analysis of Variance).
Machine Learningimplementation in WEKA: Introduction and Concepts Differentiatingalgorithmic and
model based frameworks, Regression: Ordinary Least Squares, RidgeRegression, Lasso Regression, K
Nearest Neighbours, Regression & Classification.
Unit III
WEKA implementation of Supervised Learning with Regression and Classification techniques -1: Bias-
Variance Dichotomy Model Validation Approaches, Logistic Regression, Linear Discriminant Analysis,
Quadratic Discriminant Analysis, Regression and Classification Trees, Support Vector Machines.
WEKA implementation of Supervised Learning with Regression and Classification techniques -2 Ensemble
Methods: Random Forest Neural Networks Deep learning.
Unit IV
Unsupervised Learning and Challenges for Big Data Analytics, ClusteringAssociative, Rule Mining
Challenges for big data analytics, Prescriptive analytics, Creatingdata for analytics through designed
experiments, Creating data for analytics through Activelearning, Creating data for analytics through
Reinforcement learning.
References:
1. Hastie, Trevor, et al., The elements of statistical learning. Vol. 2.No. 1. New York: springer, 2009.
2. Montgomery, Douglas C., and George C. Runger., Applied statistics and probability for engineers.
John Wiley & Sons, 2010.
3. NOC:Introduction to Data Analytics - Video coursehttp://nptel.ac.in
51
(Credit Based Continuous Evaluation Grading System) (SEMESTER – VI)
CSL620: MAJOR PROJECT

Total Marks: 500
A candidate should work on the project for 5 months and 6–8 hours on each working day.
Ist synopsis (containing mainly literature survey corresponding to the problem taken up for the
project work and line of attack to solve the problem) within one month of joining the training is to
be submitted and will be evaluated for 4 credits.
IInd synopsis (containing essentially the progress of work in comparative details) within three
months of joining the training is to be evaluated will be evaluated for 7 credits.
Credits for Final Project Report & Viva Voce: 15

All the candidates of MCA final project are required to submit a project report based on the work
done by him/her during the project period. A student will submit his/her project report in the
prescribed format. A student has to submit: three hard copies of the project report, and a soft copy
of project on CD/DVD in a thick envelope pasted inside of the back cover of the project report.
Prescribed outline for the project report

1. Title Page (format as in Anenxure -1)
2. Declaration (format as in Anenxure -1)
3. Certificate from the Project Guide on letter head of an organization (format as in Anenxure -1)
4. Acknowledgement
5. Abstract
6. Index
7. List of Figures
8. List of Tables
9. List of acronyms and abbreviations
10. Introduction to the project
11. Statement of the Problem
12. Theoretical Background / Literature review
13. Software Development Life Cycle and its deliverables as the project progressed
 Requirement Gathering and Analysis
 Feasibility Study
 Design
 Coding -complete code is not required. You can add important code snippets.-
 Implementation and Testing
 Building and Deployment
14. Limitations of the project
15. Conclusions and Future Work
16. References
17. Annexures (optional)
52
Formatting Instructions:
Margins: Left margin -1.3 inch, Right margin-1 inch, Top margin: 1 inch, Bottom margin: 1 inch
Page numbers – All pages should be numbered at the bottom center of the pages.
Normal Body Text: Font Size: 12, Times New Roman, 1.5 Spacing, Justified. 6 point above and
below paragraph spacing
Section Heading: Font Size: 14, Times New Roman, Underlined, Left Aligned. 12 point above &
below spacing.
Chapter Heading: Font Size: 20, Times New Roman, Centre Aligned, 30 point above and below
spacing.
Figure and Table Captions: Font Size: 12, Times New Roman, centred.
Coding Font: size :10, Courier New, Normal
Good quality white paper A4 size should be used for typing and duplication.
Annexure – I
DECLARATION
The work embodied in this project entitled “Name of your project” submitted to the Department of
Computer Science, Guru Nanak Dev University, Amritsar, for the award of degree of Master of
Computer Application has been done by me. The project report is entirely based on my own work
and not submitted elsewhere for the award of any other degree. All ideas and references have been
duly acknowledged.
Name & Signature of the Candidate
Date
CERTIFICATE
This is to certify that this project entitled, “Name of the project”, submitted to the Department of
Computer Science, Guru Nanak Dev University, Amritsar, for the degree of Master of Computer
Application was carried out by Mr./Ms.______________________ Roll No. ________________ is
an authentic work carried out by him/her at ________________________________ under my
guidance. The matter embodied in this project work has not been submitted earlier for award of any
degree or diploma to the best of my knowledge and belief.
Supervisor
Dated:
53
Title of the Project Report

(Times New Roman, Font size = 24)
Project Report
(Times New Roman, Font Size= 16)
Submitted to the Faculty of Engineering and Technology
for the partial fulfilment of the requirements of
Master of Computer Applications

Supervised by: Submitted by:

Name of Supervisor Name and Roll no of student
University LOGO
Department of Computer Science

Guru Nanak Dev University
Amritsar- 143005
India
Month, Year

Mca Tyc Cbegs 2019-20 PDF

Uploaded by

Copyright:

Available Formats

Mca Tyc Cbegs 2019-20 PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Mca Tyc Cbegs 2019-20 PDF

Uploaded by

Copyright:

Available Formats

FACULTY OF ENGINEERING & TECHNOLOGY

MASTER OF COMPUTER APPLICATIONS

GURU NANAK DEV UNIVERSITY

(ii) Subject to change in the syllabi at any time.

Sr. no. Subject Credits Total

*Credits not to be counted towards SGPA

Semester III Total

*Credits not to be counted towards SGPA

CSL 410: Computer Fundamentals

Instructions for the Paper Setters:

CSL411: INTRODUCTION TO PROGRAMMING

Instructions for the Paper Setters:

Program Structure: Program structure revisited, managing multi–file programs using

CSL 412: COMPUTER ORIENTED NUMERICAL & STASTISTICAL METHODS

Instructions for the Paper Setters:

ECL491: PRINCIPALS OF DIGITAL ELECTRONICS

Instructions for the Paper Setters:

MTL408: MATHEMATICAL ELEMENTS OF COMPUTER SCIENCE

Instructions for the Paper Setters:

CSP410: PROGRAMMING LABORATORY–I

Practical Exercises on Programming in C/C++

Implementation of numerical & statistical methods using C/C++ language

File management using Linux/Unix/ Windows based operating system

CSP 411: COMMUNICATION SKILLS

Mid Semester Examination: 20% weightage

Instructions for the Paper Setters:

1. Simon Sweeney, “English for Communication”, 2 nd Edition, CUP, 2003.

CSL420: DATA & FILE STRUCTURES

Instructions for the Paper Setters:

CSL421: COMPUTER ORGANIZATION AND ARCHITECTURE

Instructions for the Paper Setters:

Parallel & Multiprocessing Environment: Introduction to parallel processing, pipelining, RISC

CSL423: COMPUTER BASED OPTIMIZATION TECHNIQUES

Instructions for the Paper Setters:

CSL424: DESIGN OF PROGRAMMING LANGUAGES

Instructions for the Paper Setters:

Operating and Programming Environment: Batch processing, interactive, embedded,

CSL426: COMPUTER NETWORKS

Instructions for the Paper Setters:

CSP420: PROGRAMMING LABORATORY–II

 Implementation of Data and File Structures using C/C++

 Implementation of Computer Oriented Optimization Techniques

 Network Administration – User management, File & Resource Sharing

CSP421: PERSONALITY DEVELOPMENT

Slide Preparation and oral presentation principles

Written Presentation of technical material

Basics of Official Correspondence

CSL511: THEORY OF COMPUTATION

Instructions for the Paper Setters:

CSL512: MICROPROCESSOR AND ITS APPLICATIONS

CSL516: DATA BASE MANAGEMENT SYSTEMS

Instructions for the Paper Setters:

Basic Concepts: An overview of Database Management System, Architecture for a database

Advanced Concepts in Relational Databases: Recovery, Concurrency, Security, Integrity,

CSL517: OPERATING SYSTEM

Instructions for the Paper Setters:

CSP510: PROGRAMMING LABORATORY – III

Implementation of OO Concepts using C++

CSL518: Software Testing (Elective)