Data Structure Solved MCQs

Data Structure Solved MCQs for Computer Instructor B-17 | AJKPSC & PPSC Exam Prep

Get ready for the Computer Instructor B-17 exams with our collection of Data Structure MCQs. Crafted for AJKPSC and PPSC exams, these solved questions focus on key concepts of data structure.

Data Structure MCQS

Data Structure Solved MCQs for Computer Instructor B-17

1 / 18

1. In the worst case, how many comparisons are required to search for an element in a singly linked list of length 𝑛?

a. n/2

b. n

c. log(2n)−1

d. log(2n)

2 / 18

2. Which of the following statements is incorrect about a Binary Search Tree (BST)?

a. Value of the left child must be less than the root node

b. Left and right subtrees must also be binary search trees

c. None of them

d. Value of the right child must be greater than the root node

3 / 18

3. Which of the following sorting algorithms is best suited to sort a randomly linked list with the lowest time complexity?

a. Merge Sort

b. Quick Sort

c. Insertion Sort

d. Heap Sort

4 / 18

4. Which data structure is used in breadth first search of a graph to hold nodes?

a. queue

b. tree

c. stack

d. array

5 / 18

5. Which of the following is the correct way of declaring an array?

a. int maduwebtech;

b. array maduwebtech[10];

c. int maduwebtech[10];

d. maduwebtech{20};

6 / 18

6. The five items: A, B, C, D, and E are pushed onto a stack, starting with A. Four items are then popped from the stack and inserted into a queue. Next, two items are deleted from the queue and pushed back onto the stack. If one item is now popped from the stack, what will the popped item be?

a. B

b. A

c. C

d. D

7 / 18

7. What is the prefix notation of the expression X + Y * Z?

a. +XY*Z

b. +X*YZ

c. X+(YZ*)

d. XYZ+*

8 / 18

8. The tango tree is a type of:

a. Ternary Tree

b. K-ary Tree

c. Binary Search Tree

d. AVL Tree

9 / 18

9. Which of the following statements is false about a priority queue?

a. It is easy to implement

b. None of them

c. Deletion is simpler

d. Processes with different priorities can be managed efficiently

10 / 18

10. Which of the following highly uses the concept of an array?

a. Binary Search tree

b. Scheduling of Processes

c. Spatial locality

d. Caching

11 / 18

11. If the stack is implemented using the linked list then Which one of the following node is considered the top of the stack?

a. First node

b. None

c. Last node

d. Second node

12 / 18

12. Which of the following is the correct method to increment the rear pointer in a circular queue?

a. rear = rear + 1

b. None of them

c. (rear + 1) % max

d. (rear % max) + 1

13 / 18

13. What is the worst-case time complexity for inserting 𝑛 elements into an empty linked list, while maintaining it in sorted order?

a. Θ ( 𝑛 )

b. Θ(n^2)

c. Θ(nlogn)

d. Θ(1)

14 / 18

14. A ….. is a directed tree in which outdegree of each node is less than or equal to two?

a. both binary and trinary tree

b. binary tree

c. unary tree

d. trinary tree

15 / 18

15. The time complexity of enqueue operation in Queue is…..?

a. O(1)

b. O(n)

c. O(nlogn)

d. O(logn)

16 / 18

16. A ……… does not keep track of address of every element in the list.

a. stack

b. queue

c. linear array

d. string

17 / 18

17. Which one of the following is the size of int arr[8] assuming that int is of 2 bytes?

a. 16

b. 8

c. None

d. 2

18 / 18

18. Which data structure is used to convert the infix to prefix notation?

a. Binary tree

b. Linked list

c. Queue

d. Stack

Your score is

The average score is 66%

Data Structure Solved MCQs

Data Structure Solved MCQs for Computer Instructor B-17 | AJKPSC & PPSC Exam Prep

About Me

Useful Links