MCQs on Stack and Queue | Data Structures and Algorithms - Multiple Choice Questions and Answers | MCQs on Data Structures | Data Structures and Algorithms Quiz | Data Structures and Algorithms Online Test

Questions

51 Which data structure allows deleting data elements from and inserting at rear?

A Stacks

B Queues

C Dequeues

D Binary search tree

View Answer Comment

Answer: Option [B]

52 Which data structure is used in breadth first search of a graph to hold nodes?

A Array

B Tree

C Stack

D queue

View Answer Comment

Answer: Option [D]

Article and Schedule Quiz	Start Test!

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

53 Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

A Stack

B Priority queues

C Output restricted qequeue

D Input restricted dequeue

View Answer Comment

Answer: Option [D]

54 Which of the following data structure is non linear type?

A Graph

B Stacks

C Lists

D None of the above

View Answer Comment

Answer: Option [A]

55 In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.

A 0 and 1

B 0 and -1

C -1 and 0

D 1 and 0

View Answer Comment

Answer: Option [B]

56 There is an extra element at the head of the list called a .........

A Sentinel

B Antinel

C List head

D List header

View Answer Comment

Answer: Option [A]

57 The property of binary tree is

A The root cannot contain NULL

B The first subset is called left subtree

C The second subtree is called right subtree

D The right subtree can be empty

View Answer Comment

Answer: Option [D]

58 When new data are to be inserted into a data structure, but there is not available space; this situation is usually called .......

A overflow

B Underflow

C housefull

D memoryfull

View Answer Comment

Answer: Option [A]

59 A data structure where elements can be added or removed at either end but not in the middle is called ......

A stacks

B queues

C dequeue

D linked lists

View Answer Comment

Answer: Option [C]

60 The use of pointers to refer elements of a data structure in which elements are logically adjacent is ......

A stack

B queue

C pointers

D linked allocation

View Answer Comment

Answer: Option [D]

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!