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. What is the prefix notation of the expression X + Y * Z?

a. +XY*Z

b. X+(YZ*)

c. +X*YZ

d. XYZ+*

2 / 18

2. 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. Heap Sort

d. Insertion Sort

3 / 18

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

a. Caching

b. Scheduling of Processes

c. Spatial locality

d. Binary Search tree

4 / 18

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

a. 8

b. 2

c. 16

d. None

5 / 18

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

a. O(logn)

b. O(n)

c. O(1)

d. O(nlogn)

6 / 18

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

a. unary tree

b. both binary and trinary tree

c. binary tree

d. trinary tree

7 / 18

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

a. string

b. stack

c. queue

d. linear array

8 / 18

8. 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. A

b. D

c. B

d. C

9 / 18

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

a. Processes with different priorities can be managed efficiently

b. Deletion is simpler

c. None of them

d. It is easy to implement

10 / 18

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

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

b. None of them

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

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

11 / 18

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

a. (rear + 1) % max

b. rear = rear + 1

c. (rear % max) + 1

d. None of them

12 / 18

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

a. Θ(nlogn)

b. Θ(n^2)

c. Θ ( 𝑛 )

d. Θ(1)

13 / 18

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

a. log(2n)−1

b. n

c. log(2n)

d. n/2

14 / 18

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

a. Stack

b. Queue

c. Binary tree

d. Linked list

15 / 18

15. The tango tree is a type of:

a. Binary Search Tree

b. Ternary Tree

c. AVL Tree

d. K-ary Tree

16 / 18

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

a. int maduwebtech[10];

b. int maduwebtech;

c. maduwebtech{20};

d. array maduwebtech[10];

17 / 18

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

a. Second node

b. First node

c. None

d. Last node

18 / 18

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

a. tree

b. array

c. stack

d. queue

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