Scribd
Upload
6 views3 pages

CS3401 Set2

The document outlines the B.E/B.Tech. Algorithms Laboratory examination for the Fourth Semester in April/May 2023, detailing 15 programming tasks to be completed in C. Each task requires implementation of various algorithms, analysis of time complexity, and demonstration of results. The examination is structured to assess students' understanding of algorithmic concepts and practical programming skills.

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 Set2

The document outlines the B.E/B.Tech. Algorithms Laboratory examination for the Fourth Semester in April/May 2023, detailing 15 programming tasks to be completed in C. Each task requires implementation of various algorithms, analysis of time complexity, and demonstration of results. The examination is structured to assess students' understanding of algorithmic concepts and practical programming skills.

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.

LABORATORY 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 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.

2. Write a program to implement binary search in C. Demonstrate the working of the algorithm with
suitable inputs and analyse its time complexity.

3. Sort a given set of elements using the Heap sort method and determine the time required to sort the
elements.

4. Write a program in C to multiply two matrices and analyse the time complexity of the algorithm for
different input sizes.

5. Write a C function that takes two string inputs – a longer text and a shorter text such that the
function should give the total number of occurrences of the pattern in the text string

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 implement graph traversal using Breadth First Search

8. Find the minimum cost spanning tree of a given undirected graph using Prim’s algorithm.

9. Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.

10. Implement the merge sort algorithm in C and analyse its time complexity.
Page 1 of 2
11. Implement quick sort algorithm and analyse its time complexity.

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

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

14. Compute the transitive closure of a given directed graph using Warshall's algorithm.

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


Page 2 of 2

You might also like