Solved Objective Questions On Data Structure Set-6

This set of objective questions on data structure includes the collections of solved multiple choice questions on fundamental of data structure. It includes solved objective questions on advantages of using an array, examples of data structures, components of data structure based on the concept of Abstract Data Type (ADT), linear type of data structure and a binary search tree in data structure.

1. …………………….. is a variable that can hold the address of the variables, structure and functions that are used in the program.
A) Array
B) Pointer
C) Structure
D) None of the above

2. ……………… is the organization of the data in a computers memory or in a file.
A) Array
B) Data Structure
C) Data Management
D) Data Organization

3. Which of the following is/are the advantages of using an array?
i) Multi huge quantity of data items can be stored.
ii) Arrays saves the memory space
iii) Arrays helps to arrange the data items in particular order.
iv) Data item searching is faster.
A) i, ii and iii only
B) ii, iii and iv only
C) i, iii and iv only
D) All i, ii, iii and iv

4. Some examples of data structures are
i) array
ii) stack
iii) queue
iv) binary tree
v) hybrid tree
A) i, ii, iii and iv only
B) ii, iii, iv and v only
C) i, ii, iii and v only
D) All i, ii, iii, iv and v

Table of Contents

Read Also: Objective Questions on Data Structure and Algorithm

5. Match the following components of data structure based on the concept of Abstract Data Type (ADT) with their definitions.
a) Operations i) Organizations of data implemented in lower level data structure.
b) Storage structures ii) Description on how to manipulate information in the storage structure.
c) Algorithms iii) Specifies the external appearance of data structure.
A) a-i, b-ii, c-iii
B) a-ii, b-iii, c-i
C) a-iii, b-i, c-ii
D) a-i, b-iii, c-ii

6. Match the following properties of an array with their descriptions.
a) Homogeneous i) the list size is constant.
b) Ordered    ii) there is a first and last element.
c) Finite    iii) there is a next and previous in the natural order of the structure
d) fixed-length    iv) every element is the same.

A) a-i, b-ii, c-iii, d-iv
B) a-ii, b-iii, c-iv, d-i
C) a-iii, b-i, c-ii, d-iii
D) a-iv, b-iii, c-ii, d-i

7. Which of the following are linear type of data structure?
i) Linked list
ii) Stack
iii) Binary Tree
iv) Array
v) Queue
A) i, ii, iii and iv only
B) ii, iii, iv and v only
C) i, ii, iv and v only
D) All i, ii, iii, iv and v

8. Which of the following are non linear type of data structure?
i) Tree
ii) Graphs
iii) Hash tables
iv) List
A) i, ii and iii only
B) ii, iii and iv only
C) i, iii and iv only
D) All i, ii, iii and iv

Read Also: Objective questions of computer data structure

9. State whether the following statements is/are True or False.
i) An ancestor is any node in the path from the root to the node.
ii) A sub-tree is any connected structure below the root.
iii) Binary tree is a directed tree in which out degree of each node is less than or equal to one.
iv) A tree consists of finite set of elements called nodes.
v) Nodes that are not root and not leaf are called intermediate nodes.
A) True, True, True, False, True
B) True, False, True, True, False
C) True, True, True, False, False
D) True, True, False, True, False

10. In a binary search tree the node to be deleted will have two cases which are
i) An empty left sub-tree and non empty right sub-tree and vice versa.
ii) Non empty left sub-tree and right sub-tree.
iii) Empty left sub-tree and right sub-tree.
A) i and ii only
B) ii, and iii only
C) i and iii only
D) None of the above

Answers:

1. B) Pointer
2. B) Data Structure
3. D) All i, ii, iii and iv
4. A) i, ii, iii and iv only
5. C) a-iii, b-i, c-ii
6. D) a-iv, b-iii, c-ii, d-i
7. C) i, ii, iv and v only
8. A) i, ii and iii only
9. D) True, True, False, True, False
10. A) i and ii only