Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Name: 1. Multiple choices (please circle the answer to each of the questions below. 2 points each, total 20 points) 1) Which of the following

image text in transcribed

image text in transcribed

Name: 1. Multiple choices (please circle the answer to each of the questions below. 2 points each, total 20 points) 1) Which of the following statements is not TRUE? (Chapter 1) A. For a 64-bit computer, its memory address space is 2.not 64: B. A process is a program in execution: C. A child process has a different UID (User IDentification) as its parent: D. DMA (Direct Memory Access controls the flow of data between memory and some controller without constant CPU intervention 2) The program counter is controlled and updated by (Chapter 1) A. system administrators B. operating systems C. users' programs D, web browsers 3) Which of the following statements is NOT true? (Chapter 2) A. A process can share its address space with other processes B. Processes support the ability to have concurrent operation even when there is only one CPU available C. Processes can be created and terminated dynamically D. Processes can communicate with one another using interprocess communication primitives 4) The CPU scheduling algorithms are used to (Chapter 2) A. identify which process/thread is currently using the CPU B. check how much time has been used by the current process/thread C. determine which process/thread to run next D. decide whether or not the current process/thread should be terminated 5) Consider a physical address with a page frame size of 8KB. How many bits must be used to represent the page-frame offset of the physical address? (Chapter 3) A. 8 B. 10 C. 12 D. 14 E. Your answer: 6) To make paging systems work well, we have to consider the following issues exeer (Chapter 3) A. naming the processes B. selecting page size C. choosing page replacement algorithm D. determining the working set 7) In operating systems, "busy waiting" is defined as (Chapter 2) A. the situation where two or more processes are reading or writing some shared data and the final result depends on who runs precisely when. B. the part of a program where the shared memory is accessed. C. the situation where a variable is continuously tested until some value appears. D. the situation where if one process is using a shared variable or file, the other processes will be excluded from doing the same thing. 8) Which of the following statements is NOT true? (Chapter 2) A. The "critical region" refers to a part of program where the shared memory is accessed; B. "Producer and Consumer" problem is one of the well-known synchronization problems discussed in the operating system design and implementation; C. Threads are sharing address space but not their stacks; D. "Daemons" are defined as the processes that are inactive and ready to be removed from the memory. 9) Which of the following statements is NOT true? (Chapter 3) A. Given a logical address 0x7E6B (in hexadecimal) with a page size of 256 bytes, the page number is Ox7E; B. The three-level memory hierarchy refers to cache memory, main memory, and disk storage: C. The sizes of segments are varied and the sizes of pages are the same; D. Process Control Blocks are used to store the program code of a running process; E. A page fault occurs when a page referenced by a running program is not found in the memory. 10) Given a logical address of OxB27D (in hexadecimal) with a page size of 256 bytes, what is its corresponding physical offset within a page-frame? (Chapter 3) A. B2 B. 27 C. 7D D. 27D E. Your

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access with AI-Powered Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Students also viewed these Databases questions