Data Strycture MCQ

1. The prefix form of A-B/ (C * D ^ E) is ?
a) -A/B*C^DE
b) -A/BC*^DE
c) -ABCD*^DE
d) -/*^ACBDE

Answer: a
Explanation: Infix Expression is A-B/(C*D^E)
This can be written as: A-(B/(C*(D^E)))
Thus prefix expression is -A/B*C^DE.

2. Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer ?
a) O(1)
b) O(log₂ n)
c) O(n)
d) O (n log₂ n)

a. O(1)

3. Which of the following is a linear data structure ?
a) Array
b) AVL Tress
c) Binary Tress
d) Graphs

a. Array - Linear Data Structure

4. In simple chaining, what data structure is appropriate?
a) Doubly linked list
b) Circular linked list
c) Singly linked list
d) Binary trees

a. Doubly linked list

5. What is a data structure?
a) A programming language
b) A collection of algorithms
c) A way to store and organize data
d) A type of computer hardware

c. A way to store and organize data

6. The insertion operation in the stack is known as:
a) Insert
b) Add
c) Interpolate
d) Push

d. Push means inserting an element at the top of the stack.

7. How can array elements be accessed ?
a) logarithmically
b) randomly
c) exponentially
d) sequentially

b. randomly - The array elements are stored at contagious memory locations that can be randomly accessed with their index number.

8. Which of the following cases does not exist in complexity theory ?
a) Best case
b) Worst case
c) Average case
d) Empty Case

d. Empty Case

9. Which data structure is based on the First In Last Out (FILO) principle ?
a) Queue
b) Tree
c) Graph
d) Stack

d. Stack - The last inserted element is available first and is the first one to be deleted. Hence, it is known as Last In, First Out LIFO, or First In, Last Out FILO.

10. The prefix form of ((a/b)+c)-(d+(e*f)) is ?
a) - + / a b c + d * e f
b) + - / a b c + d * e f
c) - + a / b c d + * e f
d) - / a b + c + d * e f

a. - + / a b c + d * e f

11. Which of the following applications uses a circular linked list ?
a) Allocating CPU to resources
b) Recursive function calls
c) Undo operation in a text editor
d) Implement Hash Tables

a. Allocating CPU to resources - Round Robin is employed to allocate CPU time to resources using the circular linked list data structure.

12. What's the worst-case scenario in a linear search algorithm ?
a) The element is somewhere in the middle of the array
b) The element is not present in the array
c) The element is the last in the array
d) Either the element is the last in the array or is not there

d. Either the element is the last in the array or is not there

13. Which of the following is not a balanced binary tree ?
a) Red-black tree
b) AVL tree
c) B-tree
d) Splay tree

c. B-tree - self-balancing tree where a node can have more than two children

14. Which of the following is not a type of queue ?
a) Priority queue
b) Circular queue
c) Single-ended queue
d) Ordinary queue

c. Single-ended queue - A queue is an ordered list in which insertion is done at one end and deletion at another.

15. The complexity of the average case of an algorithm is
a) more complicated to analyze than the worst-case
b) Sometimes more complicated and some other times simpler than the worst-case
c) Much simpler to analyze than the worst-case
d) None of the above

a. more complicated to analyze than the worst-case