Chapter 10 Exercises and Answers
The first page in a paged memory system is page 0. A. 14. A process in the running state is currently being executed by the CPU. A. 15. ... If a logical address in a paged memory management system is <2, 133>, what do the values mean?
Part of the document
Chapter 10 Exercises and Answers
Answers are in blue.
For Exercises 1- 18, mark the answers true and false as follows:
A. True
B. False
|1. |An operating system is an example of application software. |
| |B |
|2. |An operating system provides a basic user interface that allows|
| |the user to use the computer. |
| |A |
|3. |A computer can have more than one operating system, but only |
| |one OS is in control at any given time. |
| |A |
|4. |Multiprogramming is the technique of using multiple CPUs to run|
| |programs. |
| |B |
|5. |In the 1960s and 70s, a human operator would organize similar |
| |computer jobs into batches to be run. |
| |A |
|6. |Batch processing implies a high level of interaction between |
| |the user and the program. |
| |B |
|7. |A timesharing system allows multiple users to interact with a |
| |computer at the same time. |
| |A |
|8. |A dumb terminal is an I/O device that connects to a mainframe |
| |computer. |
| |A |
|9. |A logical address specifies an actual location in main memory. |
| |B |
|10. |An address in a single contiguous memory management system is |
| |made up of a page and an offset. |
| |B |
|11. |In a fixed partition system, main memory is divided into |
| |several partitions of the same size. |
| |B |
|12. |The bounds register contains the last address of a partition. |
| |B It contains the length of the partition. |
|13. |The first page in a paged memory system is page 0. |
| |A |
|14. |A process in the running state is currently being executed by |
| |the CPU. |
| |A |
|15. |The process control block (PCB) is a data structure that stores|
| |all information about a process. |
| |A |
|16. |CPU scheduling determines which programs are in memory. |
| |B |
|17. |The first-com, first-served scheduling algorithm is provably |
| |optimal. |
| |B |
|18. |A time slice is the amount of time each process is given before|
| |being preempted in a round robin scheduler. |
| |A |
For Exercises 19 -23 , match the operating system with information about
it.
A. MacOS
B. Unix
C. Linux
D. DOS
E. Windows
|19. |Which is the operating system of choice for Apple Computers? |
| |A |
|20. |Historically, which is the operating system of choice for |
| |serious programmers? |
| |B |
|21. |Which is the PC version of Unix? |
| |C |
|22. |What is the Microsoft operating system family provided on PCs |
| |called? |
| |E |
|23. |What is the original PC operating system called? |
| |D |
For Exercise 24 - 26, match the following software type with its
definition.
A. Systems software
B. Operating system
C. Application software
|24. |Programs that help us solve real-world problems. |
| |C |
|25. |Programs that manage a computer system and interact with |
| |hardware. |
| |A |
|26. |Programs that manage computer resources and provide an |
| |interfaces for other programs. |
| |B |
Exercises 27 - 72 are problems or short answer questions.
|27. |Distinguish between application software and system software. |
| |Systems software are tools to help others write programs; they |
| |manage a computer system and interact with hardware. |
| |Application software are programs to solve specific problems. |
|28. |What is an operating system? |
| |An operating system is a piece of software that manages a |
| |computer's resources and provides an interface for system |
| |interaction. |
|29. |Explain the term multiprogramming. |
| |Multiprogramming is the technique of keeping multiple programs |
| |in main memory at the same time, each competing for time on the|
| |CPU. |
|30. |The following terms relate to how the operating system manages |
| |multiprogramming. Describe the part each plays in this |
| |process. |
| |A. Process |
| |A process is a program in execution. |
| |B. Process management |
| |Process management is keeping track of necessary information |
| |for active processes. |
| |C. Memory management |
| |Memory management is keeping track of how and where programs |
| |are loaded into main memory. |
| |D. CPU scheduling |
| |CPU scheduling is determining which process in memory is given |
| |access to the CPU so that it may execute. |
|31. |What constitutes a batch job? |
| |A batch job was made up of the program and the instructions |
| |regarding the system software and other resources needed to |
| |execute the job. |
|32. |Describe the evolution of the concept of batch processing from |
| |the human operator in the 1960s and '70s to the operating |
| |systems of today. |
| |Originally the instructions regarding the system software |
| |needed for a program were given to the human operator. Today |
| |the instructions are given directly to the computer through OS |
| |commands that are part of the file containing the program. |
| |Today, batch processing has come to mean a system in which |
| |programs and system resources are coordinated and executed |
| |without interaction between the user and the program. |
|33. |Define timesharing. |
| |Timesharing is a technique by which CPU time is shared among |
| |multiple interactive users at the same times. |
|34. |What is the relationship between multiprogramming and |
| |timesharing? |
| |Multiprogramming allows multiple processes to be active at |
| |once. Timesharing allows the multiple processes to be |
| |interactive ones. |
|35. |Why do we say that users in a timesharing system have their own|
| |virtual machine? |
| |Users have the illusion of having the computer all to |
| |themselves. |
|36. |In Chapter 6, we defined a virtual machine as a hypothetical |
| |machine designed to illustrate important features of a real |
| |machine. In this chapter, we define a virtual machine as the |
| |illusion created by a timesharing system that each user has a |
| |dedicated machine. Relate these two definitions. |
| |The illusion created in a timesharing situation is that the |
| |user owns a single hypothetical machine. The hypothetical |
| |machine illustrates the important features of the single |
| |machine the user needs. |
|37. |How does the timesharing concept work? |
| |Each user is represented by a login process that runs on the |
| |mainframe. When the user runs a program, another process is |
| |created that competes for CPU time with other