A senor reading scenario is creation intensive, 10 to 100 samples per minute is read and stored in a central data center. Every hour, there is a statistic computing to calculate average and standard deviation of the samples within the hour. From quite simplified point of view that ignores all other factors such as network delays and hardware capacity, which of the following data structure is the most suitable to store the sensor reading data? a. stack b. Queue c. Array-based list d. Linked-list

A senor reading scenario is creation intensive, 10 to 100 samples per minute is read and stored in a central data center. Every hour, there is a statistic computing to calculate average and standard deviation of the samples within the hour. From quite simplified point of view that ignores all other factors such as network delays and hardware capacity, which of the following data structure is the most suitable to store the sensor reading data? a. stack b. Queue c. Array-based list d. Linked-list

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

A ring buffer, or circular queue, is a FIFO data structure of a fixed size N. It is useful for transferring data between asynchronous processes or for storing log files. When the buffer is empty, the consumer waits until data is deposited; when the buffer is full, the producer waits to deposit data. Develop an API for a RingBuffer and an implementation that uses an array representation (with circular wrap-around)
In C programming Every budding computer scientist must grapple with certain classic problems, and the Towers of Hanoi (see Figure below) is one of the most famous of these. Legend has it that in a temple in the Far East, priests are attempting to move a stack of disks fromone peg to another. The initial stack had 64 disks threaded onto one peg and arranged from bottom to top by decreasing size. The priests are attempting to move the stack from this peg to a second peg under the constraints that exactly one disk is moved ata time, and at no time may a larger disk be placed above a smaller disk. A third peg is available for temporarily holding the disks. Supposedly the world will end when the priests complete their task, so there is little incentive for us to facilitate their efforts.Let’sassume that the priests are attempting to move the disks from peg 1 to peg 3. We wish to develop an algorithm that will print the precise sequence of disk-to-disk peg transfers. If we were to approach…
I need to design, analyze, and implement algorithms to read in a sequence of characters from standard input and maintain the characters in a linked list with no duplicates. When read in a previously unseen character, insert it at the front of the list. When read in a duplicate character, delete it from the list and reinsert it at the beginning. The program implements the well-known move-to-front strategy which is useful for caching, data compression, and many other applications where items that have been recently accessed are more likely to be re-accessed. The program should read a sequence of characters and should insert unseen character at the front of the list. The program should check if the character is not in the list to be inserted at the front of the list. The program should delete a duplicate character and delete it from the list and insert it at the beginning of the list. The program should check if the character is already in the list and delete the character from the list…
Convert this Python script to a MATLAB script. Hint: Use the matlab-python-cheatsheet. End all assignment statements with a semi-colon to suppress output to screen. Include the key word end at the end of your function. You should try developing in MATLAB and not the quiz server. def make_list(start, step, stop): Creates a list - first element is start, last element is stop, each element value increases by step. Parameters: start - int - first element in list step - int - value to increment each element by stop - int - last element in list Returns: list of ints return list(range(start, stop + 1, step)) For example: Test Result disp(all(make_list(1, 2, 11)== [1 3 5 7 9 11])) 1 disp(all(make_list(10, -2, -10) == [10 8 6 4 2 0 -2 -4 -6 -8 -10])) 1
Draw what a Skip List could look like after you insert 3, 10,5, 18, 14,9,4 in that order. There can be many possible structures of such a Skip List since it is a randomized data structure. The same sequence of inserts/deletes may produce different structures depending on the outcome of random coin flips.
In dynamic programming with memoization, what is the complexity of the memo data structure lookup and insert operations? a. lookup: 0(1), insert: 0(1) Ob. lookup: e(n), insert: 0(n) c. lookup: e(n), insert: 0(1) d. lookup: 0(1), insert: 0(n) e. lookup: 0(1), insert: 0( log n)
Computer Science Can someone help me create a program that is a library management system? So, the program will manage a library collection of books, allowing the user to add books, check them out, and return them. possibly use data structures such as linked lists or hash tables which will keep track of the availability of the books. demonstrate its function and discuss your experiences in creating it. Topics worthy of discussion include details of the implementation itself (language choice, class design, etc), difficulties that you faced in implementing it (learning new techniques, significant errors encountered, etc), and maybe a project post-mortem discussing whether or not you would do anything differently, knowing what you do about it at the end (e.g. using a linked list instead of an array). c++
How does the principle of data encapsulation work in a network?
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.
You want to buy a ticket for a well-known concert which is happening in your city. But the number of tickets available is limited. Hence the sponsors of the concert decided to sell tickets to customers based on some priority. A queue is maintained for buying the tickets and every person is attached with a priority (an integer, 1 being the lowest priority). The tickets are sold in the following manner - 1. The first person (pi) in the queue requests for the ticket. 2. If there is another person present in the queue who has higher priority than pi, then ask pi to move at end of the queue without giving him the ticket. 3. Otherwise, give him the ticket (and don't make him stand in queue again). Giving a ticket to a person takes exactly 1 minute and it takes no time for removing and adding a person to the queue. And you can assume that no new person joins the queue. Given a list of priorities of N persons standing in the queue and the index of your priority (indexing starts from 0). Find…
Create a BST implementation that uses three arrays to represent the BST: one with keys, one with array indices for left links, and one with array indices for right links. The arrays should be preallocated to the maximum size specified in the constructor. Compare your program's performance against that of the usual implementation.
A linked list is a data structure made of a chain of objects called nodes. Each node contains at least two variables: a value and pointer. The value is the actual data within the Node as if it were an array element. The pointer, on the other hand, points to the next node in the chain. Unlike arrays, linked lists do not need to have a contiguous block of memory upon creation. This makes linked lists a lot more dynamic in size and in ease of insertion and deletion properties. Create an implementation of singly linked list using classes with minimum 5 nodes in Python with the following capabilities/functions: Traverse - print out all data from the linked list Insert - generate a node and attach to an existing linked list Search - find an item (data) from the linked list and return the node Remove - remove a node from the linked list