The document contains a lecture plan for an Algorithms lab class at Mailam Engineering College for the period of February 2013 to May 2013. It lists the experiments to be covered each week, including binary tree traversal, Warshall's algorithm, Dijkstra's algorithm, quick sort, binary search, Strassen's matrix multiplication, knapsack problem using dynamic programming, subset sum problem using backtracking, travelling salesperson problem using branch and bound, and Prim's algorithm. It provides the schedule, expected coverage, and remarks for each class over the 10 working days in the period.
The document contains a lecture plan for an Algorithms lab class at Mailam Engineering College for the period of February 2013 to May 2013. It lists the experiments to be covered each week, including binary tree traversal, Warshall's algorithm, Dijkstra's algorithm, quick sort, binary search, Strassen's matrix multiplication, knapsack problem using dynamic programming, subset sum problem using backtracking, travelling salesperson problem using branch and bound, and Prim's algorithm. It provides the schedule, expected coverage, and remarks for each class over the 10 working days in the period.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1
MAILAM ENGINEERING COLLEGE
MAILAM (PO), Villupuram(Dt). Pin: 604 304
(Approved by AICTE New Delhi, Affiliated to Anna University Chennai & Accredited by National Board of Accreditation (NBA) New Delhi)
DEPARTMENT OF COMPUTER APPLICATIONS
LECTURE PLAN FOR LABORATORY (FEB 2013 MAY 2013)
STAFF NAME: Mrs. A. SUBATHRA DEVI CLASS: I MCA SEM: 02
SUBJECT CODE: MC9229 SUBJECT NAME: ALGORITHMS LAB FEB13 DATE DAY WORKING DAYS PERIOD EXPERIMENT COVERAGE REMARKS 13.2.2013 MON 1 3 Binary Tree Traversal
20.2.2013 MON 2 3 Warshalls Algorithm
27.2.2013 MON 3 3 Dijkstras Algorithm
6.3.2013 MON 4 3 Quick Sort
13.3.2013 MON 5 3 Binary Search
17.3.2013 MON 6 3 Strassens matrix multiplication
3.4.2013 MON 7 3 Knapsack Problem Dynamic Programming
10.4.2013 MON 8 3 Subset Sum Problem Backtracking
17.4.2013 MON 9 3 Travelling salesperson problem Branch and Bound