You are on page 1of 35


(Effective - 2010 Admission onwards) Semester I
Course Code CAS2101 CAS2102 CAS2103 CAS2104 CAS2105 CAS2106 Total Semester II Course Code CAS2201 CAS2202 CAS2203 CAS2204 CAS2205 CAS2206 Total Semester III Course Code CAS2301 CAS2302 CAS2303 CAS2304 CAS2305 CAS2306 Total Semester IV Course Code CAS2401 CAS2402 CAS2403 CAS2404 CAS2405 CAS2406 Total Semester V Course Code CAS2501 CAS2502 CAS2503 CAS2504 CAS2505 CAS2506 Total Semester VI Course Code CAS2601 Total C – Core Paper Project Work and Viva-Voce C/E C Internal 200 Marks External 200 Credit 16 16 E - Elective Paper Networks and Data Communications Simulation and Modelling Elective 1 Elective 2 Elective 3 Seminar Viva-voce (Internal) C/E C C E E E C C Internal 50 50 50 50 50 100 100 Marks External 50 50 50 50 50 0 Credit 4 3 3 3 3 3 19 Paper Software Engineering Artificial Intelligence Elective 1 Elective 2 Mini Project Work Lab 4 + Viva-Voce C/E C C E E C C Internal 50 50 50 50 50 50 Marks External 50 50 50 50 50 50 Credit 3 3 3 3 3 2 17 Paper System Software Data Base Management Systems Computer Algorithms Operating System Elective 1 Lab 3 + Viva-Voce C/E C C C C E C Internal 50 50 50 50 50 50 Marks External 50 50 50 50 50 50 Credit 3 3 4 4 3 2 19 Paper Computer Graphics Data Structures using C Object oriented Programming with C++ Applied Numerical Analysis Elective 1 Lab 2 + Viva-Voce C/E C C C C E C Internal 50 50 50 50 50 50 Marks External 50 50 50 50 50 50 Credit 3 3 4 3 3 2 18 Paper Combinatorics & Graph Theory Computer Organization Programming in C Discrete Mathematical Structures Computer Based Optimization Lab 1 + Viva-Voce C/E C C C C C C Internal 50 50 50 50 50 50 Marks External 50 50 50 50 50 50 Credit 4 4 3 3 3 2 19

List of Electives
Second Semester

E1 - Number Theory. E2 - Number Theory and Cryptography. E3 - Applied Probability and Statistics.

Third Semester

E4 - Web Commerce Technologies. E5 - Object Oriented Design. E6 - Security in Computing. E7 - Embedded Systems. E8 - Linux System Programming. E9 - Basic Java Programming.

Fourth Semester & Fifth Semester

E10 - Linux Internals. E11 - Compiler Design. E12* - Advanced JAVA Programming E13* - Advanced JAVA Mobile Programming E14* - Web enabled JAVA Programming. E15 - Data Mining (prerequisites CAS 220x-Applied Probability and Statistics). E16 - Software Project Management. E17 - Cryptography and Network Security. E18 - Intelligent Systems. E19 - Visual Programming VB.Net. E20 - Digital Image Processing. E21 - Software Quality. * Only one of the electives from E12, E13 and E14 is allowed to select during the IV and V semesters.

CAS 2101 - Combinatorics and Graph Theory
Unit 1 Selections and Binomial Coefficients: Permutation and Combination, Ordered Selections, Unordered Selections, Pairing Problems, Pairing within a set, Pairing between sets, An optimal assignment problem, Gale’s optimal assignment problem, Recurrence relations, Generating functions, The inclusion-exclusion principle, Rook polynomials. Unit 2 Block designs and Error-correcting codes: Block designs, square block designs, Hadamard configurations, Error-correcting codes, Steiner systems and sphere packings, Steiner systems, Leech’s lattice. Unit 3 Graphs and trees: Incidence and degree, Isomorphism, Subgraphs and union of graphs, Connectedness, Walks, Paths and circuits, Components, Connectedness Algorithm, Shortest path Algorithms, Eulerian graph, Hamiltonian graph- necessary and sufficient conditions, Traveling salesman problem, Bipartite graphs, Properties of trees, Centre of a tree, Rooted and binary trees, Spanning trees, Fundamental circuits, Spanning trees of a weighted graph, cutsets and cut-vertices, Fundamental cutsets, connectivity, separable graphs, Network flows, Max-flow Min-cut theorem Unit 4 Planar graphs, combinational and geometric duals, Kuratowski’s graphs, Detection of planarity, thickness and crossings, Matrix representations of graphs, Incidence matrices, Adjacency matrices and their properties, Chromatic number, Chromatic polynomial, the five color theorem, the four problem. Unit 5 Directed graphs: Binary relations, directed graphs and Connectedness, Directed trees, Arboresence, Polish method, Tournaments, Counting labeled trees, Cayley’s theorem, Counting methods, Polya Theory, Applications of graphs in Computer Science. Text Books: 1. Ian Anderson, ‘A First Course in Combinatorial Mathematics’, Clarendon Press, Oxford, 1974 2. Deo, N, ‘Graph Theory with Applications to Engineering and Computer Science’, Prentice-Hall Inc.,1974 References: 1. Harrary F, ‘Graph Theory’, Addison Wesley Publ. Comp., 1972. 2. Trembley J P & Manohar R P ‘Discrete Mathematical Structures with Applications to Computer Science’, Mc-Graw Hill, 1975. 3. Krishnamurthy V, ‘Combinatorics: theory and applications’, West Press Pvt. Ltd 1985. 4. Doerr A & Levasseur K, ‘Applied Discrete Structures of Computer Science’, Galgotia Pub.Pvt.Ltd, 1986 *****

Multiple-bus organization. Basic Operational Concepts. 5th Ed. ‘Structured Computer Organization’. ‘Computer hardware and Organization’. Conversion of Real Number. 3. Practical Implementation of logic gates. Interrupts. logic Gates. Direct Memory Access.Basic Logic Functions. Floating point numbers and Operations. Data hazards. ACII and ISCII codes.S. 1976. Signed Operand Multiplication. Minimization of logic. Zvonko Vranesic. Interface Circuits. Tanenbaum A. 5/e. McGraw Hill. Unit 4 Basic processing Unit – Fundamental Concepts. Virtual Memories. Integer division. Dhanpat Rai Publications. 2001.Computer Organization (Revised June 2008 ) Unit 1 Introduction – Basic Structure of Computers – Computer Types. 4. 5th Ed. Secondary Storage. ‘Fundamentals of Microprocessors and Micro Computers’. Addressing modes. Safwat Zaky. Assembly Language. 2002. Multiplication of positive. Memory Management Requirements. Binary Coded decimal. Synthesis of logic functions. Shift Register. Prentice Hall of India. EBCDIC Code. Encoders/decoders. Representation of negative number. Performance Considerations. 2. Science Research Associates. Text Book: 1. 2nd Ed. ‘Computer Architecture and Organization’. Latch. Hardwired control. Software. Unit 3 The Memory System – Some Basic Concepts. Multiprocessors and Multicomputers. 2. Bus Structures. Basic I/O operations. ***** . superscalar Operation. Instruction Hazards. Prentice Hall of India 2006. Counters.Addition and Subtraction of signed numbers. Influence on instruction sets. Flip-Flops. Buses. Cyrix Microprocessors. Arithmetic. Intel Pentium. Datapath and control consideration Computer Peripherals – Input Devices. Number System and Digital Electronics – Introduction. Memory operations. Ipelining – Basic concepts. 3rd Ed. Subroutines.CAS 2102 . Tata McGraw-Hill. 8086 Instructions. Hexadecimal Number System. Unit 5 Typical Micro processors – Intel 8086. Serial Communication Links. Microprogrammed control. 1993. Register. Hayes. Encoding of Machine Instructions. Boolean Algebra. Sloan M E. 1988. Additional Instructions. Code converters. Octal Number System. Standard I/O Interfaces. numbers. Latest Processors. Performance. Execution of a complete instruction. References: 1. Logic circuits . (3rd 1990) Mano M M. Combinational and sequential circuits. Functional Units. ‘Computer System Architecture’. Unit 2 Machine Instructions and programs – Memory locations and addresses. Cache Memories. Carl Hamacher. Output devices. Input-Output organization – Accessing I/O devices. Intel 80486. Semiconductor RAM Memories. AMD Microprocessors. B. Read-Only Memories.Ram. Synthesis with NAND and NOR Gates. ‘Computer Organization’. Stacks and Queues.

Schaum’s outline series. McGraw-Hill. Bitwise operators.What is C. Increment and Decrement operators. Unit 4 Introduction to Pointers-Pointers and Addresses. Multi dimensional arrays.Loops – while. Structures and Unions-Basics of Structures. Keywords Data Types . Assignment operators and expressions. Text Book: Kernighan. Pointers vs. Miscellaneus Functions. Arrays – General Concepts.Identifiers. Address Arithmetic. ‘The C Programming Language’. Self-Referential Structures. Pointers and Arrays.CAS 2103 . Operator Precedence and associativity.File inclusion. Declaring variables using storage classes. BPB Pulication. Call by reference. 1987 2. Byron Gottfried. Symbolic Constants. Call by value. How C looks. ‘Programming with C’. . 2005 3.Preprocessors . Error Handling-Stderr and Exit. Break and Continue. Pointers to function. Recursive functions .Concept of header files. 2nd Ed. Scope Rules. Array Declaration. Variables – Declaration of variables. References: 1. Complicated Declarations Unit 5 Files -File Access. 6th Ed. Table Lookup. Typedef. 2007. Brain W & Ritchie. General Concepts. initialization. Yashavant Kanetkar .Multidimensional Arrays.Primary Data types.Constants. Relatonal and Logical operators. switch.Programming in C (Revised June 2008) Unit 1 Introduction . initialization. Arrays of Structures. Conditional operator. do while. Line input and output.. . One dimensional Arrays.Data type Conversions –Implicit and Explicit Conversions. Bit-fields. Les Hancock & Morris Krieger. for. Pointers to Pointers. C Character Set.Storage Class Specifiers. Macro substitution. Command-line Arguments. Unions. Unit 2 Storage Classes . 2nd Ed.Function returning non-integers. Go to and labels Unit 3 Functions –General concept of functions. sizes.if else. ‘The C Primer’. Initiallization of Pointer Arrays. Character Pointers and Functions. Pointer Arrays. Control Structures – Statement and Blocks. Structures and Functions. Dennis M. 2002. Unary Operators. Prentice Hall. ‘Let Us C’. Pointers to Structures. Conditional inclusion. Operators Arithmetic operators (Binary operator). Pointers and Function Arguments. else if.

2.V. Counting Principles.CAS 2104 . John Truss. Unit 4 Boolean Algebra and Combinatorial Circuits.P. 2nd Ed. John E.Grimaldi & B. Matrices. Mc. Deterministic Finite Automata. 2008. Linear Diophantine Equations. Ralph P. Binary Operations. & Manohar R.Malik & M. Combinations. Relations. Linear Homogeneous Recurrence Relations. Pearson. Partially ordered sets. Trembley J. Cengage Learning. Quantifiers and First – Order Logic. ‘Discrete Mathematical Structures: Theory and Applications. Pearson. Lattices. ‘Discrete Mathematical Structures with Application to Computer Science’. Validity of Arguments. Proof Techniques.Ullman. Generalized Permutations and Combinations. 4. Two-element Boolean Algebra.Hopcroft & Jeffery D. ‘Discrete Mathematics for Computer Scientists’. Karnaugh Maps and Minimization of Boolean Expressions.S. Basic Counting Principle.5th Ed. Equivalence relations. 3. Text Book: D. 2008. Mathematical Logic. Nondeterministic Finite Automata.Graw Hill. Algorithms. Narosa Publishing House.P. Unit 5 Finite Automata and Languages – Finite Automata and Regular Languages. Unit 3 Recurrence Relations. Languages and Computation’. 2001. Grammars and Languages. Unit 2 Matrices and Closures of Relations. ‘Introduction to Automata Theory. Linear Non homogeneous Recurrence Relations. 2007.K Sen. . Pigeon hole Principle. Pumping Lemma. ‘Discrete and Combinatorial Mathematics’. Permutations. Logical Gates and Combinatorial Circuits.Ramana. Logic and Algorithms – Sets. The Matrix of a Relation and Closures. Boolean Algebra. 2008. Equivalence Classes and Partitions. closures. Integers and Mathematical Induction. References: 1. Sequences and Recurrence Relations.Discrete Mathematical Structures (Revised July 2010) Unit 1 Foundations: Sets.

Mc Millan Claude Jr. Branch and found Techniques. 1982 Churchman C W & Arnchoff E L. Assignment ..death processes. London. Hillier F S & Liberman G J. John Wiley and sons. 3rd Ed. East-West. Duality Dual simplex method. Wiley Series. sensitivity analysis Principles of simplex method. 1982. Binary Linear & Travelling salesman problems.Computer Based Optimization Unit 1 Programming. 1974. Gillet B G. New Delhi. 2nd Ed. Holden Day Inc. Srinath L. 2nd Ed. 1979. 2nd Ed..Finite customer population with single servers ( M/M/I/M)-15. Taha. Structures of basic queuing systems – Definition and classification of stochastic processesdiscrete. Prentice Hall.Mathematical Model. Unit 2 Special types of Linear programming problems. 1979. ‘Introduction to Operation Research: a computer oriented algorithmic approach’. Birth-death queuing systems: The classical system-Discouraged arrivalsInfinite number of servers (M/M/n)-m server case M|M/m ) – Finite storage(M/M/I/K).time Markov Chains – Continuous Markov Chains.S. ‘Operations Research’.Transportation and assignment problems Unit 3 Integer Programming: Introduction. ‘Introduction to Operations Research’.. References: 1. ‘Mathematical Programming’. ‘Linear Programming’. 7. ‘Foundations of optimisation’. Unit 4 Dynamic programming: Deterministic and Probabilistic Dynamic programming Unit 5 Queuing Model: Specification and measure of queuing systems. **** programming. 5. Beightler C S & Philips D T. 1976. assumptions of linear programming.CAS 2105 . 2. 3. 4. Mc Millan Publishing Company. Mc Graw Hill Book Comp. ‘Introduction to Operations Research’.Birth. 6. Applications.

Other transformations. interactive picture-construction techniques. James D et. Computer Animation:Design of Animation Sequence. Attributes of output primitives: Line. Cicrclegenerating algorithms. area-fill. Text Book: Hearn. Output Primitives: Points and Lines. Physically based modeling. Line-Drawing Algorithms. Newmann. Affine transformations.Ray-tracing methods. Composite Transformations. M Pauline. Spline Representations. character generation. Line clipping. Raster Scan Systems. ‘Introduction to Computer Graphics’. Filled-Area primitives. Mc Graw Hill. Sweep representations. Depth-sorting method. Beizer curves and surfaces. Back-face detection. Motion specifications.. BSP tree method. Geometric construction of Deterministic Self-similar fractals. Constructive solid-geometry methods. Clipping Visible Surface-detection methods: Classification. basic illumination models. Affie Fractal-Construction Methods. Hierarchical modeling with structures. References: 1. polygon clipping. Addison Wesley. Projections. curve. Three Dimensional Concepts and object representations: Three-dimensiuonal display methods. Modeling and coordinate transformations. Fractal dimension. Unit 4 Three –Dimensional Geometric and modeling transformations and viewing: Translation. Unit 3 Structures and hierarchical modeling: Basic modeling concepts. Polygon-Rendering Input functions. Viewing Pipeline. Composite transformations. ‘Computer Graphics’. Shape Grammars and other procedural methods. Twodimensional Viewing: The viewing pipeline viewing coordinate reference frame. Viewing volumes and general projection transformations. 2002. Robert F. FractalGeometry methods: Fractal-Generation Procedures. a buffer method. ***** . Classification of Fractals. 1981. 2nd Ed. Unit 5 Illumination models and surface-renderingmethods: Light sources. Graphical User interfaces and interactive input methods: Input of graphical data. Pearson Education. window-toviewport coordinate transformation. Visualization of data sets. are-subdivision method. BSP trees. curve. 1994. Elipse generating algorithms. Antialiasing Unit 2 Two Dimensional Geometric Transformations: Basic transformations. Raster animations. 2. Scharacter and bundled attributes. Random Midpoint-Displacement Methods.Computer Graphics Unit 1 Overview of Graphics Systems: Video display devices. Viewing Coordinates. William M & Sproull. Graphics Software. Scaling. Donald & Baker.CAS 2201 . Other transformations. Raster methods for transformations. Transformations between coordinate systems. Key-frame systems – Morphing. Clipping operations. scan-line method. ‘Principles of Interactive Computer Gaphics’. Matrix representation and Homogeneous coordinates. Random Scan Systems.. Octrees. Rotation. Foley. Wire frame methods. text and exterior clipping.

Arrays.Removal of recursion – Examples Unit 5 Sorting algorithms – Quick sort. ‘Fundamentals of data structures’.Backtracking .CAS 2202 . Introduction to C++ . 1985.Wesley. Default arguments. Pointers. Operators. 2. Queues. Control flow. 1978. Binary search tree. ‘The Art of Computer Programming Vols.Niclaus. Unit 2 Trees-Ordered trees. Different types of constructors. 1976. ‘Data Structures with Pascal’.Object Oriented Programming with C++ (Revised June 2008) Unit 1 Introduction to Object oriented paradigm. Unit 2 Classes and objects. Wirth. Stacks. Const objects and Const member Functions. Unit 3 Heap-Binomial Heap. Unit 4 Recursion . Destructors. applications of queues-simulation. Container classes. implementation details. Storage classes and linking. Addison . Applications of OOP. Threaded binary trees.1 & 2’.I/O Streams. Strings. Hash functions. Object initialization and cleanup-Constructors. Tanenbaum. Friend functions. postorder and preorder – traversal. Functions.Data Structures Using C Unit 1 Arrays. Inline functions. Merge sort and Count sort Text Book: Horowitz E & Sahni S. Knuth D. Heap sort. ‘Algorithms + Data structures = Programs’. Function Overloading. insertion and deletion. 3. Lists. Fibonacci Heap. AVL tree. ***** CAS 2203 . Prentice Hall International. File streams. A. Prentice Hall International. Computer Science press. Radix sort.inorder. Basic concepts of Object oriented programming. Datatypes and declarations. M J. References: 1. 1970-80. Unit 3 .M & Augenstein. RED BLACK tree. Reference variables. Static members and functions.

Muller’s Method. ‘The C++ programming language’. Bezier curves Polynomials Approximation of surfaces. Namespace. Abstract classes. Exception handling. ‘The Complete Reference C++’. Unit 5 Templates-Function Templates. Condition numbers and Errors in Solutions. Extrapolation Techniques. Getting Derivatives and Integrals Numerically. 2. Derivatives from Difference Tables. Unit 2 Solving Sets of Quations: Computing the forces in a Planar Truss. Bjarne Stroustrup. Multiple Integrals. this pointer. Casting. Convergence Criteria. ‘Object Oriented Programming in C++’. 1999. Newton-Cotes Integration formula. Interpolating with a cubic Spline. Unit 3 Interpolation and Curve Fitting: An Interpolation Problem. **** CAS 2204 . Simpson’s Rules.APPLIED NUMBERICAL ANALYSIS Unit 1 Solving Nonlinear Equations:. Evenly Spaced Data. A variation. Fixed-Point Interation. Gauss and Gauss-Jordan methods. 2003. Determinants and Matrix Inversion. Inheritance Different types of inheritance. Multistep Methods. The Adams-Moulton Method. Venugopal K R. Runge-Kutta Methods. Tata Mc Graw Hill. Errors and error Propagation Systems of Equations and Higher –Order . Norms. 3. The relaxation Method. Higher –Order Derivatives. Abstract classes. Dynamic binding. Linear Interpolation Methods. Unit 5 Numerical Solution of Ordinary Differntial equations: The spring-Mass Problem. Interval Halving (Bisection) Revisited. References: 1. The Elimination Method. Milne’s Method. Tata Mc Graw Hill. Operator overloading. ‘Mastering C++’. Pure virtual functions. Unit 4 Polymorphism and virtual functions. Interative Methods.Improved Ideal Gas Laws. 2000. Least-Squares Approximations. Herbert Schildt. Bairstow’s Method for Quadratic Factors. Newton’s Method for Polynomials. Systems of Nonlinear equations.Dynamic Object creation-new and delete Operators. Newton’s Method. Inheritance versus Composition. Pearson. Gaussian Quadrature. 2000. Class templates. Divided Differences. Overloading of templates. Multiple Roots. Robert Lafore. Euler and modified Euler Methods. Adaptive Integration. The Taylor-Series Method. Rajkumar & Ravishankar T. Unit 4 Numerical Differentiation and Numerical Integration: and B-Spline Curves. Pathology in Linear Systems-Singular Matrices. Object slicing. Multiple Integration with Variable Limits. Lagrangian Polynomials. Galgotia. Text Book: 1. Matrix Notation. Multivalued Methods. The Trapezoidal Rule-A Composite Formula.

Basic Loader Functions. ‘Systems Programming’. Alfi A A. Mc Graw Hill. MachineIndependent Compiler Features. 3 Johns. East West Press. 1986. 1980.K.Basic Macro Processor Functions. Machine-Independent Loader Features. 5. ‘Introduction to System Software’. MachineIndependent Assembler Features. MS-DOS Linker. Acadamic Press. Text Book: Leland L. Bullrich. ‘Computer Oriented Numerical Methods’. Machine-Dependent Loader Features. Limited.. Implementation Examples. Operating System Design Options. Machine-independent Operating System features. References: 1. Assembler Design Options. Narosa Pub. . Scalzo F. Machine-Independent Macro Processor Features. Comparisons of Methods/Stiff Equations. Machine-Dependent Assembler Features. Note: Assignment may be given to develop programs in FORTRAN for the various numerical methods Text Book: Curtis F Gerald. Springer Verlag. Unit 5 Operating systems:. 1978. E. .System Software Unit 1 Assemblers:. 1972. 3rd Ed.Basic Compiler Functions. 5th Ed. ‘System Software: An introduction to Systems Programming’. . ‘The art of Programming’. Implementation Examples. Patrick O Wheatley. Machine-Dependent Compiler Features. Krishamurthy. ***** CAS 2301 . ‘Computer Based Numerical Algorithms’. Unit 3 Macro Processors: . 1994. 1980 2. Stoer. Rajaraman V. ‘Computer Oriented Numerical Methods’.V & Sen S. 1984 3. Addison Wesley 1997.Basic Operating System Functions.Beck.M. References: 1 Donovan J J. Implementation Examples. Tata Mc Graw Hill. 2 Dhamdhere D. Macro Processor Design Options. Addison – Wesley. 4. House.Robin & Stewart. . 1979. ‘Applied Numerical Analysis’. Compiler Design Options. Prentice Hall India. ‘Elementary Computer Assisted Statistics’. Implementation Examples. Loader Design Options.Equations.Basic Assembler Functions. Implementation Examples Unit 2 Loaders and Linkers: . Machine-Dependent Operating System features. Unit 4 Compilers: . Ic. Van Nostrand reinherd Co. ‘Statistical Analysis: A Computer Oriented approach’.

‘Fundamentals of Database Sytems’. 2009 . 2009. Henry F. advantages.OODBMS. 3NF. House.Concurrency Control –Locks.Data mining. File Organization – Organization of Records in files – Indexing and Hashing. Korth & S. rules. 5 Kenneth A. 3. Arun K Majumdar.Complex Data types – Distributed databases – characteristics. ‘C Problem Solving and Programming’ Prentice Hall International. cursor. Cengage Learning.Overview of Biological databases. QBE Unit 3: Database Design Design Phases – Pitfalls in Design – Attribute types –ER diagram – Database Design for Banking Enterprise – Functional Dependence – Normalization (1NF. 2006. ‘The spirit of C an introduction to modern programming’. Text Book: Abraham Silberschatz. 7 Schildt. ‘C made Easy’. 4NF.Mobile databases. .Serializability – Recoverability. TMH. 2006. Mc Millan India. 2009. Sudarshan. 1989. ‘Database Management Systems’. Jaico Publ.W & Ritchie D M. ****** CAS 2302 .Data warehousing. Herbert. disadvantages..Data views – Database Languages – DBA – Database Architecture – Data Models – Keys – Mapping Cardinalities Unit 2: Relational Model Relational Algebra and calculus – Query languages – SQL – Data definition – Queries in SQL – Updates – Views – Integrity and Security – triggers.rules – ORDBMS.Database Management Systems (Revised June 2009) Unit 1: Introduction Introduction to File and Database systems. 5th Ed. New Delhi 1987. BCNF. ‘The C Programming Language’ Prentice Hall India. . Navathe. References: 1. Shamkant B.Homogenous and HeterogenousDistributed data Storage – XML – Structure of XML Data – XML Document.4 Cooper. Mc Graw Hill. Pratt. ‘Database Management Systems’. Pritimoy Bhattacharyya. . functions. ‘Programming with C’. Joseph J Adamski. 2. 5th Ed. Rameez Elmasri.Advantages.. 8 Kaicker S.Two Phase locking – Deadlock handling – Transaction Management in Multidatabases Unit 5: Current Trends Object-Oriented Databases. procedure – Embedded SQL – overview of QUEL. McGraw Hill International Edition. Unit 4: Transaction Management Transaction concept – state. Pearson Education.History. ‘Database System Concepts’. 6 Kernighan B. 1987. 2NF. disadvantages. Philip J.Applications and Challenges in Multimedia databases. 5NF). Mullish.

Charles E Leiserson. Johannes Gehrke. A task scheduling problem. Knapsack Problem. ‘Fundamentals of Computer Algorithms’. Aho A V. Branch & Bound Algorithms Unit 4 Number Theoretic Algorithms – Matrix multiplication. Pearson. 6. 3. Unit 3 Graph Algorithms – BFS. 2001 7. 2008. Pearson.4. Addison Wesley. Augmenting Data Structures. Summations. Flow networks. ‘The art of computer programming Vol 1: Fundamental Algorithms’. Pauline K Cushman. Huffman codes. McGraw Hill. McGraw Hill International Edition. Galgotia Publications Pvt. Algorithms and Applications in C++’. Recurrences. ‘Database Management Systems’. DFS. The efficiency of Algorithms. ‘Data Structures. Prentice-Hall of India. Ltd. 2nd Ed. ‘Fundamentals of Algorithmics’.Computer Algorithms Unit 1 Growth of functions. Knuth D E. Binary search trees – AVL tree. J D & Hopcroft J E. ‘Data Structures and Algorithm Analysis in C++’. Raghu Ramakrishnan. Asymptotic notations. Standard notations & common functions. Divide & Conquer Strategy-Closest pair of points. Data Structures for disjoint sets. Greedy Algorithms – An activity selection problem. Primality testing. ***** CAS 2303 . Horowitz E & Sahni S. Ullman. ‘Introduction to the Design & analysis of Algorithms’.Operating System . Matrix – Chain multiplication. ‘Introduction to Database Management Systems’. 2001. 2003. Integer factorization Unit 5 Computational Complexity – sorting. 2000. 6. TMH. Gilles Brassard & Paul Bratley. Unit 2 Dynamic Programming techniques – Principle of Optimality. Mark Allen Weiss. Tata Mc-Graw Hill. Inverting matrices. Fibonacci Heaps. NP completeness Text Book: Thomas H Cormen. 2008. New Delhi. Prentice Hall of India Private Limited. 2008 5. Red-black tree. ‘Database Management Systems’. References: 1. & Ronald L Rivest. ISRD group. strongly connected components. ‘The Design and Analysis of Computer Algorithms’. 2002. B-Trees. ‘Introduction to Algorithms’. 2007. TMH. Analysis of Algorithms Elementary Data Structures – Hash tables. Ramon A Mata-Toledo. 2004 5. Back tracking algorithms. Topological sort. ***** CAS 2304 . Goodman S E & Hedetnieni. 1998. 2. The complexity of sorting. Binomial heaps. 4. Sahni.

Multiple processor scheduling. Access Matrix. The Software Process Models. Recovery. Critical regions. Design Issues. Process Creation. Streams. Swap-space Management. The Process. Deadlock characterization. Tertiary-storage structure. 2. Intrusion Detection. Pthreads.Software Engineering Unit 1 Introduction to software engineering – Some size factors. Robustness. Network Structure. Demand Paging. Atomic transaction. Pearson. People. LogStructured File System. Threading issues. Monitors. Paging. Developing a solution strategy. Unit 3 Memory Management: Background. the Cost . Domain of Protection. Scheduling criteria. Network types. Implementation of Access Matrix. File-system Mounting. File Sharing. Milestones Documents and reviews. Deadlock detection. 3rd Ed. Efficiency and Performance. Unit 4 I/O Systems: Overview. Storage Structure. ******* CAS 2401 . ‘Operating Systems: Internals and Design Principles’. Operating System Structures: System Components. Security: The Security Problem. Planning the Development Process – The phased life-cycle model. Disk Management. Cryptography. Language-Based Protection. Thrashing. Virtual Memory: Background. Securing Systems and Facilities. File-System Structure. NFS. Evolutionary Software Process Model. Process scheduling. Transforming I/ O to Hardware Operations. Communication. The Product.Case Study: The Linux System. Project Management Concepts – The Management Spectrum. Kernel I/O Subsystem. RAID structure. Process: Process concepts. Unit 2 Planning a software Project – Defining the problem. 6th Ed. Directory Implementation. Semaphore. Methods of handling deadlocks. Communication in client-server system. Segmentation. System Structure. Computer-Security Classifications . 2006. Pearson. scheduling algorithms. Gagne. Disk Scheduling. Classic problems of synchronization. The RAD Model. 5th Ed. Algorithm evaluation. Directory Structure. Distributed System Structure: Background. Protection. Williams Stallings. Computer System Structures: Computer System Operations. Deadlock prevention. Program Threats. Evocation of Access rights. Managerial issues. OS Services . Recovery from deadlock. Segmentation with paging. contiguous memory allocation. Allocation of frames. Capability-Based system. The Process.. Unit 5 Protection: Goals of Protection. I/O Structure. Real time scheduling. Communication protocols. Disk Attachment. Free-space Management. File-System Implementation. ‘Operating Systems: design and implementation’. Application I/O Interface. Topology. the Linear Sequential Model. Performance. Synchronization hardware. swapping. File System Interface and Implementation: File Concept. Stable-Storage Implementation. ‘Operating System Concepts’. System Calls. Mass Storage Structure: Disk structure. Quality and productivity factors. Andrew S Tanenbaum. Access Methods. Unit 2 CPU Scheduling: Basic concepts.(Revised July 2009) Unit 1 Operating System Basics. The Project is WSHH Principle. Page replacement. Process Synchronization: Critical section problems. IPC. System Programs. Allocation methods. 2003 References: 1. Deadlocks: system model. System Threats. I/O Hardware. Multithreading models. deadlock avoidance. The Prototyping Model. Storage hierarchy. Wiley. Operation on processes.India. Hardware Protection. Text Book: Silberschatz. User Authentication . Threads: Overview. 2006. Galvin.

Function-Oriented Metrics. Basis Path Testing. Architectural Design – Software Architecture. 2004. Integrated CASE Environments. 2005. 6th Ed. version Control. Design Concepts and Principles. Metrics in the Process and Project Domains. ‘Software Engineering Principles and Practice’. Mapping requirements into a Software Architecture. Extended Function Point Metrics. Tata McGraw Hill. Algorithmic cost models. Unit 3 Software Configuration Management – The Software Configuration Management. Black-Box Testing. 3. Software Maintenance enhancing Maintainability during development. Work Breakdown Structures. Design Concepts. Data Design. Successive versions. Source Code Metrics. Design Principles. The SCM Process Identification of Objects in Software Configuration.. Planning an organizational structure. The Design Model Object-Oriented Design. Effective modular design. ‘Software Engineering’.. Test Case Design. Building Blocks. Architectural Styles. Intelligent Agents – Agents and environments – Good behavior – The nature of environments – Structure of agents – Problem Solving –Problem solving agents –Example problems – Searching for solutions – Uniformed search strategies – Avoiding repeated states – Searching with partial information. The Prototype Life-Cycle Model. ****** CAS 2402 . ‘Software Engineering: a practitioner’s approach’. Unit 2 Informed Search Strategies – Heuristic function – Local search algorithms and optimisation problems – Local search in continuous spaces – Online search agents and unknown environments – Constraint satisfaction problems (CSP) – Backtracking search and Local search – Structure of problems – Adversarial Search – Games – Optimal decisions in games –Alpha – Beta Pruning – imperfect real- .Requirements :functional and non-functional requirements.Model. Transform mapping transaction mapping. Design Documentation. Ian Sommerville. Control Structure Testing. Tata McGraw-Hill. Delphi Cost Estimation. Metrics and Indicators. 6th Ed. Other Planning activities. 5th Ed. change control. CASE-What is CASE. System requirements the software requirements document. SCM Standards. Automated Static Analysis. McGraw-Hill International Edition. Testing GUI’s. Software Testing Techniques – Software Testing Fundamentals.Artificial Intelligence (Revised July 2010) Unit 1 What is AI. Mc Graw Hill International Edition. Testing Documentation and Help facilities. Status report. 2007. White Box Testing. configuration Management. Software Design and Software Engineering. Addison Wesley. Software Process and Project Metrics – Measures. The Design Process.. Richard Fairley. History of AI. configuration Audit. 4. The Maintenance Process. Software Measurement-Size-Oriented Metrics. The CASE Repository Future directions in Software Engineering. ‘Software Engineering concepts’. ‘Software Engineering: a practitioner’s approach’. Unit 4 Verification and Validation – Software Inspections. 1997. Managerial Aspects of software Maintenance. User requirements. Clean room Software Development. Unit 5 Software maintenance: Types of Software Maintenance. Waman S Jawadekar. Text Book: Roger S Pressman. Software Cost estimation Techniques: Expert Judgement. 2001 References: 1. 2. Roger S Pressman.

Bluetooth. 2nd Ed. Wireless Transmission. The Medium Access Sub layer: The Channel Allocation Problem. Unit 3 The Network Layer: Network Layer Design Issues. 2009. Quality Of Service. Error Detection and Correction. Wireless LANS. Multiple Access Protocols. Congestion Control Algorithms. Communication Satellites. Agents based on Propositional Logic First Order Logic – syntax and semantics – Using first order logic – Knowledge engineering Inference – Prepositional versus first order logic – Unification and lifting – Forward chaining – Backward chaining –Resolution Unit 4 Knowledge representation – Ontological Engineering –Categories and objects – Actions – Simulation and events – Mental events and mental objects. Unit 5 The Application Layer: DNS – Domain Name System. The Network Layer in the Internet. Data Link Layer Switching. ‘Artificial Intelligence: A new Synthesis’. Social Issues.Effective propositional inference. Symmetric-Key Algorithms. Unit 3 Logical Agents. Sliding Window Protocols. The Internet Transport Protocols (TCP & UDP).. Elementary Data Link Protocols. Ethernet. References: 1. Unit 2 The Data Link Layer: Data Link Layer Design Issues. Network Hardware. ‘Artificial Intelligence’.time decision – Games that include an element of chance. Elements of Transport Protocols. Public-Key Algorithms. The Mobile Telephone System. Elsevier. 2000. The Physical Layer: The Theoretical Basis For Data Communication. The World Wide Web. Reference Models. Electronic Mail. Network Software. Guided Transmission Media. Planning: The planning problem – Planning with state space search – Partial order planning Planning graphs – Planning with propositional logic Unit 5 Learning From Observations – forms of learning – Inductive learning -Learning decision trees – Ensemble learning Text Book: Stuart Russell. Example Data Link Protocols. 2. Nils J. Multimedia. Internetworking. Pearson Education. ‘Artificial Intelligence – A Modern Approach’.Network and Data Communications (Revised July 2010) Unit 1 Introduction: . Network Standardization. Tata McGraw Hill. 2004. Network Security: Cryptography. Unit 4 The Transport Layer: The Transport Service. Broadband Wireless. Routing Algorithms. Example Networks. 3rd Ed.. Peter Norvig. . Elaine Rich & Kevin Knight. A Simple Transport Protocol.Uses of Computer Networks. Nilsson. Public Switched Telephone Network. Reasoning pattern in propositional logic. ******* CAS 2501 .

Behrouz A Forouzan. Vol I: Principles. 2nd Edn. Simulation Softwares – Comparison of Simulation Packages with Programming Languages. Monte Carlo Simulation. SIMSCRIPT and SIMULA. PHI 2000. Simulation language – Simblib. 2nd Ed.David Kelton. Random Variate Generation – Inverse Transforms Technique – Exponential and Uniform /distributions. 1995. John S. Narsingh Deo. Computer Networks. Models and Simulation.Text Book: Andrew S Tanenbaum . Model Building. Unit 4 Statistical Models in Simulation – Review of Terminology and Concepts – Useful Statistical Models – Queuing Models Characteristics of Queuing Systems. 1999 ****** E1 . Combined Discrete – Continuous Simulation – Examples.Nelson. References: 1. Output Analysis for a Single System – Stochastic Nature of Output Data. Types of Simulation with respect to Output Analysis for Terminating Simulations. 4th Ed. Jerry Banks. Unit 2 Modeling Complex Systems – List processing in Simulation. Simulation of a Single Server Queue. References: 1. Classification of Simulation Softwares. protocols and architecture’. General features of GPSS. Desirable Software Features.Simulation and Modelling Unit 1 Basics of Simulation Modeling – The Nature of Simulation Systems. 2003.. Tata Mc Graw Hill . Other Types if Simulation – Continuous Simulation. Prentice Hall. Texts Books: 1.. 2. ‘Data Communications and Networking’.. PHI 1998. Averill M. Unit 5 Input Modeling: Data Collection – Identifying the Distribution with Data.Carson and Barry L.Law & W. Discrete event Simulation. Douglas E.3rd Edn. ***** CAS 2502 . PHI. PHI. TMH 2008. Pearson Education 2003. ‘System Simulation with Digital Computer’. 4. 2. Verification and Validation of Simulation Models. Unit 3 Random Number Generation: Properties of Random Numbers – Generation of Random Numbers.Number theory . William Stallings. Data and Computer Communication. Prentice Hall. 2005 3. Comer.Gordon. ‘Discrete-Event System Simulation’. 6th Ed. ‘Internetworking with TCP/IP. ‘Simulation Modeling and Analysis’. Advantages and Disadvantages of Simulation – Area of application. ‘System Simulation’. Uyless Black. Tests for Random Numbers. System – environment – components. 2. G. 4th Ed. ‘Data Networks: concepts theory and practices’. 1988.

Apostol. Unit 4 Primality and Factoring: Pseudoprimes. Neal Koblitz. Fermat’s theorem. The continued factorization method. Springer 2004. 3rd Ed. complete and reduced residue systems.S. Springer. Ivan Niven & H. Authentication. 2005 3. Bit commitment. 2.Number Theory and Cryptography . Springer. ‘Introduction to Analytic Number Theory’.. ‘Algebraic aspects of Cryptography’ Springer. Unit 2 Indeterminate equations: Linear and second degree Diophantine equations Congruence in one unknown. Sums of two squares.Unit 1 Unique Factorization: Unique Factorization in Z. Fermat factorization and factor bases. Law of Quadratic Reciprocity. Tom M. John Wiley & Sons. Sums of four squares. ***** Signature Schemes. The Legendre symbol. Square roots modulo p. 4. The equation y2 = x3 + k Unit 3 Quadratic Reciprocity: Quadratic residues. ‘Introduction to the theory of Numbers’. Cubic curves with infinitely many Rational points. Elliptic curve primality test. Elliptic Curves: Basic facts. Neal Koblitz.2nd Ed. Pell’s theorem. 1999. The Fermat equation: Exponent 3. Nathanson. 2. 2nd Ed. Indistinguishable data transfer. Narosa Publishing House. The constructability of Regular polygons. Cubic and biquardatic Reciprocity. Text Books: 1. ‘A Course in Number Theory and Cryptography’. group properties. Σ(1/p) Diverges. 2004. Elliptic curve factorization. Law of biquardatic Reciprocity. The Chinese Remainder Theorem. Zero Knowledge protocol. New York. The rho method.. ‘Methods in Number Theory’.Zuckerman. congruences of higher degree with prime and composite modulo. ‘A Classical introduction to Modern Number Theory’. Euler function. Kenneth Ireland. The Jacobi symbol. Wilson’s theorem. 1992. E 2 . Melvyn B. 1998 References: 1. The quadratic sieve method. The growth of π(x) Congruence: properties. Infinitely many primes in Z. Unit 5 Applications of Number Theory: Cryptography.

block cipher principles and design. perfect numbers. dispersion. security attacks. quadratic residues. measure of central tendency.C. Variance and moment generating function. John Wiley & Sons. Axioms of Probability. Unit 5 Message Authentication: requirements.World Scientific. Distribution function. W.S. Neal Koblitz. ‘Cryptography and Network Security: Principles and Practice’. Springer. security of hash functions and MACS.4. 4. 5. 1998 2. Authentication Applications: Kerberos Text Books: 1. 4th Ed. Congruence: properties. key distribution. association and grouping of data. security services. & 5) References: 1. Stallings. Independence and Multiplicative theorem. ‘Applied Cryptography: Protocols.. classical encryption technique.Schnier. 2006 ( Unit 3. S.Zuckerman. Fermat’s theorem. Random experiments. Confidentiality: Placement of encryption function. Mean. Johannes A Buchmann. Tom M. 1992 ( Unit 1 &2) 2. 2nd Ed. Unit 4 Algorithms: triple DES. Digital signature: authentication protocols.Unit 1 Divisibility: ged. 1992. Discrete and continuous random variables. secure hash algorithm. Conditional Probability and Baye’s theorem. lem. Modern techniques: DES. Public key encryption – RSA algorithm. tabulation and presentation of data. complete and reduced residue systems. ‘Introduction to Analytic number theory’. IDEA. ‘Elementary Theory of Numbers’. 7.Hsiung. ‘An Introduction to cryptography’. blowfish. Wilson’s theorem. stegnanography. 6. Unit 3 Introduction to cryptography: attacks. elliptic curve cryptography. C. Hash algorithms: MD5 message digest algorithm. Springer 2004. 2nd Ed.. Narosa Publishing House. ‘An Introduction to the theory of Numbers’. ..Y. prime numbers. 1999. congruences of higher degree with prime and composite modulo. functions and codes. 2nd Ed. ‘A Course in Number Theory and Cryptography’. 2004. ‘Methods in Number Theory’..Applied Probability and Statistics Unit 1: Basic Statistics: Collection. digital signature standard. services and mechanisms. John Wiley & Sons. floor and ceiling functions. Ivan Niven & H. key management and exchange. Apostol. 2005 ****** E3 . 3rd Ed. Springer. New Delhi. traffic confidentiality. Euler function Unit 2 Indeterminate equations: Linear and second degree Diophantine equations. 3. Universities Press (India) Pvt. fundamental theorem of arithmetic. Nathanson. ‘The Mathematics of ciphers number theory and RSA cryptography’. Unit 2: Probability: Sample space and events.Coutinho. correlation. 1996. Additive theorem. Congruence in one unknown. Conventional Encryption – Classical techniques: model. random number generation. B.. Melvyn B. cryptanalysis. hash functions.Ltd. Chinese remainder theorem. Pearson Education. Algorithms & Source Code in C’.

measuring the adequacy of the regression model. Enterprise Networking and Access to the Internet. V K. Myers S L & Keying Ye. Methods of estimation – method of maximum likelihood. Testing of Hypothesis: Simple and composite hypotheses. Exponential and Normal distributions. Erwin Miller and John E. Unit 3 Internet/Intranet Security Issues and Solutions – The Need for Computer Security. Pearson Education References: 1. Walpole.W. power of a test. ‘Probability and statistics for engineers’ Prentice-Hall of India / Pearson .. Security Strategies. Gupta. Simple random sampling with and without replacement. Unit 3: Sampling Distributions: Population and Samples. secure Electronic Payment Protocol. Specific Intruder Approaches. M. Sampling distribution of sample mean when variance is known and unknown. Security Teams.Web Commerce Technologies Unit 1 Electronic Commerce Environment And Opportunities . Montgomery. ‘Probability and Statistics for Engineers and Scientists’. Type I and Type II errors. 2007. Estimation: Properties of estimates. Poisson. Two-sample confidence interval for normal population. Electronics Cash and Electronic payment Schemes. S C and Kapur. Illustration for each case. D.distributions. & Borror. Encryption. Sultan Chand and Co. Geometric.Background. **** E4 . Confidence interval for the proportions. Web Commerce Going Forward. Antivirus Programs. Hines. method of moments and method of least squares. Goldman. Secure Transactions. Myers. Security Tools.C. estimation of parameters in a linear regression model.M. Text Books: 3. Uniform. Student’s-t. Secure Transport Protocols. R. Certificates for Authentication . E. Migration to open EDI. MasterCard/Visa Secure Electronic Transaction – . On-line Electronic Cash. Commerce Net Advocacy.Modes of Electronic Commerce – Overview . Unit 5: Regression Analysis: Simple linear regression. C. H. R. The Electronic Commerce Environment. Unit 4: Interval estimation: Confidence interval for the mean of normal distribution when the variance is known and unknown. 2. 4/e. 4. 8/e. two-sample. ‘Fundamentals of Mathematical Statistics’. Tests of hypotheses on single sample.and F. Electronic Marketplace Technologies. 7th Ed. Chi-square test of goodness of fit and independence. security on Web Serves and Enterprise Networks.. ‘Probability and Statistics in Engineering’. 2003. W. John Wiley & Sons. Unit 2 Approaches to Safe Electronic Commerce – Overview. proportions.Freund. One-way analysis of variance. D. Electronic Commerce with WWW/Internet. ChiSquare-. Payments and Purchase Order Process.Probability Distributions: Genesis and basic properties of Binomial. Secure Electronic Transaction. Electronic Data Interchange.Internet Monetary Payment and Security Requirements.

Link and Association Concepts. Adding Operations. 3. 2. The Means of Distribution. Bridging the Gap. ‘Inside Servlets: A Server Side Programming for the Java platform’. S/MIME. Special Constructs for activity models. Reification of Behavior. Unit 5 Class Design – Overview of Class Design. Activity Models. Elaborating a Concept. Handling Global Resources. Terry Bernstein et al. Making a Reuse Plan. 1999. ‘Web Commerce Technology Handbook’. Nested States. Hughes. Packages. 4. Choosing a Software Control Strategy. Reification. Breaking a system into Sub Systems. Jr. Generalization and Inheritance. Process Summary – System . MOSS. State Diagram Behavior. Unit 4 Application Analysis – Application Interaction Model. Advanced Interaction Modeling – Use Case Relationships. State Diagrams. ‘Secure Commerce on the Internet’. Text Books: 1. Handling Boundary Conditions. Daniel Minoli & Emma Minoli. Comparisons of Security Methods.Object Oriented Design Unit 1 Introduction: Object Orientation. Unit 2 State Modeling – Events. Setting Trade. Domain Interaction Model. Whinston. N – ary Associations. MIME. Advanced Class Modeling – Advanced Objects and Class Concepts. Unit 3 Analysis and Design: Process Overview – Development stages. Dustin R Callaway. AP Professional (Academic Press). Iterating the Analysis.. Identifying Concurrency. AddisonWesley. 2. Adjustment of Inheritance. Priorities. MIME and Related Facilities for EDI over the Internet References Unit 5 Introduction to Servlets – Why Servlets. Designing Algorithms. OO Development. OO Themes.1999. Servlet Basics. Domain Analysis – Overview of Analysis.Introduction. ***** E5 . OO Modeling History. Sequence Models. A Sample State Model. Business Requirements. Interation Modeling – Use Case Models. Beyond Servlet API Basics. Abstract Classes. Running Servlets. ‘Internet Security Techniques’. Association Ends. Development Life Cycle. 2005 References: 1. Unit 4 E-Mail and secure E-mail Technologies for Electronic Commerce -Introduction. Design Optimization. Architecture of the ATM System. Estimating Performance. Management of Data Storage. Concepts Summary – Class Model. Procedural Sequence Models. Relation of Class and State Models. Metadata. Signal Generalization. HowDoes E-mail Work. Navigation of Class Models. State Model. ATM Example. 1997. 1996. System conception – Devising a System Concept. Abstraction. Evidence for usefulness of OO Development. Modeling Concepts: Modeling as a design Technique – Modeling. Refactoring. Concepts. Aggregation. Allocation of Subsystems. Pearson Education. Recursing Downward. Derived Data. Multiple Inheritance. Interaction Model. Relationships among the Models. Preparing a Problem Statement. Constraints. A Sample Class Model. Servlet. Servlet API Basics. Payment Processing. Larry J. Realizing Use Cases. Domain State Model. Tata McGraw-Hill. Transitions and Conditions. Class Modeling – Object and Class Concepts. Debugging Servlets. ‘Frontiers of Electronics Commerce’. ‘Internet Security for Business’. Application Class Model. Vijay Ahuja. 1995. A Model for Message Handling. The three models. Common Architectural Style. Domain Class Model. Ravi Kalakota & Andrew B. Organizing a Class Design. System Design – Overview of System Design. Application State Model. Advanced State Modelling – Nested State Diagrams. States. New Riders. John Wiley & Sons Inc.

2nd Ed. Testing. ‘Design Patterns: Elements of Reusable Object Oriented Software’. Controls against Program Threats Unit 3 Protection Services: Security methods of OS – Memory and address protection. Merkle Hellman KnapsacksUses of Encryption Secure Programs. Chuck Cotheren.Conception. Pfleeger. ‘Security in Computing’.. Mark Priestly. Wm. Dwayne Williams.Security Planning. 2004 ****** .Transpositions. Dreamtech Press.Security in Computing Unit 1 Introduction: Security problem in computing – Meaning – Kinds of Security breaches – Computer Criminals – methods of defense Cryptography: Terminology and background.Symmetric and asymmetric encryption.2004.Substitution ciphers. Erich Gamma et al. 2005. Gregory B. Unit 4 Levels of Security: Database security.Ethical Issues in Computer Security Text Book: Charles P. White. Roger Lavis. ****** E6 . PHI.Comparison of Copy right. Trusted OS design. 2.Martin Fowler & Kendall Scott. ‘Principles of Computer Security-Security+and Beyond’. Fine – tuning Generalizations. References: 1. 2004. Assurance Methods.Physical securityModeling Cyber Security. 2009. ‘Practical OOD with UML’.User Authentication Design of secure OS: Models of Security..Characteristics of good cipher. Shari Lawrence Pfleeger.Privacy principles and policies.Security versus Precision-Proposals for Multilevel securityNetwork security. Analysis. Pearson. 2nd Ed. 4th Ed. 2002. Fine – tuning Classes. Text Book: Michael Blaha & James Rumbaugh.RSA.AES. Implementation Modeling – Overview of Implementation.. Patent and Trade secret – Computer Crime. ‘UML Distilled: a Brief Guide to the Standard Object Modeling Language’. Realizing Associations.Protection Mechanisms. Michael E. 3.Organizational security policies.Stream and Block Algorithm Unit 2 Secure encryption systems: DES. ‘Infrormation Security: incident response and disaster recovery’. Cengage Learning.Threats in Network security – IDS.Public key for email Unit 5 Other issues: risk analysis. Implementation examples. 2nd Ed. Design. ‘Object Oriented Modeling and Design with UML’. 2007 Refernces: 1. Prentice Hall. Arthur Conklin. 2.Firewalls.Viruses and other malicious code. Whitman.

cross-platform development. SPI and I2C interfaces. Event registers. rate monotonic analysis. Tony Givargis.K Prasad: Embedded / Real-time systems: Concepts. 2003. Memory management. Dr. PCI Bus Unit 5 : Embedded/Real time operating systems: Architecture of the Kernel. Productivity tools. Semaphores. ‘Embedded system design: A unified hardware/software introduction’. Code optimization. Device drivers-tools for device driver development. 2. Tasks and task scheduler. USB:USB physical interface. Memory management. Ethernet: protocol architecture. Vikas Gupta. Timers. Null Modem cable connection. Software development and testing tools Unit 3 : Programming for embedded systems: Overview of ANSI C.. K. Elsevier. Signals.Development and testing tools-Hardware development and testing tools.signal management function calls. Debug port-IEEE 1149. Application software. Dr.E7 . Raj Kamal. scheduling algorithms. ‘An Embedded Software Primer’. Windows XP Embedded. Power supply unit.pipe management function calls. Pearson Education.K.11: CSMA/CA protocol. Ankur Verma. ‘Embedded System design’. UART. 3. 2009. Input/output devices.makefile. Frank Vahid. features of USB. ROM and Hybrid memory. 2003. Real-time operating systems. revision control. Communication softwareTCP/IP protocol suite.mutex management function calls.event register management function calls. RT Linux.Java 2 Micro Edition(J2ME). programming in C++. Embedded Linux. recent trends in embedded systems.K Prasad. Mailboxes. clock circuitry. Micro C/OS. indenting. IEEE 1394: features. Symbian OS Text Books: 1. 2008. 2. 2nd Ed. debugger.task states. protocol architecture. Overview of Embedded/ Realtime operating systems:Embedded operating systems: Embedded NT. ‘Programming for embedded systems: cracking the code’. ****** . 4.K. chip select logic circuit. design and programming: the ultimate reference. Wiley Publishing.semaphore management function calls. Avnish Dass. Mobile / Handheld operating systems. Categories of embedded operating systems: Non real. Handheld OS: Palm OS. Bluetooth state transition diagram. Real –time operating systems: QNX Neutrino. programming and design’.mailbox management function calls. K. CSMA/CD protocol. Mutex. Java development tools Unit 4 : Communication interface standards: Need for communication interface. requirements of embedded systems. Tata Mc Graw Hill. C coding guidelines. Schiller: Mobile communications. task management function calls. RS232/UART: RS232 communication parameters. watch dog timer and reset circuitry. 2009. profiler.message queue management function calls. memory. Timing of programs. priority inversion problem-priority inheritance.RAM. Message queues.timer management function calls. Steve Heath. Bluetooth protocol architecture. applications of embedded systems Unit 2 : Architecture of embedded systems: Hardware architecture.time embedded operating systems. Wiley India.V. ‘Embedded Systems: Architecture.V. Software architecture.processor.Services provided by an operating system. challenges and issues related to embedded software development. Programming in Java. overview of embedded system architecture.Embedded Systems (July 2010) Unit 1 : Introduction to embedded systems: Categories of embedded systems. Simon. IEEE 802. Jochen H. Architecture of embedded operating systems. References: 1. Bluetooth: Bluetooth system specifications. 2006. Pearson Education. Dreamtech Press. Interrupt service routines. VX works. latches and buffers. 5. context switching. Bit manipulation using C-calculation of CRC. GNU development tools.II. Server side programming. Pipes. David . RS232 connector configurations.E. boot sequence. Process of generating executable image. 2009.

.Full Compiler Setup. O’Reilly. Memory Addresses. Advance Char Driver Operations. Communicating with Hardware. Auerbach. ‘Linux Kernel Development’. 2. Starting New processes. O’Reilly. Page Frame Management. Harald Bohme. . Process structure. 3. Kernel modules. Embedded Development Environment. and Setup. File system types. Introduction to layout management. Unit 4 An Introduction to Device Drivers. Linux versus other Unix like Kernels. Building and Running Modules. ‘Embedded Linux Primer: A Practical Real-World Approach’.. Scheduling policy.Bootstrap Compiler Setup . Novell Press. Applets. Managing I/O Devices. The Role of signals. Debugging techniques. Karim Yaghmour.. Virtual file system.Linux System Programming (Revised.Kernel Headers Setup . References: 1. Memory Addressing. System calls related to Networking. Addison-Wesley Professional. Amol Lad. Paging in Hardware. Swap Cache. Zombie process. Viewing processes. ‘Linux Device Drivers’. Concurrency and Race conditions.2005. Kernel Overview. ‘Beginning Linux Programming’. Christopher Hallinan. File system mounting. 5. Wrox Publishers...Basic Java Programming (July 2010) Unit 1 Review of OOPs and Java Basics: Java Programming environment. 2005. July 2010) Unit 1 Linux Evolution. 1st Ed.E8 . ‘Embedded Linux System Design and Development. File locking. 2. Pipes. Architecture of Embedded Linux.Using the toolchain Text Books: 1. Signals. 2nd Ed. Segmentation in Hardware. Inner classes: local. Finalizing the toolchain Setup . 3rd Ed. Waiting for a process.. P. operators.C Library Setup . Basic Linux installation and administration. I/O Architecture. 3rd Ed. 3. Robert Love. fundamental programming structures in Java: comments. Main characteristics of Linux OS. 2006.2008. 2nd Ed. 4th Ed. data types. Binutils Setup . Linux Distributions. System calls related to scheduling. control flow. Process scheduling. Networking. Unit 2 Swing programming: the model-view-controller design pattern. FIFOs. The Ext 2 and Ext 3 File system. Richard Stones. Segmentation in Linux. Daniel P Bovet & Macro Cesati. Interfaces and call backs . Input and Output.O’Reilly. Char Drivers. Unit 5 Embedded Linux. Interrupt Handling. Unit 2 Processes. Generating a signal. Interfaces: Object cloning. Arrays. Process Table. System calls related to Signal Handling. ‘Understanding the Linux Kernel’. Jan 2005. 1st Ed. Paging in Linux. Basic event handling. Introduction. Delivering a signal. 2nd Ed. Jonathan Corbet &Alessandro Rubini. Raghavan. General kernel responsibilities. Sending / Receiving packets from the Network Card. 2007. ‘Linux Kernel Internals’. Virtual file system data structure.. variables. The Scheduling Algorithm. Michael Beck. Big Numbers. Unit 3 Interprocess communication. 4. Swapping. ****** E9 . Neil Matthew. System processes.. Device Drivers. Anonymous and static Inner classes. 1997. PHI. Objects Classes and Inheritance. ‘Building Embedded Linux Systems’. strings. 2005. GNU cross platform tool chain : GNU toolchain basics .

LDAP. BeanInfo classes. ‘Core Java’. Unit 2 Process. The Role of signals. parameter passing. Algorithms. Bernard Van Haecke. Demand paging.. File system types. Waiting for a process. Pearson. Volume 1 and 2. 2006.Thread properties. System calls. scheduling policy. Linux versus other Unix like Kernels. FIFOs. Viewing processes. Memory Addresses. Generating a signal. System calls related to Signal Handling. process scheduling. Signals. Java Bean Persistence. 2006. ****** E10 . ‘Programming in java 5. ‘JDBC: Java Database Connectivity’. Database Programming: The design of JDBC. Cohoon. Device . Exception Handling. Customizers. Unit 3 Interrupts and Exceptions. 2000. Memory Addressing. Thomas Wu. The RMI programming model: setting up. The Structured Query Language. 3. 8th Ed. Unit 4 Memory Management. Jack. Swapping. Main characteristics of Linux OS. P. Transactions. Zombie process. Memory Area Management. Process structure . Random Access Files. Davison. Delivering a signal. The Linux page cache. system processes. Choice components.Tata McGraw Hill. References: 1. The collection frame works. server object activation. Managing I/O Devices. PriorityQueue. 2. Naming patterns for Bean property types. concrete collections: LinkedList. ArrayList. Kernel Overview. I/O Architecture. Virtual file system data structure. Text Input and Output. File Managements.Text Input. Property Maps. Threads: Thread states. Row sets. Remote method calls. Segmentation in Linux. File locking. Unit 5 Distributed Object: The roles of client and server. Unit 3 Streams and Files: Streams. TreeSet. Scrollable and Updatable Result sets.0’. JDBC configuration. Virtual file system. Role of interrupts signals. Linux Distributions. page allocations and Deallocation. executing SQL statements. Exception handling basics. Text Book: Horstmann & Coronell. pipes. initializing the Interrupt Descriptor Table. Java Beans: creating beans. Enumerations. Advanced Connection management. Maps. W. Property editors. Memory Mapping. Tata McGraw Hill. The scheduling Algorithm. System calls related to scheduling. Synchronization and User interface Programming. Menus and Dialog Boxes. Unit 5 Interprocess communication. Legacy collections: HashTable class. Process Table. Interrupt Handling. 2008. Stacks and BitSets. Segmentation in Hardware. Starting New processes. Kennel Synchronization. IDG Books India. Page Frame Management. Unit 4 Collections: collection interfaces. Object Streams and serialization. Linux page Tables.Linux Internals Unit 1 Introduction and Environmental setup. Swap cache. ‘An introduction to Object Oriented Programming with Java’. Thread creation . HashSet. Using Beans to build an application. Paging in Hardware in Linux. File system mounting. James.

‘Beginning Linux Programming’. NFA to DFA. Context Sensitivity Analysis. Context Free Grammars. 2006. Networking.DFA to Minimal DFA. System calls related to Networking. PEEPHOLE OPTIMIZATION. Two Pass Scanners. Abstract Syntax Trees. Linear Intermediate Representations – Stack Machine Code.Drivers. 2000. an Optimizer. Data Types – Type Systems. Creating Output program. 2nd Ed. O’Reilly. Arithmetic operator. Redundant Expressions – DAG. Scopes and Activation Records. TREE PATTRERN MATCHING. Pearson. Classes of Context Free Grammar and their Parsers. Three Address Code. Context Free Grammar vs Regular Expressions. Unit 2 Parsing – Introduction. References: 1. 5. Goal of Optimization. Michael Beck. ‘Linux Kernel Development’. Managing Memory. The fundamental principles of compilation. Richard Stones. 3. Storing and accessing Arrays. 2nd Ed. Building LR(1) Tables. Auxiliary Data Structures. 2007. Top Down Parsing. Wrox Publishers. The procedure abstraction – techniques. Machine Independent Optimization – Introduction.2005. Moshe Bar. Scanning – Introduction. Procedure calls. Creating and Maintaining Run Time Environment. Regional Scheduling.. Regular Expression to NFA. Automatic Scanner construction. Bottom Up Parsing. Boolean and Relational operators. 4. ****** E11 . Properties of a Compiler. Recognizing words. Assigning storage locations. Ambiguous Grammar. Control Flow Constructs ( Structured and Unstructured). ‘Linux Kernel Internals’. Name Spaces. Sending/Receiving packets from the Network Card. ‘Linux Internals’. Regular Expressions. Value Numbering over regions larger than basic blocks. ‘Understanding the Linux Kernel’. Instruction . Instruction Selection – a TREE WALK Approach. TMH. The Ext 2 and Ext 3 File system. A formalism for Recognizers – Finite Automata. Robert Love. List Scheduling.Compiler Design (Revised July 2010) Unit 1 Introduction to Compilers. O’ Reilly. Global Redundancy elimination. Structure of a Compiler. Dependence Graph. Unit 3 Intermediate Representations – Graphical Intermediate Representations – Parse Tree. Checking Meaning. Improving code. An overview of phases of a Compiler: a front end. Considerations for Optimization.DFA to Regular Expression. TREE PATTERN MATCHING ON Quads. 1st Ed. Neil Matthew. Unit 4 Code Generation. Text Book: Daniel P Bovet & Macro Cesati. 3rd Ed. DAG.. Jonathan Corbet. Harald Bohme. Instruction Scheduling – Introduction. From Regular Expression to Scanner and Back. Alessandro Rubini. ‘Linux Device Drivers’. a Back end and Infrastructure. Addison-Wesley Professional.. Type Checking . The Attribute Grammar Framework. Scope of Optimization. 1997. Graphs – Control Flow Graph.Value Numbering. Opportunities for Optimization. Unit 5 Machine Dependent Code Optimization. Checking Syntax. High level view of translation – Grammars and Languages. Backus – Naur Form. Ad – hoc System Directed Translation. 2.

Web Servers Overview of J2EE Technologies. Exception handling. Jeffrey D Ullman. Local Register allocation and assignment.. Ravi Sethi.Introduction to JSP elements. Introduction to Transactions and Transaction Methods. Form Class. JSP Lifecycle. Executing SQL commands using JDBC Drivers. Foreign keys. PDAs. Allen I Holub. Servlet Redirection and Request Dispatch. Servlet Request and Response Model.JDBC and Embedded SQLIntroduction: tables.Advanced Java Programming (Revised July 2010) Unit 1 Core Java Overview: Object oriented concepts. J2ME Software Development Kits. Introduction to Web Applications. Andrew W. Introduction to Data Source and Connection pooling. MIDlet programming. Unit 2 Introduction to Java Servlets. Unit 5 Record Management System: Record Storage. set Top Boxes. Session Tracking. Appel. Error Handling. Subrahmanyam Allamaraju and Cedric Buest. JSP syntactic elements. Servlet Synchronization and Thread Model. Text Books: 1. 1993 3. J2ME and Wireless Devices Small Computing Technology: Wireless Technology-Mobile Radio Networks. CRC Press. Metadata. Aho.Techniques and Tools’. Hidden form fields. Indexing. static and dynamic Execution of SQL statements.sql package. Introduction to JSP : JSP & Servlet as Web Components. ServletConfig and ServletContext. Cambridge University Press 2000 4. Servlet State Transitions. Revised Ed. JSP. Small computing Device Requirements. Cooper & Linda Torczon. Group and Sort Views:Personal Information Manager: PIM Databases. JSP Page Lifecycle Phases. ‘Professional Java Server Programming: J2EE 1. ****** E12 . The Java. Alfred V. Clustered Keys.Request One column and multiple columns. ‘Engineering a Compiler’. Mobile Power.Request Rows and Columns. Command Class.Overview of High-Level Display: Screens: Alert Class. JDBC Drivers. smart cards. Execution of Stored Procedures using JDBC. User Interactions.Allocation – Introduction. Selective Rows. Request Rows .-Display class. Exception Handling. Views: Rules for using Views Create a view. J2ME Wireless Toolkit. Multi Threading Introduction to JDBC : Overview of JDBC API.J2ME Database Concepts: Database Schema. General Rules of Syntax. 2004. ‘Compiler: principles . Text Box Class. References: 1. Helloworld J2ME Style. URL rewriting. JSP Standard Actions Unit 3 J2ME Overview: Inside J2ME -How J2ME is organized. Global register allocation and assignment. Prentice Hall. 1986 2. Item Class. Apress publication. Unit 4 J2ME User Interfaces :Commands. Priti Shanker. Template content. 2007. Items and Event Processing. Static and Dynamic contents. ‘Compiler Design in C’. List Class. Inserting Data into Tables-Insert a Row. Sorting and Searching Records. Maintaining Client State: Cookies. Servlets vs.J2ME Architecture and Development Environments: J2ME Architecture. The Art of Indexing-Drawbacks of Using an Index. Addison Wesley. Introduction to JNDI. . Graphics. Derived Keys.Overview of Low-Level Display: Canvas: The Canvas. Servlet life Cycle and Life cycle methods.3 Edition. Updating and Deleting Data from a table. Deploying a Servlet. Y N Srikanth. Messaging. Elsevier. 2007. Text Book: Keith D. JSP element syntax. Back ground issues. Selecting Data from a TableSelect All data . The Contact databases. The Event databases. ‘Compiler Design Handbook: Optimization and Code Generation’ . Item Class. Writing and Reading Records. ‘Modern Compiler Implementation in C’.

2.sql package. Selecting Data from a Table-Select All data . Indexing. The Event databases.Gary Cornell. Commands. ‘Professional Java Server Programming: J2EE 1. J2ME Software Development Kits. J2ME MIDlets and Web services.Introduction to Web services: Basics. static and dynamic Execution of SQL statements. Inside WSDL.3 Edition. ‘Beginning J2EE 1. Apress. Kevin Mukhar and James L. Derived Keys. Metadata. Wrox publishers. The Art of Indexing-Drawbacks of Using an Index. ‘Beginning J2ME: From Novice to Professional’. MIDlet programming. John T. ‘J2ME: The Complete Reference’. 3rd Ed. ‘J2ME in a Nutshell’. Vivek Chopra. 2006 ****** . Exception Handling. References: 1. Dustin R Callaway. ‘Core Java: Volume II.. J2ME Architecture and Development Environments: J2ME Architecture. smart cards.Weaver.J2ME Database Concepts: Database Schema. 2. 8th Ed. Request Rows . 2007. Selective Rows.Bell. 3. Messaging. PDAs. JDBC Drivers. Inserting Data into Tables-Insert a Row. Items and Event Processing: J2ME User InterfacesDisplay class. Tata McGraw-Hill. 2004. Multi Threading Introduction to JDBC : Overview of JDBC API. ‘Beginning JavaServer Pages’. Advanced Features’. Sing Li. High-Level Display: Screens: Alert Class. Exact matches and Partial Matches. Tata McGraw-Hill. SOAP Basics. User Interactions.Horstmann. Unit 2 J2ME Overview: Inside J2ME -How J2ME is organized. 3. References: 1. set Top Boxes. 2007. J2ME Wireless Toolkit. ****** E13 . Mobile Power. 2005. 2. Pearson Education. ‘Inside Servlets: A Server Side Programming for the Java platform’.Request Rows and Columns.. Subrahmanyam Allamaraju and Cedric Buest. James Keogh. WSDL and SOAP. Kim Topley. tables. Writing and Reading Records. 2007 2. O’reilly. The Java.Advanced Java Mobile Programming (July 2010) Unit 1 Core Java Overview: Object oriented concepts. Text Books: 1. Foreign keys. Updating and Deleting Data from a table. 2005. Views: Rules for using Views Create a view. Executing SQL commands using JDBC Drivers. Cay S. Jon Eaves.Request One column and multiple columns. ‘J2ME: The Complete Reference’. Apress publication. Exception handling.LowLevel Display: Canvas: The Canvas. J2EE Multitier Web Services Architecture. 2005. Text Box Class. Sing Li. Sorting and Searching Records. Clustered Keys. James Keogh. Item Class. Execution of Stored Procedures using JDBC. List Class. Rubert jones. Form Class. Graphics Unit 4 Record Management System: Record Storage.JDBC and Embedded SQL. Command Class. The Contact databases.4’ With foreword by Ivor Horton. Prentice Hall. Small computing Device Requirements. 2005. RMI Concept. Item Class. Introduction to Transactions and Transaction Methods. Group and Sort Views: Unit 5 Personal Information Manager: PIM Databases. Apress Publication. J2ME and Wireless Devices Small Computing Technology: Wireless Technology-Mobile Radio Networks. Unit 3 J2ME Best Practices and Patterns. Error Handling. Helloworld J2ME Style.

‘Pro JSF and Ajax: Building Rich Internet. Wrox publishers. . Sample Application Analysis. 2005. Dustin R Callaway. Sam Dalton. Tariq Ahmed. 4th Ed. JSP syntactic elements. Servlet Request and Response Model.Flex. Kito D.Managed Beans:A Sample Application. Encoding: Generating Markup.Bell.Using Converters. Action Events . jsp:include. The Java. Unit 5 AJAX :Ajax Fundamentals . JDBC Drivers.actions. David Geary. The Tag Handler Class. Introduction to Web Applications.E14 .Ajax Components. Hidden form fields. Defining Tag Handlers in JSF 1. Apresss Publications.Ajax4jsf. David Johnson.The Fade Anything Technique Library . Servlet State Transitions.JSP elements-directives.Web Enabled Java Programming (July 2010) Unit 1 Core Java Overview: Object oriented concepts.declarations.Data tables. ‘Professional Java Server Programming: J2EE 1.Bean Scopes Configuring Beans.jsp:param. Rubert jones.expressions.4’ With foreword by Ivor Horton. ‘JavaServer Faces in Action’. 2007. Sing Li. Jon Eaves. Template content.Introduction to Java Web Services. Jon Hirshi. Dreamtech Press. 2005. ‘Pro JSP 2’. ‘Beginning Java Server Pages’. Deploying a Servlet. Servlet life Cycle and Life cycle methods. Introduction to Data Source and Connection pooling.1 . Sing Li. Pearson Education. Introduction to Transactions and Transaction Methods. 3. Components’.Implementing Form Completion with Ajax4jsf. Jonas Jacobi and John R.Dynamic Navigation. Simon Brown. jsp:setProperty. Subrahmanyam Allamaraju and Cedric Buest. Maintaining Client State: Cookies.sql package.Propagating Client-Side View State Direct Web Remoting. Event Listener Tags. Decoding: Processing Request Values . Unit 4 Introduction to JSF Frameworks: Getting started:A Simple Example. jsp:getPreoperty. 2005. Value Change Events. Converters and Validators: Classes for Implementing Custom Components. Realtime Validation. jsp:plugin. Multi Threading Introduction to JDBC : Overview of JDBC API. ‘Core Java Server Faces’ 2nd Ed. Exception Handling. Server Pages Standard Tag Library(JSTL).Using Standard Converters. ‘Flex 3 in Action’. Introduction to JNDI. . ‘Inside Servlets: A Server Side Programming for the Java platform’. Apress publication. Session Tracking. Servlets vs. Prentice Hall-2007 References: 1.Custom Components. Executing SQL commands using JDBC Drivers.3 Edition. Fallows. 2006. 6. Web Servers Overview of J2EE Technologies. 2004. Implementing Custom Component Tags.Keeping JavaScript Out of Renderers. JSP Page Lifecycle Phases.Hybrid Components.. jsp:forward.JSP Standard Actions: jsp:useBean.0 and Beyond.Event Handling: Life Cycle Events. Text Books: 3. Static and Dynamic contents. Servlet Synchronization and Thread Model. Unit 2 Introduction to Java Servlets. Unit 3 Introduction to JSP : JSP & Servlet as Web Components. Faisal Abid.Immediate Components. URL rewriting. JSP Lifecycle.Implementing Realtime Validation with Ajax4jsf. ServletConfig and ServletContext. 5.Form Completion. ‘Beginning J2EE 1.. Daniel Jepp. Kevin Mukhar and James L. 4. Apress. Vivek Chopra.Weaver. Future Trends in Web Technology WEB 2.The Custom Component Developer’s Toolbox. Ed. Mann. Execution of Stored Procedures using JDBC.Standard JSF tags. Edited by Kevin Mukhar . John T. static and dynamic Execution of SQL statements. Navigation. The Prototype Library . Passing Data from the UI to the Server . JSP.scriptlets. Dreamtech Press. Tags and Components. General Rules of Syntax.Transmitting JSP Tag Attributes to JavaScript Code. Development Environments for JSF. 2. 2009. Servlet Redirection and Request Dispatch. JSP element syntax.conversion and validation Overview of the Conversion and Validation Process .JavaScript Libraries. and Matt Raible. Static Navigation . Apress Publication. 7. 4. The TLD File.Cay Horstmann.

technical Assessment. Statistical approaches. The functions of Managers. compact item sets. Methods for Comparing classifiers. Challenges. Techniques of visualization.. ‘Data Mining: Practical Machine Learning Tools and Techniques’. Visualization: Motivations. Cluster evaluation . Pearson. Cost-benefit analysis. ‘Data Mining Techniques’. Text Book: Pang-Ning Tan. Alternative Techniques Of Classification: Rule based classifier. directing and controlling a software Engineering Project. Theory and Practice – Definition of Management: It’s nature and purpose. 2006.Software Project Management Unit 1 Introduction to Management – Management: Science. Pujari.Applied Probability and Statistics Unit 1 An overview of data mining: Data Mining: applications. Visualizing higher dimensional data. General approach to solving a classification problem. 2006 . staffing. Rule generation. ****** E16 . References: 1 Ian H.E15 . Quality of data. Data: Different types of data. Basics Of anomaly detection: Preliminaries. cash . Summary statistics. 2 Arun K. Agglomerative hierarchical clustering. Knowledge discovery. Descriptive and Predictive modeling. Overview of OLAP and multidimensional data analysis. Data preprocessing methods. Vipin Kumar. Artificial neural networks. Evaluation of association patterns. Unit 2 Project Evaluation: Strategic Assessment. 2005. Model overfitting Evaluating the performance of a classifier. Baysiean classifiers. Functions and activities of Management. Eibe Frank. Witten. DBSCAN. Unit 2 The Iris data sets. planning. General concepts. Software Engineering Project Management: Major issues of Software Engineering. Unit 5 Cluster analysis: Basic concepts And algorithms: K means. ‘Introduction to Data Mining’. 2nd Ed. Nearest classifiers.Data Mining (July 2008) Prerequisite: E3 . Measures of similarity and dissimilarity of data. Morgan Kaufmann. Unit 3 Basic concepts of classification: Definition. Alternative methods for generating frequent item sets. Examples. Universities Press. neighbor Unit 4 Association analysis: Basic concepts: Problem Definition . Decision Trees.Frequent Item set generation. The aim of all managers Science or Art? The Systems approach to Operational Management. organizing. Data mining tasks. Michael Steinbach.

Polynomial Arithmetic. expert judgment. change control Managing Contracts: Types of contracts. ‘Software Engineering Project Management’. estimating by analogy. Selection of an appropriate project approach: Choosing Technologies. Evaluating risks to the schedule. DES and Triple DES. 2. Wiley-IEEE Computer Society Press. Object points. Working in groups. the spiral model. 4. Software effort estimation techniques. 6th Ed. Hazard Identification. ‘Software Engineering: a Practitioner’s approach’. choice of process models. Software prototyping. COCOMO: A parametric model. When to plan. Leadership. ‘Software Management’. acceptance. Earned value. selecting the most appropriate process model. Projects and activities. Unit 4 Activity planning: The objectives of activity planning. structure versus speed of delivery. 2004. ****** E17 . Risk planning and control. Extreme programming Managing iterative processes. Typical terms of a contract. incremental delivery. Stress. Decision making. Formulating a network model. a procedural code –oriented approach. Discrete Logarithms.Cryptography and Network Security Unit 1 Foundations of Cryptography and Security – Ciphers and Secret Messages. cost-benefit evaluation techniques. Albrecht function point analysis. Edited by Richard H Thayer. Feistel Cipher Network Structures. types of risks. Cost monitoring. Donald J Reifer. Theory of Block Cipher Design. Contract Management. Network planning models. Managing Risk. dynamic systems development method. Activity float. Identifying the critical path. Collecting the data. Hazard Analysis. Unit 3 Software Effort Estimation: Problems with over and under estimates. Project Schedules. Strength of DES. ‘Software Project Management: A unified framework’. The basis for Software estimating. Finite Fields. 5. Managing people and organizing teams: Understanding behavior. Unit 5 Monitoring and control: Creating the framework. Motivation. Getting the project back to target. Shortening the project duration. Selecting the right person for the job. Visualizing progress. other ways of categorizing software prototypes. Identifying critical activities. 2004. Pearson Education.. Roger S Pressman. The V-process model. The forward pass. Risk evaluation. Tata McGrawHill. function points Mark II. 2002. 6th Ed. Computer Society Press. Modular Arithmetic.flow forecasting. The backward pass. Activityon-arrow networks. Conventional Symmetric Encryption Algorithms. Walker Royce. Security Attacks and Services. 2003. Bob Hughes & Mike Cotterell. Controlling changes during prototyping. Organizational behavior: a background. Risk Management: The nature of risk. Organizational structures. Health and Safety. Adding the time dimension. Becoming a team. Substitutions and Permutations. The Waterfall model. References: 1. Wiley-IEEE. 2004. instruction in the best methods. prioritizing monitoring. Mathematical Tools for Cryptography. Unit 2 . ‘Software Project Management’. Euclid’s Algorithm.. Tata McGraw-Hill. Sequencing and scheduling activities. 3. Stages in contract placement. The Oldham-Hackman job characteristics Model. technical plan contents list.

Digital Signatures. Unit 4 Fuzzy sets. Cryptographic Generators. Key Distribution. 4th Ed. SHA. Elliptic Curve Cryptosystems. ‘Cryptography and Network Security’. Electronic Commerce Security. Certificates. References: William Stallings.Intelligent Systems Unit 1 Basic concepts of Neural Network – Network properties – Learning in simple neurons – single layer perceptrons – multi layer perceptrons Unit 2 Supervised and unsupervised learning – Back propagation – derivation – Kohonen self organizing Networks – algorithms –learning vector quantization.intersection.fuzzy relational equations-applications.architecture and operations. Security Handshake Pitfalls.Modern Symmetric Encryption Algorithms. Rijndael (AES). Pseudo Random Sequences. Pearson Education.Associative memories. Unit 3 Recurrent Networks – Hopefield networks – Boltzmann machines – Adaptive resonance theory. 2005. ****** E18 . Tata Mc Graw Hill. IDEA. Kerberos. MD5.crispsets.Notion of fuzzy set. User Authentication. Blowfish. Unit 3 Public Key Cryptography – Prime Numbers and Testing for Primality.combination of operations – fuzzy relations – equivalence and similarity relations. IP and Web Security. Digital Watermarking. Text Book: Behrouz A Forouzan. Key Excahnge Algorithms.Introduction. Unit 5 Authentication of Systems.algorithm. One Time Pad. RC5. RIPEMD. Electronic Mail Security. Digital Signature Standard. ElGamal. Pretty Good Privacy. Factoring Large Numbers. Text Books: . Secure Sockets and Transport Layer. Electronic Payment Systems. Linear Congruential Generators. Diffie-Hellman. 2005. RSA.. Design of Stream Cipher.fuzzy complement – union. Secure Electronic Transaction. Public-Key Cryptography Standards Unit 4 Hashes and Message Digests – Message Authentication. Unit 5 Operations on fuzzy sets. Stream Ciphers and Pseudo Random Numbers. Twofish. ‘Cryptography and Network Security: Principles and Practices’. HMAC. CAST.fuzzy logic.Basic concepts of fuzzy setsclassical logic (overview) . RC2.

Carneron Wakefield. References: 1.NET & VB. 1994.NET. Academic Press. 1980. Threading – Processes. References: 1. Singleton & Activated Objects. Microsoft Intermediate Language. Creatint a Web User Control. Events in Web Forms. Unit 5 Developing Web Applications – Anatomy. McGraw Hill Inc. Windows Services – Characteristics. ‘Neural networks in computer intelligence’. Creating Windows Controls – Source of Controls.NET – Introduction to XML. 1989. Using Namespace. Introduction to Visual Studio . Understanding Metadata. 2. ‘Fuzzy sets. Creating a Windows Service. AppDomains. Constructors. XML Serialization. Wei Meng Lee. The DataSet Component. Application Deployment. Didier Dubois & Henri Prade.NET. ‘VB. The Common Type System. Unit 2 Object Oriented Programming – Classes. Using XML in VB. Unit 3 Database: Data Access with ADO. Master / Details. Applying Object & Components – Abstraction. ‘Neural computing: theory and practice’. Developing Custom Controls in . String Handling. Forms at Runtime Controls. interacting with Windows Services.NET Complaint Programming Languages. Billy Hollis. Common Language Runtime. Relying On Automatic Resource Management. Creating Web Controls – Types of Custom Web Controls. Forms . Prentice Hall. 2.NET 2003’. ******* E19 . Inheriting from an Existing Control. Thread Safety & Thread Affinity. and Threads. Error Handling.NET Framework – Concepts. Wiley Publishing. Program Flow Control. Permissions. Rockford Lhotka. ‘Professional VB. Using System Services.NET Framework – Introduction. uncertainty and information’.NET Programming Developer’s . Wasserman P. ADO.Visual Programming VB. Web Forms Versus ASP. Forms at Design Time. Van Nostrand Reinhold.Klir & Tina A. COM & . Limin Fu.NET components. George J. Unit 4 Working with Classing COM & Interfaces – COM. ‘Fuzzy sets and systems: theory and applications’. Creating a Subclassed Control. New York. Remoting – Basic Terminology. Controls Available. Encapsulation. Working with Data Structures. Composite UserControl. Data Binding – Presenting Data. Security in the .NET Components in COM World. The Control & UserControl Base Classes. Using . Advanced Programming – Windows Forms – Forms as Classes. Thread Scheduling. Data Binding.1. Inheritance & Interfaces. . Henk-Evert Sonder. Introduction to Web Services.D. . Tim Mc Carthy. SingleCall. Creating Assemblies. XML Stream Style Parsers. Polymorphism. Active X Controls.Folger. System XML Document Support. 1988.NET Programming Fundamentals – Variables & Unit 1 The Microsoft . 2004 Edition.NET.NET Data Providers. Text Book: Bill Evjen.

linear-positive invariant degradations. restoration in the presence of noise. 2.NET Programming Black Book’. light and electromagnetic spectrum. ‘Visual Basic . histogram processing. Text Book: Rafael C Gonzalez & Richard E. 2. 3rd Ed. Jain. Steven Holzner. frequency domain filtering. John Wiley & Sons. Woods. Prentice Hall. 2001. Unit 2 Spatial Filtering: fundamentals of spatial filtering. Frequency domain Filtering: Background. ‘Digital Image Processing’. noise in color images. Unit 5 Image Segmentation: fundamentals. line and edge detection. some basic intensity transformation functions. smoothing and sharpening. sampling. some basic relationship between pixels. erosion and dilation. gray-scale morphology. Unit 4 Image Compression: fundamentals. Morphological Image Processing: preliminaries. opening and closing. image sensing and acquisition. point. pseudo color and full color image processing. ‘Fundamentals of Digital Image Processing’. ‘ Digital Image Processing’. ****** . color transformations. application areas. IDG Books. components of an image processing system. Fourier transforms and DFT. 2008. Unit 3 Image restoration and Reconstruction: Noise models. thresholding. basic compression methods. Anil K. digital image watermarking. ****** E20 . use of motion in segmentation. 2008. Intensity Transformations: Basics of intensity transformations. implementation. Pratt. Fundamental steps in digital image processing. References: 1. 3rd Ed. Color Image Processing: color fundamentals. PHI. 2001. 2-D DFT and properties. color image compression. William K. high pass filters.. color models. constrained least square filtering. smoothing and sharpening filters. inverse filtering. low pass filters.. some basic morphological algorithms.Guide’. geometric mean filter.Digital Image Processing (July 2008) Unit 1 Introduction: What is digital image processing Origins. Dreamtech Press 2006. region based segmentation. preliminary concepts. Wiener filtering. image sampling and quantization. Digital Image Fundamentals: elements of visual perception.

Software Engineering Unit 1 Software Quality in Business Context : The meaning of Quality. GUI Testing. Testing Techniques – Equivalence partitioning. Differences between Inspection and Testing. Narosa Publishing House.E 21 . Extreme testing. People – CMM. ‘Software Engineering principles’. 5 ‘Software Engineering Project Management’. References : 1 Roger S. Metrics implementation in projects. 2 Alka Jarvis and Vern Crandall. ISO 9001:2000. 4 Richard Fairley. 1997. Product Quality. 3 Pankaj Jalote. 6th Ed. The V-Model for testing Phases.Wiley-IEEE. (Pressman). The EFQM Excellence Model. Review reporting abd Record keeping. Classification of Software Metrics. How does six sigma work. SQA Activities. McGraw-Hill International Edition.Introduction. Reliability Testing. Software Measurement and Metrics: Introduction. Malcom Baldrige National Quality Award. Tata McGraw-Hill. Unit 2 Product Quality and process Quality: Introduction. S. Quality Assurance. Formal Technical reviews. Formal Approaches to SQA. Unit 4 Software CMM and other process improvement models: CMM for software. Software Reliability – Measures of Reliability and Availability. Software Quality Assurance Background issues. Identifying appropriate Measures and Metrics for Projects. ‘Software Quality Assurance: principles and practice’. Software Reviews – Cost impact of Software Defects. Quality Assurance at each phase of SLDC. Boundary value Analysis. 2004. ‘Software Engineering: a practitioner’s approach’. ‘Software Engineering concepts’. Why is Quality important. State Transition Analysis . Defect Metrics. Gray Box Testing. Models for product Quality. Background to the CMNMODEL. 2004.Software Quality Pre-requisite: CAS 2401 . The SQA plan. Process Quality. Practices followed at mature organizations. Defect Amplification and removal. Measurement during Software Life cycle Context. Software Safety. Godbole). Narosa Publishing House. Computer Society overview. ****** . The Test Plan. Requirements related metrics. Testing vs. Other models for Software Process Improvement and excellence – ISO 12207. What is six sigma in statistical context. The quality challenge. Quality Assurance in Software Support projects. Testing Life Cycle.. Software Systems evolution. Test Artifacts. Edited by Richard H Thayer. Risk-based testing. Quality control vs. Measurements and Process Improvement. Issues in Software Measurements and Metrics program implementation. CMM-Integrated model – What is CMM-I. Performance Testing. Software Quality Assurance: + Quality Concepts – Quality. How does ISO carry out its work. 2005. Types of CMM-I models. Review guidelines. Unit 5 Software Testing – Overview. ISO Standards Development Process. 2000.The review meeting. Object. Six Sigma. Quality control. Test process improvement framework Text Book: Nina S Godbole. How does the ISO 9000 family of standards work. Measurement principles. Prentice-Hall PTR. Sample-driven reviews. The SQA function (Nina. IEEE 1074. ISO Certification Surveillance Audits/RE-certification/Re Assessment Audits. Metrics for Software Maintenance.Purpose of Testing. Earned Value Analysis. Debugging. Pressman. Cost of Quality. 2001. ‘In roads to software quality: how to guide and toolkit’.Oriented Metrics: An Overview (Godbole) Unit 3 ISO 9001: What is ISO 9000. Types of CMMs.