Scribd
Upload
7 views1 page

Data Structure and Algorithms

The document outlines an examination for a Data Structure and Algorithms course, consisting of three sections: Section A with five short answer questions, Section B with five detailed questions to choose from, and Section C with one in-depth question. Topics covered include algorithms, data structures like stacks and queues, sorting methods, and specific problems such as the knapsack problem and graph coloring. The total marks for the exam are 50, with varying weightage for each section.

Uploaded by

Dharani Mani
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
7 views1 page

Data Structure and Algorithms

The document outlines an examination for a Data Structure and Algorithms course, consisting of three sections: Section A with five short answer questions, Section B with five detailed questions to choose from, and Section C with one in-depth question. Topics covered include algorithms, data structures like stacks and queues, sorting methods, and specific problems such as the knapsack problem and graph coloring. The total marks for the exam are 50, with varying weightage for each section.

Uploaded by

Dharani Mani
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/ 1

DEPARTMENT OF MATHEMATICS

DATA STRUCTURE AND ALGORITHMS

Max Mark: 50 marks

Section A – (5 * 2 = 10 marks)
Answer ALL the questions
1. Define Algorithm
2. Explain the usage of Stack in recursive algorithm implementation
3. Define Binary Search.
4. Explain Knapsack problem.
5. What is graph coloring? Explain with an example.

Section B - (5 * 5 = 25 marks)
Answer ANY 5 Questions

6. Give an algorithm to find Merge sort with an example.


7. Define stack. Explain the usage of stack with an algorithm.
8. Prove Kruskal’s algorithm generates a minimum cost spanning tree.
9. Give an algorithm to find shortest path in a graph.
10. Brief the procedure for the sum of subsets problem.
11. Explain in brief Hamiltonian cycle problem.

Section C – (1 * 15 = 15 marks)
Answer ANY 1 Question
12. Explain how Queue can be implemented using arrays
13. State and explain the algorithm to perform Quick sort. Analyse the time complexity of the
algorithm.
14. Discuss about the 8 queens problems with suitable example.

You might also like