Consider a hospital information system using which patients can take appointment with a doctor on first come first serve basis and their appointments are maintained in a queue. a. Discuss by giving reasons on which of the following data structures is most suitable for implementing such appointment queue, when considering that there is no limit on how many patients a doctor can see in any given day. *One dimensional array Linked list b. Write and execute a java program to create an object of class appointment queue, and perform operations such as insert, remove, and display. Give your reflection on each of these operation

Consider a hospital information system using which patients can take appointment with a doctor on first come first serve basis and their appointments are maintained in a queue. a. Discuss by giving reasons on which of the following data structures is most suitable for implementing such appointment queue, when considering that there is no limit on how many patients a doctor can see in any given day. *One dimensional array Linked list b. Write and execute a java program to create an object of class appointment queue, and perform operations such as insert, remove, and display. Give your reflection on each of these operation

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 2PE

See similar textbooks

Similar questions

A. Suppose that q1 is a class CircularQueue object that is using circular queue concept and the maximum size of the array implementing q1 is 10. The current index value of front is 5 while the current index value of rear is 9. i. What are the index values of front and rear after adding TWO (2) elements into q1? Draw the circular queue diagram to show the addition process. ii. After implementing the process in Question 2A (i), what are the index values of front and rear after removing FIVE (5) elements from q1? Draw the circular queue diagram to show the removing process. iii. What are the current number of elements after implementing the process in Question 2A (i) and Question 2A (ii)? =======================
An “inverted file” is a critical data structure for implementing applications like the index of a book, or a web search engine. Given a document D (which can be viewed as an unordered, numbered list of words), an inverted file is an ordered list of words L such that for each word W in L, we store the indices of the places in D where W appears. Write a C# program (from scratch please, written by yourself (ask instructor if you are stuck), not borrowed from any other sources) that reads in a list of words separated by spaces from a text file, then uses an efficient O(N) algorithm to create the inverted file index (hint: consider the topic of this chapter, consider using a Dictionary/hashtable to help you), and writes this index out to another file or prints it to the screen. Each line of the output file should start with the next word (the words should be listed in alphabetical order, and this sorting does not have to be part of the O(N) runtime complexity, e.g. you can use regular…
you are to design a printer queue that is responsible for handling the printing requests coming from different users. You have to take into consideration that users have different levels of priorities. Each user has an identification number and a password, in addition to printing priorities. One good idea is to design the queue using an array or pointers while preserving the first-in first-out concept of the queue. For every printing request received, the program should check the priorities of that request and whether it can be moved forward in the queue to be served by the printer prior to serving the other requests. Using the programming language of your choice (preferably C++), write the printer queue that would handle the user request. The program must allow for requests coming from different users or from one user. Note: I need a working C++ code for this problem, and i need priorities.
This is a java data structures question - Given a circular bent array-based queue capable of holding 100 objects. Suppose the queue is initially empty, and then objects are put into the queue at the rate of 10 per minute while meantime they are processed and removed from the queue at the rate of 5 per minute. After 120 elements have been added to the queue, which of the following is true? CIRCLE JUST ONE LETTER FOR THE ANSWER. -> You can’t add 120 elements to an array holding 100 entries. -> There will be 60 elements in the queue, 20 of them at the front of the array where the queue started, and 40 at the other end. -> There will be 60 elements in the queue, 30 of them at the front of the array where the queue started, and 30 at the other end. -> There will be 60 elements in the queue, 40 of them at the front of the array where the queue started, and 20 at the other end.
Write a program that simulates a toy paging system that uses the WSClock algorithm. The system is a toy in that we will assume there are no write references (not very realistic), and process termination and creation are ignored (eternal life). The inputs will be: The reclamation age threshhold The clock interrupt interval expressed as number of memory references A file containing the sequence of page references Describe the basic data structures and algorithms in your implementation. Show that your simulation behaves as expected for a simple (but nontrivial) input example. Plot the number of page faults and working set size per 1000 memory references. Explain what is needed to extend the program to handle a page reference stream that also includes writes.
The goal of this second exercise is to develop a better understanding of the Linuxinterprocess communication mechanisms. This would require you to write twoprograms P1 and P2. The first program P1 needs to generate an array of 50random strings (of characters) of fixed length each. P1 then sends a group offive consecutive elements of the array of strings to P2 along with the ID’s ofthe strings, where the ID is the index of the array corresponding to the string.The second program P2 needs to accept the received strings, and send backthe highest ID received back to P1 to acknowledge the strings received. Theprogram P2 simply prints the ID’s and the strings on the console. On receivingthe acknowledged packet, P1 sends the next five strings, with the string elementsstarting from the successor of the acknowledged ID. The above mechanism needs to be implemented FIFO and UNIX DOMAIN SOCKETS. Please note that you may NOT make assumptions about the reliability of the interprocess communication…
(a) In implementing a Queue using an array, a problem might arise if the Queueis implemented in such a way that items in the Queue are inserted at thenext available location and removed from the next leading position, butsuch that, once deleted, the emptied space is unused. The problem thatarises is one where there is free space still in the array, but it is not usablebecause it is not at the end.Demonstrate this problem with a Queue that is stored in an array of size 5for the following instructions. Next, explain how you might resolve thisproblem.Queue q = new Queue(5); // assume the Queue constructor takes 5 asthe size of the arrayq.enqueue(3);q.enqueue(4);q.enqueue(1);q.dequeue( );q.dequeue( );q.enqueue(6);q.enqueue(5);q.dequeue( ); // at this point,// there are only 2 item2 in the queueq.enqueue(7); // this enqueue cannot occur, why??
in java, Two abstract data types are the ordered list and the unordered list. Explain how these two ADTs are similar and how they differ. To answer this question, assume that you do not know how they are implemented (that is, whether they are implemented using an array or a linked list).
Computer ScienceA restaurant requires WAIT ADT to help waiter to wait tables. Theapplication is required to provide functions to add a food item to the WAITlist, remove an item from the Wait list, size of the list i.e., the food itemsordered, and know if item is already in the list. The WAIT ADT access timeshould be O [1]. Provide implementation details with your choice of datastructure and the operations with justification of the constant access time.Implement search food in the added Wait list in C.
Provide a Java class named SortedPriorityQueue that implements a priority queue using a Java array of type int. The constructor of the class should be passed the size of the queue. Each time the add method is called, the value passed to it should be inserted into the array to ensure that the array remains in sorted order. If the array is full when addis called, a RuntimeException should be thrown. If the array is empty when remove is called, a RuntimeException should also be thrown Make the implementation as efficient as possible.
Consider the following scenario: a software creates and manipulates a linked list, like follows:The software would normally maintain track of two special nodes, which are as follows: Explanation of how to utilise the null reference in the node of the linked list in two frequent situations?
Given the desired order in which the manatees are to arrive down south, how do I dermine if there is any way Hugh can use the drainpipe to achive the desired order? This problem can be solved by using a stack. A stack is an ordered collected of elements that operations to push(), peek(), pop(). In Java the interface Deque has those operations. The ArrayDeque class implements the Deque Interface. Input All input is to be read from the standard input stream. The input consists of several blocks of lines and is terminated by a line with just 0. The first line of each block indicates the number of manatees 0 < N < 100,000. In each of the next lines of the block there is a permutation of the numbers 1, 2, ..., N. For N=3, the permutation 2 3 1 means that the first manatee needs to be placed at the end of line and that the second manatee needs to be placed at the front of the line. The last line of each block contains just 0 signaling the end of the block. Output For each permutation…