Scribd
Upload
40 views1 page

Algorithms Lab

This document contains a list of 11 algorithms experiments for the MCA704 Algorithms lab course at Kumaraguru College of Technology. The experiments include binary search, quick sort, merge sort, Prim's algorithm, depth first search, breadth first search, optimal binary search tree, knapsack problem using dynamic programming and branch and bound, N queen problem, and traveling salesman problem. Each experiment requires 1 session to complete. The batch includes students with roll numbers from 10MCA01 to 10MCA57. There is no deviation from the university syllabus.

Uploaded by

DrJayakanthan N
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
40 views1 page

Algorithms Lab

This document contains a list of 11 algorithms experiments for the MCA704 Algorithms lab course at Kumaraguru College of Technology. The experiments include binary search, quick sort, merge sort, Prim's algorithm, depth first search, breadth first search, optimal binary search tree, knapsack problem using dynamic programming and branch and bound, N queen problem, and traveling salesman problem. Each experiment requires 1 session to complete. The batch includes students with roll numbers from 10MCA01 to 10MCA57. There is no deviation from the university syllabus.

Uploaded by

DrJayakanthan N
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

ACD 04B(01)

01.07.2010
KUMARAGURU COLLEGE OF TECHNOLOGY
COIMBATORE – 641 006

LIST OF CYCLE OF LABORATORY EXPERIMENTS -

Experiment Cycle :

Name of the Laboratory: MCA704 Algorithms lab. Batch :

Semester : II

Branch : Computer applications.

Course : MCA Class Commencing Date: 02/02/2011

S.No. Name of the Experiment No. of Sessions required


1 Binary Search 1

2 Quick Sort 1

3 Merge Sort 1

4 Prim’s Algorithm 1
5 Depth First Search 1
6 Breadth First Search 1
7 Optimal Binary Search Tree 1
8 Knapsack Problem –Dynamic Programming 1
9 N Queen Problem 1
10 Traveling Salesman Problem 1
11 Knapsack Problem –Branch And Bound 1

Batch No. Roll Nos.

10MCA01 to 57
1

Deviation from University Syllabus if any:-


No of experiment in the syllabus :
No of experiments planned :
No of experiments (completed) :
If deviation, reason for deviation :

Staff signature HOD signature


Date Date

You might also like