(answers not verified)

[PastPaper F20] BIT_F18_NC_M_OPERATING_SYSTEMS

01. 23/0 will cause?

A. Syntax Error.
B. Race condition.
C. Signal.
D. Trap.
Answer: D

02. A binary semaphore is a semaphore with initial integer value?

A. 1.
B. 0.5.
C. -1.
D. 2.
Answer: A

03. A situation where several processes access and manipulate the same data
concurrently and the outcome of the execution depends on the particular order in
which access takes place is called __________?
A. Starvation.
B. Race Condition.
C. Convoy Effect.
D. data inconsistency.
Answer: B

04. A solution to the problem of external fragmentation is?

A. Compaction.
B. Larger Memory Size.
C. Compression.
D. Internal Fragmentation.
Answer: A

05. A system is in the safe state?

A. No Safe Sequence Exist.
B. Bankers Algorithm gives a circular wait
C. The System Can Allocate Resources to Each Process in Some Order and Still Avoid
a Deadlock
D. Mutual Exclusion Does Not Hold.
Answer: C

06. Address binding can not be done at?

A. Termination Time.
B. Load Time.
C. Compile Time.
D. RunTime.
Answer: A

07. Advantage of dynamic linking is?

A. Small Program Size.
B. No need to use exit handler.
C. No Compaction Needed.
D. Huge Program Size.
Answer: A

08. Consider a 64-bit logical address space with 8M page size. Number of bits
required for p is?
A. 41.
B. 32.
 C. 40.
D. 23.
Answer: A

09. Consider a logical address space of 32-bit and page size of 4K. Page table
entry size is 4 bytes. Maximum pages in the process address space is?
A. 4M.
B. 2M.
C.16M.
D. 1M.
Answer: D

10. Consider a logical address space of 32-bit and page size of 4K. Page table
entry size is 4 bytes. Level of paging required in this case is?
A. 4-level.
B. 2-level.
C. 3-level.
D. 1-level is enough.
Answer: B

11. Consider a machine with 64 MB physical memory and a 32 bit virtual address
space. If the page size is 4 KB, what is the approximate size of the page table?
A. 8MB.
B. 2MB.
C. 16MB.
D. 32 MB.
Answer: B

12. Consider a machine with 64 MB physical memory and a 32 bit virtual address
space. If the page size is 4 KB, number of bits required for frame number is?
A. 14.
B. 20.
C. 12.
D. 10.
Answer: A

13. Consider a machine with 64 MB physical memory and a 32 bit virtual address
space. If the page size is 4 KB, number of bits required for page number is?
A. 12.
B. 20.
C. 10.
D. 14.
Answer: B

14. Deadlock can never occur if no process is allowed to hold a resource while
requesting another resource?
A. Holding a Resource is Not Related to Deadlock
B. Yes.
C. Only Starvation Will Occur But no Possibility of Deadlock
D. No.
Answer: B

15. Executeable size is more in case of?

A. Size of Executable Does not Depend on Linking.
B. Dynamic Linking.
C. Static Linking.
D. Size of Executeable Will be Same.
Answer: C
16. For non sharable resources like a printer, mutual exclusion?
A. Must Not Exist
B. No Need of ME in printers.
C. It is Optional.
D. Must Exist
Answer: D

17. If memory access time is 100 nsec and we have this equation EAT=100* (1-p) +
15120000*p. Suppose the p is 2%. The system of slow down by approximately?
A. insufficient information.
B. 3025.
C. 1530.
D. 6096.
Answer: A (maybe)

18. If T-mem=100 nsec and T-TLB=2O nsec and the HIT RATIO 1598%. What 1sT-
effective?
A. 200.
B. 112 nsec.
C. 102.
D. 122 nsec.
Answer: D

19. If the Base and Limit registers of a process contain 400 and 300 respectively,
then the range of the valid addresses will be?
A. 400-699.
B. 401-699.
C. 300-500.
D. 400-700.
Answer: A

20. Illegal addresses are trapped using the?

A. Valid-Invalid bit
B. Dirty bit
C. Access bit.
D. Quantum bit
Answer: A

21. In contiguous memory allocation?

A. Dynamic Linking is Possible.
B. lnterna Fragmnetation Can not Occur.
C. A Single Process is Contained in a Single Contiguous Section of Memory.
D. All Processes Contained in a Single Memory Location.
Answer: C

22. In inverted page table, the entry of page table consists of?
A. pid,f.
B. only frame number.
C. pid,p.
D. pid,d.
Answer: C

23. In Linux, after forkO system call?

A. The Child Waits for Parent to Terminate and Then Runs.
B. Parent Can Only Run After All of Its Child Processes Terminte.
C. Parent and Child Run Concurrently.
D. Only parent runs.
Answer: C
24. In paged segmentation1 consider logical address space of 34 bits1 page size =1
KB, s=18 bits and d=16 bits. Maximum number of pages in the system is?
A. 128.
B. 256.
C. 32.
D. 64.
Answer: D (maybe)

25. In paged segmentation1 consider logical address space of 34 bits, page size =1
KB, s=18 bits and d=16 bits. Bits required for d' are?
A. 6.
B. 16.
C. 18.
D. 10.
Answer: D

26. Which one is fastest in finding free slot?

A. Near Fit
B. Worst Fit
C. Best Fit
D. First Fit
Answer: D

27. In paging, the page size is?

A. less than frame size.
B. equal to frame size.
C. more than frame size.
D. can not estimate it from page size.
Answer: B

28. In SRTF, if a process Pus running and another process P2 arrives with shorter
burst time?
A. P1 will continue to run.
B. P1 will be preempted and P2 will start running.
C. P2 will wait untill Pu terminates.
D. P1 will be terminated.
Answer: B

29. In the bakery algorithm to solve the critical section problem

A. A Queue of FCFS is Used.
B. The Stack is Used.
C. Each Process Receives a Number (may or may not be unique) and The One With The
Lowest Number is Served Next.
D. Each Process Gets a Unique Number and The One With The Highest Number is Served
Next.
Answer: C

30. In writing solution for critical section problem, we take care of all except?
A. Mutual Exclusion.
B. Progress
C. Zombie Processes.
D. Bounded Wait
Answer: C

31. Internal Fragmentation occurs in?

A. MVT.
B. PNG.
C. JPG.
D. MFT.
Answer: D

32. Let we have an integer variable var. ÷ +var or --var will not cause any issue
if page fault occur during execution of these instructions?
A. None of the above.
B. Not sufficient information.
C. False.
D. True.
Answer: B

33. Named Pipes (FIFOs) are temporary channel?

A. False.
B. True.
C. Pipes are not used in IPC.
D. Some time permanent some time temporary.
Answer: B (maybe)

34. Priority scheduling algorithms usually cause starvation, one of the possible
solution of starvation is?
A. Aging.
B. Another Fork is Needed.
C. Convoy Effect.
D. Thrashing.
Answer: A

35. Semaphore is a/an to solve the critical section problem?

A. Integer Variable.
B. A Hardware.
C. A Software Based Solution.
D. A Deadlock Solution.
Answer: A

36. Suppose 3 processes arrive in order P1, P2, P3 at time = 0, with Cpu time (in
ns) P1=3, P2=4, P3=6. The turn around time of P2 using RR with Time Quantum: 2 ns
will be?
A. 10.
B. 7.
C. 8.
D. 9.
Answer: D

37. Suppose we have Number of frames allocated = 4, Reference String is 1, 2, 3, 4,

1, 2, 5, 1, 2, 3, 4, 5. How many page fault using LRU?
A. 8.
B. 6.
C. 5.
D. 7.
Answer: A

38. Suppose we have Number of frames allocated = 4, Reference String is 1, 2, 3, 4,

1, 2, 5, 1, 2, 3, 4, 5. How many page fault using FIFO?
A. 10.
B. 9.
C. 11.
D. 8.
Answer: A

39. The circular wait condition can be prevented by?

A. Defining a Linear Ordering of Resource Types.
 B. Using Pipes.
C. Using Threads Instead of Processes.
D. Using Fork System Call.
Answer: A

40. Which scheme supports programmer’s view of memory?

A. Inverted [RU.
B. Paging.
C. Semgentation.
D. Hashed FIFO.
Answer: C

41. The information about number of files opened by a process is stored in?
A. KB.
B. PPFDT.
C. System Tabla
D. mode Table.
Answer: B

42. The offset d of the logical address must be?

A. Greater than segment limit
B. Between 0 and segment limit
C. Greater than segment limit
D. Busy Waiting.
Answer: B

43. The process control block (PCB) is a?

A. Data Structure.
B. An Application.
C. Hardware.
D. A Sector of Hard disk
Answer: A

44. __________ process can’t be killed by a signal, not even with the silver bullet
(SIGKILL)?
A. Zombie.
B. A Process Created Using vfork.
C. Child.
D. Orphan.
Answer: A

45. What are the two atomic operations permissible on semaphores??

A. sleep and block
B. wait and signal.
C. wait and block.
D. signal and wakeup.
Answer: B

46. What is meant by degree of multiprogramming?

A. Number of Processes in Hard Disk
B. Priority Value of a Process.
C. Number of Processes in Memory.
D. Number of Processes in I/O Queue.
Answer: C

47. Which of the following has file system level persistence?

A. FIFOs.
B. RAM.
C. Pipes.
 D. Sockets.
Answer: A