OS C, C++, Java, Unix, Networking, Data Structure, STL, Unix Commands
This is a free C, C++, Java, Unix, Networking, Data Structure, STL, Unix Commands, Operating System site, to help you to learn and sharpen your axe for interview.

 

O/S Interview Questions/Answers

____________________________________________________________

What is a binary semaphore? What is its use?

Answer:

A binary semaphore is one, which takes only 0 and 1 as values. They are used to implement mutual exclusion and synchronize concurrent processes.

What is thrashing?

Answer:

It is a phenomenon in virtual memory schemes when the processor spends most of its time swapping pages, rather than executing instructions. This is due to an inordinate number of page faults.

List the Coffman's conditions that lead to a deadlock.

Answer:

·Mutual Exclusion: Only one process may use a critical resource at a time.

·Hold & Wait: A process may be allocated some resources while waiting for others.

·No Pre-emption: No resource can be forcible removed from a process holding it.

·Circular Wait: A closed chain of processes exist such that each process holds at least one resource needed by another process in the chain.

What are short-, long- and medium-term scheduling?

Answer:

Long term scheduler determines which programs are admitted to the system for processing. It controls the degree of multiprogramming. Once admitted, a job becomes a process. Medium term scheduling is part of the swapping function. This relates to processes that are in a blocked or suspended state. They are swapped out of real-memory until they are ready to execute. The swapping-in decision is based on memory-management criteria.

Short term scheduler, also know as a dispatcher executes most frequently, and makes the finest-grained decision of which process should execute next. This scheduler is invoked whenever an event occurs. It may lead to interruption of one process by preemption.

What are turnaround time and response time?

Answer:

Turnaround time is the interval between the submission of a job and its completion. Response time is the interval between submission of a request, and the first response to that request.

What are the typical elements of a process image?

Answer:

·User data: Modifiable part of user space. May include program data, user stack area, and

·programs that may be modified.

·User program: The instructions to be executed.

·System Stack: Each process has one or more LIFO stacks associated with it. Used to store

·parameters and calling addresses for procedure and system calls.

·Process control Block (PCB): Info needed by the OS to control processes.

What is the Translation Lookaside Buffer (TLB)?

Answer:

In a cached system, the base addresses of the last few referenced pages is maintained in registers called the TLB that aids in faster lookup. TLB contains those page-table entries that have been most recently used. Normally, each virtual memory reference causes 2 physical memory accesses-- one to fetch appropriate page-table entry, and one to fetch the desired data. Using TLB in-between, this is reduced to just one physical memory access in cases of TLB-hit.

What is the resident set and working set of a process?

Answer:

Resident set is that portion of the process image that is actually in real-memory at a particular instant. Working set is that subset of resident set that is actually needed for execution. (Relate this to the variable-window size method for swapping techniques.)

Explain the popular multiprocessor thread-scheduling strategies.

Answer:

·Load Sharing: Processes are not assigned to a particular processor. A global queue of threads is maintained. Each processor, when idle, selects a thread from this queue. Note that load balancing refers to a scheme where work is allocated to processors on a more permanent basis.

·Gang Scheduling: A set of related threads is scheduled to run on a set of processors at the same time, on a 1-to-1 basis. Closely related threads / processes may be scheduled this way to reduce synchronization blocking, and minimize process switching. Group scheduling predated this strategy.

·Dedicated processor assignment: Provides implicit scheduling defined by assignment of threads to processors. For the duration of program execution, each program is allocated a set of processors equal in number to the number of threads in the program. Processors are chosen from the available pool.

·Dynamic scheduling: The number of thread in a program can be altered during the course of execution.

When does the condition 'rendezvous' arise?

Answer:

·In message passing, it is the condition in which, both, the sender and receiver are blocked until the message is delivered.

What is a trap and trapdoor?

Answer:

·Trapdoor is a secret undocumented entry point into a program used to grant access without normal methods of access authentication. A trap is a software interrupt, usually the result of an error condition.

What are local and global page replacements?

Answer:

·Local replacement means that an incoming page is brought in only to the relevant process' address space. Global replacement policy allows any page frame from any process to be replaced. The latter is applicable to variable partitions model only.

Define latency, transfer and seek time with respect to disk I/O.

Answer:

·Seek time is the time required to move the disk arm to the required track. Rotational delay or latency is the time it takes for the beginning of the required sector to reach the head. Sum of seek time (if any) and latency is the access time. Time taken to actually transfer a span of data is transfer time.

What is time-stamping?

Answer:

·It is a technique proposed by Lamport, used to order events in a distributed system without the use of clocks. This scheme is intended to order events consisting of the transmission of messages. Each system 'i' in the network maintains a counter Ci. Every time a system transmits a message, it increments its counter by 1 and attaches the time-stamp Ti to the message. When a message is received, the receiving system 'j' sets its counter Cj to 1 more than the maximum of its current value and the incoming time-stamp Ti. At each site, the ordering of messages is determined by the following rules: For messages x from site i and y from site j, x precedes y if one of the following conditions holds....(a) if Ti

In loading programs into memory, what is the difference between load-time dynamic linking and run-time dynamic linking?

Answer:

·For load-time dynamic linking: Load module to be loaded is read into memory. Any reference to a target external module causes that module to be loaded and the references are updated to a relative address from the start base address of the application module. With run-time dynamic loading: Some of the linking is postponed until actual reference during execution. Then the correct module is loaded and linked.

What are demand- and pre-paging?

Answer:

·With demand paging, a page is brought into memory only when a location on that page is actually referenced during execution. With pre-paging, pages other than the one demanded by a page fault are brought in. The selection of such pages is done based on common access patterns, especially for secondary memory devices

What is process spawning?

Answer:

·When the OS at the explicit request of another process creates a process, this action is called process spawning

What are the possible threads a thread can have?

Answer:

·Ready

·Standby

·Running

·Waiting

·Transition

·Terminated.