Scribd
Upload
15 views3 pages

Data Structure MCQS

wersdv bfg dfdf du to some of the well lno

Uploaded by

Azhir Butt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views3 pages

Data Structure MCQS

wersdv bfg dfdf du to some of the well lno

Uploaded by

Azhir Butt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

3) Which one of the following data structures are preferred in database-system

implementation?

1. AVL tree
2. B-tree
3. B+ - tree
4. Splay tree

) What maximum difference in heights between the leafs of a AVL tree is possible?

1. log(n) where n is the number of nodes


2. n where n is the number of nodes
3. 0 or 1
4. Atmost 1

) What are the worst case and average case complexities of a binary search tree?

1. O(n), O(n)
2. O(log n), O(log n)
3. O(logn), O(n)
4. O(n), O(log n)

8) Which of the following is the efficient data structure for searching words in
dictionaries?

1. BST
2. Linked List
3. Balanced BST
4. Trie

Which hashing technique is free from clustering?

5. Linear Probing
6. Double hashing
7. Quadratic hashing
8. Rehashing

25) Which of the following data structure can provide efficient searching of the
elements?

1. unordered lists
2. Binary Search tree
3. treap
4. 2-3 tree

3) What can be the value of m in the division method?

5. Any prime number


6. Any even number
7. 2p - 1
8. 2p

3) How can we initialize an array in C language?

9. int arr[2]=(10, 20)


10. int arr(2)={10, 20}
11. int arr[2] = {10, 20}
12. int arr(2) = (10, 20)

) Which one of the following is the process of inserting an element in the stack?

1. Insert
2. Add
3. Push
4. None of the above

) When the user tries to delete the element from the empty stack then the condition is
said to be a ____

1. Underflow
2. Garbage collection
3. Overflow
4. None of the above

14) Which data structure is required to convert the infix to prefix notation?

1. Stack
2. Linked list
3. Binary tree
4. Queue

Which one of the following is not the type of the Queue?

1. Linear Queue
2. Circular Queue
3. Double ended Queue
4. Single ended Queue

30) The time complexity of enqueue operation in Queue is __

1. O(1)
2. O(n)
3. O(logn)
4. O(nlogn)

38) The necessary condition to be checked before deletion from the Queue is__

1. Overflow
2. Underflow
3. Rear value
4. Front value

41) Which of the following statement is not true regarding the priority queue?

5. Processes with different priority can be easily handled


6. Easy to implement
7. Deletion is easier
8. None of the above

You might also like