Download CP7111-LabPlan-v.0 ADS NR.doc

DOC/LP/01/28.02.02
LP – CP7111
LAB PLAN
Sub Code: CP7111
LP Rev. No : 00
Sub Title: ADVANCED DATA STRUCTURES LAB
Date : 20/09/2013
Branch : ME (CSN)
Page 01 of 01
Semester: I
Objectives:
 To learn to implement iterative and recursive algorithms.
 To learn to design and implement algorithms using hill climbing and dynamic programming
techniques.
 To learn to implement shared and concurrent objects.
 To learn to implement concurrent data structures.
Exp No Experiment Topic
Recursive Algorithms (Divide and Conquer)
1 (a) Heap Sort
(b) Ackermann’s Function
(c) Towers of Hanoi
Graph Search Algorithms
2 (a) Implementation of Depth First Search
(b) Implementation of Breadth First Search
(c) Implementation of Dijkstra's Shortest Weighed Path Algorithm
Network Flow algorithm & Linear Programming
3 (a) Implementation of Primal Dual Hill Climbing Method
(b) Implementation of Steepest Ascent Hill Climbing Algorithm
Dynamic Programming
4 (a) Implementation of Longest Common Sub-Sequence
(b) Implementation of Matrix Chain Multiplication
5 Recursive Backtracking - 8 Queen's Problem
Concurrency and Synchronization
6 (a)Producer Consumer Problem
(b) Reader Writer Problem
MODEL EXAM
Concurrent Data Structures
7 Concurrent Linked Lists
8 Concurrent Queues
9 Concurrent Stacks
Mini Application using Concurrent Data Structures– Railway Ticket
10 Reservation
Prepared by
Duration
150 minutes
150 minutes
150 minutes
150 minutes
150 minutes
150 minutes
150 minutes
150 minutes
300 minutes
Approved by
Signature
Name
Designation
Ms. N. Revathi
Asst.Professor / IT
Dr. D. Balasubramanian
HoD / IT