301
CSE/IT/DS/CS
Jharkhand University of Technology, Ranchi
B.Tech. 3rd Semester Examination, 2024 (NEP)
Subject:Data Structures and Algorithms Subject Code : CSE-301
Time Allowed :3 Hours Full Marks : 70
Answer in your own words.
Answer any five questions in which Question No. 1 is compulsory.
The figures in the margin indicate full marks.
All questions carry equal marks.
1, Choose the most suitable answer:
2x7=14
()) Which of the following sorting algorithms follows the Divide and Conquer paradigm?
(a) Insertion Sort (b) Bubble Sort
(c) Merge Sort (d) Counting Sort
(ii) What is the time complexity of Quick Sort in the worst case?
(a) O(n log n) On)
(c) O(n) (d) O(logn)
(ii) Which of the following is not a standard tree traversal technique?
(a) Inorder traversal (b) Preorder traversal
(c) Outorder traversal (d) Postorder traversal
(iv) In a min-heap, which of the following is always true?
(a) The left child is always smaller than the right child.
(b) The right child is always smaller than the parent.
C) The root node contains the smallest element.
(d) The tree is always a complete binary tree.
(v) What is the height of an AVL tree with 'n' nodes in the worst case?
(a) O(n) (b) O(log n)
(c) O(n log n) (d) O(Vn)
(vi) Which data structure is most suitable for implenmenting adictionary ADT with fast insertions
and lookups?
(a) Linked List (b) Binary Search Tree
(9) Hash Table (d) Stack
(vii) Which graph traversal algorithm is used to find the shortest path in an unweighted graph?
(a) Depth-First Search (DFS) (b) Breadth-First Search (BFS)
(c) Dijkstra's Algorithm (d) Prim'sAlgorithm
Please Turn Over
37469
CSE/IT/DS/CS
Jharkhand University of Technology, Ranchi
B.Tech. 3rd Semester Examination, 2024 (NEP)
Subject:Data Structures and Algorithms Subject Code : CSE-301
Time Allowed :3 Hours Full Marks : 70
Answer in your own words.
Answer any five questions in which Question No. 1 is compulsory.
The figures in the margin indicate full marks.
All questions carry equal marks.
1, Choose the most suitable answer:
2x7=14
()) Which of the following sorting algorithms follows the Divide and Conquer paradigm?
(a) Insertion Sort (b) Bubble Sort
(c) Merge Sort (d) Counting Sort
(ii) What is the time complexity of Quick Sort in the worst case?
(a) O(n log n) On)
(c) O(n) (d) O(logn)
(ii) Which of the following is not a standard tree traversal technique?
(a) Inorder traversal (b) Preorder traversal
(c) Outorder traversal (d) Postorder traversal
(iv) In a min-heap, which of the following is always true?
(a) The left child is always smaller than the right child.
(b) The right child is always smaller than the parent.
C) The root node contains the smallest element.
(d) The tree is always a complete binary tree.
(v) What is the height of an AVL tree with 'n' nodes in the worst case?
(a) O(n) (b) O(log n)
(c) O(n log n) (d) O(Vn)
(vi) Which data structure is most suitable for implenmenting adictionary ADT with fast insertions
and lookups?
(a) Linked List (b) Binary Search Tree
(9) Hash Table (d) Stack
(vii) Which graph traversal algorithm is used to find the shortest path in an unweighted graph?
(a) Depth-First Search (DFS) (b) Breadth-First Search (BFS)
(c) Dijkstra's Algorithm (d) Prim'sAlgorithm
Please Turn Over
37469
