Scribd
Upload
6 views3 pages

CS3401 Set1

The document outlines the practical examination for the Algorithms Laboratory course for the fourth semester, detailing various programming tasks to be completed in C. Students are required to implement algorithms such as binary search, linear search, sorting algorithms, graph traversal methods, and more, with specific focus on analyzing time complexity and performance. The examination is structured to assess both theoretical understanding and practical coding skills, with a total of 100 marks allocated across different components.

Uploaded by

krishnavarathait
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
6 views3 pages

CS3401 Set1

The document outlines the practical examination for the Algorithms Laboratory course for the fourth semester, detailing various programming tasks to be completed in C. Students are required to implement algorithms such as binary search, linear search, sorting algorithms, graph traversal methods, and more, with specific focus on analyzing time complexity and performance. The examination is structured to assess both theoretical understanding and practical coding skills, with a total of 100 marks allocated across different components.

Uploaded by

krishnavarathait
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/ 3

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

Calculation Viva-Voce Record Total


Aim/Principle/Apparatus Tabulation/Circuit/
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.
Page 2 of 2

You might also like