Solve Question 26, 27, 28 showing detailly all the steps with including all explanationsAnswer Should be typewritten using a computer keyboard! 26. The main concept of the Von Neumann machinearchitecture is33th.Programs are stored in a separate memoryfrom dataA-B Both programs and data are stored on diskPrograms and data are stored in the samekind of memory.D Programs are stored in ROM and Data indisk.327. In the Round Robin (RR) scheduling; if the timequantum (q) is too large, then:A Scheduling is same as First Come FirstServedB More context switches will occur.C The average turnaround time decreases.D No effect.28. RAM cache is_A A small amount of fast memorybetween main memory and theprocessorB Memory reserved for use by theoperating systemC The computers main random accessmemory for storing programs and dataD Memory used by the VDU for storingthe screens image.29. It is a machine type which is analogous to parallelprocessingA RISCB SIMDC CISC+ System prototypeC PseudocodeD System model.

given data is 26. The main concept of the Von Neumann machine architecture is A . Programs are…

Answered: Solve Question 26, 27, 28 showing…

Solve Question 26, 27, 28 showing detailly all the steps with including all explanations Answer Should be typewritten using a computer keyboard!

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 19SA

See similar textbooks

Similar questions

Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles,”7th Edition, John Wiley & Sons Inc., 2006.” And answer the following questions: Question:15 A system has the following blocks queued for writing: 8000, 3000, 5000, 2000. The most recently written block was 4500. The block read before that was 2500. (a) What sequence of writes will a C-SCAN algorithm generate? (b) What sequence of writes will a SCAN algorithm generate? (c) What sequence of writes will a FCFS algorithm generate? (d) What sequence of writes will a SSTF algorithm generate? (e) What sequence of writes will a LOOK algorithm generate?
1. Write a Python program using the multiprocessing method and the Pool objectthat spawns 10 processes with inputs 1,...,10 and each process calculates the sumof integers up to and including its input and returns this sum.2. Provide a Python program that multiplies to n × n matrices using columnwise1D partitioning
7. The American Museum of Natural History in New York City contains more than 32 million specimens and artifacts in its various collections, including the world’s largest collection of dinosaur fossils. Many of these are in storage away from public view, but all must be carefully inventoried. a) Suppose the inventory is unordered (!) and a sequential search is done to locate a specific artifact. Given that the search is executed on a computer that can do 12,000 comparisons per second, about how much time on the average would the search require? b) Assuming the inventory is sorted, about how much time would a binary search require?
Implement SRTF (SJF with preemption) scheduling algorithm in C programming. NOTE: Please do not print the average waiting time and the average turnaround time. You are required to compute these for each process and print the values for each process separately. Add comments in the code so that the code is understandable. Take input from the user: the number of processes, their CPU burst times and arrival times for n number of processes. Compute and print the completion Time(CT), Turnaround Time(TAT), and Waiting Time(WT) for each process using C Programming
Student information is stored in a data area, and each student entry is formatted as follows:The first nine bytes are the student ID in ASCII format.The following byte is the course score.The following phrase is the section identifier. There are over 300 such student records in memory, which have been loaded consecutively beginning at address $10000. To indicate the conclusion of the records, the last record loaded is a dummy record with a section identifier of $FFFF. Create an assembler subroutine GetMax that searches the complete list for the highest mark. If there is a tie, the student with the highest score on the list should be found. The beginning address of the subroutine should be returned.
Question Which of the following statements about quicksort are true? Unless otherwise specified, assume that quicksort refers to the recursive, randomized version of quicksort (with no extra optimizations) and uses the 2-way partitioning algorithm described in lecture. Answer Mark all that apply. O Dijkstra's 3-way partitioning algorithm partitions any array of length n using only a constant amount of space (other than the input array). UGuaranteed performance is one reason why the Java system sort uses a deterministic version of quicksort instead of a randomized one. OThe main reason to recur on the left subarray before the right subarray in quicksort is to ensure stability. O Suppose that quicksort is modified to use an explicit stack instead of recursion and to always recur on the subarray with fewer items before the subarray with more items. Then, the order of growth of the maximum size of the stack is log n in the worst case. OThe number of compares o quicksort any array of n…
Write a code in sim8085 for the following problem: The pressure of two boilers is monitored and controlled by a microcomputer works based on microprocessor programming. A set of 6 readings of first boiler, recorded by six pressure sensors, which are stored in the memory location starting from 2050H. A corresponding set of 6 reading from the second boiler is stored at the memory location starting from 2060H. Each reading from the first set is expected to be higher than the corresponding position in the second set of readings. Write an 8085 sequence to check whether the first set of reading is higher than the second one or not. If all the readings of first set is higher than the second set, store 00 in the ‘D’ register. If any one of the readings is lower than the corresponding reading of second set, stop the process and store FF in the register ‘D’. Data (H): First set: 78, 89, 6A, 80, 90, 85 Second Set:71, 78, 65, 89, 56, 75
1. In a certain device, the disk rotates at 5000rpm. a) how long does one revolution take? b) what is the average rotational delay of this disk drive 2. Consider a disk dirve with 1000 tracks, numbered 0 to 999. The request queue has the following composition: 300 740 150 940 200 850 145 555 775 695. The current position is 197 and the previous request was served at 100. For each of the following disk scheduling algorithsm, compute the total distance (in tracks) that the disk arm would move. Include the calculation steps in your answers. 2.1 First - In-First-Out (FIFO) 2.2 Shortest - Service-Time - First (SSTF) 2.3 SCAN (no LOOK variation) 2.4 C-SCAN (No C-LOOK variation)
• WRITE THE ASSEMBLY LANGUAGE CODE IN EITHER RISC-V/MIPS SIMULATOR. SUBMIT FILE WITH EXTENSION “S” . • Take the screenshot of result and Registers from the simulator • UPLOAD screenshot and .s file ON BLACKBOARD. 4) Write an Assembly language code that takes in two numbers b and p, and returns the result of below expression. x= ((b+5) * (p-2) * 10) / 4;
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.
4. The Single Instruction Computer (SIC) has only one instruction that can do all operations our RISC-V does (you did a homework problem). The instruction has the following format sbn a, b, c # Mem[a]=Mem[a]- Mem[b]; if (Mem[a]- Mem[b]<0) go to PC+c For example, here is the program to copy a number from location a to location b: sbn temp, temp, 1 sbn temp, a, 1 sbn b,b, 1 sbn b, temp 1 Start: Design a single cycle datapath and control for this instruction set architecture.
Suppose a program segment consists of a purely sequential part which takes 100 cycles to execute, and an iterated loop which takes 400 cycles per iteration. Assume that the loop is dependent on the sequential part, i.e., both parts cannot run in parallel. Also assume that the loop iterations are independent, and cannot be further parallelized. If the loop is to be executed 100 times, what is the maximum speedup possible using an infinite number of processors (as many processors as you could possibly need) compared to a single processor?