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

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Now consider the Verilog version of this same simple multicycle implementation: http://aggregate.org/CPE380/multiv.html (Links to an external site.) . Which of the following statements about how that works is false? Group of answer choices The bench module instantiates a processor called PE, and generates the clock input signal to it Symbolic names for things like word size and the implementation of each control signal are given using `define The main memory is a reg array defined in a separate memory module, which is instantiated within the processor module The ALU is specified as using a ripple-carry adder rather than carry lookahead, etc. The control logic is implemented by a case statement that performs the appropriate action(s) for the current STATE
Q2) Which of the following scheduling algorithms is non-preemptive? And why?a) Round Robinb) Multilevel Queue Schedulingc) First-In First-Outd) Multilevel Queue Scheduling with Feedback
you 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 you read in a previously unseen character, insert it at the front of the list. When you 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. Requirements: The program should read a sequence of characters. The program 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…
Someone tries to fix the stack based buffer overflow problem as follows, is it secure now? why?why not? Are there any other issues within the function's implementation below? Please explain your reasoning. int bof(char *str, int size) { char *buffer = (char *) malloc(size); strcpy(buffer, str); return 1; }
In a flight reservation system, the number of available seats in each plane model is an input. A plane may have any number of available seats (the number of available seats must be greater than zero), up to the given capacity of the plane. Using boundary value analysis, a list of available seat values were generated. Which of the following lists is correct? a) 0, 1, 2, capacity + 1, a very large number b) 0, 1, 100, capacity, capacity + 1 c) 0, 1, capacity, capacity + 1 d) 1, 2, capacity -1, capacity, capacity + 1
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)
Answer the given question with a proper explanation and step-by-step solution. Consider the following source code, where k,l and m are constants declared with #define. The struct lnode is as defined as: struct lnode { char *str; // points to 32-character string struct lnode *next; // points to next node address struct lnode *prev; // points to prev node address }; You will need to determine the values for k, l and m, which are the dimensions of a 3-D array named A. struct lnode A[k][l][m]; int store_ele(int h, int i, int j, struct lnode dest) { A[h][i][j] = dest; return sizeof(A); } On compiling this program (with gcc -O2 -S -fno-asynchronous-unwind-tables) ,gcc generates the following assembly code for the store_ele function: store_ele: endbr64 movslq %edi, %rdi movslq %edx, %rdx movslq %esi, %rsi movdqu 8(%rsp), %xmm0 movq %rdi, %rax leaq (%rdx,%rdx,2), %rdx salq $6, %rax subq %rdi, %rax salq $4, %rax leaq (%rax,%rdx,8), %rax leaq (%rsi,%rsi,4), %rdx leaq (%rsi,%rdx,4), %rdx leaq…
Solve the following problems using Scala with Classic Akka Actors. For each problem, also implement client actors for sending the messages required for beginning the required computation. Use these client actors for testing your application actors. Recall the card shuffling problem. In a Faro shuffle, a stack of cards is broken up into two, and then combined so that a card from one sub-stack is followed by one from the other, and so on. A perfect Faro shuffle breaks up the stack into two sub-stacks of exactly the same size, and then combines them in the manner described above. An out-shuffle results in the top and the bottom cards of the stack remaining the same after the shuffle; an in-shuffle results in these cards becoming the second and the second last cards of the shuffled stack. Implement a shuffler actor which accepts a message containing a deck of cards as a list of even length, an integer indicating the number of times that the deck is to be shuffled, and a boolean…
Hi, currently I'm working on a project of "Queue Management System". I'm doing it by using ESP8266. So the scenario is that I've two ESP8266. One ESP8266 is connected to the keypad (4x4) and the other ESP8266 is connected to the 7 segment display. When I press any number from the keypad (4x4) it will show on single digit 7 segments. So I need a code of Arduino IDE for this scenario. Please help me with this. Thanks!!
Java Simulate the behavior of a hash map. Assume the following: the hash table array has an initial capacity of 10 the hash table uses separate chaining to resolve collisions and adds new values at the beginning of the linked list. the hash function returns the absolute value of the integer key, mod the capacity of the hash table rehashing occurs at the end of an add where the load factor is ≥ 0.5 and doubles the capacity of the hash table Fill in the diagram to show the final state of the hash table after the following operations are performed. Write each bucket as key:value pairs with arrows between them, such as key1:value1 -> key2:value2 -> key3:value3 . Put a \ in the box if an array element is unused. Also write the size, capacity, and load factor of the final hash table. Write the load factor in 0.x format, such as 0.5 or 0.75. hashTable[ 0 ] : _____ hashTable[ 1 ] hashTable[ 2 ] hashTable[ 3 ] hashTable[ 4 ] hashTable[ 5 ] hashTable[ 6 ] hashTable[ 7 ] hashTable[ 8 ]…
Use C, C++, python or matlab to develop a program whose main routine accepts two parameters n and k, i.e. when you invoke your program from the shell, you pass it two parameters, n and k, where n >=16 and k >=8and is in powers of 2 (e.g. 8, 16, 32, etc.). Your main routine shall generate a random page trace of length n, where the page numbers have values ranging from 0 to ? − 1. Develop a subroutine within your program that implements the FIFO page replacement algorithm (as a separate function within your program). The function shall accept a page trace and a parameter f for the number of frames allocated. Your main routine shall then apply the random page trace to the subroutine implementing the page replacement algorithm, multiple times (using only one trace, randomly generated), passing a parameter f (number of page frames used) that ranges from 4 to k. Your main routine shall then record the number of page faults for each run (i.e. for each f).Run your program using a page…
Some applications require two types of accesses to the critical section-read access and write access. For these applications, it is reasonable for multiple read accesses to happen concurrently. However, a write access cannot happen concurrently with either a read access or a write access. Example: For a sequence [R1, R2, W1, R3] of requests, R1 and R2 should be able to access the critical section concurrently while W1 and R3 wait in the queue. Once R1 and R2 leave the critical section, W1 can enter the critical section while R3 waits in the queue. (a) Modify Lamport's algorithm for such applications. (b) Modify Ricart and Agrawala's algorithm for such applications.