COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 Unit 1 : LINEAR DATA STRUCTURES Introduction - Abstract Data Types (ADT), Arrays and its representation Structures, Stack, Queue, Circular Queue, Applications of stack, Infix to postfix conversion, evaluation of expression, Applications of Queue. Linked Lists, Doubly Linked lists, Applications of linked list, Polynomial Addition. Unit 2: TREE STRUCTURES Need for non-linear structures, Trees and its representation, Binary Tree, expression trees, Binary tree traversals, left child right sibling, Data structures for general trees, applications of trees, Huffman Algorithm, Binary search tree. Unit 3: BALANCED SEARCH TREES, SORTING AND INDEXING AVL trees, B-Trees, Sorting, Bubble sort, Quick Sort, Insertion Sort, Heap sort, Hashing, Hashing functions, Collision Resolution, Techniques, Separate chaining, Open addressing, Multiple hashing. Unit 4: GRAPHS & ALGORITHM ANALYSIS Definition of Graphs, Representation of graph, Graph Traversals, Depth-first traversal, breadth-first traversal, Applications of graphs, Topological sort, shortest-path algorithms, minimum spanning tree, Prim's and Kruskal's algorithms, Algorithm Analysis, Asymptotic Notations,- Divide and Conquer, Merge Sort, Binary Search, Greedy Algorithms, Knapsack Problem.Dynamic Programming Warshall s Algorithm for finding Transitive Closure, Backtracking, Sum of Subset Problem, Branch and Bound, Travelling Salesman Problem. COURSE: RELATIONAL DATABASE MANAGEMENT SYSTEMS CODE: 05MCAR17162 CREDITS: 05 Unit 1 : INTRODUCTION TO RELATIONAL MODEL File systems versus Database systems, Data Models, DBMS Architecture, Data Independence, Data Modeling, Enhanced E-R Modeling, Relational Modeling Concepts, Relational Algebra Unit 2: QUERY DESIGN AND EVALUATION SQL Queries Basic and Complex, Views, Constraints, Relational Calculus, Tuple and Domain Relational Calculus, Overview of Commercial RDBMS, Database Design, Functional Dependencies,Normal Forms (1 NF 5 NF), Algorithms for Executing Query Operations, Cost Estimation Unit 3: TRANSACTION PROCESSING Transaction Processing, Properties of Transactions, Serializability, Transaction Support in SQL, Locking Techniques, Time Stamp ordering, Validation Techniques, Granularity of Data
Items, Recovery concepts, Shadow paging, Log Based Recovery, Database Security Issues, Access control, Statistical Database Security Unit 4: Files and Indexing File operations, Hashing Techniques, Indexing Single level and Multi-level Indexes, B+ tree, Static Hashing, Indexes on Multiple Keys, OODBMS- - Object-Based Databases - OO Data Model - OO Languages, Persistence, Object Relational Databases XML, Structure of XML, Temporal Databases, Mobile Databases, Spatial Databases, Case Study for Design and Manage the Database for any Project COURSE: SYSTEM SOFTWARE AND OPERATING SYSTEMS CODE: 05BMCAR17163 CREDITS: 04 Unit 1 : BASICS OF SYSTEM SOFTWARE AND ASSEMBLER Introduction System software and SIC/XE machine architecture - Basic assembler functions, Assembler algorithms and data structures; Machine dependent assembler features, Instruction formats Addressing modes, Program Relocation; Machine independent assembler features Literals Symbol-defining statements Expressions, Program Blocks Control Sections and Program, Linking-Implementation examples MASM assembler Unit 2: COMPILER- LEXICAL ANALYSIS, SYNTAX ANALYSIS Phases of compiler-lexical Analysis: Role of a Lexical analyzer, input buffering, specification and recognition of tokens, Finite Automata, Designing a lexical analyzer generator, Pattern matching based on NFAs, Syntax Analysis: Role of Parser, Top-down parsing, recursive descent and predictive parsers, Bottom-Up parsing, Operator precedence parsing, LR, SLR and LALR parsers, Intermediate languages: graphical representations, DAGs, Three address code, types of three address statements, syntax directed translation into three address code, implementation of three address statements Unit 3 : CODE GENERATION, OPTIMIZATION & SYSTEM CONCEPTS Code Optimization: Machine dependent and machine independent code generation: Sources of optimization Code Generation-Semantic stacks, evaluation of expressions, control structures, and procedure calls, Types of operating systems-operating systems structures, Systems components operating systems services, System calls - Systems programs Unit 4: Process Concept & Synchronization, Process concept- process scheduling-ipc-cpu Scheduling, Process Synchronization Critical Section problem Semaphores-Classical problems-critical regions, Monitors-Deadlocks- Handling and Recovery Threads- Multithreading, Memory Management--Virtual Memory-Demand paging-page Replacement-Thrashing Disk Structures-Working with File Systems Linux, Windows Vista, Android OS, Virtual machine OS
COURSE: APPLIED MATHEMATICS CODE: 05BMCAR17164 CREDITS: 04 Unit 1: SET THEORY Sets and Subsets, Set Operations and the Laws of Set Theory, Counting and Venn Diagrams, Cartesian Products and Relations, Functions One-to-One, Onto Functions, Function Composition and Inverse Functions; Properties of Relations, Computer Recognition Zero- One Matrices and Directed Graphs, Partial Orders Hasse Diagrams, Equivalence Relations and Partitions. Unit 2 : FUNDAMENTALS OF LOGIC Proposition, Logical Connectives and Truth Tables, Logic Equivalence The Laws of Logic, Logical Implication Rules of Inference, Use of Quantifiers, Quantifiers, Definitions and the Proofs of Theorems and its application, Mathematical Induction and Recursion, Sequences and summations, Mathematical Induction, The Well Ordering Principle, Recursive Definitions, structural Induction, Recursive algorithms. Unit 3: COUNTING Basics of counting, Pigeonhole Principle, Permutation and Combinations, Binomial coefficients, Discrete Probability, Probability theory, Expected value and Variance. Advanced Counting Techniques. Recurrence relations and its solutions, Generating functions, Inclusion Exclusion and its applications Relations: Introduction, n-ary relations and applications, Representing relations, Closures of Relations, Equivalence relations, Partial Orderings. Unit 4: GRAPHS Introduction, Representing Graphs, Graph Isomorphism, connectivity, Euler and Hamilton Paths, 4.3 Shortest path problems, Planar Graphs, Graph Colouring. Trees, Introduction, Applications of Trees, Tree traversal, Spanning Trees, Minimum Spanning Trees. Course: Data Structures Lab CODE: 05BMCAR17165 CREDITS: 03 Part A.1: Exercises 1 7 1. Polynomial Addition using array 2. Array implementation of stack 3. Array implementation of Queue 4. Infix to Postfix conversion 5. Postfix to Prefix Conversion 6. Singly Linked List operations
7. Binary tree traversals Part A.2: Exercises 8 14 8. Breadth First Search 9. Depth First Search 10. Quick Sort 11. Merge Sort 12. Find the Shortest Path using Dijkstra s Algorithm Greedy method 13. Warshall s Algorithm for finding transitive closure using Dynamic programming. 14. Sum of subset problem using backtracking. Part B.1 Part B.2 COURSE: RDBMS LAB CODE: 05BMCAR17166 CREDITS: 03 Part A.1: Exercises 1 5 1) Creation of base tables and views. 2) Data Manipulation INSERT, DELETE and UPDATE in Tables 3) Retrieval of Data using SELECT 4) Use of Sub-Queries with JOIN 5) Usage of Data Control Commands. Part A.2: Exercises 6 10 (High level Extensions using PL/SQL and Front End Tools like Visual Studio / Developer 2000) 6) Use of Cursors, Procedures and Functions. 7) Embedded SQL or Database Connectivity. 8) Triggers Block and Form Level. 9) Working with Forms and Menus. 10) Creating Reports using Report Writers. Part B.1 Part B.2
COURSE: SOFTWARE ENGINEERING & ARCHITECTURE CODE: 05MCAR17171 CREDITS: 04 Unit 1 : BASICS OF SOFTWARE ENGINEERING PROCESS The evolving role of software, Changing Nature of Software, A Generic view of process Software engineering-a layered technology, a process framework, The Capability Maturity Model Integration (CMMI), Process patterns, process assessment, personal and team process models, Process models: The waterfall model, Incremental process models, Evolutionary process models, specialized process models, The Unified process, Requirements elicitation and analysis, Requirements validation, Requirements management. Unit 2 : SOFTWARE SYSTEM MODELS, DESIGN AND EVALUATION System models: Context Models, Behavioural models, Data models, Object models, structured methods. Design process and Design quality, Design concepts, the design model, pattern based software design. Creating an architectural design: software architecture. Data design, Architectural styles and patterns, Architectural Design, assessing alternative architectural designs, mapping data flow into software architecture. Modelling component-level design: Designing class-based components, conducting component level design, Object constraint language, designing conventional components, Performing User interface design: Golden rules, User interface analysis and design, interface analysis, interface design steps, Design evaluation. Unit 3 : SOFTWARE ARCHITECTURE AND REFERENCE MODELS The Architecture Business Cycle, What is Software Architecture, Architectural patterns, reference models, reference architectures, architectural structures and views, Creating an Architecture, Quality Attributes, Achieving qualities, Architectural styles and patterns, designing the Architecture, Documenting software architectures, Reconstructing Software Architecture, Architecture Evaluation, Architecture design decision making, ATAM, CBAM. Moving from one system to many Software Product Lines, Building systems from off the shelf components, Software architecture in future Unit 4: Software Testing and Metrics A strategic approach to software testing, test strategies for conventional software, Black- Box and White-Box testing, Validation testing, System testing, the art of Debugging, Product metrics: Software Quality, Frame work for Product metrics, Metrics for Analysis Model, Metrics for Design Model, Metrics for source code, Metrics for testing, Metrics for maintenance, Metrics for Process and Products: Software Measurement, Metrics for software quality.