Question

i. In the space provided, write appropriate data structure for following applications: a. An operating system is to process requests for computer resources by allocating the resource in the order in which they are requested b. A word processor to have f key that causes the preceding command to be redisplayed. Every time the user presses f key, the program shows the command that preceded the one currently displayed C. dictionary of words used by a spelling checker to be built and maintained ii. Implement a queue (First In First Out) using circular linked list with the constraint that you can keep only one Node* ptr to read/write data. Class Queue Private: Node* ptr; //Do not add any other data member in this class Public: Void Enqueue (int data);// You have to write this function int Dequeue (int data);// You have to write this function }

Answer 1

Solution

i)

Answer

a. Queue

b. Stack

c. Binary Search Tree

Explanation

a)Queue uses FIFO policy

FIFO means First In First Out

Queue simply procoesses the order that they arrive

Operating System Process the request for computer resources by allocating the resources in the order in which they have requested

It is First In First Out policy

Hence Answer is Queue

---

b)It uses Stack data structure

Stack uses LIFO policy

LIFO-Last In First Out

Last Inserted element will be First Out

Every time user presse the key in word processor program shows the command that preceded the one currently displayed

Hence Answer is stack

---

c)Dictionary of words stored in tree form using the binary search tree it is easy to implement the spell checke

For example if i want to check CAT

first we will Check C is available on the root of the Binary Search tree

if it is move to the next level and so on

Hence Binary Search Tree is the correct answer

---

Answered first part of the question completely

really sorry couldnt able to answer the second one

all the best