Data Structures

How is the 2nd element in an array accessed based on pointer notation?

• *a+2

• *(a+2)

• *(*a+2)

• &(a+2)

Answer explanation

a[2] is equivalent to *(a + 2) in pointer notation.

From following which is not the operation of data structure?

 

• Operations that manipulate data in some way

• Operations that perform computation

• Operations that check for syntax error

• Operations that monitor an object for the occurrence of control

Answer explanation

Which of the following data structures can be used to implement queues?

• Stack

• Arrays

• LinkedList

• All of the above

Answer explanation

Stack, Arrays, and LinkedList can be used to implement Queues so all the options are correct.

Which of the following data structures finds its use in recursion?

• Stack

• Array

• LinkedList

• Queues

Answer explanation

Stacks find their use in recursion

Which of the following sorting algorithms provide the best time complexity in the worst-case scenario?

• Merge Sort

• Quick Sort

• Bubble sort

• Selection Sort

Answer explanation

Merge Sort will always have a time complexity of O(n * logn) which is the best in the worst case among these algorithms

What is the maximum number of swaps that can be performed in the Selection Sort algorithm?

• n-1

• n

• 1

• n-2

Answer explanation

n-1 swaps are performed at max to sort any array by Selection Sort

Which of the following represents the Postorder Traversal of a Binary Tree?

• Left->Right->Root

• Left->Root->Right

• Right->Left ->Root

• Right->Root->Left

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

• Stack 

• Linked list

• Binary tree

• Queue

Which of the following is the prefix form of A+B*C?

• A+(BC*)

• +AB*C

• ABC+*

• +A*BC

The minimum number of stacks required to implement a stack is

• 1

• 3

• 2

• 5