G. B.

Technical University, Lucknow

SYLLABUS

B.Tech THIRD and FOURTH YEAR ( Semester V, VI, VII and VIII)

Computer Science & Engineering and Information Technology

Effective from session 2010-11

1

B.Tech Study and Evaluation Scheme Effective from session 2010-11 Computer Science & Engineering Year-III, Semester V
SNo Subject Code Subject Period Evaluation Scheme Sessional CT TA Total 1 2 3 4 5 6 EHU-501 ECS-501 ECS-502 ECS-503 ECS-504 ECS-505 Engineering & Managerial Economics Operating System Design and Analysis of Algorithms Object Oriented Techniques Computer Graphics Graph Theory 3-1-0 3-1-0 3-1-0 3-1-0 2-1-0 2-1-0 30 30 30 30 15 15 20 20 20 20 10 10 50 50 50 50 25 25 100 100 100 100 50 50 150 150 150 150 75 75 Exam Total

Practicals / Training /Projects 7 8 9 10 11 ECS-551 ECS-552 ECS-553 ECS-554 GP-501 Operating System Lab* Algorithms Lab* Object Oriented Techniques Lab* Computer Graphics Lab* General Proficiency 0-0-2 0-0-2 0-0-2 0-0-2 25 25 25 25 25 25 25 25 25 25 25 25 50 50 50 50 50

* At least 10 problems are to be considered based on corresponding theory course.

2

B.Tech Study and Evaluation Scheme Effective from session 2010-11 Computer Science & Engineering Year-III, Semester VI
SNo Subject Code Subject Period Evaluation Scheme Sessional CT TA Total 1 2 3 4 5 6 EHU-601 ECS-601 ECS-602 ECS-603 ECS-604 EIT-505 Industrial Management Computer Network Software Engineering Compiler Design Web Technology 3-1-0 3-1-0 3-1-0 3-1-0 2-1-0 2-1-0 30 30 30 30 15 15 20 20 20 20 10 10 50 50 50 50 25 25 100 100 100 100 50 50 150 150 150 150 75 75 Exam Total

Information Security and Cyber Laws Practicals / Training /Projects 7 8 ECS-651 ECS-652 Computer Network Lab* Web Technology based Software Engineering Lab* Compiler Lab* Seminar General Proficiency

0-0-2 0-0-2

-

25 25

25 25

25 25

50 50

9 10 11

ECS-653 ECS-654 GP-601

0-0-2 0-0-2 -

-

25 50 -

25 50 -

25 -

50 50 50

* At least 10 problems are to be considered based on corresponding theory course.

3

B.Tech Study and Evaluation Scheme Effective from session 2011-12 Computer Science & Engineering Year-IV, Semester VII
SNo Subject Code Subject Period Evaluation Scheme Sessional CT TA Total 1 2 3 4 5 EOE-071EOE-074 ECS-701 ECS-702 Open Elective-I Distributed Systems Digital Image Processing CS-Elective-I CS-Elective-II 3-1-0 3-1-0 3-1-0 3-1-0 3-1-0 30 30 30 30 30 20 20 20 20 20 50 50 50 50 50 100 100 100 100 100 150 150 150 150 150 Exam Total

Practicals / Training /Projects 6 7 8 9 10 ECS-751 ECS-752 ECS-753 ECS-754 GP-701 Distributed Systems Lab* Digital Image Processing Lab* Project Industrial Training Viva-Voce General Proficiency 0-0-2 0-0-2 0-0-4 0-0-2 25 25 50 50 25 25 50 50 25 25 50 50 50 50 50

* At least 10 problems are to be considered based on corresponding theory course.

4

B.Tech Study and Evaluation Scheme Effective from session 2011-12 Computer Science & Engineering Year-IV, Semester VIII
SNo Subject Code Subject Period Evaluation Scheme Sessional CT TA 1 2 3 4 EOE-081EOE-084 ECS-801 Open Elective-II Artificial Intelligence CS-Elective-III CS-Elective-IV 3-1-0 3-1-0 3-1-0 3-1-0 30 30 30 30 20 20 20 20 Total 50 50 50 50 100 100 100 100 150 150 150 150 Exam Total

Practicals / Training /Projects 5 6 7 ECS-851 ECS-852 GP-801 Artificial Intelligence Lab* Project General Proficiency 0-0-2 0-0-12 25 25 25 200 50 300 50

100 100 -

Note:
1. 2. Practical Training done after 6th Semester would be evaluated in 7th semester through Report and Vivavoce. Project has to be initiated in 7th semester beginning and completed by the end of 8th semester with proper report and demonstration.

* At least 10 problems are to be considered based on corresponding theory course.

5

List of Electives for B.Tech (Computer Science & Engineering) CS-Elective-I ECS-071 ECS-072 ECS-073 ECS-074 CS-Elective-II ECS-075 ECS-076 EIT-073 ECS-077 EIT-074 CS-Elective-III ECS-081 ECS-082 ECS-083 ECS-084 CS-Elective-IV ECS-085 ECS-086 ECS-087 *ECS-088 * Computational Geometry Computational Complexity Parallel Algorithms Pattern Recognition Data Mining & Data Warehousing Distributed Database Bioinformatics Data Compression IT in Forensic Science Real Time System Software Project Management Embedded Systems Cryptography & Network Security Neural Networks Natural Language Processing Mobile Computing Soft Computing Note: ECS.088 may be opted by only those students who didn’t opt EOE-041 as an open elective 6 .

B. 7 .Tech Study and Evaluation Scheme Effective from session 2010-11 Information Technology Year-III. Semester-V SNo Subject Code Subject Period Evaluation Scheme Sessional CT TA Total 1 2 3 4 5 6 EHU-501 ECS-501 ECS-502 EIT-501 ECS-504 EIT-505 Engineering & Managerial Economics Operating System Design and Analysis of Algorithms E-Commerce Computer Graphics 3-1-0 3-1-0 3-1-0 3-1-0 2-1-0 2-1-0 30 30 30 30 15 15 20 20 20 20 10 10 50 50 50 50 25 25 100 100 100 100 50 50 150 150 150 150 75 75 Exam Total Information Security and Cyber Laws Practicals / Training /Projects 7 8 9 10 11 EIT-551 EIT-552 EIT-553 EIT-554 GP-501 Operating System Lab* Algorithms Lab* Mini Project using Web Technology -1 Computer Graphics Lab* General Proficiency 0-0-2 0-0-2 0-0-2 0-0-2 - - 25 25 25 25 - 25 25 25 25 - 25 25 25 25 - 50 50 50 50 50 * At least 10 problems are to be considered based on corresponding theory course.

Tech Study and Evaluation Scheme Effective from session 2010-11 Information Technology Year-III. Semester-VI SNo Subject Code Subject Period Evaluation Scheme Sessional CT TA Total 1 2 3 4 5 6 EIT-602 ECS-505 EHU-601 ECS-601 EIT-601 Industrial Management Computer Network Software Project Management IT-Elective-I ERP Graph Theory 3-1-0 3-1-0 3-1-0 3-1-0 2-1-0 2-1-0 30 30 30 30 15 15 20 20 20 20 10 10 50 50 50 50 25 25 100 100 100 100 50 50 150 150 150 150 75 75 Exam Total Practicals / Training /Projects 7 8 9 10 11 EIT-651 EIT-652 EIT-653 EIT-654 GP-601 Computer Network Lab* Software Project Management Lab * Mini Project using Web Technology -2 Seminar General Proficiency 0-0-2 0-0-2 0-0-2 0-0-2 25 25 25 50 25 25 25 50 25 25 25 50 50 50 50 50 Note: EIT-553 (Mini Project using web technology-1) started in 5th semester has to be continued and completed in 6th semester as EIT-653 (Mini Project using web technology-2) * At least 10 problems are to be considered based on corresponding theory course. 8 .B.

B. 9 .Tech Study and Evaluation Scheme Effective from session 2011-12 Information Technology Year-IV. Semester-VII SNo Subject Code Subject Period Evaluation Scheme Sessional CT TA Total 1 2 3 4 5 EOE-071EOE-074 EIT-701 ECS-801 Open Elective-I Cryptography & Network Security Artificial Intelligence IT-Elective-II IT-Elective-III 3-1-0 3-1-0 3-1-0 3-1-0 3-1-0 30 30 30 30 30 20 20 20 20 20 50 50 50 50 50 100 100 100 100 100 150 150 150 150 150 Exam Total Practicals / Training /Projects 6 EIT-751 Cryptography & Network Security Lab* Artificial Intelligence Lab* Project Industrial Training Viva-Voce General Proficiency 0-0-2 25 25 25 50 7 8 9 10 EIT-752 EIT-753 EIT-754 GP-701 0-0-2 0-0-4 0-0-2 - - 25 50 50 - 25 50 50 - 25 - 50 50 50 50 * At least 10 problems are to be considered based on corresponding theory course.

2.Tech Study and Evaluation Scheme Effective from session 2011-12 Information Technology Year. Project has to be initiated in 7th semester beginning and completed by the end of 8th semester with proper report and demonstration.B. Practical Training done after 6th Semester would be evaluated in 7th semester through Report and Vivavoce. * At least 10 problems are to be considered based on corresponding theory course.IV. 10 . Semester-VIII SNo Subject Code Subject Period Evaluation Scheme Sessional CT TA 1 2 3 4 EOE-081EOE-084 ECS-701 Open Elective-II Distributed Systems IT-Elective-IV IT-Elective-V 3-1-0 3-1-0 3-1-0 3-1-0 30 30 30 30 20 20 20 20 Total 50 50 50 50 100 100 100 100 150 150 150 150 Exam Total Practicals / Training /Projects 5 6 7 EIT-851 EIT-852 GP-801 Distributed Systems Lab* Project General Proficiency 0-0-2 0-0-12 25 25 25 200 50 300 50 100 100 - Note: 1.

List of Electives for B.Tech ( Information Technology) IT-Elective-I EIT-061 EIT-062 EIT-063 IT-Elective-II ECS-071 ECS-072 ECS-073 ECS-074 EIT-071 EIT-072 IT-Elective-III ECS-075 ECS-076 EIT-073 ECS-077 EIT -074 IT-Elective-IV ECS-081 ECS-083 EIT-081 EIT-082 IT-Elective-V ECS-085 ECS-086 ECS-087 *ECS-088 * Software Quality Engineering Software Testing Software Reliability Computational Geometry Computational Complexity Parallel Algorithms Pattern Recognition Discrete Structures Theory of Automata and Formal Languages Data Mining & Data Warehousing Distributed Database Bioinformatics Data Compression IT in Forensic Science Real Time System Embedded Systems Digital Image Processing Multimedia Systems Neural Networks Natural Language Processing Mobile Computing Soft Computing Note: ECS.088 may be opted by only those students who didn’t opt EOE-041 as an open elective 11 .

Silberschatz.Batch. “Operating Systems”. Dekker’s solution. Time sharing. Threads and their management. Operating System Structure. Process generation. Monolithic and Microkernel Systems. “Operating Systems Concepts”. Unit – III CPU Scheduling: Scheduling Concepts. Thrashing. Multiuser Systems. Unit – IV Memory Management: Basic bare machine. Process Control Block (PCB). Multithreaded Systems. Inter Process Communication models and Schemes. Protection schemes. Unit – V I/O Management and Disk Scheduling: I/O devices. Performance Criteria. Test and Set operation. Paged segmentation. Operating System services. Page replacement algorithms. Galvin and Gagne. Process Transition Diagram. Reentrant Kernels. “ An Introduction to Operating System”. 12 . Classical Problem in Concurrency. Harvey M Dietel. Interactive. Process States. Sleeping Barber Problem. Sibsankar Halder and Alex A Aravind. “Operating Systems : A Concept based Approach”. Demand paging. File system protection and security. Multiprogramming with fixed partitions. Virtual memory concepts. File System: File concept. Scheduling Algorithms. Deadlock: System model. Pearson Education 3. Unit – II Concurrent Processes: Process Concept. Resident monitor. Real Time System. Multiprocessor Systems.Layered structure. Classification of Operating systems. Critical Section Problem. and File sharing. Locality of reference. Peterson’s solution. RAID. Process identification information. Pearson Education 4. Paging.SYLLABUS ( Computer Science & Engineering and Information Technology) ECS-501: Operating System Unit – I Introduction : Operating system and functions. Performance of demand paging. I/O buffering. Cache memory organization. References: 1. and I/O subsystems. Disk storage and disk scheduling. Multiprocess Systems. Prevention. Semaphores. Principle of Concurrency. 2nd Edition. D M Dhamdhere. File system implementation issues. Segmentation. Deadlock characterization. Recovery from deadlock. Schedulers. Avoidance and detection.Dining Philosopher Problem. Multiprogramming with variable partitions. File organization and access mechanism. Producer / Consumer Problem. System Components. Wiley 2. Process address space. Mutual Exclusion. Multiprocessor Scheduling. File directories.

Unit -V Selected Topics: Algebraic Computation. Cengage Learning. 3.IV Dynamic programming with examples such as Kanpsack. Coreman. Backtracking. "Fundamentals of Computer Algorithms". 4. Horowitz & S Sahni. Fibonacci Heaps. Theory of NP-completeness. Convex hull and Searching. String Matching. Comparison of sorting algorithms. Performance measurements. Growth of functions. Quick sort. 2008. References: 1. Single source shortest paths .TMH 5. Mc Graw Hill. William Stallings. “Operating Systems: Internals and Design Principles ”. Paul. RCT Lee. Graph Coloring. RC Chang and YT Tsai. Fast Fourier Transform. Charles E. 5. Sorting and order Statistics . Printice Hall of India. Thomas H.III Divide and Conquer with examples such as Sorting. 13 . Approximation algorithms and Randomized algorithms. Knapsack. All pair shortest paths – Warshal’s and Floyd’s algorithms.” Algorithms”. “The Design and Analysis of Computer Algorithms” Pearson Education. Unit -II Advanced Data Structures: Red-Black trees. Complexity of algorithms. Aho.Shell sort. Resource allocation problem. Branch and Bound with examples such as Travelling Salesman Problem. Unit .Dijkstra’s and Bellman Ford algorithms. 6th Edition. SS Tseng. 2005. n-Queen Problem. “Introduction to the Design and Analysis of Algorithms”. Berman. Greedy methods with examples such as Optimal Reliability Allocation. Sorting in linear time. Minimum Spanning trees – Prim’s and Kruskal’s algorithms. B – trees. Hamiltonian Cycles and Sum of subsets. Ullman. Binomial Heaps. Unit . Matrix Multiplication. E. Leiserson and Ronald L. Heap sort. “Introduction to Algorithms”. Rivest. Analyzing algorithms. 2. Merge sort. Pearson Education ECS-502: Design and Analysis of Algorithms Unit-I Introduction : Algorithms. Hopcraft.

Component diagrams and Deployment diagrams. Collaboration Diagrams: Terms. Features. generosity. Object representation. JDBC/ODBC Bridge. Documenting design considerations. UNIT IV Introduction to Java. Architecture. Jackson Structured Development (JSD). Passing arguments to methods. Class &Object Diagrams: Terms. Use case Diagrams. Combining three models. Package diagram. Relationships. conceptual model of the UML. Multi threading. Inheritance. Packages. JAR files. design optimization. UNIT V Java Swing: Introduction to AWT. Utility of Java as internet programming language. Encapsulation. Physical packaging. programming in the large. robustness. History. importance of modeling. Developing a simple bean. Session Beans. Inner classes. Object design. Concepts. polymorphism. Mapping object oriented concepts using non-object oriented language. Introduction to UML. Java Beans: Application Builder tools. UNIT III Object Oriented Analysis. using Bound properties. interaction diagram. Object Oriented concept of Java. Object oriented language features. 14 . callback mechanism. Deployment. principles of modeling. Time diagram. abstract method and classes. Sequence Diagrams: Terms. depicting a message. Translating classes into data structures. modeling techniques for Class & Object Diagrams. iterated messages. Activity Diagrams. State Machine . Process and thread.ECS-503: Object Oriented Techniques UNIT I Introduction: The meaning of Object Orientation. information hiding. Introduction to servlets. Implementing inheritance. AWT v/s Swing. concepts. polymorphism in collaboration Diagrams. associations encapsulation. Event Handling. Networking. concepts. Basic Behavioral Modeling: Use cases. object identity. Adjustment of inheritance. Abstraction and Encapsulation. Structured analysis and structured design (SA/SD). Introspection. depicting asynchronous messages with/without priority. Introduction to Enterprise Java beans (EJB). common Mechanisms. Creating a Swing Applet and Application. Procedural v/s OOP. object oriented modeling. The Java Beans API. Entity Beans. extensibility. I/O . String Handling. Implementation of control. Object oriented programming style: reusability. Event and signals. JDBC. UNIT II Basic Structural Modeling: Classes. Java APIs. The bean developer kit(BDK). Polymorphism. Object oriented design. Collection. Interface . use of self in messages. Architectural Modeling: Component. and diagrams. broadcast messages. Designing algorithms. The connectivity model. Classes and Objects.

“The Unified Modeling Language User Guide”. Points and lines. Unit – III Three Dimensional: 3-D geometric primitives. basic illumination models – Ambient light. 3-D Object representation. Graphic Displays. Color consideration. Raster scan displays. Blobby objects. “The Complete Reference JAVA2”. Booch. Circle generating algorithms. Acme Learning ECS-504: Computer Graphics Unit – I Introduction and Line Generation: Types of computer graphics. James Rumbaugh. Polygon clipping – Sutherland Hodgeman polygon clipping. Maksimchuk.” Computer Graphics”. Amrendra N Sinha and Arun D Udai. 2-D Clipping algorithmsLine clipping algorithms such as Cohen Sutherland line clipping algorithm. Tiwari. Unit – II Transformations: Basic transformation. Reflections and shearing. Scan line method. Pearson Education 6.Random scan displays. Ivar Jacobson. Pearson Education 3. Hidden Lines and Surfaces: Back Face Detection algorithm. TMH 4. Schildt. Bspline and Bezier curves and surfaces. Pearson Education 2. A. Conallen and Houstan. Warn model. Composite transformations. Depth buffer method. Matrix representations and homogenous coordinates. “Object Oriented Modeling and Design”.buffer method. Ellipsoid. Young. Transparency and Shadows. PHI 2. 3-D viewing. Viewing transformations. Introductory concepts of Spline. and parallel version of these algorithms. “ Object Oriented Programming with JAVA” . Intensity Attenuation. 3-D Clipping.References: 1. Combined approach. TMH 5. “Object Oriented Analysis and Design with Applications”. Diffuse reflection. Mark Priestley “Practical Object-Oriented Design with UML”. Specular reflection and Phong model. Liang Barsky algorithm. Line clipping against non rectangular clip windows. TMH 15 . Line drawing algorithms. 3-D Transformation. Engle. Spheres. Text clipping. Frame buffer and video controller. “Computer Graphics C Version”. Naughton. Curve clipping. Grady Booch. Donald Hearn and M Pauline Baker. Mid point circle generating algorithm. Weiler and Atherton polygon clipping. projections. Windowing and Clipping: Viewing pipeline. James Rumbaugh et. al. Pandey. Unit – IV Curves and Surfaces: Quadric surfaces. References: 1.

on counting trees. all cut sets in a graph. Gary Chartrand and Ping Zhang. Balakrishnan. thickness and crossings. path & circuits. Matrix representation of graph – Basic concepts. Rogers. Narosa 5. F. Steven Harrington. Schaum's Outline of Graph Theory. detection of planarity. cut set vector. various example of graphs & their sub graphs. basis vector. “Computer Graphics with OpenGL”. Coloring. various operation on graphs. four color problem Discussion of Graph theoretic algorithm wherever required. matching. covering and partitioning of a graph. disconnected graphs and component. N. distance diameters. TMH 7. Graph Theory. TMH 3. Pearson Education 16 . Graph theory with applications to Engineering and Computer Science. finding all spanning trees of a graph and a weighted graph. fundamental circuits. References 1. fundamental circuits and cut sets . chromatic partitioning. combinatorial and geometric dual: Kuratowski graphs. TMH 5. McGraw Hill Pearson ECS-505: Graph Theory Unit -I Graphs. Graph Theory: Modeling. rooted and binary trees. Cut-set matrix and Adjacency matrix. Applications and Algorithms.3. Hamiltonian paths and circuits. Harary. the traveling sales man problem. chromatic number. Discussion on criterion of planarity. Unit. walks. “ Procedural Elements of Computer Graphics”. education 4. V. Wilson. Circuit matrix. some properties. circuit and cut set subspaces. Bondy and Murthy: Graph theory and application. PHI 2. Path matrix. some basic properties. Geir Agnarsson. Robin J. Donald Hearn and M Pauline Baker. algorithms of primes. Unit -III Cuts sets and cut vertices. Pearson Education 4. network flows Planer graphs. connected graphs. Kruskal and Dijkstra Algorithms. circuit vector. Unit -IV Vector space of a graph and vectors. radius and pendent vertices.II Trees and fundamental circuits. chromatic polynomials. Addison Wesley. covering. Deo. connectivity and separability. 6. euler graphs. Introduction to Graph Theory. Introduction to Graph Theory. spanning trees. Incidence matrix. Sub graphs. geometric dual. “Computer Graphics: A Programming Approach” .

Govt. New Age International Goel.Commerce: Internet and Intranet based E-commerce. Network Access Equipments. Technology. needs of E-Commerce. policies and Agenda. E. 6. online Banking. John Vacca “Electronic Commerce”. 4. components of Firewall. Changing Nature of Information Systems. Transaction security. TMH Turban. Mobile Information device. Pete Lohsin .EIT-501: E-Commerce Unit I : Introduction: Definition of Electronic Commerce. Unit V Electronic Payments: Overview. problems and prospects. credit card. Classification of Threats and Assessing Damages 17 . Digital Signatures. framework. basics. “Frontiers of Electronic Commerce”. “Electronic Commerce 2004: A Managerial Perspective”. 3. Emerging client server. ISDN. FRAME RELAY). incentives for engaging in electronic commerce. Unit IV Encryption: Encryption techniques. E-Checks. Addison. Security Threats. Network Infrastructure. Andrew Winston.Commerce Law. New Age International Laudon. Smart card. Information System Threats and attacks. Role of Internet and Web Services. Credit/Debit card based EPS. Payment Gateway. Unit II: Network Infrastructure for E. References: 1. Factors to consider in Firewall design. Ritendra “E-commerce”. advantages and disadvantages. Secret key encryption. Unit III Web Security: Security Issues on web. Limitation of Firewalls. Pearson Education EIT-505 Information Security and Cyber Laws UNIT-I History of Information Systems and its Importance. WAP technology. 2. Society”. E-Commerce Models. digital Tokens. Virtual Private Network. The SET protocol. 5. Importance of Firewall. Pearson Education Bajaj and Nag. Impact of E-commerce on business. Need of Distributed Information Systems. Broadband telecommunication (ATM.Issues. Forms of Agreement. Network Security. “E-Commerce: Business. Triple encryption. Mobile Commerce: Introduction. Asymmetric encryption: public and private pair key encryption. certificate. EDI Application in business. Ravi Kalakota.Wesley. magnetic strip card. E-Commerce: technology and prospects. Wireless Application Protocol. “E-Commerce the cutting edge of Business”. Symmetric Encryption: Keys and data encryption standard.

Issues in Data and Software Privacy Cyber Crime Types & overview of Cyber Crimes References : 1. IT Act 2000 18 . Legal Challenges UNIT-III Model of Cryptographic Systems. Use of Tunneling with VPN. Benefits. Criteria for selection of biometrics. Pearson Education 3. Copyright Law. Business Transactions on Web. Authentication Mechanisms. Perimeter for Network Protection.Needs.Basic Concepts. Mc Graw Hill 6. Legal Issues in Data mIning Security. Patent Law. Confidentiality. Finger Prints.“ Information Security”. “Computer Insecurity”. System of Keys. E Governance and EDI. Delhi 4. Basic Tenets of Physical Security and Physical Entry Controls. authentication Service Security. IPR. Firewalls. Digital Signature. Willey 2. Shoemaker. UNIT-II Security Threats to E Commerce. Policies Network Security.Security in Mobile and Wireless Computing. Springer 7.Security Challenges in Mobile Devices.“Cyber Laws Simplified”. Dimensions. Concepts in Electronics payment systems. Public Key Cryptography. Yadav. Security Implication for organizations. Merkov.Ethical Issues. Sood. Factors in Biometrics Systems. Economic and Social Aspects. Virtual Organization. Design Issues in Biometric Systems. Need of Intrusion Monitoring and Detection. Physical Security. Integrity Availability and other terms in Information Security. Issues in Documents Security.“ Information Systems Security”. Design and Implementation Issues. Information Classification and their Roles. Building Security into Software Life Cycle Ethics. Access Control. Credit/Debit Cards. E Cash. “ Information Assurance for the Enterprise”. Network Attacks. Intrusion Detection Virtual Private Networks. Types of VPNs and their Usage. Requirement of Digital Signature System. Schou. Security Concerns in VPN UNIT-IV Security metrics. Godbole.Biometrics. “Foundations of Information Technology”.Need. Tata McGraw Hill 5.Classification and their benefits Information Security & Law. New Age. Interoperability Issues. Furnell. Disaster and Controls. Breithaupt. Laptops Security Basic Principles of Information Security.

Firewall Media ECS-602: Software Engineering Unit-I: Introduction Introduction to Software Engineering. Data compression techniques. Network structure and architecture. Macmillan Press 4. "Data Communication and Networking".Channel Allocations. Data and Computer Communication. Pearson Education 3.Point .IV Transport Layer: Transport Layer . Spiral Model.to Pont Networks. TMH 2. connection management. Software Characteristics. Example Networks . Other application. Stallings. IP address. References : 1. Software Engineering Processes.Internet and Public Networks. Shanmugarathinam. A.Design issues.Elementary Data Link Protocols. Computer Networks. Software Crisis. Sliding Window protocols. ISDN. Similarity and Differences from Conventional Engineering Processes. ”Essential of TCP/ IP”. Iterative Enhancement Models. cryptography . IP packet. Prototype Model. Access and Management.Window Management.S. Network Topology Design . Unit .Overview of IEEE standards . Presentation Layer-Design issues. Tanenbaum. Unit . G.FDDI. session LayerDesign issues. Software Development Life Cycle (SDLC) Models: Water Fall Model. The OSI reference model. Error Handling. remote procedure call. “Computer Networks”. services. Congestion control Internetworking -TCP / IP. Switching methods. Unit-II Medium Access sub layer: Medium Access sub layer .III Network Layer: Network Layer . Forouzen.Delay Analysis. Software Components. Local Access Network Design. Evolutionary Development Models.ECS-601: Computer Network Unit -I Introduction Concepts: Goals and Applications of Networks. IPv6. LAN protocols ALOHA protocols . Physical Layer Transmission Media. Electronic mail. Acme Learning 5. 19 .TCP . Back Bone Design. Terminal Handling. Unit-V Application Layer: Application Layer: File Transfer. Anuranjan Misra. W. routing. Data Link Layer . Virtual Terminals. Software Quality Attributes.

Manodrioli. Architectural Design. Rajib Mall. 7. Acceptance Testing. Efforts. K. Software Engineering. Decision Tables. Data Flow Diagrams. Corrective and Perfective Maintenance. Cengage Learning. Fundamentals of Software Engineering. Change Control Process. K. Integration Testing. Fundamentals of Software Engineering. Flow Charts. Documentation. Information Modeling. Ian Sommerville. Top-Down and Bottom-Up Design.Unit-II: Software Requirement Specifications (SRS) Requirement Engineering Process: Elicitation. 20 . 2. SQA Plans. Schedule/Duration. References: 1. PHI Publication. Software Risk Analysis and Management. Regression Testing. ISO 9000 Models. Testing for Functionality and Testing for Performance. Pankaj Jalote. Categories of Maintenance: Preventive. Reverse Engineering. Jarayeri. Design Structure Charts. Kassem Saleh. Software Engineering. Static Testing Strategies: Formal Technical Reviews (Peer Reviews). SEI-CMM Model. Compliance with Design and Coding Standards. Alpha and Beta Testing of Products. Software Quality Frameworks. Macmillan Publication. An Overview of CASE Tools. Software Quality Assurance (SQA): Verification and Validation. Analysis. Review and Management of User Needs. Software Engineering. Constructive Cost Models (COCOMO). Addison Wesley. Software Version Control. Structural Testing (White Box Testing). Functional Testing (Black Box Testing). Unit-V: Software Maintenance and Software Project Management Software as an Evolutionary Entity. IEEE Standards for SRS. Feasibility Study. 8. S. Software Engineering: A Practitioners Approach. Software Measurement and Metrics: Various Size Oriented Measures: Halestead’s Software Science. Software Engineering. Resource Allocation Models. Low Level Design: Modularization. Unit Testing. Unit-IV: Software Testing Testing Objectives. Estimation of Various Parameters such as Cost. 6. R. Wiley 5. Aggarwal and Yogesh Singh.”Software Engineering”. Coupling and Cohesion Measures. D. 4. SRS Document. Software ReEngineering. Need for Maintenance. Walk Through. Entity Relationship Diagrams. Software Configuration Management Activities. Carlo Ghezzi. 3. New Age International Publishers. Code Inspection. Pressman. McGraw Hill. Test Data Suit Preparation. Pseudo Codes. Top-Down and Bottom-Up Testing Strategies: Test Drivers and Test Stubs. M. Pfleeger. Unit-III: Software Design Basic Concept of Software Design. Function Point (FP) Based Measures. Cyclomatic Complexity Measures: Control Flow Graphs. Design Strategies: Function Oriented Design. PHI Publication. Cost of Maintenance. Object Oriented Design.

an automatic parser generator. "Compilers: Principles. Aho. the canonical Collection of LR(0) items. predictive parsers Automatic Construction of efficient Parsers: LR parsers. Bootstrapping. DAG representation of basic blocks. Unit – III Syntax-directed Translation: Syntax-directed Translation schemes. translation of assignment statements. The syntactic specification of programming languages: Context free grammars. postfix notation. Addresses in the Target Code. syntactic phase errors semantic errors. three address code. storage allocation in block structured language. quadruple & triples. YACC.” Crafting a Compiler with C”. Kenneth Louden. derivation and parse trees. capabilities of CFG. postfix translation. Techniques and Tools”. 4. implementation of LR parsing tables. representing scope information. statements that alter the flow of control. Code Generator. constructing SLR parsing tables. Phases and passes.. Boolean expressions. Global Data-Flow analysis References: 1. Unit – II Basic Parsing Techniques: Parsers. Unit – IV Symbol Tables: Data structure for symbols tables. Pearson Education 21 . Optimization of Basic Blocks. constructing Canonical LR parsing tables. lexical-analyzer generator. Pearson Education 2. Error Detection & Recovery: Lexical Phase errors. operator precedence parsing. Code optimization: Machine-Independent Optimizations. ambiguity. Optimization of DFA-Based Pattern Matchers implementation of lexical analyzers. More about translation: Array references in arithmetic expressions. Cengage Learning. value numbers and algebraic laws. Charles Fischer and Ricard LeBlanc. Formal grammars and their application to syntax analysis. declarations and case statements. TMH 3. procedures call.” Compiler Construction”. LEX-compiler. the Target Language. Basic Blocks and Flow Graphs. BNF notation. Finite state machines and regular expressions and their applications to lexical analysis. V Raghvan. “ Principles of Compiler Design”. Parse trees & syntax trees.ECS-603: Compiler Design Unit – I Introduction to Compiler. using ambiguous grammars. Implementation of Syntaxdirected Translators. Intermediate code. Sethi & Ullman. Loop optimization. Constructing LALR parsing tables. top down parsing. Shift reduce parsing. translation with a top down parser. Run-Time Administration: Implementation of simple stack allocation scheme. Unit – V Code Generation: Design Issues.

Need Identification. CPM. Types of WBS.NET. Network Diagrams: PERT. Session. C. frames. ASP. Decision process. introduction to COM/DCOM. protocols governing the web. images. Patel and Barik. “Internet and Web Design” . presenting and using XML Unit III: Scripting Java script: Introduction. Scheduling Objectives. Acme Learning EIT-601: Software Project Management UNIT-I: Introduction and Software Project Planning Fundamentals of Software Project Management (SPM). Pearson Education 3. UNIT-II: Project Organization and Scheduling Project Elements. web team . tomcat server. web applications. sharing data between JSP pages. New Age International 2. Management Spectrum. “ Web Technology and Design” . Bar Charts: Milestone Charts. objects. statements. Xavier. New Age International 5. CGI Unit IV: Server Site Programming Introduction to active server pages (ASP). JSP objects. Project Management Cycle. “Web Technologies” Pearson Education 6. Software project estimation. Perl & CGI”. declaring variables and methods. web project. Deitel. Project Life Cycle and Product Life Cycle. XML schemes. java server pages (JSP). BPB Publication. Event and event handling. Project Plan. Functions. ”Introduction to Web Technology & Internet”. Java Script. Activities and Tasks. Earned Value Indicators: 22 . Work Breakdown Structure (WBS). Structure of a Software Project Management Plan. Scheduling terminology and techniques. debugging. DHTML. CSS. JSP application design. forms. documents. Building the project schedule. Ivan Bayross. References 1. Jackson. Planning Objectives. SPM Objectives. Ramesh Bangia. Estimation models. Earned Value Analysis. “Java for programmers”. forms. table. Software Project Planning. Gantt Charts. SPM Framework. VB Script. UNIT-III: Project Monitoring and Control Dimensions of Project Monitoring & Control. Unit II: Web Page Designing HTML: list. Ways to Organize Personnel. Estimation methods. Types of project plan.” HTML. Vision and Scope document. XML: DTD. Project schedule. 4. introduction to AJAX. web development strategies.ECS-604 Web Technology Unit I: Introduction Introduction to web. functions.

Program Verification & validation. 2. Risk analysis. UNIT-IV: Software Quality Assurance and Testing Testing Objectives. Test Cases. MS-Project. Test Strategies. UNIT . ERP. Software Project Management.II Business Process Reengineering. UNIT-V: Project Management and Project Management Tools Software Configuration Management: Software Configuration Items and tasks. UNIT . Pearson Education Kieron Conway. Functional Modules of ERP Software. Test Plans. Risk monitoring. 23 . Benefits. Cotterell. Integration of ERP. Dreamtech Press S. Change Control. Schedule Performance Index (SPI). Change Requests Management. Plan for Change. Product Life Cycle Management(PLM). Error Tracking. Kelkar. Risk Management Process: Risk identification. Supply chain Management. Types of Review: Inspections. M. Data ware Housing. Cost Performance Index (CPI). Pair Programming. The Structure of ERP. The Evolution of ERP.Functional Modules: Introduction. Formal SQA Approaches: Proof of correctness. Evolution and Structure: Conceptual Model of ERP. Code Reviews. Marketplace Dynamics. Cleanroom process. Royce. 4. The Changing ERP Market. 3. Interpretation of Earned Value Indicators.III ERP Marketplace and Marketplace Dynamics: Market Overview. Data Mining. Statistical quality assurance. Baselines. Testing Automation & Testing Tools. Cost Variance (CV). A. Deskchecks. Software Reviews.Budgeted Cost for Work Scheduled (BCWS). Planning and Scheduling Tools. Origin. Cost Benefit Analysis. Version Control. Risk Management: Risks and risk types. References: 1. Software Project Management. EIT-602: ERP UNIT . Software Quality Attributes. SQA Activities.I ERP Introduction. Risk planning. PHI Publication. Software Project Management Tools: CASE Tools. Schedule Variance (SV). Types of Testing. Software Project Management.LAP. Levels of Testing. Online Analytic Processing(OLAP). The SEI Capability Maturity Model CMM). Testing Principles. Supply chain and Customer Relationship Applications. Risk Breakdown Structure (RBS). Walkthroughs. Program Correctness. Software Quality Metrics and Indicators. Tata McGraw-Hill Publication. Software Project Management. Concept of Software Quality.

Mechanism for building distributed file systems. resource Vs communication deadlocks. Consultants. Joseph A Brady. classification of Agreement Problem. edge chasing algorithms. PHI 4. requirement of mutual exclusion theorem. Atomic Commit in Distributed Database system. Examples of distributed Systems. UNIT . shared memory. global state. “ERP Demystified”. Interactive consistency Problem. ERP and Internet. distributed dead lock detection. Tata McGraw Hill 2. Distributed Deadlock Detection: system model. Vendors and Employees. Fundamental Models. Vinod Kumar Garg and Venkitakrishnan N K. Algorithm for Implementation 24 . Integrating ERP into organizational culture. deadlock prevention. Rahul V. Unit–III Agreement Protocols: Introduction. Lamport’s & vectors logical clocks.in ERP. Concepts in Message Passing Systems: causal order. Architectural models. Token based and non token based algorithms.UNIT . Byzantine agreement problem. Ellen F Monk. Design issues in Distributed Shared Memory. Object Oriented Architecture. Causal ordering of messages. “Enterprise Resource Planning”. total order. Future Directives. Consensus problem. Distributed Resource Management: Issues in distributed File Systems.IV ERP Implementation Basics. Altekar “Enterprise Resource Planning”. avoidance. Solution to Byzantine Agreement problem. Role of SDLC/SSAD. Theoretical Foundation for Distributed System: Limitation of Distributed system. Thompson Course Technology 5. Alexis Leon. path pushing algorithms. Logical clocks. Application of Agreement problem. 3. detection & resolution. performance metric for distributed mutual exclusion algorithms. total causal order. Tata McGraw Hill. Critical success and failure factors. centralized dead lock detection. absence of global clock. Mary Summer. System models. Resource sharing and the Web Challenges. “Concepts in Enterprise Resource Planning”. “Enterprise Resource Planning – Concepts and Practice”.Pearson Education ECS-701 DISTRIBUTED SYSTEMS Unit–I Characterization of Distributed Systems: Introduction. Unit-II Distributed Mutual Exclusion: Classification of distributed mutual exclusion. Techniques for Message Ordering. termination detection.V ERP & E-Commerce. Bret Wagner. Using ERP tool: either SAP or ORACLE format to case study References: 1. ERP Implementation Life Cycle.

Basis of Filtering in Frequency Domain. "Distributed System: Concepts and Design”. Timestamp ordering. Unit–IV Failure Recovery in Distributed Systems: Concepts in Backward and Forward recovery. Histogram Specification. Singhal & Shivaratri. McGraw Hill 2.” Distributed Systems”. Ramakrishna. Local Enhancement. Smoothing . PHI 5. Image Enhancement in Frequency Domain Fourier Transform and the Frequency Domain. Applications. Cambridge University Press ECS-702 DIGITAL IMAGE PROCESSING UNIT-I Introduction and Fundamentals Motivation and Perspective. Components of Image Processing System. Smoothing Frequency Domain Filters – Gaussian Lowpass Filters. Commit Protocols. High-pass. Optimistic Concurrency control. Kindberg. Dynamic voting protocols. Recovery in Distributed Database Systems. "Distributed Algorithms". Gerald Tel. A Simple Image Model. UNIT-II Image Enhancement in Spatial Domain Introduction.Gehrke. 25 . Distributed deadlocks. Element of Visual Perception.” Database Management Systems”. Fault . Steen. Atomic Commit protocols. Enhancement using Arithmetic/Logic Operations – Image Subtraction. Histogram Equalization. Sharpening – The Laplacian. Sharpening Frequency Domain Filters – Gaussian Highpass Filters. Fault Tolerance: Issues in Fault Tolerance. Basic Gray Level Functions – Piecewise-Linear Transformation Functions: Contrast Stretching. Homomorphic Filtering. Dollimore. Image Averaging. Mc Grawhill 3. highly available services. Coulouris. Obtaining consistent Checkpoints.Mean filter. Transaction recovery. Comparison of methods for concurrency control. Locks. Correspondence Between Filtering in Spatial and Frequency Domain. Distributed Transactions: Flat and nested distributed transactions. Sampling and Quantization. Recovery in Concurrent systems. Nested transactions.of Distributed Shared Memory. Unit –V Transactions and Concurrency Control: Transactions. Voting protocols. Pearson Education 4. Ordered Statistic Filter. Concurrency control in distributed transactions. Replication: System model and group communication. Tenanuanbaum. "Advanced Concept in Operating Systems". Transactions with replicated data. Filters – Low-pass. References: 1.tolerant services. Basics of Spatial Filtering.

Published by: John Wiley and Sons. Rafael C. Triple DES 26 . Pattern Fitting Approach. Morphological Algorithms – Boundary Extraction. Algorithms to Recover Depth Segmentation Introduction. Geometric Transformation – Plane to Plane transformation. Order Statistic Filters – Median Filter. Data encryption standard(DES). Digital Image Processing and Computer Vision. Pixel-Based Approach. Convex Hull. Modern Block Ciphers: Block ciphers principles. A. Gonzalvez and Richard E. fiestal structure. services and mechanism. Shannon’s theory of confusion and diffusion. Region-based Approach. 3. Digital Image Processing 2 Edition. Dilation and Erosion. Stereo Imaging – Algorithms to Establish Correspondence. Thickening UNIT-V Registration Introduction. Schalkoff. Corner Detection. Thinning. block cipher modes of operations. NJ. Opening and Closing. Edge Elements Extraction by Thresholding. Edge Linking and Edge Following. Strength of DES. Edge and Line Detection: Edge Detection. Stream and block ciphers. Classical encryption techniquessubstitution ciphers and transposition ciphers. Line Detection. Restoration in the presence of Noise only-Spatial Filtering – Mean Filters: Arithmetic Mean filter. Minimum Mean-square Error Restoration. Published by: Pearson Education. Fundamentals of Digital Image Processing. NY. Periodic Noise Reduction by Frequency Domain Filtering – Bandpass Filters. UNIT-IV Morphological Image Processing Introduction. Region Extraction. References: 1. steganography. Idea of differential cryptanalysis. Local Thresholding. Max and Min filters. Published by Prentice Hall. Jain. Extraction of Connected Components. Noise Models. 2.J. Woods. Logic Operations involving Binary Images.K. Multi-level Thresholding.UNIT-III Image Restoration A Model of Restoration Process. nd EIT-701 Cryptography & Network Security Unit-I Introduction to security attacks. Edge Detector Performance. Edge Operators. R. Upper Saddle River. cryptanalysis. Mapping. Geometric Mean Filter. Region Filling.

2. message authentication code. combining security associations. firewalls References: 1. “Cryptography and Network Security”.” Network Security and Cryptography”. Advanced Encryption Standard (AES) encryption and decryption Fermat’s and Euler’s theorem. William Stallings. field. Behrouz A.Unit-II Introduction to group. birthday attacks. Bruce Schiener. Discrete Logarithmic Problem. Authentication header. Digital signature standards (DSS). Encapsulating security payloads. security of hash functions. Secure electronic. Primality testing. Authentication Applications: Kerberos Electronic mail security: pretty good privacy (PGP). hash functions. Principals of public key crypto systems. Extended Euclidean Algorithm. “Cryptography and Network Security: Principals and Practice”. System Security: Introductory idea of Intrusion. TMH 27 . Unit-V IP Security: Architecture.509 Certificates. Public key distribution. proof of digital signature algorithm. Secure hash algorithm (SHA) Digital Signatures: Digital Signatures. modular arithmetic. 5. transaction (SET) . Cengage Learning. Intrusion detection. key management. Diffie-Hellman Key Exchange. Unit-IV Key Management and distribution: Symmetric key distribution. Elgamal Digital Signature Techniques. Viruses and related threats. John Wiley & Sons 4. authentication functions. Pearson Education. Bernard Menezes. prime and relative prime numbers. Public key Infrastructure. finite field of the form GF(p). Frouzan: Cryptography and Network Security. “Applied Cryptography”. S/MIME. X. security of RSA Unit-III Message Authentication Codes: Authentication requirements. Introduction to Secure Socket Layer. RSA algorithm. Chinese Remainder theorem. TMH 3. Atul Kahate.

Search for games. McGraw-Hill 3. K – means clustering. Stuart Russell. Unit-II Introduction to Search : Searching for solutions. Prentice Hall of India. Dan W. Structure of Intelligent Agents. Applications of Artificial Intelligence.Principle Component Analysis (PCA) and Linear Discriminant Analysis (LDA). Decision trees. Resolution. Adversarial Search.Beta pruning. Support Vector Machine (SVM). Local search algorithms and optimistic problems. Pearson Education 2. Utility theory. References: 1. “Introduction to Artificial Intelligence”. Forward & Backward chaining. Peter Norvig. Statistical learning models. Reinforcement learning. Computer vision.EM algorithm. E Charniak and D McDermott. Informed search strategies. Inference in First order logic. Unit-V Pattern Recognition : Introduction. Bayesian Networks. “Artificial Intelligence and Expert Systems”. “Artificial Intelligence”. Parameter estimation methods . 28 . Patterson. Pearson Education 4. Probabilistic reasoning. Hidden Markov Models (HMM). Unit-IV Machine Learning : Supervised and unsupervised learning. Foundations and History of Artificial Intelligence.ECS-801: Artificial Intelligence Unit-I Introduction : Introduction to Artificial Intelligence.Naive Bayes models. Alpha . “Artificial Intelligence – A Modern Approach”. Design principles of pattern recognition system. Theory of first order logic. Uniformed search strategies. Intelligent Agents. Unit-III Knowledge Representation & Reasoning: Propositional logic. Classification Techniques – Nearest Neighbor (NN) Rule. Statistical Pattern recognition. Learning with complete data . Learning with hidden data . Natural Language Possessing. Bayes Classifier. Elaine Rich and Kevin Knight.

SQA Techniques. Software Quality Engineering (SQE). Defect Prevention. Exponential Distribution and Software Reliability Growth Models. Structural and Error-Oriented Analysis & Testing. UNIT-III: Software Quality Management and Models Modeling Process. Metrics for Software Maintenance: Backlog Management Index. Characteristics of Modern Testing Tools. Software Quality Attributes and Specification. Overview of Different Types of Software Review. References: 1. Customer Satisfaction Metrics.Syllabus of Elective Subjects ( Computer Science & Engineering and Information Technology) EIT-061 Software Quality Engineering UNIT-I: Introduction Defining Software Quality. Software Testing. Phase-Based Defect Removal Pattern. In-Process Quality Metrics: Defect Arrival Pattern. Evolution of Software Quality Assurance (SQA). Jeff Tian. Proof of Correctness. Failures. Kan. Cost of Quality. Major SQA Issues. Reduction. Statistical Quality Assurance. Defects. Static and Dynamic Testing Tools. Software Reliability Allocation Models. UNIT-IV: Software Quality Assurance Quality Planning and Control. Defect Rate and Reliability. Stephen H. Wiley 2. Validation & Testing: Verification and Validation. Fix Response Time. Documents and Metrics. Customer Problems Metric. Evolutionary Nature of Verification and Validation. Major SQA Activities. Function Points. Addison-Wesley 29 . Criteria for Model Evaluation. Metrics and Models in Software Quality Engineering. Fix Quality. Faults. Impracticality of Testing all Data and Paths. Software Quality Assessment Models: Hierarchical Model of Software Quality Assessment. UNIT-V: Software Verification. Quality Improvement Process. Quality Standards and Processes. Software Reliability Models: The Rayleigh Model. Zero Defect Software. and Containment. UNIT-II: Software Quality Metrics Product Quality Metrics: Defect Density. Total Quality Management. Introduction to Measurement and Inspection Process. Defect Removal Effectiveness. Functional. Software Quality Indicators.

Software Test Automation: Scope of automation. Test tool selection. “Software Testing and Quality Assurance”. Structural testing: Unit/Code functional testing. Design & Architecture for automation. Scalability testing. Iterative testing. Stress testing. behavior and correctness. Software defect tracking. System integration. Types of testing. Testing in Object Oriented Systems. Management. Defect Bash. New Age International Publication. Initial Smoke or Sanity test. Requirements based testing. 2. Boundary value analysis. Acceptance testing: Acceptance criteria. Requirements. Bi-directional integration. “Fundamentals of Software Testing”. static testing. Principles of testing. “Software Engineering”. Tools for regression testing. Functional versus Non-functional testing. Execution and Reporting. Unit-II: White Box and Black Box Testing White box testing. Desikan and G. “Software Testing: Principles and Practices”. Execution Trace. Beta testing. Ad hoc Testing: Pair testing. Validation and Testing. Exploratory testing. S. Testing and debugging. K. Selection of regression tests. state/graph based testing. Unit-III: Integration. System. Aggarwal and Yogesh Singh. Scenario Testing. Equivalence partitioning. Pearson Education. Defect seeding. test cases selection and execution. Pearson Education. Reliability testing. 30 . and Acceptance Testing Top down and Bottom up integration. Regression test process. Errors. Unit-V: Test Management and Automation Test Planning. Differences between white box and Black box testing. Naik and Tripathy. Code coverage testing. Black Box testing. Model based testing and model checking. Deployment testing. Ramesh. Mathur. K. Generic requirements for test tool framework. Test Minimization. 3. and Failures. Code complexity testing. Wiley 4. Aditya P. Basics of software testing.EIT-062 Software Testing Unit-I: Introduction Faults. Verification. Dynamic Slicing. References: 1. Test metrics and measurements. static analysis tools. Software Quality and Reliability. Testing objectives. Unit-IV: Test Selection & Minimization for Regression Testing Regression testing. Design/Architecture verification.

UNIT-V: Software Reliability Techniques Reliability Techniques: Trending Reliability Techniques. Introduction to Measurement and Inspection Process. Static Code Metrics. Software Reliability Problem. Models and Tools: Study of tools like CASRE. Zero Defect Software. Parametric Reliability Growth Models. and Containment. Metrics for Software Maintenance. Wiley 4. Failures. Documents and Metrics. and Pfleeger. Defect Rate and Reliability. Customer Problems Metric. Modeling Process. Measurement of internal and external product attributes. UNIT-II: Software Reliability Metrics Collection of fault and failure data. Software Reliability Attributes and Specification. Software Reliability Metrics. Software Quality Engineering (SQE). Jeff Tian. Evolution of Software Quality Assurance (SQA). Concept of Defects. Software Quality Assessment Models: Hierarchical Model of Software Quality Assessment. Reduction. UNIT-III: Software Reliability Assessment Models Basics of Reliability Theory. Optimal Reliability Allocation. Phase-Based Defect Removal Pattern. The Rayleigh Model. Exponential Distribution and Software Reliability Growth Models. Triangulations: polygon triangulations. Customer Satisfaction Metrics. Criteria for Model Evaluation. Error Seeding. Reliability Growth. References: 1. Software Reliability indicators. SARA. Defect Prevention. Faults. point-set triangulations. Quality Improvement Process. Software Reliability Models. John Musa. Addison-Wesley ECS-071 COMPUTATIONAL GEOMETRY UNIT-I Convex hulls: construction in 2d and 3d. “Software Reliability Engineering”. Curve Fitting. representations. Stephen H. UNIT-IV: Software Reliability Allocation Models Software Reliability Allocation Models. SMERFS. planar graphs 31 . Major SQA Issues. Metrics and Models in Software Quality Engineering. Dynamic Metrics. In-Process Quality Metrics: Defect Arrival Pattern. Defect Removal Effectiveness. Quality Planning and Control. “Software Metrics: A Rigorous and Practical Approach”. lower bounds. McGraw-Hill 2. Major SQA Activities. Kan. Failure Rate. Overview of Different Types of Software Review. International Thomson Computer Press 3.EIT-063 Software Reliability UNIT-I: Introduction Defining Software Reliability. Predicting Reliability Techniques. Fenton.

Cambridge University Press . Fortune's sweep for Voronoi diagrams. . Computational Geometry in C. Springer-Verlag. Delayney triangulations: divide-andconquer. UNIT-V Sweep techniques: plane sweep for segment intersections. Logical characterizations. resources (time and space). topological sweep for line arrangements. hierarchy. min-max angle properties UNIT-III Geometric searching: point-location. Joseph O'Rourke. many-faces complexity and algorithms. algorithms. linear programming with prune and search. concatenable queues. zone theorems. References: 1. Ketan Mulmuley. incompleteness. Springer Verlag 2. UNIT-II Complexity classes. complexity. Applications of computational geometry. relationships between complexity classes. Computational Geometry: An Introduction Through Randomized Algorithms. P/NP/PSPACE. techniques for counting. Mark de Berg . hardness. segment trees. variants. 3. Algorithms and Applications . Combinatorial geometry: Ham-sandwich cuts. Preparata and Michael Ian Shamos. computability. interval trees. reduction s. visibility with reflections. art-gallery problems UNIT-IV Arrangements of lines: arrangements of hyper planes. Visibility: algorithms for weak and strong visibility. UNIT-III Randomized computation Approximability. Marc van Kreveld . Computational Geometry. Mark Overmars . and Otfried Schwarzkopf. Robust geometric computing. Prentice-Hall 4. UNIT-IV 32 and complexity. ECS-072 COMPUTATIONAL COMPLEXITY UNIT-I Models of Computation. flip and incremental algorithms. fractional cascading. duality of Voronoi diagrams. Computational Geometry: An Introduction by Franco P. finger trees.UNIT-II Voronoi diagrams: construction and applicat ions. completeness. Randomization in computational geometry: algorithms.

Quinn. Unit-II: Performance Measures of Parallel Algorithms. Kth element. Communication complexity. 2. Pyramid model. ”Parallel Sorting Algorithm” by Academic Press 33 . Akl.J. Parallel Merging Algorithms on CREW/EREW/MCC. Tree model.Connected Graphs. Complexity Theory: A Modern Approach. Vector-Matrix Multiplication.G. Parallel computation and complexity. Selman . Counting problems. Unit-III: Parallel Sorting Networks. Cube Connected Cycle. Quantum computation References: 1. Min/Max on various models.optimal algorithms. parallel computational models such as PRAM.Circuit complexity. Prentice-Hall 2. lower bounds. Root finding. Springer ECS-073 PARALLEL ALGORITHMS Unit-I: Sequential model. An example of illustrate Cost. S. Cambridge University Press 3. Hypercube. M. Christos H. PRAM-CREW. EREW models. Cost. Papadimitriou.optimality. Sanjeev Arora and Boaz Barak . need of alternative model. Parallel Sorting Networks on CREW/EREW/MCC/. References: 1. “Design and Analysis of Parallel Algorithms” 3.G. Alan L. Unit-V: Graph Algorithms . Derrangements. Combinatorial Optimization: Algorithms and Complexity . Combinatorial AlgorithmsPermutation. Perfect Shuffle Computers. linear array Unit-IV: Parallel Searching Algorithm. Fully Connected model. LMCC. Steven Homer . UNIT-V Probabilistically checkable proofs. MCC. McGrawHill. Combinations. search and traversal. Kth element in X+Y on PRAM. S.. simulation of one model from another one. Computability and Complexity Theory . speed-up and efficiency of PA. Butterfly.such as summation. Parallel Matrix Transportation and Multiplication Algorithm on PRAM. “Designing Efficient Algorithms for Parallel Computer”. Solution of Linear Equation. Interactive proofs. Akl.

Data Reduction:-Data Cube Aggregation. 2. Unit – III Parameter estimation methods: Maximum-Likelihood estimation. Cluster validation. Unit . Learning and adaptation.V Unsupervised Learning & Clustering: Criterion functions for clustering. M. Mathematical foundations – Linear algebra. 4th Edition.(Binning. Unit-II Statistical Patten Recognition: Bayesian Decision Theory. Gaussian mixture models. Data 34 . Duda.error partitional clustering – K means. “Pattern Recognition and Machine Learning”. agglomerative hierarchical clustering. Expectation. Classifiers. 3. Data Integration and Transformation. 2006. Normal density and discriminant functions.ECS-074 Pattern Recognition Unit-I Introduction: Basics of pattern recognition. Bishop. Stork. Form of Data Preprocessing. Fuzzy classification. S. Normal distribution.Inconsistent Data. Regression. John Wiley. Motivation(for Data Mining). Hart and David G. Richard O.IV Nonparametric Techniques: Density Estimation. Dimensionality reduction. Pattern recognition approaches. Springer. 2009. C. Nearest Neighbor Rule. 2nd Edition. Probability Theory. multivariate normal densities. References: 1. Hidden Markov Models (HMM). Chi squared test. Parzen Windows. Peter E.Data Mining-Definition & Functionalities. “Pattern Classification”. Expectation-maximization (EM).Principal Component Analysis (PCA). Data Cleaning: Missing Values. Computer and Human inspection). ECS-075 Data Mining & Data Warehousing Unit-I Overview. 2009. Unit . Clustering. K-Nearest Neighbor Estimation. mean and covariance. Bayesian Parameter estimation. Koutroumbas. Academic Press. Clustering Techniques: Iterative square . Theodoridis and K. Design principles of pattern recognition system. Noisy Data. “Pattern Recognition”. Dimension reduction methods . Fisher Linear discriminant analysis. Data Processing.

Compression. Mallach. Bayesian Classification. Statistical measures in large Databases. Measuring Central Tendency. Mining Association Rules in Large Databases. Stars. M. Tuning Data Warehouse. Data Cubes. Classification methods K-nearest neighbor classifiers. Fact Constellations. HOLAP. ”Data Mining Concepts & Techniques” Elsevier 3.H. Definition. Data Marting. Multi Dimensional Data Model. Measuring Dispersion of Data. Process Architecture. Analytical Characterization. Numerosity Reduction. Mining Class comparisions. Data Generalization. Pearson Education 4. Outlier Analysis Unit-IV Data Warehousing: Overview. References: 1. Discretization and Concept hierarchy generation Unit-II Concept Description:. Cluster Analysis: Data types in cluster analysis. Association rule mining. Hierarchical Clustering.”Data Warehousing System”. 3 Tier Architecture. Difference between Database System and Data Warehouse. mining Single-Dimensional Boolean Association rules from Transactional Databases– Apriori Algorithm.McGraw –Hill 35 . Categories of clustering methods. Neural Network approach.”Data Mining:Introductory and Advanced Topics” Pearson Education 2. Concept hierarchy. ROLAP. Query Facility. CLIQUE. Partitioning methods. Historical information. Security. Multilayer feed-forward Neural Network.Definition. Analysis of attribute relevance.STING. Decision tree. Genetic Algorithm. Model Based Method –Statistical Approach. Delivery Process. Micheline Kamber. Clustering.Dunham. Jiawei Han. Dennis Murray. OPTICS. Issues regarding Classification and prediction. Grid Based Methods. Graph Displays of Basic Statistical class Description. Data Mining interface. OLAP function and Tools. Back propagation Algorithm. Unit-V Aggregation. OLAP Servers. MOLAP. Testing Data Warehouse. Mining Multilevel Association rules from Transaction Databases and Mining MultiDimensional Association rules from Relational Databases Unit-III Classification and Predictions: What is Classification & Prediction. Snow Flakes.CURE and Chameleon. Backup and Recovery. Density Based Methods-DBSCAN. “Data Warehousing in the Real World : A Practical Guide for Building Decision Support Systems. Sam Anahory. Classification by Back propagation.

Concurrent Execution of transaction. Mathematical Preliminaries for Lossless compression: A brief introduction to information theory. Measures of prefonnance. UNIT –II Lock based protocols.’ Database System Implementation’ Pearson Education 4. Ullman. Multiway Joins. Models: Physical models. Concepts in Orphan and Inconsistent Messages. orth and Sudershan. Enforcing serializablity by Locks. Updating replicated data. Recovery in Message passing systems. Singhal and Shivratri. Markov models.’Distributed Database’. Log based recovery. Moss Concurrency protocol. Ramakrishna and Gehrke. Mc Graw Hill 3. Eager and Lazy Replication Techniques References 1. Coding: uniquely decodable codes. Algorithms for recovery line. ’Advance Concepts in Operating Systems’ MC Graw Hill ECS-077 Data Compression Unit . Database System Concept’. Distributed Commit. UNIT –IV Issues of Recovery and atomicity in Distributed Databases.’ Database Management System. Checkpoints. Ceei and Pelagatti. Cost based query optimization for distributed database. protocols for Distributed Deadlock Detection. Modeling and coding. Semi joins. architecture for Locking scheduler UNIT III Distributed Transactions Management.I: Compression Techniques: Loss less compression. Distributed Locking schemes. Silberschatz. Data Distribution. Probability models. TMH 5. UNIT V Distributed Query Processing. composite source model. 36 .Widom. Conflict and View Serializability. Mc Graw Hill 2. Lossy Compression. Prefix codes. Multiple Granularity and Multiversion Techniques. Fragmentation and Replication Techniques. Long duration transactions. Concepts in Recoverable and Cascadeless schedules.ECS-076 Distributed Database UNIT-I Transaction and schedules. Recovery with Concurrent Transactions. Locking system with multiple lock modes. Traditional recovery techniques. time stamp based protocols. Garcia-Molina. Testing for Serializability.

42 bits. The Linde-Buzo-Gray Algorithm. Adaptive Dictionary. Uniform Quantizer. Tunstall codes. Image Compression: The Graphics Interchange Format (GIF). Applications: File Compression-UNIX compress. Adaptive Quantization. The Burrows-Wheeler Transform: Moveto-front coding. Permutation and Symmetric groups. Comparison of Binary and Huffman cding. Subgroups and order. Definition and elementary properties of Rings and Fields. Cyclic Groups. Equality of relations. Tree structured Vector Quantizers. Mathematical Induction. Scalar Ouantization: The Quantization problem. Proofs of some general identities on sets. Lagrange's theorem. Introduction to Data Compression. Natural Numbers: Introduction. JBIG2. The LZ78 Approach. Predictive Coding: Prediction with Partial match (ppm): The basic algorithm. Multisets. Encoding procedure. Unit-II Algebraic Structures: Definition. Normal Subgroups. Generating a binary code. Dynamic Markoy Compression. Proof by counter – example. Induction with Nonzero Base cases. Compression over Modems: V. Combination of sets. Static Dictionary: Diagram Coding. Groups. JPEG-LS. The Exclusion Principle. length of context. Non uniform Quantization. Unit – IV: Distortion criteria. Unit-V: Advantages of Vector Quantization over Scalar Quantization. Models. References: 1. Classification of functions. Unit-III: Coding a sequence. Morgan Kaufmann Publishers EIT-071 Discrete Structures Unit-I Set Theory: Introduction. Properties of relations. Rice codes. Operations on functions. Applications of Hoffman coding: Loss less image compression. Adaptive Huffman coding: Update procedure. Golomb codes. Composite Relations. Group Homomorphisms. Recursive definition of relation.Unit – II: The Huffman coding algorithm: Minimum variance Huffman codes. Variants of Induction. Structured Vector Quantizers. Order of relations. Cosets. The LZ77 Approach. The ESCAPE SYMBOL. Dictionary Techniques: Introduction. CALIC. Text compression. Proof Methods. Relations: Definition. Khalid Sayood. Applications: Bi-level image compression-The JBIG standard. Integers Modulo n. Operations on relations. Growth of Functions. Multi-resolution Approaches. Proof by contradiction. 37 . Ordered pairs. Audio Compression. Recursively defined functions. Image compression. Functions: Definition. Facsimile Encoding. Decoding procedure.

Graph coloring Recurrence Relation & Generating function: Recursive definition of functions. Transition tabl e. Nondeterministic finite Automata (NFA). Strings and Languages. Modular and Complete lattice. Lattices: Definition. Tautology.Unit-III Partial order sets: Definition. Simplification of Boolean Functions. Jean Paul Trembley. Method of solving recurrences. Alphabets. Satisfiability. Karnaugh maps. 5. Hasse diagram. Combinatorics: Introduction. Rosen. Algebra of proposition. PHI EIT-072 THEORY OF AUTOMATA AND FORMAL LANGUAGES Unit – I Introduction. Binary tree traversal. NFA with epsilon transit ion. Recursive algorithms. Addison Wesley.C. Grimaldi.C. well formed formula. Discrete Mathematical Structures. Partial order sets. and S. McGraw-Hill. Operators of regular expression and their precedence. well formed formula of predicate. Language of DFA. R Manohar. Combination of partial order sets. McGraw Hill 2. Binary search tree. R. Logic gates. Contradiction. Unit-V Trees : Definition. Multigraphs. Unit-IV Propositional Logic: Proposition. Euler and Hamiltonian paths. Distinguis hing one string from other. McGraw-Hill 3. Ross. Equi valence of NFA and DFA. Digital circuits and Boolean algebra. R. Myhill-Nerode Theorem Unit – II Regular expression (RE) . Kenneth H. Inference theory of predicate logic. Pigeonhole Principle References: 1. Kolman. Automata and Grammars. Truth tables. DFA to 38 . Busby. Theory of Inference Predicate Logic: First order predicate. Kleen’s Theorem. Counting Techniques. Discrete Mathematics and Its Applications. Deterministic finite Automata (DFA)-Formal Definition. Algebraic manipulation of Boolean expressions. Properties of lattices – Bounded. Minimization of Finite Automata. Simplified notation: State transition graph. Planar graphs. Discrete and Combinatorial Mathematics. Definition. Algebraic laws for Regular expressions. 4.P. Bipartite graphs. Language of NFA. Graphs: Definition and terminology. Boolean Algebra: Introduction. B. “Elements of Distcrete Mathematics”. Regular expression to FA. Binary tree. Axioms and Theorems of Boolean algebra. Discrete Mathematical Structures with Application to Computer Science. Complemented. Isomorphism and Homeomorphism of graphs. Liu and Mohapatra. quantifiers. Representation of graphs.

Hopcroft. Data analysis. Applications and Limitation of FA. “Introduction to Automata Theory. Unit – IV Push Down Automata (PDA): Description and definition. Acceptance by Final state. TM as Computer of Integer functions. Pearson Education 2. Introduction to recursive function theory References: 1. “Introduction to Languages and Theory of Computations”.P. Metadata: Summary 39 . Ullman. Variants of Turing Machine. PHI EIT-073 Bioinformatics Unit I: Bioinformatics objectives and overviews. Universal TM. C. Introduction to Undecidability.Chandrasekaran. Two stack PDA Unit – V Turing machines (TM): Basic model. Language acceptance by TM. Non Regular Languages. Pumping Lemma for regular Languages . definit ion and representatio n. Papadimitrou. “Theory of Computer Science : Automata. Pumping lemma for CFLs. Ambiguous to Unambiguous CFG. Data integration. Decision Properties of CFLs: Emptiness. Interdisciplinary nature of Bioinformatics. Instantaneous Description. Languages and Computation”. K. Derivation . Useless sym bols.L. Examples. Undecidable problems about TMs. Closure properties of Regu lar Languages. Language of PDA. Martin J. Finiteness and Memership. PHI 3.L. Simplification of CFGs. Application of Pumping Lemma. Closure proper ties of CFLs. Deterministic PDA. Chur ch’s Thesis. and Lewis. Unit – III Context free grammar (CFG) and Contex t Freee Languages (CFL): Definition. CFG to PDA and PDA to CFG. C. Instantaneous Description. Languages and Computation”. Modified PCP. Equivalence of PDA and CFG. Halting problem. Am biguity in Grammer. FA with output: Moore and Mealy machine. Inherent ambiguity. “Elements of the Theory of Computation”. Derivation trees.. Decision properti es of Regular Languages.Regular expression.. TMH 4. Major Bioinformatics databases and tools. C. Acceptance by empty stack. Normal forms for CFGs: CNF and GNF. Arden Theorem. Recursive and recursively enumerable languages. Mishra and N. Equivalence of Moore and Mealy Machine. Post correspondence problem (PCP).

transcription factor binding sites and single nucleotide polymorphism. generic variability and its connection to clinical data. New Delhi 3. Protein structure. Linux Operating System. -Transcription. gzip / gunzip. finding new type of data online. XML. Overview of Java. Rastogi. problems in molecular approach and the bioinformatics approach. BLAST. “Bioinformatics Methods & applications. developing applications on Linux OS. relational and object oriented).the functional elements in DNA. Web deployment concepts. Unit II: Basic chemistry of nucleic acids. Springer 40 . and controlled vocabularies. -Translation. CBS 5. Unit IV: Genome. application to biological data warehouses. Shubha Gopal et. Proteomics & Drug Discovery” PHI. Genes. Rastogi. oerview of the bioinformatics applications. “Evolutionary Bioinformatics”. Molecular Biology and Bioinformatics: Systems approach in biology. chemical compounds. Structure of RNA. Boolean search. Phylogenetics. 2. hierarchies and graphical models. DNA Replication.& reference systems. Protein folding and function. “ Bioinformatics: with fundamentals of genomics and proteomics”. CORBA. D E Krane & M L Raymer. Mendiratta. regular expressions. ftp. Perason Education. Nucleic acid-Protein interaction. fuzzy search and neighboring. general data retrieval techniques: indices. expressed sequence tags. Unit III: Perl Basics. Analyzing DNA.DNA sequencing. Proteins: Amino acids. telnet. Genomics. ” Fundamental concepts of Bioinformatics”. Forsdyke. Unit V: Macromolecular structures. Understanding and Using Biological Databases. Secondary. Tertiary and Quaternary structure. O’Reilly. Genomic sequencing. Mc Graw Hill. Central dogma of molecular biology. gene expression. Perl applications for bioinformatics.Bioperl. Computational representations of molecular biological data storage techniques: databases (flat. tar. Structure of DNA. References 1. “ Developing Bio informatics computer skills”. mounting/unmounting files. 4.al. Representation of patterns and relationships: sequence alignment algorithms.

Evaluation and Benchmarking of Watermarking system. Active and Malicious Attackers. Statistical Steganography. References: 1. Speaker Recognition. Biometric Verification. Cover Generation Techniques. Transform Methods: Fourier Transformation.EIT -074 IT in Forensic Science UNIT I Overview of Biometrics. Evidence collection. Copy Right Enforcement. Authentication and Biometrics: Secure Authentication Protocols. Biometric Enrollment. Evidence dynamics. Steganalysis: Looking for Signatures: . surveillance tools for future warfare. Artech House. Biometric Identification.Spread Spectrum and Information hiding. UNIT IV Watermarking and Copyright Protection: Basic Watermarking. Preservation of digital evidence. Matching Biometric Samples. UNIT III A Survey of Steganographic Techniques: Substitution systems and Bit Plane Tools. Split Images in Perceptual Bands. Biometric System Security. Wisdom from Cryptography Principles of Steganography: Framework for Secret Communication. Rules of evidence. Watermarking Applications. Security of Steganography System. " Information Hiding Techniques for Steganography and Digital Watermarking". Disabling Hidden Information. Linguistic Steganography. 41 . Petitcolas. Fast Fourier Transformation.Extracting hidden Information. Data recovery. Transform Domain Techniques: . Hand Geometry. Iris Recognition. Adaptive versus non-Adaptive Algorithms. Information hiding in Written Text. Face Recognition. Common biometrics: Finger Print Recognition. Katzendbisser. Mellin-Fourier Transformation. UNIT V Computer Forensics. Verification by humans. Information Hiding in Noisy Data . Signature Verification UNIT II Introduction to Information Hiding: Technical Steganography. Access Control Security Services. Wavelets. Requirements and Algorithmic Design Issues. Distortion Techniques. Applications of Transformation in Steganography. Discrete Cosine Transformation.

"Guide to Biometrics". Access Control in Multiple-Unit Resources. Overview of Commercial Real Time databases 42 . “Computer Forensics: Crime scene Investigation”. Peter Wayner. Time Services. Controlling Concurrent Accesses to Data Objects. Temporal Consistencey. Model of Real Time Communication. Periodic Task Model. Soft and Hard RT Communication systems. Elsevier 3. Temporal Parameters of Real Time Workload. UNIT-IV: Real Time Communication Basic Concepts in Real time Communication. Firewall Media ECS-081 Real Time System UNIT-I: Introduction Definition. Typical Real Time Applications: Digital Control. and Timing Constraints. Scheduling Aperiodic and Sporadic jobs in Priority Driven and Clock Driven Systems. Internet and Resource Reservation Protocols UNIT-V: Real Time Operating Systems and Databases Features of RTOS.. Connell et.2. Rate Monotonic Algorithm. Bolle. Firewall Media 5. UNIX as RTOS. Charecteristic of Temporal data. Use of Priority-Ceiling Protocol in Dynamic Priority Systems. Deadlines. Hard Real Time Systems and Soft Real Time Systems. Christopher L. Brown.. Weighted Round Robin Approach. Medium Access Control Protocols for Broadcast Networks. Offline Versus Online Scheduling. Dynamic Versus Static Systems. Priority Driven Approach. Stack Based PriorityCeiling Protocol. Preemption Ceiling Protocol. Release Times. Reference Models for Real Time Systems: Processors and Resources. Springer 4. John Vecca. High Level Controls. Steganography and Watermarking 2/e". POSIX Issues. Basic Priority-Inheritance and Priority-Ceiling Protocols. UNIT-II: Real Time Scheduling Common Approaches to Real Time Scheduling: Clock Driven Approach. Optimality of Effective-Deadline-First (EDF) and Least-Slack-Time-First (LST) Algorithms. al. Priority-Based Service and Weighted Round-Robin Service Disciplines for Switched Networks. Non-preemptive Critical Sections. UNIT-III: Resources Sharing Effect of Resource Contention and Resource Access Control (RAC). Signal Processing etc. "Disappearing Cryptography: Information Hiding.T. Concurrency Control. Precedence Constraints and Data Dependency. “Computer Evidence: Collection and Preservation”.

Risk planning. SPM Framework. Version Control. Risk Breakdown Structure (RBS). Real Time Systems by Jane W. Planning Objectives. Concept of Software Quality. Software Reviews. K. Test Strategies. Estimation methods. Cost Performance Index (CPI). Building the project schedule. Mall Rajib. Levels of Testing. Need Identification. “Real Time Systems”. Software project estimation. Schedule Performance Index (SPI). Deskchecks. Schedule Variance (SV). UNIT-II: Project Organization and Scheduling Project Elements. and Verification”. Testing Principles. Scheduling terminology and techniques. Cost Variance (CV). S.References: 1. SQA Activities. Albert M. Project Life Cycle and Product Life Cycle. UNIT-V: Project Management and Project Management Tools Software Configuration Management: Software Configuration Items and tasks. Types of Testing. UNIT-III: Project Monitoring and Control Dimensions of Project Monitoring & Control. Formal SQA Approaches: Proof of correctness. ECS-082 Software Project Management UNIT-I: Introduction and Software Project Planning Fundamentals of Software Project Management (SPM). Plan for Change. Gantt Charts. Pearson Education Publication. Change Requests Management. Planning and Scheduling Tools. Cost Benefit Analysis. Functions. 43 . Test Cases. Software Quality Metrics and Indicators. CPM. Project Management Cycle. Software Project Planning. Testing Automation & Testing Tools. Structure of a Software Project Management Plan. Bar Charts: Milestone Charts. Types of Review: Inspections. Analysis. Activities and Tasks. MS-Project. “Real-Time Systems: Scheduling. Cleanroom process. Liu. Decision process. Management Spectrum. Interpretation of Earned Value Indicators. Test Plans. Risk Management Process: Risk identification. Work Breakdown Structure (WBS). Cheng . Vision and Scope document. 2. Risk monitoring. Risk analysis. Types of project plan. Network Diagrams: PERT. Project schedule. Scheduling Objectives. Software Quality Attributes. Pair Programming. Walkthroughs. The SEI Capability Maturity Model CMM). Types of WBS. Estimation models. SPM Objectives. Project Plan. Pearson Education 3. Software Project Management Tools: CASE Tools. Earned Value Analysis. Statistical quality assurance. UNIT-IV: Software Quality Assurance and Testing Testing Objectives. Baselines. Program Correctness. Code Reviews. Error Tracking. Program Verification & validation. Risk Management: Risks and risk types. Earned Value Indicators: Budgeted Cost for Work Scheduled (BCWS). Ways to Organize Personnel. Change Control. Wiley.

4. “Introduction to Embedded Systems”. Formal Verification. Springer 44 . Pearson Education Kieron Conway.. DAC). Software Project Management. digitization (ADC.. Dreamtech Press S. frequency spectrum and sampling. H. Applications Unit-II Timing and clocks in Embedded systems. Characteristics and requirements. “Real-Time Systems”. Royce. Real time operating system issues. Unit-III Signals. Shibu K. R.Gupta.References: 1. Development Language References: 1. Task Modeling and management.Kopetz. Unit-V Fault-Tolerance. Tata McGraw-Hill Publication. PHI Publication. Trends in Embedded Processor. Kluwer 2. M. Software Project Management. A. “Co-synthesis of Hardware and Software for Embedded Systems”. Software Project Management. OS. Communication strategies for embedded systems: Encoding and Flow control. Unit-IV Embedded Control and Control Hierarchy. Signal Conditioning and Processing. Modeling and Characterization of Embedded Computation System. Kelkar. ECS-083 Embedded Systems Unit-I Introduction to embedded systems: Classification. Marwedel. Cotterell. Software Project Management. 5. 2. Kluwer 3.V. “Embedded System Design”. TMH 4.

block cipher modes of operations. Secure electronic. firewalls References: 1. “Cryptography and Network Security”. modular arithmetic. fiestal structure. Strength of DES. Behrouz A. Extended Euclidean Algorithm. services and mechanism. RSA algorithm. message authentication code. Secure hash algorithm (SHA) Digital Signatures: Digital Signatures. Authentication Applications: Kerberos Electronic mail security: pretty good privacy (PGP). 5. Primality testing. Tata McGraw Hill 45 . Advanced Encryption Standard (AES) encryption and decryption Fermat’s and Euler’s theorem. key management. security of hash functions. Shannon’s theory of confusion and diffusion. Discrete Logarithmic Problem. Triple DES Unit-II Introduction to group. Idea of differential cryptanalysis. Introduction to Secure Socket Layer.” Network Security and Cryptography”. Chinese Remainder theorem. Diffie-Hellman Key Exchange. Intrusion detection. Public key Infrastructure. proof of digital signature algorithm. Principals of public key crypto systems. Bruce Schiener. authentication functions. John Wiley & Sons 4. field. Modern Block Ciphers: Block ciphers principles.ECS-084 Cryptography & Network Security Unit-I Introduction to security attacks.509 Certificates. Authentication header. S/MIME. X. “Cryptography and Network Security: Principals and Practice”. 2. Unit-IV Key Management and distribution: Symmetric key distribution. Tata McGraw Hill 3. Cengage Learning. Pearson Education. Classical encryption techniquessubstitution ciphers and transposition ciphers. transaction (SET) System Security: Introductory idea of Intrusion. hash functions. combining security associations. Bernard Menezes. Digital signature standards (DSS). finite field of the form GF(p). steganography. birthday attacks. cryptanalysis. Encapsulating security payloads. “Applied Cryptography”. Data encryption standard(DES). Frouzan: Cryptography and Network Security. Unit-V IP Security: Architecture. Elgamal Digital Signature Techniques. Public key distribution. Viruses and related threats. Atul Kahate. William Stallings. security of RSA Unit-III Message Authentication Codes: Authentication requirements. Stream and block ciphers. prime and relative prime numbers.

approximation properties of RBF networks and comparison with multilayer perceptran. Unit-IV Recurrent network and temporal feed-forward network. Al and NN. Principal component and Independent component analysis. adaptation. application to image and signal processing. least mean square algorithm. neuron Mode l. Error correction learning. eigen values & eigen vectors. activation Functions. 2. quick prop. Neural Network Principles. heuristics for making BPalgorithm performs better. Unit-II: Data processing Scaling. References: 1. Neural Network Design. regression. Soft computing. J. principal component analysis. Learning process: Supervised and unsuperv ised learning. statistical nature of the learning process. 4. self organizing map and SOM algorithm. single neuron computation. An Intoduction to Neural Networks. back propagation algorithm. Neural Network and Fuzzy Sets. PHI 46 . human Brain. implementation with BP.ECS-085 Neural Networks Unit-I: Neurocomputing and Neuroscience Historical notes. RPROP algorithm). Transformation (FT/FFT). PHI Kosko. Harvey. Neuro-Fuzzy-genetic algorithm Integration.L. Accelerated learning BP (like recursive least square. properties of feature map and computer simulation. gradient descent rule. Unit-III Multilayered network architecture. application in 2D information processing. Cengage Learning R. Unit-V Complex valued NN and complex valued BP. Basic Models of Artificial neurons. nonlinearly separable problems and bench mark problems in NN. MIT Hagen Demuth Beale. covariance matrix. 3. Knowledge representation. Complexity analysis of network models.A. normalization.competitive learning. analyticity of activation function. Anderson. aggregation function. multilayer perceptron.

Deterministic Parser. New Delhi 2. Natural Language Processing and Language Representation 5. database interface. Natural Language Understanding.Down Chart Parsing. References: 1. hierarchical. Speech and Language Processing. Unit-V Ambiguity Resolution: Statistical Methods. overview of wireless telephony: cellular concept. Shapiro. Top-Down and Bottom-Up Parsers. Representations and Understanding. Probabilistic Context-Free Grammars. handoffs. channel structure. Probabilistic Language Processing. Addison-Wesley ECS-087 Mobile Computing Unit – I Introduction. Word senses and Ambiguity. Different levels of Language Analysis. Organization of Natural language Understanding Systems. Applications of NLP.ECS-086 Natural Language Processing Unit-I Introduction to Natural Language Understanding: The study of Language. Unit-III Grammars and Parsing: Grammars and sentence Structure. Pearson Education 4. NLP: A Paninian Perspective. Transition Network Grammars. Linguistic Background: An outline of English syntax. 47 . Human preferences in Parsing. Handling questions in Context-Free Grammars. S. channel allocation in cellular systems. Language as a Cognitive Process. D. Augmented Transition Networks. location management: HLR-VLR. J.M. Prentice Hall. GSM: air-interface. James Allen. Martin. Unit-IV Grammars for Natural Language: Auxiliary Verbs and Verb Phrases. Top. Encoding Ambiguity in Logical Form. C. Parsing with Features. Part-of-Speech tagging. issues in mobile computing. Estimating Probabilities. Encoding uncertainty. L. Unit-II Introduction to semantics and knowledge representation. Some applications like machine translation. Jurafsky. Evaluating Language Understanding Systems. Feature Systems and Augmented Grammars: Basic Feature system for English. GPRS. Movement Phenomenon in Language. Pearson Education 3. H. Winograd. Vineet Chaitanya and Rajeev Sangal. Akshar Bharti. Ivansca. Best First Parsing. T. CDMA. Obtaining Lexical Probabilities. Semantics and Logical Form. Morphological Analysis and the Lexicon.

Kohnen's self organizing networks . Unit – V Adhoc networks.Single layer perception .Classification and Regression Trees . “Mobile Computing”. Mobile IP. Destination sequenced distance vector routing (DSDV). 2. localization. Charles Perkins. Wireless multiple access protocols. data broadcasting. applications. Unit – III Data management issues. Mobile Communications. Unit-II: FUZZY SYSTEMS Fuzzy sets. Blue Tooth. 48 . Charles Perkins. Temporary ordered routing algorithm (TORA). Dynamic source routing (DSR).Simulated annealing – Evolutionary computation. Ad Hoc on demand distance vector routing (AODV).Decomposition . applications. J.Fuzzy control methods . Addison Wesley. data replication for mobile computers. Wireless applications. Unit .Hopfield network.II Wireless Networking. Wireless LAN Overview: MAC issues. Disconnected operations. Routing protocols.Rule based structure identification . protocol stack. transaction processing in mobile computing environment.Fuzzy decision making. 3. Fuzzy functions . References: 1. TCP over wireless. 4. QoS in Ad Hoc Networks. Addison Wesley. Ad hoc Networks.FUZZY MODELING Adaptive networks based Fuzzy interface systems .11. Addison Wesley. application environment. MAC issues. Schiller. WAP: Architecture. Unit-III: NEURO .Neuro-Fuzzy controls .IV Mobile Agents computing. Fuzzy Relations and Fuzzy reasoning. adaptive clustering for mobile wireless networks.Unit .Supervised and Unsupervised learning – Back propagation networks . global state routing (GSR).Multilayer Perception . Upadhyaya.Data clustering algorithms . File system. IEEE 802. security and fault tolerance. Mobile IP.Fuzzy automata and languages . Springer ECS-088 Soft Computing Unit-I: ARTIFICIAL NEURAL NETWORKS Basic concepts .

Wiley 2. Deepa. Sharpening – The Laplacian. Local Enhancement. Ross.Fitness Computations . Basis of Filtering in Frequency Domain. “Fuzzy Logic”. Filters – Low-pass.Rank space method. "Genetic Algorithms: Search. D.Cross over . Smoothing . Histogram Equalization. Goldberg. Addison Wesley 6. Ordered Statistic Filter. Applications. Prentice Hall 5. “ Principles of Soft Computing”. "Neuro-Fuzzy and Soft computing". and Mizutani E. Basics of Spatial Filtering. Sivanandam.Mean filter. References: 1. Enhancement using Arithmetic/Logic Operations – Image Subtraction.Mutation . Image Enhancement in Frequency Domain Fourier Transform and the Frequency Domain. Histogram Specification. Prentice Hall 3. Basic Gray Level Functions – Piecewise-Linear Transformation Functions: Contrast Stretching. Timothy J.Reproduction . Genetic algorithm based Internet Search Techniques. Wang. Element of Visual Perception. Image Averaging.S. Homomorphic Filtering. McGraw Hill 4.R. Jang J. "Fuzzy Logic with Engineering Applications". A Simple Image Model. 49 . Sun C.Unit-IV: GENETIC ALGORITHMS Survival of the Fittest . Sampling and Quantization. Sharpening Frequency Domain Filters – Gaussian Highpass Filters. Laurene Fausett. High-pass.E. "Fundamentals of Neural Networks". Correspondence Between Filtering in Spatial and Frequency Domain. Intoduction to MATLAB Environment for Soft computing Techniques. Soft computing based hybrid fuzzy controller. Smoothing Frequency Domain Filters – Gaussian Lowpass Filters. Optimization and Machine Learning". Components of Image Processing System. UNIT-II Image Enhancement in Spatial Domain Introduction.T. Springer EIT-081 Digital Image Processing UNIT-I Introduction and Fundamentals Motivation and Perspective. Unit-V: APPLICATION OF SOFT COMPUTING Optimiation of traveling salesman problem using Genetic Algorithm.Rank method .

Region Filling. presentation tools. Published by: Pearson Education. Digital Image Processing 2 Edition. authoring tools. card and page based authoring tools. Digital Image Processing and Computer Vision. Edge Linking and Edge Following.UNIT-III Image Restoration A Model of Restoration Process. Noise Models. nd EIT-082 Multimedia Systems Unit-I: Introduction Introduction to Multimedia. Jain. 50 . sound. Gonzalvez and Richard E. Edge Elements Extraction by Thresholding. Thickening UNIT-V Registration Introduction. NJ.K. Multi-level Thresholding. NY. Line Detection. Algorithms to Recover Depth Segmentation Introduction. Communication devices. Extraction of Connected Components. A. Geometric Mean Filter. Schalkoff. Local Thresholding. Periodic Noise Reduction by Frequency Domain Filtering – Bandpass Filters. UNIT-IV Morphological Image Processing Introduction. Upper Saddle River. Woods. Max and Min filters. Minimum Mean-square Error Restoration. Edge Detector Performance. Pattern Fitting Approach. Convergence of Computer. Published by: John Wiley and Sons. image capturing. Stereo Imaging – Algorithms to Establish Correspondence. Dilation and Erosion. tools for object generations. Edge Operators. Morphological Algorithms – Boundary Extraction. Thinning. Memory & storage devices. Pixel-Based Approach. Multimedia Objects. 2. R. Region-based Approach.J. References: 1. Convex Hull. Multimedia in business and work. Multimedia software's. Published by Prentice Hall. Corner Detection. Fundamentals of Digital Image Processing. video. 3. Edge and Line Detection: Edge Detection. Logic Operations involving Binary Images. Region Extraction. Rafael C. Mapping. Opening and Closing. Multimedia Information. Geometric Transformation – Plane to Plane transformation. Order Statistic Filters – Median Filter. Restoration in the presence of Noise only-Spatial Filtering – Mean Filters: Arithmetic Mean filter. Communication and Entertainment products Stages of Multimedia Projects Multimedia hardware.

References: 1. recent development in Multimedia. Indexing and retrieval of Video Database. image file formatic animations Images standards. loss compression & silence compression. Sleinreitz. lossy graphic compression. Huffman Algorithms. Multimedia Database. Sound MIDI.Content based retrieval for text and images. Compression ratio loss less & lossy compression. Sliding Window Compression. Loss less compression of sound. Unit-IV: Speech Compression & Synthesis Digital Audio concepts. 2. Buford. “Multimedia Systems”. Video Compression. “Multimedia. Finite Context Modelling. Arithmetic Coding Higher Order Modelling. Making IT Work”. LZ77. JPEG Compression. Digital Audio. bitmaps. Vector drawing. Colors. LZW compression. “Multimedia System”. Zig Zag Coding.Video:Video representation. Video Conferencing. 4. BPB. Unit-V: Images Multiple monitors. MIDI under windows environment Audio & Video Capture. 3. Mark Nelson. Sampling Variables. “Data Compression Hand Book”. Dictionary based Compression. MHEG Standard Video Streaming on net. Shannon Fano Algorithm. Compression.Unit-II: Multimedia Building Blocks Text. Tay Vaughan. 51 . Addison Wesley. audio file formats. MPEG standards. Unit-III: Data Compression Huffman Coding. McGraw Hill. Adaptive Coding. Addison Wesley. Multimedia Broadcast Services.

Sign up to vote on this title
UsefulNot useful