Scribd
Upload
638 views2 pages

CS3401 Questions

The document outlines the practical end semester examination for the fourth semester CS3401 Algorithms Laboratory course. It provides 15 algorithmic and data structures problems to choose from including implementations of binary search, linear search, insertion sort, graph traversal, shortest path problems, minimum spanning trees, sorting algorithms, traveling salesperson, and more.

Uploaded by

anant
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
638 views2 pages

CS3401 Questions

The document outlines the practical end semester examination for the fourth semester CS3401 Algorithms Laboratory course. It provides 15 algorithmic and data structures problems to choose from including implementations of binary search, linear search, insertion sort, graph traversal, shortest path problems, minimum spanning trees, sorting algorithms, traveling salesperson, and more.

Uploaded by

anant
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/ 2

B.E / B.Tech.

PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2023

Fourth Semester

CS3401 – ALGORITHMS LABORATORY

(Regulations - 2021)

Time: 3 Hours Answer any one Questions Max. Marks 100

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation Viva-Voce Record Total


required/Procedure Program/Drawing & Results
20 30 30 10 10 100

1. Implement the binary search algorithm in C and analyse its time complexity.

2. Implement Linear Search. Determine the time required to search for an element. Repeat the
experiment for different values of n, the number of elements in the list to be searched and plot a graph
of the time taken versus n.

3. Implement Insertion sort and repeat the experiment for different values of n, the number of elements
in the list to be sorted and plot a graph of the time taken versus n.

4. Given a text txt [0...n-1] and a pattern pat [0...m-1], write a function search (char pat [ ], char txt [
]) that prints all occurrences of pat [ ] in txt [ ]. You may assume that n > m.

5. Develop a program to implement graph traversal using Breadth First Search.

6. Write a C program to implement the depth first search algorithm for a graph and analyse its
time complexity.

7. Develop a program to find the shortest paths to other vertices using Dijkstra’s algorithm.

8. Develop a program to implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.

Page 1 of 2
9. Implement prims algorithm for finding the minimum spanning tree of an undirected graph.

10. Develop a program to find out the maximum numbers in a given list of n numbers using the divide
and conquer technique.

11. Implement the heap sort algorithm in C. Compare its performance with other sorting algorithms for
different input sizes.

12. Implement quick sort algorithm and analyse its time complexity.

13. Implement Traveling Salesperson problem and then solve the same problem instance using any
approximation algorithm and determine the error in the approximation.

14. Write a C program to Implement N Queens problem using Backtracking.

15. Implement randomized algorithms for finding the kth smallest number.

INTERNAL EXAMINER EXTERNAL EXAMINER

Page 2 of 2

You might also like