For each of the following applications, mention the data structure (list, stack, queue, tree, heap, graph) that will be most suitable to use. (Justify your answer) i). For implementing a priority queue in the operating system, where the highest priority item will be served by the microprocessor. ii). For simulating a social network such as Facebook and Twitter. iii). For implementing Breadth First Search in a graph.

For each of the following applications, mention the data structure (list, stack, queue, tree, heap, graph) that will be most suitable to use. (Justify your answer) i). For implementing a priority queue in the operating system, where the highest priority item will be served by the microprocessor. ii). For simulating a social network such as Facebook and Twitter. iii). For implementing Breadth First Search in a graph.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 13RQ: How is an array stored in main memory? How is a linked list stored in main memory? What are their...

See similar textbooks

Similar questions

Fundamentals of Python: Data Structures Unit 12 Exercises 2 2 3 2 Draw a picture showing the adjacency list for the above-directed graph with edge costs. You should assume that the edges in a list are ordered from least cost to greatest cost. 2.
write a C program to Design a simple link list that has three nodes having the following data. Student Name, Student Reg #, Student Semester, Student CGPA… (without using classes) (Data Structures and algorithm)
Priority queue (5p) How can a programmer implement a priority queue? Givethe pros and cons of each implementation variant. It is desirable to look not only atthe lecture notes, but also at other available materials.
Question 42 What makes implementing a queue with a Doubly Linked List relatively easier than implementing a queue with a typical array, where all elements stay in adjacent locations? There's no need to explicitly shift the elements of a Linked List to the front, as there would be in an array. There's no need to keep track of how many elements are present, as there would be in an array. There is no advantage to using a Linked List implementation over an array implementation. There's no need to keep track of a front and a back, as there would be in an array.
Fill in the following terms (Real , Array, Link list, Graph, stack). Match the correct terms. Non-linear data structure Choose... + Choose... Fixed Size Real Array Graph Primitive Data Type Link List Choose... Random access allowed Dynamic size Choose...
d. In implementing a Queue using an array, a problem might arise if the Queue is implemented in such a way that items in the Queue are inserted at the next available location and removed from the next leading position, but such that, once deleted, the emptied space is unused. The problem that arises is one where there is free space still in the array, but it is not usable because it is not at the end. Demonstrate this problem with a Queue that is stored in an array of size 5 for the following instructions. Next, explain how you might resolve this problem. Queue q constructor takes 5 as the size of the array = new Queue(5); // assume the Queue q.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 queue q.enqueue(7); // this enqueue can not occur, why??
Answer question using C++ programming language. 1. Construct a circular queue of size 7 containing 4 elements (10, 4, 12, 20). Draw the structure of the queue after performing the following operations. a. Enqueue (34); Enqueue (14); b. Dequeue ( ); Dequeue ( ); Enqueue (17) c. Enqueue (56); Dequeue ( ); Enqueue(45)
Write pseudo-code for problems requiring code. Do not write Java, Python or C++. please the appropriate level of detail. For the questions asking for justification, please provide a detailed mathematically oriented discussion. A proof is not required. 1. Develop an ADT specification for a priority queue. A priority queue is like a FIFO queue except that items are ordered by some priority setting instead of time. In fact, you may think of a FIFO queue as a priority queue in which the time stamp is used to define priority.2. Write an algorithm to reverse a singly linked list, so that the last element become the first and so on. Do NOT use Deletion - rearrange the pointers. 3.What is the average number of nodes accessed in search for a particular element in an unordered list? In an ordered list? In an unordered array? In an ordered array? Note that a list could be implemented as a linked structure or within an array.4. Write a routine to interchange the mth and nth elements of a…
When contrasted with other data structures, such as a linked list or tree, this one has a number of advantages.
Give simple example about queue and stack ..
Implement in Python a double-ended queue (deque): A double-ended queue is a data structure (ordered collection of items) similar to a traditional queue. It has two ends, front and end, but it is not restricted to adding or removing items. New items can be added on the front or on the end. Existing items can be removed from either end. The image graphically shows how the structure is. - Implement the requested structure using a single linked list, which implements the following functions: enterFront, enterEnd, removeFront, removeEnd- The data to be entered are animal-type objects; name, type of animal, age- Create a Main function with the available operations
What is the difference between a stack and a queue in computer science, and how are they implemented? Provide examples of scenarios where using a stack or a queue would be the most appropriate data structure choice.