CS332 Kwestel Final UPDATED Actual Exam Questions and CORRECT Answers
0 view 0 purchase
Course
CS332 Kwestel
Institution
CS332 Kwestel
CS332 Kwestel Final UPDATED Actual
Exam Questions and CORRECT Answers
True - CORRECT ANSWER- T / F - In a multiprogramming system, main memory is
divided into multiple
sections: one for the operating system (resident monitor, kernel) and one for the
set of processes currently being executed.
...
CS332 Kwestel Final UPDATED Actual
Exam Questions and CORRECT Answers
True - CORRECT ANSWER✔✔- T / F - In a multiprogramming system, main memory is
divided into multiple
sections: one for the operating system (resident monitor, kernel) and one for the
set of processes currently being executed.
False - CORRECT ANSWER✔✔- T / F - The task of subdividing memory between the O/S
and processes is
performed automatically by the O/S and is called relocation.
True - CORRECT ANSWER✔✔- T / F - The practice in which a program and data are
organized in such a way
that various modules can be assigned the same region of memory is called
overlaying.
True - CORRECT ANSWER✔✔- T / F - The concept of virtual memory is based on one or
both of two basic
techniques: segmentation and paging.
False - CORRECT ANSWER✔✔- T / F - A major problem with the largely obsolete Fixed
Partitioning memory
management technique is that of external fragmentation.
True - CORRECT ANSWER✔✔- T / F - The problem of internal fragmentation can be
lessened in a system
employing a fixed-partition memory management scheme by using unequal size
partitions.
False - CORRECT ANSWER✔✔- T / F - In the Dynamic Partitioning technique of memory
management, the bestfit placement algorithm is usually the best performer of the available
algorithms.
,True - CORRECT ANSWER✔✔- T / F - In the Dynamic Partitioning technique of memory
management,
compaction refers to shifting the processes into a contiguous block, resulting in
all the free memory aggregated into in a single block.
False - CORRECT ANSWER✔✔- T / F - In the Dynamic Partitioning technique of memory
management, the first-fit
placement algorithm scans memory from the location of the last placement and
chooses the first available block it finds that satisfies the request.
True - CORRECT ANSWER✔✔- T / F - The Buddy System is a reasonable compromise to
overcome the
disadvantages of both the fixed and variable partition schemes.
False - CORRECT ANSWER✔✔- T / F - A physical memory address is a reference to a
memory location
independent of the current assignment of data to memory.
True - CORRECT ANSWER✔✔- T / F - A memory system employing paging may suffer
slightly from internal
fragmentation and experiences no external fragmentation.
False - CORRECT ANSWER✔✔- T / F - In a memory system employing paging, the chunks
of a process (called
frames) can be assigned to available chunks of memory (called pages).
True - CORRECT ANSWER✔✔- T / F - A memory system employing segmentation may
suffer slightly from
external fragmentation and experience no internal fragmentation.
, False - CORRECT ANSWER✔✔- T / F - A memory system employing segmentation
consists of a number of user
program segments that must be of the same length and have a maximum
segment length.
Memory Management - CORRECT ANSWER✔✔- The task of subdividing memory between
the O/S and processes is performed
automatically by the O/S and is called:
a. Protection
b. Relocation
c. Memory Management
d. All of the above
All of the above - CORRECT ANSWER✔✔- The concept of Memory Management satisfies
certain system requirements,
including:
a. Protection
b. Relocation
c. Physical organization
d. All of the above
Overlaying - CORRECT ANSWER✔✔- The practice in which a program and data are
organized in such a way that
various modules can be assigned the same region of memory is called:
a. Overlaying
b. Sharing
c. Relocation
d. None of the above
Segmentation and Paging - CORRECT ANSWER✔✔- The concept of virtual memory is
based on one or both of two basic techniques:
a. Overlaying and relocation
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller MGRADES. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $9.99. You're not tied to anything after your purchase.
