Multiple Choice Questions (MCQ) on Data Structure

Computer Science Engineering

31- The concatenation of two lists can be performed in O(1) time. Which of the following variation of the linked list can be used?

(A) Array implementation of list

(B) Circular doubly linked list

(C) Doubly linked list

(D) Singly linked list

 

32- What is meant by physical size in a dynamic array?

(A) The size visible to users

(B) The size of the underlying array at the back-end

(C) The size extended to add new elements

(D) The size allocated to elements

 

33- What does ‘stack underflow’ refer to?

(A) index out of bounds exception

(B) removing items from an empty stack

(C) adding items to a full stack

(D) accessing item from an undefined stack

 

34- Which of the following is true?

(A) smaller the order of B-tree, less frequently the split occurs

(B) smaller the order of B-tree, more frequently the split occurs

(C) larger the order of B-tree, more frequently the split occurs

(D) larger the order of B-tree, less frequently the split occurs

 

35- What is/are the disadvantages of implementing tree using normal arrays?

(A) difficult to implement

(B) have to know the maximum number of nodes possible before creation of trees

(C) difficult in finding the parent of a node

(D) difficulty in knowing children nodes of a node

 

36- Heap can be used as _______

(A) Normal Array

(B) A decreasing order array

(C) Stack

(D) Priority queue

 

37- Which of the following properties is associated with a queue?

(A) Last In Last Out

(B) Last In First Out

(C) First In First Out

(D) First In Last Out

 

38- Which of the following statements for a simple graph is correct?

(A) Path and trail have no relation

(B) Every trail is a path as well as every path is a trail

(C) Every trail is a path

(D) Every path is a trail

 

39- What is the need for a circular queue?

(A) implement LIFO principle in queues

(B) to delete elements based on priority

(C) easier computations

(D) effective usage of memory

 

40- A connected planar graph having 6 vertices, 7 edges contains _______ regions.

(A) 11

(B) 1

(C) 3

(D) 15

 

ANSWERS:

31-(B), 32-(B), 33-(B), 34-(D), 35-(B), 36-(D), 37-(C), 38-(D), 39-(D), 40-(C)