TNPSC ASSISTANT SYSTEM ENGINEER- 2019
DATA STRUCTURES AND ALGORITHMS
PREVIOUS YEAR QUESTIONS 1 MARK SOLVED
TOPICS DISCUSSED: 1. In queue insertion takes place -----end. (A)front (C)rear (B)top (D) bottom ANS: (C)rear
2. Preorder is also known as (A) symmetric order (C) depth first order (B) asymmetric order (D) breadth first order ANS:(C) depth first order
3. The complexity ofBinary search algorithm is (A) O(n) (C) O(logn) (B) O(n2) (D) O(nlogn) ANS: (C) O(logn)
4. The another name for header node is (A)list header (C) tail header (B) list node (D) push header ANS: (A)list header
5. ----- is an almost complete binary tree such that the content of each node is greater than or equal to the contents of its father . (a)Min-heap (C) Min-Max heap (B) Max heap (D) Max-Min heap ANS: (a)Min-heap
6. Binary search is used in which list (A)unordered list (C) binary list (b)sorted list (D) linear way of list ANS: (b)sorted list
