Institute of Applied Medicines And Research Ghaziabad Integrated Department Course: MBA(CSE), Vth Sem Subject: DAA (IMBCS530)

Lecture Plan

S.No. 1 2

Topic UNIT 1 Introduction: Algorithm,

Proposed Lectures 1 2

Lecture Taken 1 3 2 2 2

Date 24.08.2011 25.08.2011 25.08.2011 26.08.2011 29.08.2011 02.09.2011 05.09.2011 06.09.2011 06.09.2011 07.09.2011 09.09.2011 12.09.2011 13.09.2011 14.09.2011 15.09.2011 15.09.2011

Status Completed Completed Completed Completed Completed

3 4 5 6

Analysis of algorithms, Growth of Functions, Master's Theorem Design of Algorithm. 2 2 2

4 7 8 9 Sorting & Order Statistics: Heap sort, Sorting in Linear time Median & Order Statistics UNIT 2 Advanced Data Structure: Red Black 1, 3, 1, 2, 2, Trees, Augmenting Data Structure. B2, 1 Trees, Binomial Heaps, Fibonacci Heaps, Data Structure for Disjoint Sets. 12 UNIT 3 Advanced Design and Analysis Techniques: Dynamic Programming, 2, 1, 1, 2 Greedy Algorithms, Amortized Analysis, Back Tracking 6 UNIT 4 Graph Algorithms: Elimentary Graphs Algorithms, Minimum Spanning Trees, 1, 1, 1, 2, 1, Single source shortest paths, All-pairs 1 shortest paths, Maximum flow, Travelling Salesman Problem 7 UNIT 5 Selected Topics: Randomized algorithms, String matching, NP 1, 3, 1, 1 completeness, Approximation algorithms. 6 Total Lecture 45 1 14

5 1 16

Completed Completed

10

1, 3, 1 5

19.09.2011 20.09.2011 21.09.2011 23.09.2011 26.09.2011

11 12

13

14

15 16

21

Faculty Name: Mr. S. P. Singh

Institute of Applied Medicines And Research Ghaziabad Integrated Department Lab Experiments Details Course: MBA(CSE), Vth Sem Subject: DAA (IMBCS530P) S.No. 1 1.1 1.2 1.3 2 2.1 2.2 2.3 2.4 3 3.1 3.2 3.3 3.4 4 4.1 4.2 4.3 5 5.1 5.2 5.3 6 6.1 6.2 7 7.1 7.2 1 2 Practical Name Divide & Conquer method Quick Sort Merge Sort Strassen's matrix multiplication Greedy Method Knapsack Problem Job Sequencing Optimal merge patterns Minimal Spanning Trees Dynamic Programming Multistage Graphs OBST 0/1 Knapsack problem Travelling Salesperson Problem Back Tracking n-Queens problem Graph coloring problem Hamiltonian Cycles Sorting Insertion Sort Heap Sort Bubble Sort Searching Sequential Search Binary Search Selection Minimum/Maximum Kth smallest element Additional Practicals beyond syllabus Selection Sort Counting Sort (Linear time Sort) Status Completed Completed Date 09.09.2011 29.08.2011

Completed Completed Completed Completed Completed Completed Completed Completed Completed

23.08.2011 09.09.2011 23.08.2011 19.09.2011 19.09.2011 23.08.2011 23.08.2011 29.08.2011 09.09.2011

Faculty Name: Mr. S. P. Singh