Home / Engineering / Data Structure (DS) MCQs / Page 8

Data Structure (DS) MCQs | Page - 8

Dear candidates you will find MCQ questions of Data Structure (DS) here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 51.17K Points
Coach

Q. 71) Which of the following name does not relate to stacks?

(A) fifo lists
(B) lifo list
(C) piles
(D) push-down lists
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 72) The term "push" and "pop" is related to the

(A) array
(B) lists
(C) stacks
(D) all of the above
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 73) Which data structure allows deleting data elements from front and inserting at rear?

(A) stacks
(B) queue
(C) dequeue
(D) binary search tree
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 74) node.next -> node.next.next; will make

(A) node.next inaccessible
(B) node.next.next inaccessible
(C) this node inaccessible
(D) none of the above
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 75) A circular linked list can be used for

(A) stack
(B) queue
(C) both stack & queue
(D) neither stack or queue
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 76) In doubly linked lists

(A) a pointer is maintained to store both next and previous nodes.
(B) two pointers are maintained to store next and previous nodes.
(C) a pointer to self is maintained for each node.
(D) none of the above
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 77) The disadvantage in using a circular linked list is …………………….

(A) it is possible to get into infinite loop
(B) last node points to first node.
(C) time consuming
(D) requires more memory space
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 78) A linear list in which each node has pointers to point to the predecessor and successors nodes is called as

(A) singly linked list
(B) circular linked list
(C) doubly linked list
(D) linear linked list
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 79) In doubly linked lists, traversal can be performed?

(A) only in forward direction
(B) only in reverse direction
(C) in both directions
(D) none of the above
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 80) What differentiates a circular linked list from a normal linked list?

(A) you cannot have the ‘next’ pointer point to null in a circular linked list
(B) it is faster to traverse the circular linked list
(C) you may or may not have the ‘next’ pointer point to null in a circular linked list
(D) head node is known in circular linked list
View Answer Discuss Share

Explore Sets

Data Structure (DS) MCQs Set 1

Data Structure (DS) MCQs Set 2

Data Structure (DS) MCQs Set 3

Data Structure (DS) MCQs Set 4

Data Structure (DS) MCQs Set 5

Data Structure (DS) MCQs Set 6

Data Structure (DS) MCQs Set 7

Data Structure (DS) MCQs Set 8

Data Structure (DS) MCQs Set 9

Data Structure (DS) MCQs Set 10

Data Structure (DS) MCQs Set 11

Data Structure (DS) MCQs Set 12

Data Structure (DS) MCQs Set 13

Data Structure (DS) MCQs Set 14

Data Structure (DS) MCQs Set 15

Data Structure (DS) MCQs Set 16

Data Structure (DS) MCQs Set 17

Data Structure (DS) MCQs Set 18

Data Structure (DS) MCQs Set 19

Data Structure (DS) MCQs Set 20

Data Structure (DS) MCQs Set 21

Data Structure (DS) MCQs Set 22

Data Structure (DS) MCQs Set 23

Data Structure (DS) MCQs Set 24

Data Structure (DS) MCQs Set 25

Data Structure (DS) MCQs Set 26

Data Structure (DS) MCQs Set 27

Data Structure (DS) MCQs Set 28

Data Structure (DS) MCQs Set 29

Data Structure (DS) MCQs Set 30

Data Structure (DS) MCQs Set 31

Data Structure (DS) MCQs Set 32

Data Structure (DS) MCQs Set 33

Data Structure (DS) MCQs Set 34

Data Structure (DS) MCQs Set 35

Data Structure (DS) MCQs Set 36

Data Structure (DS) MCQs Set 37

Data Structure (DS) MCQs Set 38

Data Structure (DS) MCQs Set 39

Data Structure (DS) MCQs Set 40

Data Structure (DS) MCQs Set 41

Data Structure (DS) MCQs Set 42

Data Structure (DS) MCQs Set 43

Data Structure (DS) MCQs Set 44

Data Structure (DS) MCQs Set 45

Data Structure (DS) MCQs Set 46

Data Structure (DS) MCQs Set 47

Data Structure (DS) MCQs Set 48

Data Structure (DS) MCQs Set 49

Data Structure (DS) MCQs Set 50

Data Structure (DS) MCQs Set 51

Data Structure (DS) MCQs Set 52

Data Structure (DS) MCQs Set 53

Data Structure (DS) MCQs Set 54