DSA quiz

Which operator is used to access the value at the address stored in a pointer?

• &
• ->
• @
• *

Which best explains a sparse matrix?

• A matrix with all elements being non-zero.
• A matrix that is always square in shape.
• A matrix that contains only positive numbers.
• A matrix with Most Number of Zero

Which data structure is used in infix to postfix conversion?

• Stack
• Queue
• Linked List
• Array

If the Stack is full what is the value of top pointer?

• Top = 0

• Top = -1

• Top = Max-1

• Top = n

Which queue allows insertion and deletion from both ends?

• Deque
• Stack
• Priority Queue
• Circular Queue

In a circular queue of size n, how many elements can be stored?

• n
• n + 1
• n-1

• unlimited

 Which operation is used to insert an element in a queue?

• dequeue
• enqueue

• pop
• push

 What is the condition to check whether a queue implemented with a dynamic array is empty?

• front == -1

• rear == front

• front > rear

• front == rear + 1

Which of the following is true about a queue?

• Insertion happens at front

• Deletion happens at rear

• FIFO is maintained

• LIFO is followed

Which of the following is not a linear data structure?

• Array
• Stack
• Tree

• Linked List