Willowood Chemicals Interview Questions and Answers

Mat dbms os mostly mat

3 question in 1.5 hours hard questions

Q1. Implement priority queue
Ans. 
Priority queue is a data structure that stores elements based on their priority.
• Use a binary heap to implement a priority queue.

• Elements are inserted based on priority and removed in order of priority.

• Example: Inserting elements with priority values and removing them in sorted order.
Answered by AI
Add your answer
Q2. Implement stack and queue
Ans. 
Implement stack and queue using arrays
• For stack, use array and implement push and pop operations

• For queue, use array and implement enqueue and dequeue operations

• Example: Stack - push(1), push(2), pop() -> returns 2

• Example: Queue - enqueue(1), enqueue(2), dequeue() -> returns 1
Answered by AI
Add your answer