Course Contents: Tait Fontents Hours Basic functional blocks of @ computer: CPU, memory, inputoulpul subsystems, control unit. Instruction set architesture of a CPU register, 1 |instrction execution cycle, RTL interpretation of instructions, addressing | 8 Fixed point Addition, Subtraction, Multiplication and Division, Floating Pot arithmetic, High performance arithmetic, Booth’ algorithm, integer division Data representation method Booths multiplication, division algorithm and example IEEE standard single and double precision format and examples 1 ‘Memory Management: Mierarchy, Memory Chip Organization, Cache memory Viral memory. Parallel Bus Architectures, Intemal Communication Methodologis, Serial Bus Architectures, Mass storage, Input and Output Devices, Segmentation, TLB, Page replacement algorithms Mt Pipelining: Basic concepis of pipelining, Aritimetc and Tasrocion Pipeline throughput and speedup, pipeline hazards, Itodvction, Logie Design Convention, 1v | Building 2 Datapath — Simple Implementation scheme — An Overview of| Pipelining ~ Pipelined Datapath and Control, Data Hazards: Forwarding versus Control Hazards, Exceptions, Parallelism via lstuctins ‘CPU contro unit design: hardwired and micro-pogammed design appoacles, V | Case study - design of simple hypothetical CPU, 8 Mulicore processors architecture. Advanced topics & its Application. Tait ‘Contents Tatroduction ~Algorithms, Common operations on data structures, Types of data structures, Data structures & Programming, Program Design, Complexities, Time Complexity, Step Count Method, order of Growth, Asymptotic Notation. Sorting and Searching Tniroduction, Sorting, Insertion Sort, Selection Sort, Merging, Merge-Sort, Shell Sort, Radix Sort, Searching and Data Modification, Hashing “Arrays: Introduction, Linear Arrays, Arrays as ADT, Representation of Linear array in Memory, Traversing Linear Arrays, Inserting and deleting, Sorting; Bubble Sort, Searching; Linear Search, Binary Search Stacks, Queue and Recursion- Introduction, Stacks, Array Representation of Stacks, Linked Representation of Stacks, Stack as ADT, Arithmetic Expression; Polish Notation, Application of Stacks, Recursion, Towers of Hanoi, Implementation "of Recursive Procedures by Stacks, Queue, Linked Representation of Queues, Queues as ADT, Circular Queues, Deques, Priority Queues. Applications of Queues Introduction to Linked List- Representation of Linked Lists in Memory, ‘Traversing a Linked List, Searching a Linked List, Memory Allocation; Garbage Collection, Insertion into a Linked List, Deletion from a Linked List, Header Linked List, Circularly Linked Lists, Two-Way Lists (or Doubly Linked Lists). v Trees and Binary Trees -Binary Trees + Representation, Operations: Insert, Delete, Traversal: Preorder, Inorder, Postorder,Traversal Algorithms Using Stacks.Header Nodes; Threads,Threaded Binary Trees,Binary Search Trees Searching and Inserting in Binary Search Trees,Deleting in a Binary Search ‘Tree,Balanced Binary Trees,AVL Search Trees, Insertion in an AVL Search Tree, Deletion in an AVL Search Tree,m-way Search Trees Searching, Insertion and Deletion in an m-way Search tree,B-Trees ,Searching, Insertion and Deletion in a B-tree,B4-Trees Graph Algorithms Graphs and their Applications- Introduction, Graph Theory Terminology, Sequential Representation of Graphs, Adjaceney Matrix; Path Matrix, Linked Representation of a Graph, Operations on Graphs, Traversing a Graph,Posets; Topological Sorting Spanning TreesUnit Contents UNIT: SOFTWAREPROCESS Introduction to Software Engineering, Software Process, Perspective and Specialized Process Models ~ Software Project Management: Estimation ~ LOC and FP Based Estimation, COCOMO Model ~ Project Scheduling ~ Scheduling, Eamed Value Analysis ~ Risk Management. UNIT Il: REQUIREMENTS ANALYSIS AND SPECIFICATION Software Requirements: Functional and Non-Functional, User requirements, System requirements, Software Requirements Document — Requirement Engineering Process: Feasibility Studies, Requirements elicitation and analysi requirements validation, requirements management-Classical analysis: Structured system Analysis, Petri Nets- Data Dictionary Mm UNIT IIE: SOFTWARE DESIGN Design process ~ Design Concepts-Design Model- Design Heuristic ~ Architectural Design ~ Architectural styles, Architectural Design, Architectural Mapping using Data Flow- User Interface Design: Interface analysis, Interface Design ~Component level Design: Designing Class based components, traditional Components. UNIT IV: PROJECT MANAGEMENT Estimation — FP Based, LOC Based, Make/Buy Decision, COCOMO II ~ Planning ~ Project Plan, Planning Process, RFP Risk Management — Identification, Projection, RMMM ~ Scheduling and Tracking ~ UNIT V: TESTING Software testing fundamentals-Internal and external views of Testing-white box testing ~ basis path testing-control structure testing-black box testing Debugging