b. Compare and explain internal fragmentation and external fragmentation.
8 4 3 3
24. a. Given six memory partitions of300 kB, 600 kB, 350 kB, 200 kB, 750 kB and 8 4 4 3
125 kB (in order). How would the first-fit, best-fit and worst-fit algorithms [Link]/ [Link] (Integrated) DEGREE EXAMINATION, JULY 2024
place processes of size 115 kB, 500 kB, 358 kB, 200 kB and 375 kB (in order)? Third Semester
Rank the algorithms in terms of how efficiently they use memory.
21CSC202J OPERATING SYSTEM
(OR) (For the candidates admittedji'om the academic year 2022-2023 onwards)
b. Consider page reference string 1,3,0,3,5,6,3 with 3 page frames. Find the 4 3
8 4 Note:
number of page faults. (i) Part - A should be answered in OMR sheet within first 40 minutes and OMR sheet should be handed over
to hall invigilator at the end of 40 th minute.
25. a. Describe the following in detail with respect to disk: 8 3 5 2 (ii) Part - B and Part - C should be answered in answer booklet.
(i) Seek time
(ii) Latency Time: 3 Hours Max. Marks: 75
(iii) Access time Marks BL CO PO
(iv) Transfer time PART A (20 x 1 = 20Marks)
Answer ALL Questions
2
(OR) 1. To access the services of the operating system, the interface is provided by the
b. Discuss various file organization methods with an example. 8 3 5 2
(A) Library (B) System calls
PART - C (1 x 15 = 15 Marks) Marks BL CO PO (C) Assembly instructions (D) API
Answer ANY ONE Question 2
2. ________~~_.of the following is not true.
26. Consider a system that contains five processes PI, P2, P3, P4, P5 and three 15 4 4 3 (A) Kernel IS the program that (B) Kernel IS the first part of
resources types A, Band C. The resources types A has 10, B has 5 and C has constitutes the central core of the operating system to load into
7 instances. Answer the banker's algorithm. operating system memory during booting
(C) Kernel IS made of vanous (D) Kernel remains in the memory
modules with cannot be loaded in during the entire computer
running operating system sessIon
3. A is an active entity whereas ___ is said to be a passive entity.
(A) Process, program (B) Program, process
(C) Processor, process, (D) Program, processor
(i) Construct the need matrix. 4. The time taken to switch between user and kernel modes of execution be t2 2
(ii) Determine if the system is safe or not. while the time taken to switch between two processes be 1J. IdentifY the true
27. Consider that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive 15 4 5 3 statement.
is currently serving request at cylinder 143, and the previous request was at (A) t2 > t\ (B) 12 tl
(C) t1 < t\ (D) Nothing can be said about the
cylinder 125. The queue of pending requests, in FIFO order is 86, 1470,913,
- relation between t\ and t1
1774, 948, 1509, 1022, 1750, 130. Starting from the current head position,
find is the total distance (in cylinders) that the disk arm moves to satisfy all 2
pending, request for each of the following disk scheduling algorithm: 5. List of processes that are prepared to be executed and waiting are in ~--
(i) FCFS (A) Job queue (B) Ready queue
(ii) SSTF (C) Execution queue (D) Process queue
(iii) SCAN 2 2
(iv) C-SCAN 6. The segment of code in which the process may change common variables,
(v) LOOK update tables, write into file is known as _ __
(vi) C-LOOK (A) Program (B) Non-critical section
(C) Critical section (D) Synchronizing
*****
Page 4 of4 13JA3·21 CSC202J Page 1 of4 13JA3·21 CSC202J
2 5
7. is referred to as the collection of data section, text section stack and 17. The Light Directory Access Protocol (LDAP) doesn't store _ __
memory limits of a process. (A) Users (B) Address
(A) Process control block (B) Process state block (C) Passwords (D) Security keys
(C) Process status block (D) Process information block 2 5
18. is an approach to restrict system access to authorized users.
8. of the following is called job scheduling? 3 (A) Role-based access control (B) Process-based access control
(A) Long-term scheduling (B) Short-term scheduling (C) Job-based access control (D) Program based access control
(C) CPU scheduling (D) Medium term scheduling 4
19. The bankers algorithm is ___ than the resource allocation graph algorithm.
2 3 (A) Less efficient (B) More efficient
9. Consider several processes access the same data concurrently and the outcome
of the execution depends on the particular order in which the access takes (C) Equal (D) Zero
place is called - - - 2
(A) Dynamic condition (B) Face condition 20. A monitor is a type of _ _
(C) Essential condition (D) Critical condition (A) Semaphore .(B) Low level synchronization
construct
10. A semaphore is a shared integer variable and _ __ 3 (C) High level synchronization (D) Medium level synchronization
(A) That can not drop below zero (B) That can not be more than zero construct construct
(C) That can not drop below one (D) That can not be more than one
PART - B (5 x 8 = 40 Marks) Marks BL CO PO
2 3 Answer ALL Questions
11. Round Robin scheduling is in a time shared system.
(A) Using very large time slices (B) Using very small time slices 3
converts it into first come first converts it into first come first 21. a. Explain the essential properties of the following operating systems.
2
served scheduling algorithm served scheduling algorithm (i) Batch
2
(C) Using extremely small time (D) Using very small time slices (ii) Time sharing
2
slices increases performance converts into shortest job first (iii) Parallel
2
algorithm (iv) Distributed
12. Mutual exclusion implies that _ __ 2 3 (OR)
4 3
(A) If a process is executing in its critical section, then no other process b.i. Explain in detail about the various reasons involved in process creation and
must be executing in their critical section termination.
(B) If a process is executing in its critical section, then other processes must 4 3
11. Compare mode switching and process switching.
be executing in their critical sections
(C) If a process is executing in its critical section, then all the resources of 8 4 2 -,
o
22. a. Describe the solution using semaphores to solve dinning philosopher problem.
the system must be blocked until it finishes execution
(D) Process not executing in critical section
(OR)
8 4 2 3
13. In the bounded buffer problem _ __ 4 b. Discuss how wait ( ) and signal ( ) semaphore operations should be
(A) There is only one buffer (B) There are 'n' buffers (n being implemented in multiprocessor environments, using test and set instructions.
greater than one but finite) The solution should exhibit minimal busy waiting. Develop pseudo code for
(C) There are infinite buffers (D) The buffer size is bounded implementing operations.
8 4 3 3
14. The Dining-Philosophers problem will occur in case of _ __ 4 23. a. Consider the following set of processes with the length of the CPU-burst time
(A) 5 philosophers and 5 chopsticks (B) 4 philosophers and 5 chopsticks m given ms
• t
(C) 3 philosophers and 5 chopsticks (D) 6 philosophers and 5 chopsticks Process Arrival time Burst time I
PI 8 0 !
i
15. The situation where the processor spends most of its time in swapping process 2 4 P2 4 1
pieces rather than execution instruction is called - - - P3 9 2
(A) Paging (B) The principle of locality P4 5 3
(C) Thrashing (D) Swapping P5 3 4 I
4
Draw four Gantt charts illustrating the execution of these processes using
16. of the following is the main drawback of FIFO page replacement
FCFS, SJF, priority scheduling. Also calculate waiting time and turn around
algorithm?
time for each scheduling algorithms.
(A) Requirement of large memory (B) Frame allocation
(C) Reduction in multiprogramming (D) Reduced optimality
(OR)
Page 2 of4 13JA3-21CSC202J Page 3 of4 13JA3-21 CSC202J
