Scribd
Upload
12 views

DS-Lab1 (1)

The document is a record for a Data Structures and Algorithms Lab course at Pondicherry University for the academic year 2022-2023. It includes a bonafide certificate and an index of topics covered, such as searching algorithms, data structures, tree and graph traversal techniques, and various algorithms including Dijkstra’s and the Traveling Salesman problem. The document serves as a practical examination submission for students in the Computer Science department.

Uploaded by

goooglebaba420
Copyright
© © All Rights Reserved
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
12 views

DS-Lab1 (1)

The document is a record for a Data Structures and Algorithms Lab course at Pondicherry University for the academic year 2022-2023. It includes a bonafide certificate and an index of topics covered, such as searching algorithms, data structures, tree and graph traversal techniques, and various algorithms including Dijkstra’s and the Traveling Salesman problem. The document serves as a practical examination submission for students in the Computer Science department.

Uploaded by

goooglebaba420
Copyright
© © All Rights Reserved
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/ 5

˜

Data Structures and Algorithms Lab

Roll No
Name
Class

Department of Computer Science


School of Engineering & Technology
Pondicherry University
Karaikal-609 605
Puducherry,India
Department of Compute Science School
of Engineering &Technology
Pondicherry University
Karaikal-609 605,
Puducherry, India

BONAFIDE CERTIFICATE

Name:

Reg. No: Class:

Course Title

Course Code _________________________________________________

Certified that this is the bonafide record of work done by me during Odd / Even

Semester of 2022 – 2023 and submitted for the Practical Examination on

Staff In-Charge Head of the Department

Examiners

1.

2.
INDEX
Sl.No. Contents Page No.

1 Searching Algorithms (with the number of key comparisons)


1a.Sequential search algorithm
1b.Binary search algorithm
1c.Fibonacci search algorithm

2 Evaluation of Arithmetic Expression.

3 Dynamic Linear Data structure


3a.Stack
3b.Queue
3c.Circular queue
3d.priority queue
4 Linked List
4a.Singly Linked List,
4b.Doubly Linked List
4c.Circular Linked List.
5 Tree Traversal techniques.
5a.Inorder
5b.Preorder
5c.Postorder
6 Graph Traversal techniques.

7 Dijkstra’s Algorithm to obtain the shortest paths

8 Binary search using Divide-and-Conquer technique.

9 Sorting algorithms using Divide-and-Conquer technique.


9a. Merge Sort
9b. Quick Sort
10 Knapsack using Greedy technique.

11 Traveling Salesman algorithms using Dynamic Programming technique.

12 8 Queens with the design of Backtracking

You might also like