Ojective Question

data-structure-mcqs - Set (1)

Correct Answer: Orange && Worng Answer: Red

1. The complexity of Bubble sort algorithm in average case is

(A). O(n)

(B). O(log n)

(C). O(n2)

(D). O(n log n)

View Answer

Explanation: Not Avilable

2. The process of processing each element in the list is known as-

(A). Sorting

(B). Merging

(C). Inserting

(D). Traversal

View Answer

Explanation: Not Avilable

3. The memory address of the first element of an array is called

(A). Floor address

(B). Foundation address

(C). First address

(D). Base address

View Answer

Explanation: Not Avilable

4. Which of the following name does not relate to stacks ?

(A). FIFO list

(B). LIFO list

(C). Piles

(D). Push-down lists

View Answer

Explanation: Not Avilable

5. The situation when in a linked list START=NULL is –

(A). Underflow

(B). Overflow

(C). Housefull

(D). Saturated

View Answer

Explanation: Not Avilable

6. Which of the following is a two-way list?

(A). Grounded header list

(B). Circular header list

(C). Linked list with header and trailer nodes

(D). None of the above

View Answer

Explanation: Not Avilable

7. Two dimentional array is also called –

(A). Table arrays

(B). Matrix arrays

(C). Both of the above

(D). None of these

View Answer

Explanation: Not Avilable

8. A variable P is called pointer if –

(A). P contains the address of an element in DATA

(B). P points to the address of first element in DATA

(C). P can store only memory address

(D). P contains the DATA and the address of DATA

View Answer

Explanation: Not Avilable

9. Which of the data structure store the homogeneous data elements

(A). Record

(B). Pointers

(C). Arrays

(D). None of the above

View Answer

Explanation: Not Avilable

10. _____ is not the component of data structure –

(A). Operations

(B). Storage structures

(C). Algorithms

(D). None of the above

View Answer

Explanation: Not Avilable

11. Which data structure is used in breadth first search ?

(A). Stack

(B). Queue

(C). Tree

(D). Array

View Answer

Explanation: Not Avilable

12. To represent hierarchical relationship between elements which data structure is suitable ?

(A). Dequeue

(B). Priority queue

(C). Tree

(D). Graph

View Answer

Explanation: Not Avilable

13. Which of the following data structure is not linear data sturcture ?

(A). Array

(B). Linked list

(C). Both the above

(D). None of the above

View Answer

Explanation: Not Avilable

14. Binay search tree cannot be applied to –

(A). Sorted linked list

(B). Sorted binary trees

(C). Sorted linear array

(D). Pointer array

View Answer

Explanation: Not Avilable

15. The empty list is the one which has no

(A). Nodes

(B). Data

(C). Both (a) and (b)

(D). Address

View Answer

Explanation: Not Avilable

16. Which of the following linked list have last node of the list pointing to the first node ?

(A). Circular doubly linked list

(B). Circular linked list

(C). Circular singly linked list

(D).

View Answer

Explanation: Not Avilable

17. Key value pair is usually seen in –

(A). Hash tables

(B). Heaps

(C). Both (a) and (b)

(D). Skip list

View Answer

Explanation: Not Avilable

18. Which of the following ways is in a in-order traversal?

(A). Root → left sub tree → right sub tree

(B). Root → right sub tree → left sub tree

(C). Right sub tree → left sub tree → root

(D). Left sub tree → root → right sub tree

View Answer

Explanation: Not Avilable

19. Items in a priority queue are entered in a _____ order.

(A). Random

(B). Order of priority

(C). As and when they come

(D). None of the above

View Answer

Explanation: Not Avilable

20. On what principle does stack works ?

(A). FILO

(B). FIFO

(C). LILO

(D). LIFO or FILO

View Answer

Explanation: Not Avilable

1. The complexity of Bubble sort algorithm in average case is

2. The process of processing each element in the list is known as-

3. The memory address of the first element of an array is called

4. Which of the following name does not relate to stacks ?

5. The situation when in a linked list START=NULL is –

6. Which of the following is a two-way list?

7. Two dimentional array is also called –

8. A variable P is called pointer if –

9. Which of the data structure store the homogeneous data elements

10. _____ is not the component of data structure –

11. Which data structure is used in breadth first search ?

12. To represent hierarchical relationship between elements which data structure is suitable ?

13. Which of the following data structure is not linear data sturcture ?

14. Binay search tree cannot be applied to –

15. The empty list is the one which has no

16. Which of the following linked list have last node of the list pointing to the first node ?

17. Key value pair is usually seen in –

18. Which of the following ways is in a in-order traversal?

19. Items in a priority queue are entered in a _____ order.

20. On what principle does stack works ?

Categories