BSc CSIT (TU) Science Data Structures and Algorithms (BSc CSIT, CSC206) Question Paper 2077
This is the official BSc CSIT (TU) (Science stream) Data Structures and Algorithms (BSc CSIT, CSC206) 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 Data Structures and Algorithms (BSc CSIT, CSC206) 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) Data Structures and Algorithms (BSc CSIT, CSC206) 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 merge sort with its algorithm. Sort the list 38, 27, 43, 3, 9, 82, 10 using merge sort showing all the intermediate steps and analyze its complexity.
What is an AVL tree? Explain different rotations used to balance an AVL tree with examples. Construct an AVL tree by inserting 21, 26, 30, 9, 4, 14, 28, 18, 15, 10, 2, 3, 7.
Define minimum spanning tree. Explain Prim's and Kruskal's algorithms to find the minimum spanning tree of a graph with a suitable example.
Section B: Short Answer Questions
Attempt any EIGHT questions.
Compare linear search and binary search. Write an algorithm for binary search and analyze its complexity.
What is a heap? Explain the heapify operation and construct a max-heap from 4, 10, 3, 5, 1.
Explain different representations of a graph (adjacency matrix and adjacency list) with examples.
What is dynamic programming? Explain it with the example of the 0/1 knapsack problem.
What are the applications of stack? Explain how a stack is used in function calls.
Explain heap sort algorithm with an example and analyze its time complexity.
What is algorithm complexity? Explain Big-O, Big-Omega and Theta notations with examples.
What is a linked list? Differentiate between singly and doubly linked lists with diagrams.
Define a queue. Explain circular queue and write an algorithm for its enqueue and dequeue operations.