BSc CSIT (TU) Science Design and Analysis of Algorithms (BSc CSIT, CSC314) Question Paper 2077
This is the official BSc CSIT (TU) (Science stream) Design and Analysis of Algorithms (BSc CSIT, CSC314) question paper for 2077, as set in the regular annual examination. It carries 60 full marks and a time allowance of 180 minutes, across 12 questions. On Kekkei you can attempt this Design and Analysis of Algorithms (BSc CSIT, CSC314) past paper online with a timer, get instant AI feedback and step-by-step solutions, and track the topics where you lose marks — completely free. Whether you are revising for your BSc CSIT (TU) Design and Analysis of Algorithms (BSc CSIT, CSC314) exam or solving previous years' question papers, this 2077 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Explain the greedy method of algorithm design. Generate the prefix code for the string "CYBER CRIME" using Huffman algorithm and find the total number of bits required to encode it.
What is backtracking and how does it differ from recursion? Solve the 4-Queens problem using backtracking and analyze its time complexity.
Define minimum spanning tree. Write Kruskal's algorithm to find the MST of a connected weighted graph, illustrate it with an example and analyze its complexity.
Section B: Short Answer Questions
Attempt any EIGHT questions.
Write Dijkstra's algorithm to find single-source shortest paths and explain it with an example.
Explain the matrix chain multiplication problem and write its dynamic programming formulation.
Explain heap sort algorithm with an example and analyze its time complexity.
Explain how the subset-sum problem is solved using backtracking with an example.
What are approximation algorithms? Explain the approximation algorithm for the vertex cover problem.
Explain the branch and bound technique. How is it used to solve the travelling salesman problem?
Differentiate between Breadth First Search (BFS) and Depth First Search (DFS) with examples and their time complexities.
Solve the recurrence relation T(n) = 2T(n/2) + n using the substitution method and the recursion tree method.
Explain the job sequencing with deadlines problem and solve it using the greedy approach for a given set of jobs.