GURU NANAK DEV UNIVERSITY AMRITSARgndu.ac.in/syllabus/201920/ELECENG/MCA TYC CBEGS 2019-20.pdf · 2019. 12. 16. · CSL616 Fundamentals of Cloud Computing 4 0 0 CSL632 Distributed

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 UNIVERSITYAMRITSAR

Note: (i) Copy rights are reserved.Nobody is allowed to print it in any form.Defaulters will be prosecuted.

(ii) Subject to change in the syllabi at any time.Please visit the University website time to time.

1MASTER OF COMPUTER APPLICATIONS (MCA)

(Credit Based Evaluation and Grading System)

Sr. no. Subject Credits TotalMarks

Semester I L T PCSL410 Computer Fundamentals 4 0 0 100CSL411 Introduction to Programming 4 0 0 100CSL412 Computer Oriented Numerical & Statistical Methods 4 0 0 100ECL491 Principal of Digital Electronics 4 0 0 100MTL408 Mathematical Elements of Computer Science 4 0 0 100CSP410 Programming Laboratory-I 0 0 2 100CSP411 Communication Skills* 0 0 1

Sub Total 20 0 3Grand Total 18 600

Semester IICSL420 Data & File Structures 4 0 0 100CSL421 Computer Organization & Architecture 4 0 0 100CSL423 Computer Based Optimization Techniques 4 0 0 100CSL424 Design of Programming Languages 4 0 0 100CSL426 Computer Networks 4 0 0 100CSP420 Programming Laboratory–II 0 0 2 100CSP421 Personality Development * 0 0 1 100

20 0 3 100Grand Total 23 600

*Credits not to be counted towards SGPANote: PSL-053 ID Course Human Rights & Constitutional Duties (Compulsory Paper) Students canopt. in any semester except Semester 1st. This ID Paper is one of the total ID Papers of this course.

Semester III TotalMarks

CSL511 Theory of Computation 4 0 0 100CSL512 Microprocessor & its Applications 4 0 0 100CSL516 Data Base Management System 4 0 0 100CSL517 Operating System 4 0 0 100

Elective 4 0 0 100CSP510 Programming Laboratory – III 0 0 2 100

List of ElectivesCSL518 Software Testing 4 0 0CSL519 Object Oriented Programming using JAVA 4 0 0

Sub Total 20 0 2Grand Total 22 600


(Credit Based Evaluation and Grading System)

Semester – IVCSL525 Information System 4 0 0 100CSL529 Evolutionary and Intelligent Computing Theories &

Applications4 0 0 100

CSL530 Web Technologies 4 0 0 100Elective-I 100Interdisciplinary Course-I 100

CSP-520 Programming Laboratory – IV 0 0 2 100List of Electives-I

CSL526 Computer Graphics 4 0 0CSL528 Digital Image Processing 4 0 0

Sub Total 20 0 2Grand Total 22

Semester – VCSL611 System Software 4 0 0 100CSL612 Software Engineering 4 0 0 100CSP610 Programming Laboratory – V 0 0 2 100

Elective-I 4 0 0 100Interdisciplinary Course-II 4 0 0 100Interdisciplinary Course-III 4 0 0 100


List of ElectivesCSL614 Artificial Neural Networks 4 0 0CSL616 Fundamentals of Cloud Computing 4 0 0CSL632 Distributed Systems 4 0 0CSL633 System Simulation 4 0 0CSL637 Introduction to Machine Learning 4 0 0CSL635 Introduction to Data Analytics 4 0 0

Semester – VICSE620 Major Project 0 0 26 500


*Credits not to be counted towards SGPA


(Credit Based Evaluation and Grading System) (SEMESTER – I)

CSL 410: Computer FundamentalsCredits

L T P4 0 0

Mid Semester Examination: 20% weightageEnd 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 fourSections (A-D). Questions may be subdivided into parts (not exceeding four). Candidates arerequired to attempt five questions, selecting at least one question from each Section. The fifthquestion may be attempted from any Section.

Section AIntroduction 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 andDevelopment Tools: – Problem Analysis, Program Constructs (Sequential, Decision, Loop),Algorithms, Flowcharts, Pseudocode. Decision table, Modular Programming, Top–down andBottom–up Approaches, functional, Procedural object–oriented, and logic programming,Programming Languages – Syntax & Semantics.

SECTION –BOperating System Concepts: Role of an Operating System, Types of operating systems, Batchprocessing, Multiprograming, timesharing, real time, mobile, portable etc, Booting procedureand its types, Components and functions of operating system. Data Communication andInternet: 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 HackingPrevention Mechanism: Anti – Viruses, Firewalls, Biometrics Controls for security,cryptography and encryption.

SECTION –CIntroduction to Cloud Computing: Overview of distributed computing: Trends of computing,introduction to parallel/distributed computing, Introduction to Cloud Computing includingbenefits, challenges, and risks, Different types of clouds, Security and Privacy issues in theCloud.. 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 ofimplementation.

Total Marks: 100



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.



CSL411: INTRODUCTION TO PROGRAMMINGCredits

L T P4 0 0



SECTION –AIntroduction to Program Development: Problem Analysis, Designing a solution.Overview of C: Brief history of C, introduction to different versions of C. General Structure of aC program, stages in the development of a C program.Data Types, Operators & Expressions: Constants and variables, data types, declaringvariables, storage classes, different types of expressions and their evaluation, conditionalexpression, assignment statement, enumerated data type, redefining/creating data types, typecasting.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, Loopingusing for, while and do – while statements, transferring program control using break andcontinue statementsArrays & Strings: Introduction to arrays, declaring arrays, initializing arrays, processing ofarrays, introduction to strings.Structures & Unions: Introduction to structures, declaring structures, initializing structures,accessing elements of structures, array of structures, nested structures, passing structures asarguments to a function, introduction to unions.

SECTION –BFunctions: Defining a function, local variables, return statement, invoking a function, specifyingand passing arguments (including arrays, strings) to a function, function prototyping and use ofheader 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–referentialstructures.

Total Marks: 100



Program Structure: Program structure revisited, managing multi–file programs usingtraditional approach of separate compilations and project facility of Turbo C compiler, storageclasses 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 –CIntroduction to Object Oriented Paradigm – Object Oriented programming and C++,

Structured Programming methodology, its shortcomings, advantages of OOPS (Object OrientedProgramming Style).OOP concepts: Abstraction, Encapsulation, Data Hiding, Inheritance, Polymorphism. Overviewof C++ – Data types, Input/output statements, Flow of control – looping statements, branchingstatements, Pointers & references, namespaces.

SECTION –DClass design: constructors, destructors, operator overloading, reuse through inheritance, virtualfunctions, exception handling. I/O with stream classes, memory managementThe Standard Template Library (STL): containers, algorithms, iterators, adaptors, functionobjects.

References:1. Stephan G. Kochan, Programming in C, Addison–Wesley Professional, 2013.2. Walter Savitch, Absolute C++, Fifth Edition, Addison Wesley, 20133. 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.



CSL 412: COMPUTER ORIENTED NUMERICAL & STASTISTICAL METHODSCredits

L T P4 0 0



SECTION–AFloating–Point Numbers: Floating–point representation, Rounding, Chopping, Error analysis.Non–Linear Equations: Generalized Newton Raphson method,Secant method, Rate of convergence ofsecant method, Muller’s method.Linear Systems of equations: Gauss Elimination and LU– decomposition methods, solution oftridiagonal system , Jacobi and Gauss–Seidel methods.Central Difference Interpolation:Gauss forward, Gauss Backward, stirling Interpolation methods.

SECTION –BNumerical 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–Kuttamethod,Predictor–Corrector method.Dispersion: Meaning, Characteristics for an ideal measure of dispersion. Measures of dispersion(Meandeviation, Standard Deviation and variance.)Principle of least Square: correlation and regression coefficients (two variables only)

SECTION –CAnalysis of Statistical Data: Frequency distribution; Frequency curve and histogram; Measure of

central tendency and dispersionRandom Variables and probability distributions: Basic concepts of probability and itsproperties,Conditional probability and independent events; Random variable, Notion of sample space;distribution functions; Mathematical expectation, Poisson, Rectangular, Exponential and Normaldistributions.

SECTION –DSampling 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 significancebased 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).

Total Marks: 100



ECL491: PRINCIPALS OF DIGITAL ELECTRONICSCredits

L T P4 0 0



SECTION ASemiconductors : 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 BDigitalIC's:Logic gates,clocksandtimers.BooleanAlgebra&CircuitDesign:BasiclawsofBooleanalgebra,K-Maps:MinimizationTechniques,circuitdesignusingstandard(NAND)gates.

SECTION CSequentialCircuits:Flip-Flops-SRFl ipFlop,JKFlipFlop,D-FlipFlop,TFlipFlop,EdgeTriggeredFlipFlops,LevelTriggeredFliprtops,Registers-SerialInSerialOut(SISO),SerialInParallelOut(SIPO),ParallelInSerialOut(PISO),ParallelInParallelOut(PIPO),CountersSynchronousandAsynchronousCounters.CombinationalCircuits:Adder,decoderIde-multiplexer,encoderImultiplexerdesign.

SECTION DLogicDesign:ITL,STIL,CMOSlogicfamilies.DataConverters:AnalogtodigitalandDigitaltoanalogconversiontechniques,MicroprocessorcompatibleADCsandbasicinterfacingtechniques.DigitalPeripherals:Keyboard,multiplexedsevensegmentd isplay,CRTdisplayschemes,Printers,Contro linterfaces(parallelandserial)fortheperipheralunits.

Total Marks: 100



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, Analysis & 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.



MTL408: MATHEMATICAL ELEMENTS OF COMPUTER SCIENCECredits

L T P4 0 0



SECTION –ALogic and Propositional Calculus: Proposition and Compound Propositions, basic LogicalOperations, Propositions and Truth Tables, Tautologies and Contradictions, LogicalEquivalence, Duality law, Algebra of propositions, Conditional and Biconditional Statements,Arguments, Logical Implication, Propositional Functions, Predicates and Quantifiers, Negationof Quantified Statements, Inference theory of the predicates calculus.Algebraic Systems: Operations, Semigroups, Groups, Subgroups, Normal Subgroups andHomomorphisms, Rings, Fields, Polynomials over a field.

SECTION –BGraph Theory: Graphs and Multigraphs, Subgraphs, Isomorphic and Homeomorphic Graphs,

Walks, Paths and Cycles, Eulerian Graph, Hamiltonian Graph, Connectivity, Bridges ofKonigsberg, Traversable Multigraphs, Labeled and Weighted Graphs, Complete, regular andBipartite Graphs, Tree graphs, Planar Graphs, Regions, Euler’s Formula, Graph Colorings,Chromatic Number, Welch–Powell Algorithm, Representing Graphs in Computer Memory.

SECTION –CRecurrence Relations and Generating Functions: Polynomial expressions, recursion theorem,closed form expression, generating function, solution of recurrence relation using generatingfunction.Properties of the Integers: Order and Inequalities, Absolute Value, Mathematical Induction,Division Algorithm, Greatest Common Divisor, Euclidean Algorithm, Fundamental Theorem ofArithmetic, Congruence Relation, Congruence Equations.

SECTION –DBoolean 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.

Total Marks: 100



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



CSP410: PROGRAMMING LABORATORY–ICredits

L T P0 0 2

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

Total Marks: 100



CSP 411: COMMUNICATION SKILLSCreditsL T P0 0 1



UNIT–ITheories of communication, Goals- Organizational and Personal, Psychology of communication,Channels, Cost and Barriers to communication, Informal and Formal communication

UNIT–IIListening and Speaking Skills, Familiarizing to different tones and accents, Oral communicationpractice, Public speaking, Grammar and Vocabulary, Speech, Extempore

UNIT–IIIBasics of Telephone Etiquette in Business communication, Practice of Interview skills andGroup DiscussionsStudents must carry out Group discussions and Mock interviews during the lab session.

Books Recommended:

1. Simon Sweeney, “English for Communication”, 2nd Edition, CUP, 2003.2. Leo Jones and Richard Alexander, “New International Business English”, CUP, 2000.3. Essentials of Business Communication, Rajendra Pal. JS Korlahhi.

Total Marks: 100


(Credit Based Evaluation and Grading System) (SEMESTER – II)

CSL420: DATA & FILE STRUCTURESCredits

L T P4 0 0


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 attemptfive questions, selecting at least one question from each Section. The fifth question may be attemptedfrom any Section.

SECTION–APreliminaries: Various data structures, common operations on data structures, algorithm complexity, bigO 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 listsover arrays, various operation on linked lists

SECTION–BStacks: Description of stack structure, implementation of stack using arrays and linked lists. Applicationsof 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 searchtree using linked lists, various operations on binary search trees, AVL Trees, Threaded Binary Trees, B–Trees, B+ trees.

SECTION CGreedy 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 oradjacency lists, various graphs traversing algorithms, finding shortest path between two nodes,Dijkastra’s shortest path algorithm., finding biconnected component, strongly connectedcomponent and finding cycles in the graphs.

Total Marks: 100



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



CSL421: COMPUTER ORGANIZATION AND ARCHITECTURECredits

L T P4 0 0



SECTION ABasic computer Organisation and design: Register Transfer and Micro–operations: Register TransferLanguage, various Arithmetic, Logic & Shift micro–operations, instruction codes,

computer registers, timing & control, instruction cycle, design of a complete basic computer & it’sworking.

SECTION BProgramming & 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 CMemory Organisation: Memory hierarchy, main, auxiliary, cache memory, virtual memory, paging andsegmentation.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, RISCArchitecture, 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.

Total Marks: 100



CSL423: COMPUTER BASED OPTIMIZATION TECHNIQUESCredits

L T P4 0 0



SECTION ALinear Programming: Mathematical formulation of linear programming problems, Canonical andstandard forms of linear programming problems, Solution by Graphical & Simplex method, Revisedsimplex method, Two phase & Big–M method, Duality, Primal–Dual Relationship, Dual Simplexmethod, Economic Interpretation of Optimal simplex Solution. Sensitivity Analysis: Changes in RHSvalues, Objective Function Coefficients, Constraint Coefficients, Addition of a new constraint/variable.(13 Lectures)

SECTION BSpecial Types of LPP: Transportation and Assignment Problems, Optimality, Special cases inTransportation 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 2games, dominance property, arithmetic method of n x n .

SECTION CInteger & 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 DEvolutionary Techniques: Introduction to Evolutionary Computing & Genetic Algorithms, GA as asearch and optimization technique. Implementation of SGA using MATLAB/Scilab. AdvancedComputing Techniques: Introduction to Neural Networks, Fuzzy Systems and other Soft Computingtechniques. Introduction to Swarm Intelligence and Optimization.

Books Recommended:1. Gass, S. L.: Linear Programming2. 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.

Total Marks: 100



CSL424: DESIGN OF PROGRAMMING LANGUAGES

CreditsL T P4 0 0



SECTION AStudy of Programming Languages: Brief History, Feature of a good language

Programming Language Processor: Translator and software simulator computer, syntax semantics andvirtual computers.

Specifications and Implementation of Elementary and Structured Data Types. Type equivalence,checking and conversion.

SECTION BVectors 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. Subprogramdefinition and activation, simple and recursive subprogram, subprogram environment.

SECTION C

Scope – Static and Dynamic, Block structures, Local Data and Shared Data, Parameters and ParameterTransmission. Local and Common Environments, Tasks and Shared Data.

Static and Stack-Based Storage management. Fixed and Variable size heap storage management, GarbageCollection.

SECTION D

Syntax and Translation: Syntactic elements of a language, stages in translation, formal definition ofsyntax

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

Text/References:1. Programming languages: design and implementation, Terrence W. Pratt., Pearson2. Programming languages: concepts and constructs, Ravi Sethi, ISBN 9780201590654.3. Programming Language Pragmatics, Scott, ELSEVIER

Total Marks: 100



CSL426: COMPUTER NETWORKS

CreditsL T P4 0 0



SECTION AIntroduction 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 BLayered Architecture: OSI and TCP/IP reference models.

Data Link layer: Framing, Error detection and correction, Elementary data link and slidingwindow protocols, Channel allocation in LAN and WAN, Multiple access protocols.

SECTION CDesign issues of network layer: Routing algorithms, Congestion control algorithms,internetworking, Repeaters, Routers.Services and elements of transport protocolsIEEE standards used in Computer networks.

SECTION DIntroduction 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. NetworkSecurity 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 Press3. William Satlllings, Wireless Communication & Networks, Pearson Education

Total Marks: 100



CSP420: PROGRAMMING LABORATORY–IICredits

L T P0 0 2

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

Implementation of Computer Oriented Optimization Techniques

Network Administration – User management, File & Resource Sharing

Total Marks: 100



CSP421: PERSONALITY DEVELOPMENTCredits

L T P0 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 coresubjects 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”, 3rd Edition, McMillan, 1979.


(Credit Based Evaluation and Grading System) (SEMESTER –III)

CSL511: THEORY OF COMPUTATIONCredits

L T P4 0 0



SECTION ANon Deterministic Finite Automata, Deterministic Finite Automata, – moves,regular expressions, crossing sequence. Moore and Mealy machines.

SECTION BPumping lemma for regular sets, Minimisation algorithm, Context free grammar,derivation Trees, Chomesky & Greibach normal forms.

SECTION CPushdown automata, pumping lemma for CFL’s, Ogden’s lemma, Turing machines.Undecidability,

SECTION DRecursive 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.

Total Marks: 100



CSL512: MICROPROCESSOR AND ITS APPLICATIONSCredits

L T P4 0 0

Mid Semester Examination: 20% weightageEnd Semester Examination: 80% weightageInstructions for the Paper Setters:Eight questions of equal marks (Specified in the syllabus) are to be set, two in each of the fourSections (A-D). Questions may be subdivided into parts (not exceeding four). Candidates arerequired to attempt five questions, selecting at least one question from each Section. The fifthquestion may be attempted from any Section.

SECTION AIntroduction: Introduction to Microprocessor, Microcontroller and Microcomputer, differenttypes of microprocessors - Intel, AMD, Motorola, and their suitability to different types ofapplications. 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 BArchitecture of 8086/ 8088 Microprocessor: Description of various pins, configuring the8086/8088 microprocessor for minimum and maximum mode systems description of maximumsystem 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 busstatus codes, memory control signals, read/write bus cycles, the role of stack in intrrupts andsubroutine cells; demultiplexing the address data bus, program and data storage memory,dynamic RAM system.

SECTION CInput /Output Interface of the 8086 / 8088 microprocessor: I/O Interface, I/O address spaceand data transfers, I/O instructions, I/O bus cycles, Output ports, 8255A ProgrammablePeripherals Interface (PPI), memory– mapped, I/O, serial communication interface (USART andUART) – the RS–232 C interface, 8251A programmable communication interface, specialpurpose interface controllers.Interrupt Interface of 8086/8088 microprocessor: What is interrupt? Types of interrupt,Interrupt Vector Table (IVT)

SECTION D8086/8088 assembly language programming: General structure of an assembly languageprogram, steps in the development of an assembly language program, Assembly language V/Smachine language, addressing modes, Instruction set: data movement instructions, arithmeticinstructions, 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. Howdecisions are made and how loops can be set in an assembly language program.

Total Marks: 100



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.



CSL516: DATA BASE MANAGEMENT SYSTEMSCredits

L T P4 0 0



SECTION A

Basic Concepts: An overview of Database Management System, Architecture for a databasesystem, 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 beprovided.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 datamanagement and Big data analyticsTechniques of Data Management: Storage and Analysis of data, Extraction of relevantinformationApplications of Big Data: Distributed databases, Hadoop, NoSQL, NewSQL,Dimensionality reduction, processing unstructured data

Total Marks: 100



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.



CSL517: OPERATING SYSTEMCredits

L T P4 0 0



SECTION ABasic 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 BMemory Management: Basic Memory management Schemes, Partition memory management,demand paged memory management, segmented memory management, swapping, hierarchy ofmemory, Virtual Memory, Working Set Model.Device Management: Dedicated devices, shared devices, virtual devices, channels, I/O trafficcontroller, I/O scheduler, I/O device handlers, Storage devices, buffering, disk schedulingalgorithms.

SECTION CInformation 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 RequirementsSECTION 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.

Total Marks: 100



CSP510: PROGRAMMING LABORATORY – IIICredits

L T P0 0 2

Hands on practice of SQL statements with different clauses available using Oracle 8i or higherversion

Implementation of OO Concepts using C++

Total Marks: 100



CSL518: Software Testing (Elective)Credits

L T P4 0 0



SECTION AIntroduction Software Testing – software quality, Why software testing, Evolution of softwaretesting. 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 ofbugs.Levels of Testing – unit to system testing.

SECTION BTypes of testing - volume testing, stress testing, usability testing, performance testing, securitytesting, storage testing, compatibility testing, configuration testing, reliability testing, recoverytesting, acceptance testing.Testing strategies and techniques – structural versus functional testing, automated versus manualtesting, static versus dynamic testing.

SECTION CDebugging – 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; strategiesfor testing; testing tools; testing event driven systems; testing graphical user Interfaces. Workingexperience of any one tool.

SECTION DSoftware security testing – software vulnerabilities fundamentals; security policy; enforcingsecurity policy; threat modelling;Security testing of standalone and web applicationsBasic 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 WesleyProfessional, 2006

Total Marks: 100



CSL519: OBJECT ORIENTED PROGRAMMING USING JAVA (Elective)

CreditsL T P4 0 0



SECTION AEvolution of Java, Importance of JAVA to Internet, Features of JAVA, Bytecode, ObjectOriented Approach. Various Data Types and Operators, Type Conversion and Casting, OneDimensional and Multidimensional arrays, Selection Statements, Iterative Statements, Jumpingstatements. Class Fundamentals, Declaring objects, Introducing Methods, Constructors, thiskeyword, Overloading constructors and Methods, Recursion, Nested and Inner classes.

SECTION BInheritance 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 CMultithreaded 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 & writingFiles, Byte Streams, Character Streams & Serialization.

SECTION DApplet basics, Applet Architecture, Applet: Display, Repaint, Parameter Passing. EventHandling: The Delegation Event Model, Event Classes, Event Listener Interfaces, AWT WindowFundamentals, 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.

Total Marks: 100


(Credit Based Evaluation and Grading System) (SEMESTER –IV)

CSL525: INFORMATION SYSTEMSCredits

L T P

4 0 0



SECTION A

An Introduction to Information System: Information Concepts, System Concepts, BusinessInformation Systems, Information Systems in society, business and Industry, Ethical and Socialissues, Global Challenges in Information Systems

Information Systems in Organizations: organizations and Information systems, competitiveAdvantage, 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, DSSSoftware, Strategies for DSS, Group Support Systems, Executive Support System (ESS)

SECTION CKnowledge 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 anddisadvantages, Historical context of DIS.The Internet and Internet Applications as a Distributed Information SystemSecurity, data integrity and availability of DIS, Network management issues

Total Marks: 100



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



CSL529: EVOLUTIONARY AND INTELLIGENT COMPUTING THEORIES ANDAPPLICATIONS

CreditsL T P4 0 0



SECTION AIntroduction to AIAI concept, Importance of AI, Evolution of AI, Applications of AI.KnowledgeIntroduction and Importance of Knowledge, Knowledge based systems, KnowledgeRepresentation, First Order Predicate Logic (FOPL), Syntax and Semantics of FOPL,Knowledge Organization and Manipulation.

SECTION BUn–supervised Learning: Kohonen Self Organization Feature maps and Adaptive ResonanceTheory. Introduction to Fuzzy Logic and Fuzzy Sets, Fuzzy Relations, Fuzzyfication,Defuzzyfication. Introduction to Hybrid soft Computing. Applications of Advance Computing inPattern Recognition, Signal Processing & Image Retrieval.

SECTION CIntroduction to Evolutionary Computing & Genetic Algorithms. Introductionto GeneticAlgorithms, Goals of Optimization, How Genetic Algorithms work, A Simple GeneticAlgorithm’s Computer Implementation highlighting Reproduction by Selection, Crossover,Mutation.

SECTION DAdvanced GA Techniques Mapping Objective Function to Fitness Form, Fitness scaling,discretization, Different types of Selection and Crossover techniques. A case study of TravellingSalesman 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, 19917. Dan W. Patterson, ‘Introduction to Artificial Intelligence and Expert Systems’, Prentice-

Hall India Private Limited, 2006.

Total Marks: 100



CSL530: WEB TECHNOLOGIESCredits

L T P4 0 0

Total Marks: 100



SECTION AWeb 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 Servletparameters, Handling HTTP requests and responses, Cookies and Session Tracking ASP/JSP,Basics of ASP/JSP objects, simple ASP and JSP pages

SECTION CRepresenting Web data, Data base connectivity, JDBC, Dynamic web pages, XML, DTD, XMLschema, DOM, SAX, XQuery, Building web applications, cookies, sessions, open sourceenvironment

Introduction to PHP, basics, PHP File handling, file upload, cookies, error handling, PHPMySQL introduction

SECTION DMiddleware technologies, Ecommerce architecture and technologies, Ajax, Advanced webtechnologies 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.


(Credit Based Evaluation and Grading System) (SEMESTER –IV) (Electives-I)

CSL526: COMPUTER GRAPHICSCredits

L T P

4 0 0


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 AElements of Computer Graphics: Introduction to computer graphics; graphics display devices; interactivecontrol 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’salgorithm, drawing arcs, sectors, etc. Flood Fill Algorithms, BoundaryFill Algorithms

Geometric Transformations: Translation, rotation, scaling, reflection and shear; concept of homogenouscoordinates, Building composite transformations.

SECTION B

Viewing Transformations: Concept of windows & viewport, window–to–viewport mapping, clippingoperations – 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 CProjective Transformations: Parallel projections – orthographic, axonometric (isometric, diametric andtrimetric), 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 handle3D objects).

Total Marks: 100



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.



CSL528: DIGITAL IMAGE PROCESSINGCredits

L T P

4 0 0Mid Semester Examination: 20% weightageEnd 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

Fundamentals: Introduction to Digital Image Processing, Fundamental steps in Digital Image Processing,Components of Image Processing System, Applications of Digital Image Processing, Image Sensing andAcquisition, Image Sampling and Quantization, Relationships between Pixels, Distance Measure betweenPixels.

Image Enhancement and Restoration: Spatial Domain Filtering Techniques, Smoothing spatial filters,Sharpening spatial filters, Histogram Processing, Introduction to Fourier Transformation, low pass filters, highpass 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 ImageProcessing, Color Transformation, Color Complements, Color Slicing, Color Image Smoothing andSharpening, Noise in color Images.

Wavelets and Multi-Resolution Processing: Wavelet functions, Wavelet transformations in one and twodimensions, 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.

Total Marks: 100



SECTION D

Representation and Description: Image Representation, Boundary and Regional Descriptors, RelationalDescriptors.

Object Recognition: Pattern and pattern classes, recognition based on Decision Theoretic Methods, StructuralMethods.

References:1. Rafael C. Gonzalez & Richard E. Woods, “Digital Image Processing”, 2nd Edition.

2. A.K. Jain, “Fundamental of Digital Image Processing”, PHI



CSP520: PROGRAMMING LABORATORY – IV

Credits

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++

Total Marks: 100


(Credit Based Continuous Evaluation Grading System) (SEMESTER – V)

CSL611: System SoftwareCredits

L T P4 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 (notexceeding 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 beattempted from any sections.

Unit IIntroduction to System Software, Evolution of System software, Components of System software,Translators, Loaders, Interpreters, Assembler and CompilerOverview of Assembly Process

Unit IIDesign of One pass and Two pass AssemblerMacro definition and expansion, Concatenation of macro parameters, Generation of unique labels,Conditional macro expansion, Recursive macro expansion

Unit IIIPhases of compilation process, Lexical analysis, parsing, Storage management optimisationIncremental compilers, Cross compilers, P code compilers

Unit IVBasic loader functions. Relocation, program linking, linkage,editors, dynamic linking bootstrap loadersOther 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, JohnWiley, 1991.



CSL612: Software EngineeringCredits

L T P4 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 (notexceeding 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 beattempted from any sections.

Unit IIntroduction: Introduction to Software Engineering, Software Components, Software Characteristics,Software Crisis, Software Engineering Processes, Similarity and Differences from Conventional EngineeringProcesses, Software Quality Attributes. Software Development Life Cycle (SDLC) Models: WaterfallModel, 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 ManagementSoftware Requirement Specifications (SRS) Requirement Engineering Process: Elicitation, Analysis,Documentation, Review and Management of User Needs, Feasibility Study

Unit IIInformation Modeling, Data Flow Diagrams, Entity Relationship Diagrams, Decision Tables, SRSDocument, IEEE Standards for SRS. Software Quality Assurance (SQA): Verification and Validation, SQAPlans, Software Quality Frameworks, ISO 9000 Models, SEI–CMM ModelBasic Concept of Software Design, Architectural Design, Low Level Design: Modularization, DesignStructure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion Measures, Design Strategies: FunctionOriented Design, Object Oriented Design, Top–Down and Bottom–Up Design. Software Measurement andMetrics: Various Size Oriented Measures: Halestead’s Software Science, Function Point (FP) BasedMeasures, Cyclomatic Complexity Measures: Control Flow Graphs

Unit IIISoftware Testing: Testing Objectives, Unit Testing, Integration Testing, Acceptance Testing, RegressionTesting, Testing for Functionality and Testing for Performance, Top–Down and Bottom–Up TestingStrategies: Test Drivers and Test Stubs, Structural Testing (White Box Testing), Functional Testing (BlackBox 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 andCoding Standards.



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



CSP610: Programming Laboratory - VCredits

L T P

0 0 2Total Marks: 100

Practical Exercises on System Programming concepts and Assembly Language.

Working knowledge of distributed version control system Git.



CSL614: Artificial Neural Networks (Elective)Credits

L T P

4 0 0Note 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 (notexceeding 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 beattempted from any sections.

Unit IBasics of Neural Networks: Connectionist Models and their structures, Multilayer Perception &BackPropagation Networks, Gradient Descent.Some Representation Issues: Representing Boolean function, Distributed Representation, RepresentingReal – valued Functions.

Unit IISingle Layer Models: Perception learning and pocket Algorithm.Autoassociators and one–shot learning: Linear Autoassociators and the interproduct TrainingRuleHopfield Model, Associative Memories.

Unit IIIMean Squared Errors (MSE) Algorithms: MSE Approximation, TheWidrow–Hoff Rule,ADALINEUn–supervised Learning: K–Means Clustering, Topology–Preserving maps, AdaptiveResonance Theory

Unit IVBack Propagation: Algorithms, Derivation, Practical ConsiderationsIntroduction to Some Applications: NETTALK, Handwritten Character Recognition,Travelling SalesmanProblem.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.

Total Marks: 100Total Marks: 100



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

L T P4 0 0


UNIT–IIntroduction: Definition, Vision, Reference Model, Benefits, Limitations, Terminology, OpenChallenges.Virtualization: Definition, Type of Virtualization, Benefits, Limitations, Virtualization andCloud, VirtualAppliance.

UNIT–IICloud Computing Architecture: Service Models, Deployment Models, Cloud Entities, CloudClients,Service Level Agreement (SLA) and Quality of Service (QoS) in Cloud Computing.

UNIT–IIIProgramming Models in Cloud:Thread Programming, Task Programming and Map–ReduceProgramming.Cloud Security: Infrastructure Security, Data Security, Identity and Access Management,PrivacyManagement, Security as a Service on Cloud.

UNIT–IVAdvance Topics in Cloud: Energy Efficiency in cloud, Market Oriented Cloud Computing, Big–DataAnalytics, 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, Feb2013.

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 India3. 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.

Total Marks: 100



CSL632: DISTRIBUTED SYSTEMS (Elective-I)Credits

L T P


Goals: To understand how large-scale computational systems are built

To study the key design principles of distributed systems to understand the challenges of largesystems.

To realize the importance of coordination in distributed systems.

To learn to create secure and reliable systemsPre-requisites: Operating System, Computer System Architecture, Computer Networks

Unit – IDistributed 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 – IIRole of middleware; communication - message passing and distributed shared memoryInter process communication – direct, multicast, indirect, RPC, RMI, IPC in UNIX.

Unit – IIIOperating System support; Time and Global states; Coordination and agreement; Distributed transactionsand concurrency control; Replication.Security challenges – perimeter defence, authentication schemes, and access control technologies.

Total Marks: 100



Unit – IVReliable 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, 5thed., 2012.Recommended Readings:

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 AdvancedTopics, 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.



CSL633: SYSTEM SIMULATION (Elective-I)Credits

L T P


Unit – IIntroduction: 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 ofintegration formulas; concepts of discrete system simulation with the help of two examples, Generation ofrandom numbers, Generation of non–uniformly distributed numbers.

Unit – IISimulation 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 analysisDesign and Evaluation of Simulation Experiments: Experimental layout and validation.

Unit – IVSimulation Languages: Continuous and discrete simulation languages, Block–Structuredcontinuoussimulation 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,ComputerNetworks Architectures

Recommended Readings:

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

Total Marks: 100



CSL637: Introduction to Machine Learning (Elective-I)Credits

L T P

4 0 0Total Marks: 100


Unit IIntroduction, linear classification, Perceptron update rule Perceptron convergence, generalization, Maximummargin classification, Classification errors, regularization, logistic regression, Linear regression, estimatorbias and variance, active learning, Active learning (cont.), non-linear predictions

Unit IIKernels, 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 andgeneralization.

Unit IIIMixture models, Mixtures and the expectation maximization (EM) algorithm, EM, regularization, clustering,Spectral clusteringProgramming in PYTHON: Markov models, Hidden Markov models (HMMs).

Unit IVMore 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.



CSL635: INTRODUCTION TO DATA ANALYTICS (Elective-I)Credits

L T P4 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 (notexceeding 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 beattempted from any sections.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 IData Analytics Overview, Applications of Data Analytics, Descriptive Statistics: DescriptiveStatistics,Probability Distributions, Inferential Statistics: Inferential Statistics through hypothesis tests, Permutation &Randomization Test.

Unit IIRegression & ANOVA: Regression ANOVA (Analysis of Variance).Machine Learningimplementation in WEKA: Introduction and Concepts Differentiatingalgorithmic andmodel based frameworks, Regression: Ordinary Least Squares, RidgeRegression, Lasso Regression, KNearest Neighbours, Regression & Classification.

Unit IIIWEKA 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 EnsembleMethods: Random Forest Neural Networks Deep learning.

Unit IVUnsupervised Learning and Challenges for Big Data Analytics, ClusteringAssociative, Rule MiningChallenges for big data analytics, Prescriptive analytics, Creatingdata for analytics through designedexperiments, Creating data for analytics through Activelearning, Creating data for analytics throughReinforcement 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


(Credit Based Continuous Evaluation Grading System) (SEMESTER – VI)

CSL620: MAJOR PROJECT

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 theproject work and line of attack to solve the problem) within one month of joining the training is tobe submitted and will be evaluated for 4 credits.IInd synopsis (containing essentially the progress of work in comparative details) within threemonths of joining the training is to be evaluated will be evaluated for 7 credits.

Credits for Final Project Report & Viva Voce: 15All the candidates of MCA final project are required to submit a project report based on the workdone by him/her during the project period. A student will submit his/her project report in theprescribed format. A student has to submit: three hard copies of the project report, and a soft copyof project on CD/DVD in a thick envelope pasted inside of the back cover of the project report.

Prescribed outline for the project report1. 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. Acknowledgement5. Abstract6. Index7. List of Figures8. List of Tables9. List of acronyms and abbreviations10. Introduction to the project11. Statement of the Problem12. Theoretical Background / Literature review13. 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 project15. Conclusions and Future Work16. References17. Annexures (optional)

Total Marks: 500



Formatting Instructions:Margins: Left margin -1.3 inch, Right margin-1 inch, Top margin: 1 inch, Bottom margin: 1 inchPage 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 andbelow paragraph spacingSection 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 belowspacing.Figure and Table Captions: Font Size: 12, Times New Roman, centred.Coding Font: size :10, Courier New, NormalGood quality white paper A4 size should be used for typing and duplication.

Annexure – I

DECLARATIONThe work embodied in this project entitled “Name of your project” submitted to the Department ofComputer Science, Guru Nanak Dev University, Amritsar, for the award of degree of Master ofComputer Application has been done by me. The project report is entirely based on my own workand not submitted elsewhere for the award of any other degree. All ideas and references have beenduly acknowledged.

Name & Signature of the CandidateDate

CERTIFICATE

This is to certify that this project entitled, “Name of the project”, submitted to the Department ofComputer Science, Guru Nanak Dev University, Amritsar, for the degree of Master of ComputerApplication was carried out by Mr./Ms.______________________ Roll No. ________________ isan authentic work carried out by him/her at ________________________________ under myguidance. The matter embodied in this project work has not been submitted earlier for award of anydegree or diploma to the best of my knowledge and belief.

SupervisorDated:



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(Times New Roman, Font Size= 14)

Supervised by: Submitted by:Name of Supervisor Name and Roll no of student

(Times New Roman, Font Size= 14)

University LOGO

Department of Computer ScienceGuru Nanak Dev University

Amritsar- 143005India

Month, Year(Times New Roman, Font Size= 16)

Documents

GURU NANAK DEV UNIVERSITY AMRITSARgndu.ac.in/syllabus/201920/ELECENG/MCA TYC CBEGS 2019-20.pdf · 2019. 12. 16. · CSL616 Fundamentals of Cloud Computing 4 0 0 CSL632 Distributed