final_quiz_2023

What would be the solution to the given prefix notation?

• 14

• 15

• 12

• 18

To implement a stack using queue(with only enqueue and dequeue operations), how many queues will you need?

• 1

• 2

• 4

• 3

How do you calculate the pointer difference in a memory efficient double linked list?

• head xor tail

• pointer to previous node xor pointer to next node

• pointer to previous node – pointer to next node

• pointer to next node – pointer to previous node

What is the worst case time complexity of inserting a node in a doubly linked list?

What is the worst case time complexity of inserting a node in a doubly linked list?

• O(nlogn)

• O(logn)

• O(n)

• O(1)

In a binary search tree, which of the following traversals would print the numbers in the ascending order?

• Level-order traversal

• Pre-order traversal

• In-order traversal

• Post-order traversal

In a circular queue, how do you increment the rear end of the queue?

• rear++

• (rear+1) % CAPACITY

• (rear % CAPACITY)+1

• rear–

What is the postfix expression for the corresponding infix expression?

a+b*c+(d*e)

• abc*+de*++

• abc+*de*+

• a+bc*de+*

• abc*+de*+