15. Recursion is sometimes preferred to iteration because (a) it is generally fa
ID: 3670052 • Letter: 1
Question
15. Recursion is sometimes preferred to iteration because (a) it is generally faster. (b) it generally will take less space. (c) it reduces the complexity of the code. (d) it can solve problems iteration cannot. (e) (a) and (b) above 4 16. A single processor system can have no processes ready and no process running. Select one: (a) TRUE (b) FALSE A 17. Upgrading to a new computer platform inevitably required all software to be rewritten, or at he very least recompiled, for the new machine until what event? (a) The introduction in 1956 of transistors in computers by UNIVAC (b) The introduction in 1964 of the IBM/360 computer family (c) The introduction in 1981 of the open architecture IBM PC (d) The introduction in 1984 of the CD-ROM by Sony 18. The operating system creates a single process if two users execute the same reentrant code. Select one: (a) TRUE (b) FALSE not sure 19. In the 1980s, software such as spreadsheet programs and word processors helped drive the revolution by ereating demand from businesses that could use these products to increase their productivity (a) Mainframe computing (b) Distributed computing (c) Personal computing (d) Client/Server computing I S 20. Instruction Length is the number of bits that comprise an instruction in a given architecture. Select one: (a) TRUE (b) FALSE 21. Which of the following lists memory types from highest to lowest speed? P 63.19 (a) secondary storage, main memory, cache, registers (b) registers, cache, secondary storage, main memory (c) registers, cache, main memory, secondary storage (d) none of the above 22. A cache hit occurs when 78 (a) a referenced piece of data is present in cache memory (b) a piece of data is removed from the cache. (c) a referenced piece of data is not present in cache memory. (d) a piece of data is placed in the cache. 23. The most common secondary storage device is (a) random access memory (b) dynamic random access memory (c) tape drives (d) magnetic diskExplanation / Answer
As you've asked I'm aswering anly those question which you didn't able to aswer or answered wrong.
15. Answer is c. It reduces the complexity of the code. Try implementing merge sort algorithm without recursion you'd be able to understand how complex can be a simple piece of code without recursion.
16. Answer is False. There are some operating system process is always running to keep system alive. Even to check whether there is a process or not you need a process.
17. Answer is c. The introduction in 1981 of open architechture IBM PC
18. False. In many modern operating systems, there can be more than one instance of a program loaded in memory at the same time; for example, more than one user could be executing the same program, each user having separate copies of the program loaded into memory. With some programs, it is possible to have one copy loaded into memory, while several users have shared access to it so that they each can execute the same program-code. Such a program is said to be re-entrant. The processor at any instant can only be executing one instruction from one program but several processes can be sustained over a period of time by assigning each process to the processor at intervals while the remainder become temporarily inactive. A number of processes being executed over a period of time instead of at the same time is called concurrent execution.
19. Answer is d. Because everyone is used to work on their local copies of documents. Which needs to be combined or accumulated at the end of the day. Which is a very hectic task. That's why there is a huge business demand to shift all work to client server model so that all work could be done centraly on master copy rather than on a local copy.
27. Multitasking. Verious process runs though time slice after the time slice process are switched to different one.
30. degree of multiprogramming. The degree of multiprogramming describes the maximum number of processes that a single-processor system can accommodate efficiently
32. time-sharing and resource-sharing computer systems were developed to provide shared interactive use of a computer system at a reasonable cost.
34. Magnetic-core memory
38. Strategy itself called direct memory access
41. degree of multiprogramming. The degree of multiprogramming describes the maximum number of processes that a single-processor system can accommodate efficiently
43. A trap is an exception in a user process. It's caused by division by zero or invalid memory access. It's also the usual way to invoke a kernel routine (a system call) because those run with a higher priority than user code. Handling is synchronous (so the user code is suspended and continues afterwards). In a sense they are "active" - most of the time, the code expects the trap to happen and relies on this fact.
An interrupt is something generated by the hardware (devices like the hard disk, graphics card, I/O ports, etc). These are asynchronous (i.e. they don't happen at predictable places in the user code) or "passive" since the interrupt handler has to wait for them to happen eventually.
You can also see a trap as a kind of CPU-internal interrupt since the handler for trap handler looks like an interrupt handler (registers and stack pointers are saved, there is a context switch, execution can resume in some cases where it left off).
Hope it helps.
Please leave a comment if you have any query.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.