MCQs on Linked List | Data Structures and Algorithms - Multiple Choice Questions and Answers | MCQs on Data Structures | Data Structures and Algorithms Quiz | Data Structures and Algorithms Online Test

41 One can convert a binary tree into its mirror image by traversing it in

A inorder

B preorder

C postorder

D None of the above

View Answer Comment

Answer: Option [C]

42 The data structure required to evaluate a postfix expression is

A queue

B stack

C linked-list

D All of the above

View Answer Comment

Answer: Option [B]

43 Which of the following sorting methods would be most suitable for sorting a list which is almost sorted

A Insertion Sort

B Selection Sort

C Quick Sort

D Bubble Sort

View Answer Comment

Answer: Option [D]

44 The process of accessing data stored in a serial access memory is similar to manipulating data on a

A heap

B queue

C stack

D None of the above

View Answer Comment

Answer: Option [C]

45 The postfix form of A*B+C/D is

A ABCD+/*

B AB*CD/+

C *AB/CD+

D A*BC+/D

View Answer Comment

Answer: Option [B]

46 A linear collection of data elements where the linear node is given by means of pointer is called

A linked list

B node list

C primitive list

D None of these

View Answer Comment

Answer: Option [A]

47 Representation of data structure in memory is known as:

A storage structure

B file structure

C abstract data type

D None of the above

View Answer Comment

Answer: Option [C]

48 The goal of hashing is to produce a search that takes

A O(1) time

B O(n²) time

C O(log n) time

D O(n log n) time

View Answer Comment

Answer: Option [A]

49 The complexity of multiplying two matrices of order m*n and n*p is

A np

B mn+p

C mn

D mnp

View Answer Comment

Answer: Option [D]

50 For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

A 2n

B 2e

C (e²+1)/2

D (2n-1)/2

View Answer Comment

Answer: Option [B]

Data Structures and Algorithms MCQs | Objective Questions Answers

State-wise Current Affairs

Gkseries

Information

Study Material

Contact