BSc CSIT (TU) Science Data Structures and Algorithms (BSc CSIT, CSC206) Question Paper 2080
This is the official BSc CSIT (TU) (Science stream) Data Structures and Algorithms (BSc CSIT, CSC206) question paper for 2080, 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 2080 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
What is a graph? Explain Breadth First Search (BFS) and Depth First Search (DFS) traversal techniques with suitable examples and their applications.
Define stack and its operations. Write an algorithm to convert an infix expression into postfix and evaluate the postfix expression A B + C * D - with a stack.
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.
Section B: Short Answer Questions
Attempt any EIGHT questions.
What is recursion? Write a recursive algorithm to compute the factorial of a number and explain the role of the stack in recursion.
Differentiate between bubble sort and selection sort with examples.
Explain inorder, preorder and postorder tree traversals with an example binary tree.
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.