BCA2010 – OPERATING SYSTEM

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

“ help.mbaassignments@gmail.com ”

or

Call us at : 08263069601

(SPRING 2015 ASSIGNMENT

PROGRAM	BCA (REVISED FALL 2012)
SEMESTER	2
SUBJECT CODE & NAME	BCA2010 – OPERATING SYSTEM
CREDIT	2
BK ID	B1405
MAX.MARKS	60

Note: Answer all questions. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme.

1.  Differentiate between Simple Batch Operating Systems and Timesharing Operating Systems.

Answer : Batch Operating System:

In early computer systems, the user did not interact directly with the computer system. The data and programs were first prepared on the input media such as punched cards or punched tape. The data and programs prepared on the punched tape or punched cards were referred to as jobs. These jobs were submitted to the computer operator. The computer operator would arrange the jobs into proper sequence known as batches and run the batches through the computer. The batch operating system was used to manage and control such type of operations.

The simple batch operating system transfers the jobs to the processor one by one. When one job is completed, then control is transferred to

2 Explain the different process states.

Answer : A process is a program in execution. The execution of a process must progress in a sequential fashion. Definition of process is following.

A process which is Executed by the Process have various States, the State of the Process is also called as the Status of the process, The Status includes whether the Process has Executed or Whether the process is Waiting for Some input and output from the user and whether the Process is Waiting for the CPU to Run the Program after the Completion of the Process.

The various States of the Process are as Followings:-

1) New State : When a user request for a Service

3 Define Deadlock. Explain necessary conditions for deadlock.

Answer : A deadlock is a situation in which two computer programs sharing the same resource are effectively preventing each other from accessing the resource, resulting in both programs ceasing to function. The earliest computer operating systems ran only one program at a time. Eventually some operating systems offered dynamic allocation of resources. Programs could request further allocations of resources after they had begun running. This led to the problem of the deadlock.

 Coffman (1971) identified four (4) conditions that must hold simultaneously for there to be a deadlock.

4. Differentiate between Sequential access and direct access methods.

Answer : The hypertext and hyperlink exemplify the direct-access paradigm and are a significant improvement over the more traditional, book-based model of sequential access.

(Direct access can also be called random access, because it allows equally easy and fast access to any randomly selected destination. Somewhat like traveling by a Star Trek transporter instead of driving along the freeway and passing the exits one at a time, which is what you get with sequential access.)

In a normal, physical book, the reader is supposed to read pages one by one, in the order in which they are provided by the author. For most books (fiction, at least), it makes little sense for the reader to turn directly page 256 and start reading there. Unless, of course, that is where the reader left off in their last reading session. Getting to page 256 in a 500-

5. Differentiate between Daisy chain bus arbitration and Priority encoded bus arbitration.

Answer : In most mini- and mainframe computer systems, a great deal of input and output occurs between the disk system and the processor. It would be very inefficient to perform these operations directly through the processor; it is much more efficient if such devices, which can transfer data at a very high rate, place the data directly into the memory, or take the data directly from the processor without direct intervention from the processor. I/O performed in this way is usually called direct memory access, or DMA. The controller for a device employing DMA must have the capability of generating address signals for the memory, as well as all of the memory control signals. The processor informs the DMA controller that data is available (or is to be placed into) a block of memory locations starting at a certain address in

6. Explain LRU page replacement algorithm with example

Answer: A good approximation to the optimal algorithm is based on the observation that pages that have been heavily used in the last few instructions will probably be heavily used again in the next few. Conversely, pages that have not been used for ages will probably remain unused for a long time. This idea suggests a realizable algorithm: when a page fault occurs, throw out the page that has been unused for the longest time. This strategy is called LRU (Least Recently Used) paging.

Although LRU is theoretically realizable, it is not cheap. To fully implement LRU, it is necessary to maintain a linked list of all pages in memory, with the most recently used page at the front and the least recently used page at the rear. The difficulty is that the list must be updated on every memory reference. Finding a page in the list, deleting it,

Dear students get fully solved assignments

Send your semester & Specialization name to our mail id :

“ help.mbaassignments@gmail.com ”

or

Call us at : 08263069601