Mca syllabus
- 1. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING SYLLABUS FOR MCA PROGRAMME ` RAJIV GANDHI UNIVERSITY, RONO HILLS, DOIMUKH
- 2. Course Structure FIRST SEMESTER Paper Code Title Credit Mark Distribution End Semester Sessional Practical Total CSPG-101 DISCRETE MATHEMATICAL STRUCTURES 3-0 80 20 - 100 CSPG-102 PROBLEM SOLVING AND PROGRAMMING USING C 2-2 50 20 30 100 CSPG-103 PROBABILITY AND STATISTICS 3-0 80 20 - 100 CSPG-104 MANAGEMENT ACCOUNTANCY 3-0 80 20 - 100 SECOND SEMESTER Paper Code Title Credit Mark Distribution End Semester Sessional Practical Total CSPG-105 THEORY OF COMPUTATION 3-0 80 20 - 100 CSPG-106 DATA AND FILE STRUCTURE 3-1 50 20 30 100 CSPG-107 OBJECT ORIENTED PROGRAMMING AND DESIGN 3-1 50 20 30 100 CSPG-108 DIGITAL COMPUTER ORGANISATION AND ASSEMBLY LANGUAGE PROGRAMMING 3-1 50 20 30 100 THIRD SEMESTER Paper Code Title Credit Mark Distribution End Semester Sessional Practical Total CSPG-201 PRINCIPLES OF PROGRAMMING LANGUAGES 3-1 50 20 30 100 CSPG-202 DATABASE MANAGEMENT SYSTEM 3-1 50 20 30 100 CSPG-203 DESIGN AND ANALYSIS OF ALGORITHMS 3-0 80 20 - 100 CSPG-204 COMPUTER NETWORKS 3-0 80 20 - 100
- 3. FOURTH SEMESTER Paper Code Title Credit Mark Distribution End Semester Sessional Practical Total CSPG-205 COMPUTER GRAPHICS 3-1 50 20 30 100 CSPG-206 OPERATING SYSTEMS 3-1 50 20 30 100 CSPG-207 SOFTWARE ENGINEERING 3-1 50 20 30 100 CSPG-208 DATA WAREHOUSING AND DATA MINING 3-1 50 20 30 100 FIFTH SEMESTER Paper Code Title Credit Mark Distribution End Semester Sessional Practical Total CSPG-301 COMPILER DESIGN 3-1 50 20 30 100 CSPG-302 COMPUTER ARCHITECTURE 3-0 80 20 - 100 CSPG-33X ELECTIVE – I (Any one from the list) 3-0 80 20 - 100 CSPG-331: ARTIFICIAL INTELLIGENCE CSPG-332: OPERATIONS RESEARCH CSPG-333: INFORMATION SECURITY CSPG-334: PATTERN RECOGNITION CSPG-304 SYSTEM PROJECT – I 0-4 100 SIXTH SEMESTER Paper Code Title Credit Mark Distribution End Semester Sessional Practical Total CSPG-305 SYSTEM PROJECT – II 0-12 - - - 300
- 4. MASTER OF COMPUTER APPLICATION (MCA) FIRST SEMESTER CSPG-101 DISCRETE MATHEMATICAL STRUCTURES (3-0) Introduction: Logic-Prepositional Equivalences-Truth tables-Totalogies-Predicates and Quantifiers-Sets-Operations on sets-Sequences and Summations -Growth functions - relations and their properties- n-ary relations and their applications -Representation of relations-Closures of relations-Equivalence relations-Partial Orderings. Counting Techniques: Basics of Counting- Pigeonhole Principle- Combinations and Permutations-Generalized Per mutations and Combinations-Recurrence relations- Solving Recurrence Relations-Divide and Conquer relations- Generating Functions-Inclusion and Exclusion-Applications of Inclusion-Exclusion. Graph Theory: Introduction to Graphs-Terminology-Relations and Directed Graphs - Representations of Graphs- Isomorphism-Connectivity- Euler and Hamiltonian Paths - Shortest Path problems- Planar Graphs - Graph Coloring- Introduction to trees- Applications of trees- Traversals-Trees and sorting-Spanning Trees-Minimum Spanning Trees. Boolean Algebra and Models of Computation: Boolean Functions-Representing Boolean Functions -Logic Gates-Minimizations of Circuits-Languages and Grammars- Finite State Machines with and with no outout-Language Recognition-Turing Machines. Reference Books: 1. Discrete mathematics and its applications, Keneth. H. Rosen, Tata McGraw-Hill Publishing Company, New Delhi 2. Discrete Mathematics for computer scientists & Mathematicians, Joe L. Mott, Abraham Kandel & T. P. Baker,Prentice Hall of India Ltd, New Delhi 3. Discrete mathematics, Richard Johnsonbaug, Pearson Education, New Delhi CSPG-102: PROBLEM SOLVING AND PROGRAMMING USING C (2-2) INTRODUCTION: Definition of Algorithms- Writing algorithms- top down design – Program verification- The efficiency of algorithms- Concept of Recursion- some simple example to illustrate these concepts like finding the GCD of two numbers- Swapping two variables- Summation of n given numbers- generation of Fibonocci sequence- Reversing a given number-Base conversion. INTRODUCTION TO C: C character set- Delimiters-The C Keywords-Identifiers- Constants-Variables-Rules for Defining Variables-Data Types-Declaring Variables- Initializing Variables – Type Conversion-Priority of Operators and their Clubbing-
- 5. Comma and Conditional Operator-Arithmetic Operators-Relational Operators –Logical Operators-Bitwise Operators-Input and Output in C-Formatted and Unformatted Functions -Library Functions. MORE ABOUT C : if statement- if…else statement-various forms of if- nested if -break statement-continue statement – go to statement - switch statement - nested switch statement - for statement -while statement do while statement - arrays - working with string and standard functions. ADVANCED CONCEPTS OF C : introduction to pointers – pointer declaration – Arithmetic Operations with pointers – pointers and arrays – pointers and two-dimensional arrays – array of pointers – pointers to pointers – pointers and strings – void pointers – function definition and declaration – proto types - types of functions – call by value and reference – functions returning more values – function as an argument – function with operators – function and decision statements – function and loop statements – function with arrays and pointers – recursion – pointer to function – storage classes. ADDITIONALS IN C: preprocessor directives – structures and unions – bit wise operators – files – command line arguments – dynamic memory allegation – graphics in C . PROBLEM SOVING: Reversal of an Array- Removal of duplicates in an ordered array- Partitioning of an array- Finding the kth smallest of an element of an array-Finding the longest monotone subsequence of an array-Linear search- Binary search- Hash searching- Bubble sort- merge sort- Quick sort-Insertion sort-selection sort-Text processing- Towers of Honoi problem using recursion. Reference Books: 1) Ashok N. Kamthane, Programming with ANSI and Turbo C, Pearson Education, New Delhi. 2) R. G. Dromey, How to Solve it by Computer, Prentice Hall Of India Ltd, New Delhi. 3) N. G. Venkateshmurthy, Programming techniques through C, Pearson Education, New Delhi. 4) Byron s Gottfried, Programming with C, Schaum‟s Outline series, Tata McGraw Hill Pub. Company, New Delhi. 5) Jacqueline A. jones & Keith Harrow, C programming with problem solving, Dreamtech publications, New Delhi CSPG-103: PROBABILITY AND STATISTICS (3-0) Probability: Definitions of probability, Addition theorem, Conditional probability, Multiplication theorem, Bayes theorem of probability and Geometric probability. Random variables and their properties: Discrete Random variable, Continuous Random variable, Probability Distribution joint probability distributions their properties, Transformation variables, Mathematical expectations, probability generating functions. Probability Distributions / Discrete distributions : Binomial, Poisson Negative binominal distributions and their properties. (Definition, mean, variance, moment generating function.,
- 6. Additive properties, fitting of the distribution.) Continuous distributions : Uniform, Normal, exponential distributions and their properties. Multivariate Analysis : Correlation, correlation coefficient, Rank correlation, Regression – test for goodness of fit, test for independence. Estimation: Sample, populations, statistic, parameter, Sampling distribution, standard error, unbiasedness, efficiency, Maximum likelihood estimator, notion & interval estimation. Testing of Hypothesis: Formulation of Null hypothesis, critic al region, level of significance, power of the test. Small Sample Tests : Testing equality of .means, testing equality of variances, test of correlation coefficient, test for Regression Coefficient. Large Sample tests : Tests based on normal distribution Reference Books : 1) Probability & Statistics for Engineers and Scientists, Walpole, Myers, Myers, Ye. Pearson Education. 2) Probability, Statistics and Random Processes T.Veerarajan Tata McGraw – Hill 3) Probability & Statistics with Reliability, Queuing and Computer Applications, Kishor S. Trivedi, Prentice Hall of India. CSPG-104: MANAGEMENT ACCOUNTANCY (3-0) Principles Of Accounting : Nature And Scope Of Accounting, Double Entry System Of Accounting, Introduction To Basic Books Of Accounts Of Sole Proprietary Concern, Closing Of Books Of Accounts And Preparation Of Trial Balance. Final Accounts : Trading, Profit And Loss Accounts And Balance Sheet Of Sole Proprietary Concern With Normal Closing Entries. (with numerical problems) Ratio Analysis: Meaning, Advantages, Limitations, Types Of Ratio And Their Usefulness.(Theory only) Fund Flow Statement: Meaning Of The Term Fund, Flow Of Fund, Working Capital Cycle, Preparation and Inter-preparation Of Statement. Costing: Nature, Importance And Basic Principles. Budget And Budgetary Control: Nature And Scope, Importance Method Of Finalization And Master Budget, Functional Budgets. Marginal Costing : Nature, Scope, Importance, Construction Of Break Even Chart, Limitations And Uses Of Break Even Chart, Practical Applications Of Marginal Costing.
- 7. (with numerical problems) Introduction To Computerized Accounting System: Coding Logic And Codes Required, Master Files, Transaction Files, Introduction To Documents Used For Data Collection, Processing Of Different Files And Outputs Obtained. Reference Books: 1) Introduction to Accountancy. T.S.Grewal, Sultan Chand and Sons 2) Management Accountancy, S .P.Jain 3) Introduction To Accounting, G.Agarwal. SECOND SEMESTER CSPG 105: THEORY OF COMPUTATION (3-0) Finite automata, regular expressions, push-down automata, context free grammars, pumping lemmas. Turing machines (deterministic, non-deterministic, multitape), Church-Turing Thesis, Decidability and undecidability, diagonalization, and reducibility, Halting problem, Post correspondence problem, Rice's Theorem, and other undecidability results Time and space complexity P vs. NP, NP-completeness, Cook's Theorem, and other NP- complete problems PSPACE, PSPACE-completeness, PSPACE-complete problems L vs. NL, NL-completeness, Savitch's Theorem, Immerman-Szelepcsenyi Theorem. Reference Books: 1) Michael Sisper, Introduction to the Theory of Computation, International Thompson Publishing. 2) Introduction to Languages and Theory of Computation, John C. Martin – McGraw Hill 3) Introduction to Automata Theory, Languages and Computation by J. E. Hopcroft and J. D. Ullman - PEARSON Education
- 8. CSPG-106: DATA AND FILE STRUCTURE (3-1) Data Structures: Basic Data Structures : Arrays, Linked Lists, Stack, Queue, Dequeue, Tree, Heap, Hash Table and Collision resolution. Basic algorithms for Creation, Manipulation of Data Structures. Internal Sorting Algorithms : Bubble, Heap, Quick Sort. Tape sorting and Merging. C as the programming language for implementation of these algorithms. File Structures: Primary File Organization: Sequential, Direct, Indexed Sequential. Multi-list File Organization, Inverted Files. File Sorting, Hashing Reference Books: 1) Lipshutz, Data Structure, McGraw Hill. 2) Standish, Data Structure, Addison-Wesley. 3) B. Salzberg, File Structures, Prentice-Hall. 4) A.L. Tharp, File Organization and Processing, John Wiley and Sons. 5) M. Tennenbaum, Y. Langsam and M. J. Augenstein, Data Structures using C, PHI. CSPG-107: OBJECT ORIENTED PROGRAMMING (3-1) Fundamentals of object oriented programming: Introduction to Object Oriented Paradigm, procedural Paradigm, An overview of classes, objects and Methods, inheritance and polymorphism. Basic of C ++: Structure of c++ program, data types and declaration, Expressions and operator precedence, Program flow control, functions, scope of variables, Inline functions and default arguments, dynamic allocation new and delete operators. Classes as objects, user defined data types, constructors & destructors, controlling and accessibility, class members, member functions, Friend functions, this pointer, static and const member functions. inheritance: Derived classes, syntax of derived classes, Types of Inheritance, Virtual Functions. and Virtual Base Classes. Adhoc Polymorphism: Overloading and Function selection, Friend Functions, overloading operators such as assignment subscripting, I/O, pointer to class member, new and delete. Templates : Generic Classes, Class Templates, Function Templates Parameterizing
- 9. Vectors, STL, Containers, Iterators, Function Adapters, String Library Exceptions : Using assert.h, signal.h, throwing exceptions, Try Blocks, handlers, Exception specification, standard exceptions and uses. I/O streams: Output and Input class streams, Ostream, Istream, File handling, using strings as streams UML: Basics, Use Case, Class, Object, Sequence, Activity, State Chart, Collaboration, Component and Deployment diagrams in Object oriented project design. Reference Books: 1) Object Oriented Programming using C++, Ira Pohl, PEARSON EDUCATION 2) Object Oriented Programming in C++ , Robert Lafore 3) UML in 21 Days, Tech Media CSPG-108: DIGITAL COMPUTER ORGANISATION AND ASSEMBLY LANGUAGE PROGRAMMING (3-1) Information Representation and Manipulation, Character Codes, Redundant Coding, Logic Gates, Switching Algebra, De-Morgan's Theorem, Switching function minimization using Karnaugh's map. Basic building blocks of digital computer: Flip flops. Registers, Counters, Multiplexer, etc. Basic Model of Stored Program Computer, Instruction sets : Reduced, Complex. Addressing Schemes, Instruction Execution mechanism, Organization of CPU, Memory Organization, RAM, ROM, Cache Memory, Associative memory Organization, I/O devices with special reference to modern peripheral devices, Data Transfer Schemes : Hand Shaking, Polling, DMA. I/O Processor. Overview of 32-bit Processors. Assembly Language Programming: Assembly Language of P-IV, Assembler, Machine Language Instruction Processor, Completeness of Instruction Set. Details of the instructions of P-IV with timing diagrams for instruction execution. Design of Assembly Language Programs for Common Application Problems such as Maximum finding, Summation, Sorting, Searching, Multiple Precision Arithmetic, etc. Reference Books 1) Malvino, Digital Computer Electronics, TMH. 2) Gaonkar, Microprocessor Architecture Programming Applications with 8085/8080A, Wiley Eastern. 3) J.P.Hayes, Digital System design and Microprocessor, McGraw Hill 4) J.P.Hayes, Computer Architecture and Organization, McGraw Hill. 5) M.M.Mano, Computer System Architecture, PHI. 6) Y. Yu and C. Marut, Assembly Language Programming and Organisation of the IBM PC, McGraw Hill.
- 10. THIRD SEMESTER CSPG-201: PRINCIPLES OF PROGRAMMING LANGUAGES (3-1) The Role of Programming Languages:- Toward Higher- level Languages, Problems of Scale, Programming Paradigms, Language Implementation Bridging the Gap Language Description: - Syntactic Structure: Expression Notations, Abstract Syntax Trees, Lexical Syntax, Context -Free Grammars, Grammars for Expressions, Variants of Grammars IMPERATIVE PROGRAMMING: Statements: Structured Programming:- The Need for Structured Programming, Syntax- Directed Control Flow, Design Considerations: Syntax, Handling Special Cases in Loops, Programming with invariants, Proof Rules for Partial Correctness, Control flow in C. Types: Data Representation:- The Role of Types, Basic Types, Arrays Sequences of Elements, Records: Named Fields, Unions and variant Records, Sets, Pointers: Efficiency and Dynamic Allocation, Two String Tables, Types and Error Checking. Procedure Activations:- Introduction to Procedures, Parameter-passing Methods, Scope Rules for Names, Nested Scopes in the Source Text, Activation Records, Lexical Scope: Procedures as in C, Lexical Scope: Nested Procedures and Pascal. OBJECT ORIENTED PROGRAMMING: Groupings of Data and Operations:- Constructs fro Program Structuring, Information Hiding, Program Design with Modules, Modules and Defined Types, Class Declarations in C++, Dynamic Allocation I C++, Templates: Parameterized Types, Implementation of Objects in C++. Object-Oriented Programming:- What is an Object?, Object- Oriented Thinking, Inheritance, Object-Oriented Programming in C++, An extended C++ example, Derived Classes and information Hiding, Objects in Smalltalk, Smalltalk Objects have self. FUNCTIONAL PROGRAMMING: Elements of Functional Programming:- A little Language of expressions, Types : Values and Operations, Function declarations, Approaches to Expression Evaluation, Lexical Scope, Type Checking. Functional Programming in a Typed Languages:- Exp loring a List, Function Declaration by Cases, Functions as First-Class Values, ML: Implicit Types, Data Types, Exception Handling in M, Little quit in Standard ML Functional Programming with Lists:- Scheme, a Dialect of Lisp, The Structure of Lists, List M anipulation, A Motivating Example: Differentiation, Simplification of Expressions, Storage Allocation for Lists.
- 11. OTHER PARADIGMS: Logic Programming:- Computing with Relations, Introduction to Prolog, Data Structures in Prolog, Programming techniques, Control in Prolog, Cuts. An Introduction to Concurrent Programming:- Parallelism in Hardware, Streams: Implicit Synchronization, Concurrency as interleaving, Liveness Properties, Safe Access to Shared Data, Concurrency in Ada, Synchronized Access to Shared variables. Reference Books: 1) Programming Languages – Concepts & Constructs , Ravi Sethi, Pearson Education. 2) Programming Languages – Design & Implementation ,Terrance W. Pratt, Marvin V. Zelkowitz, Pearson Education. 3) Concepts of Programming Languages – Robert L. Sebesta, Pearson Education. CSPG-202: DATABASE MANAGEMENT SYSTEM (3-1) DBMS Concepts: Data abstraction, database system architecture, Schemas and Subschemas, data independence. Physical Data Organization: Hashed, index file, B-tree. Data Models: Data modeling using entity relationship. Hierarchical and Network Model: DBTG proposals, data manipulation languages. Relational Model: Relational Algebra and Calculus, Storage organization for relations, Functional, Multivalued and Project-Join dependencies, Decomposition. Normal Forms: First, Second, Third, BCNF, Fourth and PJ normal forms. Relational Query language, Query processing, Query optimization: General strategies of optimization, Optimizing Algebraic Expression, Systematic Query optimization using cost estimate. Concurrent Operations on the Database: Basic Concepts, A simple Transaction Model, Model with Read- and Write-Locks, Read-only, Write-only Model, Concurrency for Hierarchically Structured Items, Protection against Crashes, Optimistic Concurrency Control. Principles of Distributed Databases, Framework for distribution. Translation of global queries into fragment queries. Query optimization and management of distributed transaction. Concurrency control and reliability in distributed databases. Administration of Distributed Databases. Example Systems. Reference Books: 1) R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Pearson Education/Addison Wesley. 2) Thomas Cannolly and Carolyn Begg, “ Database Systems, A Practical Approach to Design, Implementation and Management”, Pearson Education.
- 12. 3) Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”, McGraw Hill. 4) C.J.Date, A.Kannan and S.Swamynathan,”An Introduction to Database Systems”, Pearson Education. 5) Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”, McGraw Hill. CSP-203: DESIGN AND ANALYSIS OF ALGORITHMS (3-0) Elementary Data Structures, Basic Computational Models. Simple Algorithms. Analyzing Algorithms, Asymptotic Notation, Recurrence relations. Design Methods : General Consideration, Algorithm design paradigms and representative problems: Divide and Conquer (Binary search, Merge Sort, Quick Sort, Arithmetic with Large integers, etc.), Greedy Method (Minimal Spanning Tree, Shortest Paths, Knapsack, etc.), Dynamic Programming (Chained Matrix Multiplication, Optimal Storage on Tapes, Shortest Paths, Optimal Search Trees, etc.), Backtracking (8-queens problem, Graph Colouring, Hamiltonian Cycles, etc.), Branch and Bound (0/1 Knapsack problem, Travelling Salesperson, etc.), Approximation (Graph Colouring, Task Scheduling, Bin Packing, etc.), Probabilistic Algorithms (Numerical Integration, Primality Testing, etc.). Polynomial Evaluation and Interpolation, Fast Fourier transforms. Intractable Problems: Basic Concepts, Nondeterministic Algorithms, NP Completeness, Cook's Theorem, Examples of NP-Hard and NP-Complete problems. Problem Reduction. Lower Bound Techniques: Comparison tree, Reduction, Adversary argument. Reference Books: 1) Aho, J. Hopcroft and J.Ullman, The design and Analysis of Computer Algorithms, Addison Wesley. 2) E. Horowitz and S. Sahani, Fundamentals of Computer Algorithms, Galgotia, New Delhi. 3) S.E. Goodman and S.T. Hedetniemi, Introduction to the Design and Analysis of Algorithms, McGraw Hill. 4) G. Brassard and P.Bratley, Algorithmics, PHI. 5) S.K. Basu, Design Methods and Analysis of Algorithms, PHI. 6) T.H. Coremen, et. al, Introduction to Algorithm, PHI.
- 13. CSPG-204: COMPUTER NETWORKS (3-0) Foundations of Networking: Communication Networks – Network Elements – Switched Networks and Shared media Networks – Probabilistic Model and Deterministic Model – Data grams and Virtual Circuits – Multiplexing – Switching - Error and Flow Control –Congestion Control – Layered Architecture – Network Externalities – Service Integration – Modern Applications Quality of Service: Traffic Characteristics and Descriptors – Quality of Service and Metrics – Best Effort model and Guaranteed Service Model – Limitations of IP networks – Scheduling and Dropping policies for BE and GS models – Traffic Shaping algorithms – End to End solutions – Laissez Faire Approach – Possible improvements in TCP –Significance of UDP in inelastic traffic High Performance Networks: Integrated Services Architecture – Components and Services – Differentiated Services Networks – Per Hop Behaviour – Admission Control – MPLS Networks – Principles and Mechanisms – Label Stacking – RSVP – RTP/RTCP High Speed Networks: Optical links – WDM systems – Optical Cross Connects –Optical paths and Networks – Principles of ATM Networks – B-ISDN/ATM Reference Model – ATM Header Structure – ATM Adaptation Layer – Management and Control – Service Categories and Traffic descriptors in ATM networks Network Management: ICMP the Forerunner – Monitoring and Control – Network Management Systems – Abstract Syntax Notation – CMIP – SNMP Communication Model – SNMP MIB Group – Functional Model – Major changes in SNMPv2 and SNMPv3 – Remote monitoring – RMON SMI and MIB Reference Books: 1) Larry L. Peterson and Bruce S. Davie: Computer Networks – A Systems Approach, Elsevier. 2) Behrouz A. Forouzan: Data Communications and Networking, Tata McGraw Hill. 3) William Stallings: Data and Computer Communication, Pearson Education. 4) Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts and Key Architectures, Tata McGraw-Hill. FOURTH SEMESER CSPG-205: COMPUTER GRAPHICS (3-1) Introduction: Display of entities, Geometric computation and representation, Graphics Environments; Working Principles of display devices: refreshing raster scan devices, vector devices, Cathode Ray Tube Terminals, Plotters; Display of colors: Look Up Tables, display of gray shades, Half toning;
- 14. Display and drawing of graphics primitives: point, line, polygon, circle, curves and text; Coordinate Conventions: world coordinates, device coordinates, normalized device coordinates, view-port and window, zooming and panning by changing coordinate reference frames; Computations on polygons: point inclusion problem, polygon filling, polygon intersection, clipping, polygonization of a point set, convex hull computation, triangulation of polygons; Transformations in 2D and 3D: translation, rotation, scaling, reflection, Projection: perspective and parallel projections, isometric projection, Transformation matrices; Volume and Surface Representation: polygonal meshes, parametric curves and surfaces, Cubic and Bicubic Splines, Voxel, Octree and Medial Axis representation, Sweep Representation, Surfaces and Volumes by rotation of curves and surfaces, fractal modeling; Hidden surface and line elimination: Elimination of back surfaces, painters' algorithms, Binary Space Partitioning Tree; Rendering and Visualization: Shading model, Constant, Goraud and Phong Shading, Ray tracing algorithm, Radiosity Computation; Computer Animation: fundamental concepts. Reference Books: 1. James D. Foley, Andries Van dam, Steven K. Feiner & John F. Hughes, Computer Graphics – Principles and Practices, Pearson Education. 2. Donald Hearn and M Pauline Baker, Computer Graphics, PHI 3. Woo, Neider, Davis, Shreiner, “Open GL Programming Guide”, Pearson Education. 4. David F. Rogers, Procedural Elements for Computer Graphics, Tata-McGraw Hill. CSPG-206: OPERATING SYSTEMS (3-1) Unit I: Concepts, Processes and Threads Operating system as an Extended Machine and as a Resource Manager, Operating system concepts (Files, Deadlocks, Memory Management, Input/Output, Processes, The Shell, Security), The evolution of Operating Systems (Serial Processing, Simple Batch Systems, Multiprogrammed Batch Systems, Mainframe Operating Systems, Server Operating Systems, Time Sharing Systems, Multiprocessor Operating Systems, Real-Time Systems, Embedded Operating Systems, Smart Card Operating), System Calls (Process Management, File Management, Directory management), Introduction to Processes (The Process Model, Process Creation, Process Termination, Process Hierarchies, Process States, Implementation of Processes, Process Control Block), Threads (The Thread Model, Thread Usage, Implementing Threads(In User Space and Kernel), Scheduler Activation, Pop Up Threads, Interprocess Communication (Race conditions, Critical Sections, Mutual Exclusion with Busy Waiting, Sleep and wakeup, Semaphores, Mutexes, Monitors, Message Passing), Classical IPC problems (The Dining Philosophers Problem, The Sleeping Barber Problem), Process Scheduling (Scheduling in Batch Systems, Scheduling in Batch Systems, Scheduling in Interactive Systems, Scheduling in Real-Time Systems, Thread Scheduling) Unit II: Deadlocks and Memory Management
- 15. Resources, Deadlock (Conditions for Deadlock, Deadlock modeling), Deadlock detection and recovery, Deadlock avoidance, Deadlock prevention Memory management without swapping or paging (Monoprogramming without swapping or paging, Multiprogramming with fixed partitions, Relocation and Protection), Swapping, Virtual Memory (Paging, Page Tables), Page Replacement Algorithms (Not-recently-used, First in first out, Second Chance page replacement algorithm, The Clock Page Replacement Algorithm, Least Recently used page replacement algorithm, The Working Set Page Replacement Algorithm, Modeling Paging Algorithms (Belady‟s Anomaly, Stack Algorithms, Predicting page fault rates), Design issues for Paging Systems, Implementation issues, Segmentation (Implementation of pure segmentation, Segmentation with Paging: MULTICS) Unit III: Input/Output and File Systems Principles of I/O hardware (I/O devices, Device Controllers, Direct memory access), Principles of I/O software, I/O Software Layers, Disks (Disk hardware, disk formatting, disk arm scheduling algorithms, Error handling, Track-at-a-time caching, RAM disks) Clocks (Clock hardware, Clock software), Terminals (Terminal hardware, Input software, Output software) Files (File Naming, File structure, File types, File access, File attributes, File operations, Memory mapped files), Directories, File System layout (Implementing files, Implementing directories, Shared files), Security (The security environment, Generic Security Attacks, Design Principles For Security, User Authentication), Protection mechanisms (Protection Domains, Access Control Lists, Capabilities, Multilevel Security, Covert Channels), Type of File Systems (FAT, VFAT, FAT32, NTFS) Unit IV: Introduction to Linux OS design –Case study Overview of Unix, Processes in Unix (Fundamental Concepts, Process Management System Calls in Unix, Implementation of Processes in Unix), Memory Management in Unix, Input/Output in Unix, The Unix File System, Security in Unix Reference Books: 1) Tanenbaum, Modern Operating Systems, PHI (EEE) 2) Milenkovic, Operating Systems: Concepts and Design, McGraw Hill. 3) Sillberschatz et. al, Operating Systems, Wiley India. 4) W.R. Steveans, Advanced Progamming in the UNIX Environment, Addison Wesley. 5) M.J. Bach, The Design of the UNIX Operation System, PHI(EEE). 6) Singhal and Shivaratri, Advanced Concepts in Operating Systems, TMH CSPG-207: SOFTWARE ENGINEERING (3-1) Introduction to Software Engineering : Software development and life cycle; Project size and its categories; Planning a software project; Project-control and Project-team standards; Design of solution strategies; Software cost estimation and evaluation techniques. Software
- 16. Design: Various design concepts and notations; Modern design techniques; Verification and Validation methods; Documentation and implementation procedures; Performance of software systems; Software metrics and models. Documentation of Project-systems, manuals and implementation. Software Reliability: Definition and concept of software reliability; software errors, faults, repair and availability; Reliability and availability models; Use of database as a study tool. Reference Books: 1) R.E. Fairley, Software Engineering Concepts, McGraw-Hill. 2) D.A.Lamb, Software engineering, PHI. 3) Jalota, Software Engineering, Narosa Publishing House. 4) R.S. Pressman, Software Engineering, McGraw-Hill. 5) R. Mall, Fundamentals of Software Engineering, PHI. CEPG-208: DATA WAREHOUSING AND DATA MINING (3-1) Data Warehousing Concept of Data Warehouse, Differences between Operational Databases and Date Warehouse, Multi-dimensional Data Model, Schemas for Multi-dimensional Databases, Data Cube Representations, Data Warehouse Architecture, OLTP vs OLAP, Efficient Query Processing in data Warehouses, Indexing of OLAP data, Meterialization concept; Data Mining Data Clustering: Partitioning, Hierarchical, Density-based, Grod Based and Model Based Methods; Classification & Prediction: Decision Tree Techniques, Back-Propagation Method, Bayesian Method Association Rule Mining Techniques: Frequent Itemset Generation, Apriori, Horizontal Method, Sampling Approach, Hashing Approach; Dynamic Association Rule Mining; Mining of Complex Types of Data: Mining of Spatial Databases, Multimedia Databases, Time-series and sequence Data, Text Databases, WWW Data; Reference Books: 1) Jiawei Han and Micheline Kamber, „Data Mining: Concepts and Techniques, Morgan Kaufmann, India 2) A K Pujari, „Data Mining Techniques, University Press, India 3) Han, Manilla and Smyth, „Principles of Data Mining‟, PHI, India
- 17. FIFTH SEMESTER CEPG-301: COMPILER DESIGN (3-1) Compiler structure: analysis-synthesis model of compilation, various phases of a compiler, tool-based approach to compiler construction. Lexical analysis: interface with input, parser and symbol table, token, lexeme and patterns. Difficulties in lexical analysis. Error reporting. Implementation. Regular definition, Transition diagrams, LEX. Syntax analysis: CFGs, ambiguity, associativity, precedence, top down parsing, recursive descent parsing, transformation on the grammars, predictive parsing, bottom up parsing, operator precedence grammars, LR parsers (SLR, LALR, LR), YACC. Syntax directed definitions: inherited and synthesized attributes, dependency graph, evaluation order, bottom up and top down evaluation of attributes, L- and S-attributed definitions. Type checking: type system, type expressions, structural and name equivalence of types, type conversion, overloaded functions and operators, polymorphic functions. Run time system: storage organization, activation tree, activation record, parameter passing, symbol table, dynamic storage allocation. Intermediate code generation: intermediate representations, translation of declarations, assignments, control flow, Boolean expressions and procedure calls. Implementation issues. Code generation and instruction selection: issues, basic blocks and flow graphs, register allocation, code generation, dag representation of programs, code generation from dags, peep hole optimization, code generator generators, specifications of machine. Reference Books: 1) V. Aho, R. Sethi, and J. D. Ullman: Compilers: Principles, Techniques and Tools, PEARSON Education. 2) C. Fischer and R. LeBlanc: Crafting a Compiler in C , PEARSON Education. 3) I. Holub: Compiler Design in C, PHI 4) Andrew W. Appel and Maia Ginsburg: Modern Compiler Implementation in C, Cambridge Press. CSPG-302: COMPUTER ARCHITECTURE (3-0) Introduction: review of basic computer architecture, quantitative techniques in computer design, measuring and reporting performance. CISC and RISC processors.
- 18. Pipelining: Basic concepts, instruction and arithmetic pipeline, data hazards, control hazards, and structural hazards, techniques for handling hazards. Exception handling. Pipeline optimization techniques. Compiler techniques for improving performance. Hierarchical memory technology: Inclusion, Coherence and locality properties; Cache memory organizations, Techniques for reducing cache misses; Virtual memory organization, mapping and management techniques, memory replacement policies. Instruction-level parallelism: basic concepts, techniques for increasing ILP, superscalar, superpipelined and VLIW processor architectures. Array and vector processors. Multiprocessor architecture: taxonomy of parallel architectures. Centralized shared-memory architecture: synchronization, memory consistency, interconnection networks. Distributed shared-memory architecture. Cluster computers. Non von Neumann architectures: data flow computers, reduction computer architectures, systolic architectures. Reference Books: 1) Hennessey and Patterson: Computer Architecture A Quantitative Approach, Elsevier. 2) Kai Hwang: Advanced Computer Architecture - Parallelism, Scalability, Programmability, Tata McGraw Hill. CSPG-331: ARTIFICIAL INTELLIGENCE (3-0) Introduction: AI problem; AI techniques, problem as a state space search, Production Systems, Issues in design of search programs. Heuristic Search Techniques: Generate and test, Hill Climbing, Best-First Search, Problem reduction, Means- Ends analysis. Knowledge Representation: Knowledge representation issues, Predicate logic, knowledge representation using rules, weak slot-and-Filler structure. Natural Language Processing: Syntactic processing, semantic analysis, Discourse and pragmatic processing. Expert Systems: Representation using domain knowledge, Expert System shell, knowledge acquisition. References Books: 1) Artificial Intelligence: E. Rich & K. Knight, Tata McGraw Hill. 2) Principles of Artificial Intelligence, N.J. Nilson, Narosa Pub. House.
- 19. CSPG-332: OPERATIONS RESEARCH (3-0) Overview of operations Research: OR models – OR Techniques Linear Programming : Introduction – Graphical solution; Graphical sensitivity analysis – The standard form of linear programming problems – Basic feasible solutions - unrestricted variables – simplex algorithm – artificial variables – Big M and two phase method – Degeneracy - alternative optima – unbounded solutions – infeasible solutions. Dual problems : Relation between primal and dual problems – Dual simplex method Transportation model: starting solutions. North West corner Rule - lowest cost method – Vogels approximation method – Transportation algorithms – Assignment problem – Hungarian Method. Network Models : Definitions – CPM and PERT – Their Algorithms Integer Programming : Branch and Bound Algorithms cutting plan algorithm. Dynamic Programming: Recursive nature of dynamic programming – Forward and Backward Recursion Deterministic Inventory Models : Static EOQ Models – Dynamic EOQ models. Game theory: Two person Zero Sum Games – Mixed strategy games and their Algorithms. Reference Books: 1) Operations Research – An Introduction, Handy A Taha, Pearson Education. 2) Operations Research, Panneer Selvan, Prentice Hall of India. 3) Operation Research, Hira and Gupta, S.Chand CSPG-333: INFORMATION SECURITY (3-0) Introduction to Cryptography: Terminology, Security Aspects, Attack Models, Classical Cryptography, Shift Cipher, Substitution Cipher, Vigenere Cipher, Basic Cryptanalysis Mathematics of Cryptography: Groups, Rings, and Fields, Integer Arithmetic, Modular Arithmetic, The Euclidean Algorithm, Finite Fields of The Form GF(p), Polynomial Arithmetic, Finite Fields Of the Form GF(2n ), Linear Congruence Introduction to Number Theory: Prime Numbers, Primality Testing, Factorization, Fermat's and Euler's Theorems, Testing for Primality, The Chinese Remainder Theorem, Discrete Logarithms
- 20. Conventional Encryption: Attacks on Encryption Schemes, Perfect Security, Cipher Machines, Modes of Operation (ECB, CBC, CFB, OFB) , Multiple Encryption , DES, Triple- DES, AES,RC4 Stream Cipher , Attacks on DES. Pseudo-random Number Generators (PRNGs): Random and Pseudorandom Numbers, Next- bit Test, Removing Biases, ANSI X9.17 Generator Blum-Blum-Shub Generator, Statistical Tests. Hash Functions and MAC: Standard hashes (MD5, SHA-1, SHA-256/384/512, RIPEMD- 160), Birthday Attack , Collisionfreeness and recent attacks , Message Authentication Code (MAC) Algorithms , Authenticated Encryption Key Establishment and Public-key Cryptography: Key Management, Diffie-Hellman Key Exchanga ,Attacks on Diffie Hellman, RSA, , Attacks on RSA , ElGamal , Attacks on ElGamal , Semantic Security and Chosen-ciphertext Security, Provably Secure Schemes Integrity and Digital Signature: Message Integrity, Digital Signature, Authentication Protocol, Digital Signature Standards, Attacks on Digital Signature, Variation and Applications Reference Books: 1) William Stallings, Cryptography and Network Security, Principles and Practice, Prentice Hall India. 2) Behrouz A Forouzan, Cryptography & Network Security, Tata McGraw-Hill Publications 3) Atul Kahate, Cryptography and network security, TMGH CSPG-334: PATTERN RECOGNITION (3-0) Bayes Decision Rules for two Class problem, Bayes maximum likelihood rule, minimum distance classifier, error probabilities for classifier, Mahalanobis distance, Bound for error probabilities, Estimation of parameters, Learning. Single layer perceptron Clustering, Minimum within cluster distance critewrion, k-menas algorithm single linkage, complete linkage and average linkage algorithms, Isodata algorithm etc. Feature Selection: Algorithms for feature selection such as Branch and Bound, Sequential forward and backward selections, GSFS and GSBS, (L, R) algorithm, Criterion function: Probabilistic Separability criterion, error probability based criterion, entropy based criterion, minimum within class distance based criterion, probabilistic independence, Principal Component Analysis Fuzzy Set-theoretic Pattern Recognition: Usual Fuzzy set theoretic operations –union, intersection etc., Multitvalued Logic: Zade Compositional Rule of inference, Fuzzy C-means algorithm, Supervised Classification: Multitvalued Recognition System, Fuzzy set theoretic based feature selection criteria.
- 21. Reference Books: 1) Duda and Hart, “Pattern Classification ad Scene Analysis”, John Willey. 2) P.A. Devijver and J. Kittler, “Pattern Recognition: A Statistical Approach”. 3) K. Fukunga, “Introduction to Statistical Pattern Recognition”, Academic Press 4) S.K. Pal and Dutta Mazumdar, “Fuzzy Set Theroetic Methods for Patern Recognition”, John Willey. CSPG-304: SYSTEM PROJECT – I (0-4) SIXTH SEMESTER CSE-305: SYSTEM PROJECT – II (0-12)