Data Structures objective Questions Answers | Data Structures and Algorithms - Multiple Choice Questions and Answers | MCQs on Data Structures | Data Structures and Algorithms Quiz | Data Structures and Algorithms Online Test | Page-9

Questions

81 Which of the following sorting algorithms does not have a worst case running time of O(n²)?

A Insertion sort

B Quick sort

C Bubble sort

D Merge sort

View Answer Comment

Answer: Option [D]

82 In a circular linked list

A there is no beginning and no end.

B components are arranged hierarchically.

C forward and backward traversal within the list is permitted.

D components are all linked together in some sequential manner.

View Answer Comment

Answer: Option [A]

Article and Schedule Quiz	Start Test!

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

83 The quick sort algorithm exploit _________ design technique

A Overflow

B Backtracking

C Dynamic programming

D Divide and Conquer

View Answer Comment

Answer: Option [D]

84 The data structure required to check whether an expression contains balanced parenthesis is

A Stack

B Queue

C Tree

D Array

View Answer Comment

Answer: Option [A]

85 What data structure would you mostly likely see in a nonrecursive implementation of a recursive algorithm?

A Trees

B Linked list

C Stack

D Queue

View Answer Comment

Answer: Option [C]

86 The number of leaf nodes in a complete binary tree of depth d is

A 2^d

B 2^d–1+1

C 2^d+1+1

D 2^d+1

View Answer Comment

Answer: Option [A]

87 The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum

A One node

B Two nodes

C Three nodes

D Any number of nodes

View Answer Comment

Answer: Option [A]

88 A binary tree of depth “d” is an almost complete binary tree if

A Each leaf in the tree is either at level “d” or at level “d–1”

B For any node “n” in the tree with a right descendent at level “d” all the left descendents of “n” that are leaves, are also at level “d”

C Both (A) & (B)

D None of the above

View Answer Comment

Answer: Option [C]

89 In a binary tree a sequence of consecutive edges is called ......

A Path

B Rotate

C Two-way

D Connecting lines

View Answer Comment

Answer: Option [A]

90 An adjacency matrix representation of a graph cannot contain information of:

A nodes

B edges

C parallel edges

D direction of edges

View Answer Comment

Answer: Option [C]

ADRE 2.0 FULL LENGTH MOCK TEST

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!