The interface to the access the services of Operating System is provided by?

A) API.
B) Library Call.
C) Processes.
D) System Call.
ANSWER: D
In Linux, which system call is used to create a new process?
A) creat.
B) pthread_creat.
C) fork.
D) New Process Cannot be Created Using System Call.
ANSWER: C
Which system call is used to return process identifier of a terminated child?
A) wait.
B) exit.
C) term.
D) child status can not be returned.
ANSWER: A
Which of the following is not the state of a process?
A) Running.
B) Old.
C) Ready.
D) Blocked.
ANSWER: B
The process control block (PCB) is a?
A) Hardware.
B) A Sector of Hard disk.
C) Data Structure.
D) An Application.
ANSWER: C
What is meant by degree of multiprogramming?
A) Number of Processes in I/O Queue.
B) Priority Value of a Process.
C) Number of Processes in Memory.
D) Number of Processes in Virtual Memory.
ANSWER: C
Which of the following statements is true?
A) Short Term Scheduler Manages the Degree of Multiprogramming.
B) Medium Term Scheduler Swap-out and Swap-in Processes.
C) Medium Term Scheduler is Called More Often as Compared to Short Term Scheduler.
D) Long Term Scheduler is Used to Shcedule Processes on CPU.
ANSWER: B
Which of the following has file system level persistence?
A) Sockets.
B) FIFOs.
C) Pipes.
D) RAM.
ANSWER: B
The information about number of files opened by a process is stored in?
A) System Table.
B) PCB.
C) PPFDT.
D) Inode Table.
ANSWER: C
___________time is overhead when the system does no useful work?
A) Process Creation Time.
B) Process Termination Time.
C) Context Switch Time.
D) Thread Creation Time.
ANSWER: C
If the Base and Limit registers of a process contain 400 and 200 respectively, then
the range of the valid addresses will be?
A) 200-400.
B) 400-599.
C) 400-600.
D) 401-599.
ANSWER: B
In Linux, after fork() 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
Which system call used after a fork to replace the process memory image with a new
executable?
A) exit.
B) execute.
C) exec.
D) Another Fork is Needed.
ANSWER: C
Pick the true statement?
A) Fork System Call is Called Once Return Twice.
B) Fork Returns PID of Parent to Child.
C) Fork Returns PPID of Child to Parent.
D) Fork Does not Return Anything to Parent.
ANSWER: A
____________ process can't be killed by a signal, not even with the silver bullet
(SIGKILL).?
A) Orphan.
B) Zombie.
C) Child.
D) A Process Created Using vfork.
ANSWER: B
If a parent has terminated before reaping its child, and the child process is still
running, then that child is called?
A) Orphan.
B) Zombie.
C) Half Dead Process.
D) Half Alive Process.
ANSWER: A
2 is standard file descriptor for?
A) Input.
B) Error.
C) Output.
D) Pipes.
ANSWER: B
What will be the effect of command: cat 0< f1 1> f2 2>&1?
A) f1 points to STDIN, f2 and f3 point to STDERR.
B) f1 points to STDERR, f2 points to STDIN and STDOUT.
C) f1 points to STDIN, f2 points to both STDOUT and STDERR.
D) Error in the command.
ANSWER: C
The correct command for counting number of lines on which word "os" is appearing in
file name f3.txt is?
A) cat f3.txt | grep os | wc -g.
B) cat f3.txt | grep os | wc -l.
C) cat f3.txt | grep os | wc -p.
D) cat f3.txt | grep os.
ANSWER: B
True concurrency is achieved in which of thread mapping?
A) M:1.
B) M:N.
C) 1:1.
D) 1:M.
ANSWER: C
Parent thread can wait for it child thread using ?
A) pthread_create.
B) pthread_exit.
C) pthread_join.
D) waitpid.
ANSWER: C
Convoy Effect problem may occur in _________ scheduling algorithm?
A) RR.
B) FCFS.
C) Virtual RR.
D) MLFQ.
ANSWER:B
CPU scheduling algorithms try to maximize the following parameter?
A) Waiting Time.
B) Turn Around Time.
C) Throughput.
D) Response Time.
ANSWER:C
Suppose 3 processes P1, P2, P3 arrive at the same time (let say at time=0) with
CPU time (in ns) P1=1, P2=2, P3=4, What will be the average waiting time using SJF?
A) 3 ns.
B) 2 ns.
C) 1 ns.
D) 0 ns.
ANSWER:C
Suppose 3 processes arrive in order P1, P2, P3 with CPU time (in ns) P1=4, P2=2,
P3=1, What will be the average waiting time using FCFS?
A) 1 ns .
B) 2 ns.
C) 6 ns.
D) 4 ns.
ANSWER:B
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) 9.
B) 8.
C) 10.
D) 7.
ANSWER:A
In multilevel queue scheduling?
A) Processes do not move between queues..
B) Processes can move between queues.
C) All Queues have equal priority.
D) There can be two queues only.
ANSWER:A
3 characteristics of critical section problem solution are Mutual Exclusion,
Progress and ?
A) Busy Waiting.
B) Bounded Waiting.
C) Unlimited Waiting.
D) Circular Waiting.
ANSWER: B
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) data inconsistency.
B) Starvation.
C) Convoy Effect.
D) Race Condition.
ANSWER:D
In the bakery algorithm to solve the critical section problem ____________?
A) Each Process Receives a Number (may or may not be unique) and The One With The
Lowest Number is Served Next.
B) Each Process Gets a Unique Number and The One With The Highest Number is Served
Next.
C) A Queue of FCFS is Used.
D) The Stack is Used.
ANSWER:A
Semaphore is a/an _______ to solve the critical section problem?
A) A Hardware.
B) A Software Based Solution.
C) Integer Variable.
D) A Deadlock Solution.
ANSWER:C
What are the two atomic operations permissible on semaphores??
A) wait and block .
B) wait and signal.
C) signal and wakeup.
D) sleep and block.
ANSWER:B
A binary semaphore is a semaphore with initial integer value?
A) 2.
B) 1.
C) -1.
D) 0.5.
ANSWER:B
To ensure difficulties do not arise in the readers – writers problem _______ are
given exclusive access to the shared object.?
A) Writer.
B) Reader.
C) No Exclusive Access.
D) No Shared Objects.
ANSWER:A
The dining – philosophers problem will occur in case of ____________?
A) 5 Philosophers and 5 Chopsticks.
B) 3 Philosophers and 5 Chopsticks.
C) 2 Philosophers and 4 Chopsticks.
D) 1 Philosopher and 2 Chopsticks.
ANSWER:A
The circular wait condition can be prevented by?
A) Using Threads Instead of Processes.
B) Defining a Linear Ordering of Resource Types.
C) Using Fork System Call.
D) Using Pipes.
ANSWER:B
Which one of the following is a visual way to determine the deadlock occurrence?
A) Inversion Graph.
B) Orphan Graph.
C) Resource Allocation Graph.
D) Acyclic Graph.
ANSWER:C
For non sharable resources like a printer, mutual exclusion ?
A) Must Exist.
B) Must Not Exist.
C) No Need of ME in printers.
D) It is Optional.
ANSWER:A
Deadlock can never occur if no process is allowed to hold a resource while
requesting another resource?
A) Yes.
B) No.
C) Holding a Resource is Not Related to Deadlock.
D) Only Starvation Will Occur But no Possibility of Deadlock.
ANSWER: A
Address binding can not be done at?
A) Compile Time.
B) Run Time.
C) Load Time.
D) Termination Time.
ANSWER:D
Advantage of dynamic linking is?
A) Huge Program Size.
B) No Compaction Needed.
C) Small Program Size.
D) No need to use exit handler.
ANSWER: C
A system is in the safe state?
A) The System Can Allocate Resources to Each Process in Some Order and Still Avoid
a Deadlock.
B) No Safe Sequence Exist.
C) Banker's Algorithm gives a circular wait.
D) Mutual Exclusion Does Not Hold.
ANSWER: A
A solution to the problem of external fragmentation is?
A) Larger Memory Size.
B) Internal Fragmentation.
C) Compaction.
D) Compression.
ANSWER:C
In contiguous memory allocation?
A) A Signle Process is Contained in a Single Contiguous Section of Memory.
B) All Processes Contained in a Single Memory Location.
C) Dynamic Linking is Possible.
D) Internal Fragmnetation Can not Occur.
ANSWER: A
Executeable size is more in case of?
A) Dynamic Linking.
B) Static Linking.
C) Size of Executable Does not Depend on Linking.
D) Size of Executeable Will be Same.
ANSWER: B
One of the advantages of dynamic linking is?
A) Less Time Needed to Load the Program as Compared to Static Linking.
B) More Time needed to Load the Program as Compared to Static Linking.
C) It Has no Advantage Over Static Linking.
D) The Executable Size is Huge.
ANSWER: A
Internal Fragmentation occurs in?
A) MFT.
B) MVT.
C) JPG.
D) PNG.
ANSWER: A
External Fragmentation Occurs in?
A) MFT.
B) MVT.
C) PNG.
D) JPEG.
ANSWER: B
In Next Fit?
A) Scan From Beginning and Chooses the First Available Block That is Large Enough.
B) Scan Memory From the Location of Last Placement and Chooses Next Available Block
That is Large Enough.
C) Scan All Holes and Chooses the One With a Size Closest to The Requirement.
D) Scan All Holes and Choose The Biggest Hole.
ANSWER: B
Which one is fastest?
A) Best Fit.
B) First Fit.
C) Next Fit.
D) Worst Fit.
ANSWER: B