Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

computer science operating system, Summaries of Computer Science

University of OttawaComputer Science

computer science operating system

Typology: Summaries

2014/2015

Uploaded on 04/19/2026

lol-lol-5yl
lol-lol-5yl 🇨🇦

7 documents

1 / 10

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSI3131 Winter 2023 Operating Systems
Final EXAMINATION
Sample Test
Length of Examination: 120 min, Data/Time: N/A
Professor: Mohammad Alnabhan
Identification: (complete this part using ink)
Family name: ………………………………………….
Given names: ………………………………………….
Student number: ………………………………………
Signature: ………………………………………………
Instructions for paper-based exam: Please read carefully!
• There are 40 questions in this sample test.
• Answer all questions on the Scantron sheet and on the question sheet. Select exactly one answer
for each question. If there is more than one correct answer, select the most correct/precise
answer.
• YOU MUST SUBMIT BOTH this question sheet and your Scantron answer sheet.
• You can detach the last from the question booklet to use for calculations (also near the
questions).
• This is a closed-book test. No books, papers, calculators or other electronic devices are
permitted.
• Each question is worth 1 point.
• Please note that looking at somebody else’s exam or helping somebody else is academic fraud.
Write your family name and student number on the Scantron sheet, with
letters and circles.
pf3
pf4
pf5
pf8
pf9
pfa

Partial preview of the text

Download computer science operating system and more Summaries Computer Science in PDF only on Docsity!

CSI3131 Winter 2023 Operating Systems

Final EXAMINATION

Sample Test

Length of Examination: 120 min, Data/Time: N/A

Professor: Mohammad Alnabhan

Identification: (complete this part using ink)

Family name: ………………………………………….

Given names: ………………………………………….

Student number: ………………………………………

Signature: ………………………………………………

Instructions for paper-based exam: Please read carefully!

  • There are 40 questions in this sample test.
  • Answer all questions on the Scantron sheet and on the question sheet. Select exactly one answer

for each question. If there is more than one correct answer, select the most correct/precise

answer.

  • YOU MUST SUBMIT BOTH this question sheet and your Scantron answer sheet.
  • You can detach the last from the question booklet to use for calculations (also near the

questions).

  • This is a closed-book test. No books, papers, calculators or other electronic devices are

permitted.

  • Each question is worth 1 point.
  • Please note that looking at somebody else’s exam or helping somebody else is academic fraud.

Write your family name and student number on the Scantron sheet, with

letters and circles.

Multiple choice questions [1 mark each]:

  1. A deadlocked state occurs whenever ____. a) a process is waiting for I/O to a device that does not exist b) the system has no available free resources c) every process in a set is waiting for an event that can only be caused by another process in the set d) a process is unable to release its request for a resource after use
  2. One necessary condition for deadlock is ____, which states that at least one resource must be held in a nonsharable mode. a) Hold and wait b) Mutual exclusion c) Circular wait d) No preemption
  3. In a system resource-allocation graph, ____. a) a directed edge from a process to a resource is called an assignment edge b) a directed edge from a resource to a process is called a request edge c) a directed edge from a process to resource is called a request edge d) None of these answers
  4. A cycle in a resource-allocation graph is ____. a) a necessary and sufficient condition for deadlock in the case that each resource has more than one instance b) a necessary and sufficient condition for a deadlock in the case that each resource has exactly one instance c) a sufficient condition for a deadlock in the case that each resource has more than once instance d) is neither necessary nor sufficient for indicating deadlock in the case that each resource has exactly one instance
  5. Which of the following statements is true? a) A safe state is a deadlocked state b) A safe state may lead to a deadlocked state c) An unsafe state is necessarily, and by definition, always a deadlocked state d) An unsafe state may lead to a deadlocked state
  6. Absolute code can be generated for ____. a) compile time binding b) load time binding c) execution time binding d) interrupt binding

  1. What is compaction? a) a technique for overcoming internal fragmentation b) a paging technique c) a technique for overcoming external fragmentation d) none of the above

  2. One of the following statements is true about fragmentation: a) Allocation into fixed partitions incurs zero internal fragmentation, but terrible external fragmentation. b) Due to increasing page table sizes, the smaller the pages, the larger the internal fragmentation problem is. c) Internal fragmentation denotes the unused memory within the address space of the process. d) External fragmentation means that the process’s address space is divided into many small fragments spread throughout the physical memory.

  3. External fragmentation exists when: a) Enough total memory exists to satisfy a request but it is not contiguous. b) The total memory is insufficient to satisfy a request. c) A request cannot be satisfied even when the total memory is free. d) None of the above.

  4. One of the following statements is true about TLB: a) TLB allows all page table entries to be accessed directly on the CPU, without incurring memory-access penalty. b) TLB caches frequently accessed memory locations, eliminating the need for page tables c) A TLB miss means that page fault has occurred. d) TLB is an associative memory caching the frequently used page table entries.

  5. Which of the following is NOT considered a file attribute? a) File Name b) File Size c) File Data Pointer d) File Protection bits

  6. One of the following statements is true: a) Disc cylinder consists of all tracks on the same platter. b) All blocks of the cylinder can be read without moving the disc head. c) As the inner tracks are shorter then the outer tracks, the hard disk spins faster when reading the inner tracks, to maintain constant linear velocity. d) The latency and transfer rate of the hard disk is primarily determined by the I/O bus used.

  7. Which of the following is true about compaction?

a) It can be done at assembly, load, or execution time. b) It is used to solve the problem of internal fragmentation. c) It cannot shuffle memory contents. d) It is possible only if relocation is dynamic and done at execution time.

  1. Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1. Suppose that there are also three frames within our system. Using the FIFO replacement algorithm, what will be the final configuration of the three frames following the execution of the given reference string? a) 1, 2, 3 b) 4, 1, 2 c) 3, 1, 2 d) 4, 2, 1
  2. Belady's Anomaly states that ____. a) giving more memory to a process will improve its performance b) as the number of allocated frames increases, the page-fault rate may decrease for all page replacement algorithms c) for some page replacement algorithms, the page-fault rate may decrease as the number of allocated frames increase d) for some page replacement algorithms, the page-fault rate may increase as the number of allocated frames increases
  3. ____ is the concept in which a process is copied into main memory from the secondary memory according to the requirement. a) Paging. b) Demand Paging. c) Segmentation. d) None of the above.
  4. A process is thrashing if ________. a ) it is spending more time paging than executing b) it is spending less time paging than executing c) page fault occurs d) swapping cannot take place
  5. Optimal page replacement ____. a) is the page-replacement algorithm most often implemented. b) is used mostly for comparison with other page-replacement schemes. c) can suffer from Belady's anomaly. d) requires that the system keep track of previously used pages.
  6. Working set model for page replacement is based on the assumption of ________.

  1. Which of the following allocation methods ensures that only one access is needed to get a disk block using direct access? a) linked allocation b) indexed allocation c) hashed allocation d) contiguous allocation

  2. One of the following is true about hard disks: a) A sector consists of one or many contiguous blocks b) Data is transferred in units of tracks c) The seek time is usually less than the rotational delay d) Data is transferred in units of blocks

  3. One of the following is true about the chained (linked list) file allocation method: a) It provides a good support for direct access files b) It provides a good support for indexed files c) It provides a good support for sequential files d) It does not provide a good support for any type of files

  4. The free-space list can be implemented using a bit vector approach. Which of the following is a drawback of this technique? a) To traverse the list, each block must be read on the disk b) It is not feasible to keep the entire list in main memory for large disks c) The technique is more complicated than most other techniques d) This technique is not feasible for small disks

  5. The SSTF scheduling algorithm ____. a) services the request with the maximum seek time b) services the request with the minimum seek time c) chooses to service the request furthest from the current head position d) None of the above

  6. Which statement is true for disk-scheduling algorithms? a) SCAN and C-SCAN perform better for systems that place a heavy load on disk b) performance does not depend on the number and types of requests c) SSTF is sometimes called the elevator algorithm d) C-LOOK scheduling is a form of SJF scheduling; may cause starvation of some requests

  1. A RAID structure ____. a) is primarily used for security reasons b) is primarily used to ensure higher data reliability c) stands for redundant arrays of inexpensive disks d) is primarily used to decrease the dependence on disk drives
  2. RAID level 0+1 is used because, RAID level 0 provides ____ whereas RAID level 1 provides ____. a) performance, redundancy b) performance, reliability c) redundancy, performance d) None of the above
  3. An interrupt priority scheme can be used to ____. a) allow the most urgent work to be finished first b) make it possible for high-priority interrupts to preempt the execution of a low priority interrupt c) defer the handling of low-priority interrupt without masking off all interrupts d) All of the above

Good Luck!

41. All of the above