Scribd
Upload
4 views3 pages

Daa Lab Page

The document outlines a Continuous Assessment Practical for students in the School of Computer Science and Applications, detailing eight experiments to be conducted. These include implementing various algorithms such as linear searching, Dijkstra’s algorithm, 0/1 Knapsack, Quick sort, Merge sort, Kruskal’s algorithm, Floyd's algorithm, and the N Queen's problem. Each experiment requires students to document the date, sign, and remarks for their practical work.

Uploaded by

wakin35585
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views3 pages

Daa Lab Page

The document outlines a Continuous Assessment Practical for students in the School of Computer Science and Applications, detailing eight experiments to be conducted. These include implementing various algorithms such as linear searching, Dijkstra’s algorithm, 0/1 Knapsack, Quick sort, Merge sort, Kruskal’s algorithm, Floyd's algorithm, and the N Queen's problem. Each experiment requires students to document the date, sign, and remarks for their practical work.

Uploaded by

wakin35585
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

SCHOOL OF COMPUTER

SCIENCE AND APPLICATIONS

Roll No:____
Name:__________________
Sem:_______
Section______
Continuous Assessment Practical
Exp NAME OF EXPERIMENT Date Sign Remark
No
1 Implement linear searching on a set of elements.

2 From a given vertex in a weighted connected graph, find


shortest paths to other vertices using Dijkstra’s algorithm.
3 Implement 0/1 Knapsack problem using
Dynamic Programming
4 Sort a given set of elements using the Quick sort method

5 Implement a Merge Sort algorithm to sort a given set of


elements.
6 Find Minimum Cost Spanning Tree of a given undirected graph
using Kruskal’s algorithm.
7 Implement All-Pairs Shortest Paths Problem using Floyd's
algorithm.
8 Implement N Queen's problem using Back Tracking.
CONTENTS
Exp NAME OF EXPERIMENT PAGE
No NO.

1 Implement linear searching on a set of elements.

2 From a given vertex in a weighted connected graph, find shortest paths to other vertices
using Dijkstra’s algorithm.
3 Implement 0/1 Knapsack problem using Dynamic Programming

4 Sort a given set of elements using the Quick sort method

5 Implement a Merge Sort algorithm to sort a given set of elements.

6 Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal’s
algorithm.
7 Implement All-Pairs Shortest Paths Problem using Floyd's algorithm.

8 Implement N Queen's problem using Back Tracking.

You might also like