Scribd
Upload
34 views1 page

Os - 2

The document discusses operating system concepts related to memory management, scheduling, and deadlocks. It covers topics like paging, segmentation, virtual memory, translation lookaside buffers, semaphores, and the banker's algorithm for deadlock avoidance. The document contains questions to test understanding of these operating system concepts.

Uploaded by

Kannan Thenmozhi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
34 views1 page

Os - 2

The document discusses operating system concepts related to memory management, scheduling, and deadlocks. It covers topics like paging, segmentation, virtual memory, translation lookaside buffers, semaphores, and the banker's algorithm for deadlock avoidance. The document contains questions to test understanding of these operating system concepts.

Uploaded by

Kannan Thenmozhi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

SIRI PSG ARTS AND SCIENCE COLLEGE FOR WOMEN, SANKARI 12.

The page table contains ____________


INTERNAL EXAMINATION - (ODD SEM) a) base address of each page in physical memory
OPERATING SYSTEMS b) page offset c) page size d) none of the mentioned
Class :II BCA & IIIBSC (CS) 13. Each entry in a segment table has a ____________
Sub code: 21UCS07 Time:3hrs a) segment base b) segment peak
c) segment value d) none of the mentioned
Date : Max.mark : 75
14. The offset ‘d’ of the logical address must be ____________
SECTION - A [15 x 1 = 15 MARKS]
a) greater than segment limit b) between 0 and segment limit
Answer all the questions c) between 0 and the segment number d) greater than the segment number
1. Which module gives control of the CPU to the process selected by the short- 15. If there are 32 segments, each of size 1Kb, then the logical address should
term scheduler? have ____________
a) dispatcher b) interrupt c) scheduler d) none of the mentioned a) 13 bits b) 14 bits c) 15 bits d) 16 bits
2. The processes that are residing in main memory and are ready and waiting to
execute are kept on a list called _____________
a) job queue b) ready queue c) execution queue d) process queue
3. The interval from the time of submission of a process to the time of
completion is termed as ____________ SECTION - B [2 x 5 = 10 MARKS]
a) waiting time b) turnaround time c) response time d) throughput Answer any TWO questions
4. Which scheduling algorithm allocates the CPU first to the process that requests 16. Explain the requirements in memory management intended to satisfy?
the CPU first? 17. Describe paging technique with example?
a) first-come, first-served scheduling b) shortest job scheduling c)priority 18. Difference between logical address and physical address?
scheduling d) none of the mentioned 19. Explain the conditions in deadlock?
5. Which algorithm is defined in Time quantum? 20. Discuss producer and consumer problem?
a) shortest job scheduling algorithm b) round robin scheduling algorithm SECTION - C [5 x 10 = 50 MARKS]
c) priority scheduling algorithm d) multilevel queue scheduling algorithm
Answer all the questions
6. Which one of the following can not be scheduled by the kernel?
a) kernel level thread b) user level thread c) process
21. a) Explain internal and external fragmentation with example in detail? [or]
d) none of the mentioned b) Explain any two page replacement algorithm?
7. Preemptive Shortest Job First scheduling is sometimes called ____________ 22. a) Explain segmentation in detail. [or]
a) Fast SJF scheduling b) EDF scheduling – Earliest Deadline First b) Discuss about demand paging?
c) HRRN scheduling – Highest Response Ratio Next 23. a) Describe about virtual memory? [or]
d) SRTN scheduling – Shortest Remaining Time Next b) Explain about TLB(translation look aside buffer in detail?
8. Which of the following scheduling algorithms gives minimum average waiting 24. a) Describe Semaphore with example? [or]
time? b) Explain dinning philosophers problem in detail?
a) FCFS b) SJF c) Round – robin d) Priority 25. a) Describe the deadlock avoidance using bankers algorithm? [or]
9. Which one of the following is the address generated by CPU? b) Discuss the condition in the deadlock prevention?
a) physical address b) absolute address c) logical address
d) none of the mentioned
10. Run time mapping from virtual to physical address is done by ____________
a) Memory management unit b) CPU c) PCI d) None of the mentioned
11. Memory management technique in which system stores and retrieves data from
secondary storage for use in main memory is called?
a) fragmentation b) paging c) mapping d) none of the mentioned

You might also like