Download Problem Solving Techniques - II and more Thesis Design Patterns in PDF only on Docsity! PROBLEM SOLVING TECHNIQUES – II Course Code: CSE 703 Credit Units: 02 Total Hours: 20 Course Objective: To impart the basic concepts of data structures and algorithms and understand about writing step by step approach in solving problems with the help of appropriate data structures also improve problem solving skills in operating system and database management. Course Contents: Module I: Design and Analysis of Algorithm: (06 Hours) Introduction: Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of Functions, Performance Measurements, Asymptotic Notations. Recurrences- substitution method, recursion tree method, master method Types of algorithm: Divide and Conquer with Examples Such as Sorting, Matrix Multiplication, Convex Hull and Searching. Greedy Methods with Examples Such as Optimal Reliability Allocation, Knapsack, Minimum Spanning Trees – Prim’s and Kruskal’s Algorithms, Single Source Shortest Paths – Dijkstra’s and Bellman Ford Algorithms. Dynamic Programming with Examples Such as Knapsack. All Pair Shortest Paths – Warshal’s and Floyd’s Algorithms, Resource Allocation Problem. Backtracking, Branch and Bound with Examples Such as Travelling Salesman Problem, Graph Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of Subsets. Module II: Operating System-I: (04 Hours) Processes and Scheduling policies :Introduction to processes management, operating system views of processes, various process transition states, Introduction to Processor scheduling, Introduction to various types of schedulers, Performance criteria in scheduling algorithms, Concept of FCFS scheduling algorithm, Concept of priority scheduling algorithm like SJF, Concept of non-preemptive and preemptive algorithms, Concept of round-robin scheduling algorithm, , Concept of multi-level queues, feedback queues. Interprocess Communication: Introduction to Interprocess Communication and Synchronization, Critical regions and Conditional critical regions in a Semaphore. Introduction to monitors, various modes of monitors, Issues in message implementation, Concept of mutual exclusion with messages. Module III: Operating System-II: (03 Hours) Dead Locks: Concept of Deadlocks, issues related to its prevention, avoidance and detection/recovery, Concept of deadlock prevention and its avoidance, Concept of deadlock detection and recovery. Memory Management: Need of Memory management and its requirements, paging, segmentation, concept of fragmentation. Characteristics of contiguous & non-contiguous allocation techniques, Detail study of fragmentation, Virtual memory management, introduction to page-replacement, Need of various page- replacement policies, Concept of FIFO and optimal page-replacement algorithms, Concept of LRU approximation and its page-replacement algorithm, Module IV: Database Management System-I: (04 Hours) Data Modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER diagrams to tables, extended ER model, relationships of higher degree.
