BSc CSIT (TU) Science Data Structures and Algorithms (BSc CSIT, CSC206) Question Paper 2079
This is the official BSc CSIT (TU) (Science stream) Data Structures and Algorithms (BSc CSIT, CSC206) question paper for 2079, 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 2079 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
What is sorting? Explain the working mechanism of quick sort algorithm with a suitable example. Analyze its best-case and worst-case time complexity.
Define a binary search tree (BST). Write algorithms for insertion and deletion of a node in a BST and trace them with a suitable example.
What is a graph? Explain Breadth First Search (BFS) and Depth First Search (DFS) traversal techniques with suitable examples and their applications.
Section B: Short Answer Questions
Attempt any EIGHT questions.
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.
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.