Current Affairs Quiz 2024GKCourses AptitudeADRE 2.0English

Data Structures and Algorithms MCQs | Objective Questions Answers

Download PDF

Free download pdf of Data Structures and Algorithms Multiple Choice Questions and Answers for papers of graduate and post-graduate examinations in Computer Science & Engineering Branch.
Go To Download Page
(31) The in order traversal of tree will yield a sorted listing of elements of tree in....
[A] Merging
[B] AVL Trees
[C] Binary trees
[D] Binary search trees

Comment

Answer: Option [D]
(32) A binary tree whose every node has either zero or two children is called.........
[A] Extended binary tree
[B] Complete binary tree
[C] Binary Search tree
[D] Disjoint tree

Comment

Answer: Option [A]

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

Article and Schedule Quiz Start Test!
(33) The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
[A] ABFCDE
[B] ADBFEC
[C] ABDECF
[D] ABDCEF

Comment

Answer: Option [C]
(34) Three standards ways of traversing a binary tree T with root R .......
[A] Prefix, infix, postfix
[B] Pre-process, in-process, post-process
[C] Pre-traversal, in-traversal, post-traversal
[D] Pre-order, in-order, post-order

Comment

Answer: Option [D]
(35) A technique for direct search is
[A] Hashing
[B] Tree Search
[C] Binary Search
[D] Linear Search

Comment

Answer: Option [A]
(36) If a node having two children is deleted from a binary tree, it is replaced by its
[A] Preorder predecessor
[B] Inorder predecessor
[C] Inorder successor
[D] Preorder successor

Comment

Answer: Option [C]
(37) A full binary tree with 2n+1 nodes contain
[A] n leaf nodes
[B] n non-leaf nodes
[C] n-1 leaf nodes
[D] n-1 non-leaf nodes

Comment

Answer: Option [B]
(38) A full binary tree with n leaves contains
[A] n - 1 nodes
[B] log2n nodes
[C] 2n – 1 nodes
[D] 2n nodes

Comment

Answer: Option [C]
(39) The smallest element of an array’s index is called its
[A] extraction
[B] range
[C] lower bound
[D] upper bound

Comment

Answer: Option [C]
(40) The data structure required for Breadth First Traversal on a graph is
[A] queue
[B] stack
[C] array
[D] None of the above

Comment

Answer: Option [A]

Take Mock Tests

Missiles Mock Test Start Test!
SSC MTS Mock Test Start Test
IBPS CLERK MOCK TEST Start Test
SSC MTS 2022 JULY 26 Shift 1 (ENGLISH) Start Test!
SSC GD Previous Year Paper 2021 Nov 17 Shift - I (Hindi) Start Test!
SSC CGL Tier - 1 PYP 2022 April 21 Shift- 1 (ENGLISH) Start Test!
MPSC PAPER I MOCK TEST 1 (ENGLISH) Start Test!
IB Security Assistant Mock test 1 (english) Start Test!
UP POLICE CONSTABLE MOCK TEST 1 Start Test!
DELHI POLICE CONSTABLE MOCK TEST 1 (HINDI) Start Test!
LEAVE A COMMENT