Scribd
Upload
22 views3 pages

OSY W

Uploaded by

aayushsawant511
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views3 pages

OSY W

Uploaded by

aayushsawant511
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

OSY w-22:

1. Explain time sharing operating system?


Ans: An time sharing operating system is called as multitasking operating system it is an logical
extension of multiprogrammed operating system
User Interaction with program is available in time sharing operating system during execution of the
program user interact directly with the program by supplying necessary info to program
Multitasking means that a computer can work with more than one program at a time
Many user share computer system simultaneouly in time sharing operating system uses
multiprogramming and cpu scheduling each user has one separate program in memory

In time sharing each user has given an time slice for executing his/her job in rr fashion job continue
until the time slice end

Describe any two component of os


Process management is already done
Main memory management:
Main memory management primary concerned with the management of primary memory This
memory management concerned with this following activity :
Keeping track of the status of each location of main memory
Determining allocation policy for main memory
Allocation technique
Dellocation technique and policy after deallocation status information must be update
Main memory primary concerned with the allocation of physical memory of finite capacity the overall
resource utilization and performance criteria of computer is affected by the performance of memory
management module

Process State:

New : Initially a process is in new state os creates a process by call fork() system call

Ready : when a process is loaded into main memory ,it is ready for execution in this state the process
is waiting for processor allocation

Running : A process that is currently being executed os allocate all hardware and software resource to
that process for execution

Waiting : A process is waiting until a event occurs such as completion of I/o operation

Terminate: A process which completes is operation and release it all resource

Describe the free space management technique?


A file system is responsible to allocate free block to the file system therefore it has to keep track all
the free block present in the disk there are mainly four approach such as:
Bit vector
Link list
Grouping
Counting

Bit Vector: A Free space implement as a bit vector


Each block is represented by 1 bit if block is if the block is free the bit is 1 if the block is allocated the
bit is 0
Example : consider the block 2,3,4,5,8,9,10,11,12,13 are free and other are allocated
When a bit table is stored in the memory the exhaustive search table can slow file system perfomance
Most of the file system use auxilary data structure for bit table file system also maintain summary
table summary table contain subrange number of free blocks and maximum sized contiguous number
of free block

Summary table is used to store information about contiguous free block when a file system need a
number of contiguous free block it can scan the summary table to find an approriate sub range and
then search that sub range

Advantages:
It is easy to find free block
It is as small as possible

Disadvantages:
The Efficiency of method reduce if the disk size is increase
It is not feasible to keep bit map in memory of large space

Link list :
In this approach the free disk block are linked together I.e free block contain a pointer to the next
free block the block number of the very first disk block is stored in a separate location on a disk an is a
cache memory In this approach link all the disk block together keeping the pointer to the free block
the block contain a pointer to another free block

Advantages:
The available space is used efficiently using this method
Dynamic allocation in linked list is easy

Disadvantages:
This method is not efficient during iteration of each block of memory
When a size of linked list increase the headache of mainiating pointer is also increase

Differentiate between multiprogrammed and multitasking

Multiprogrammed:
It is based on the concept of context switching
It takes more time to execute the process
Principle objective is to maximize the processor use
The idea is to reduce the cpu idle time for long as possible

Multitastking :
It is based on the concept of time sharing
It takes less time to execute task allocation
The principle objective to minimize the response time
The idea is to run multiple process simultaneouly via time sharing

State the use of the following o.s tools :


Device Management:
Managing all the hardware or virtual devices of computer
Allow interaction with hardware devices through device driveer
Keeping track of all device data and location
Monitoring device status like printer storage device and other device
Allocated device to the process as per the process requirement and the priority
Used to install device and component level driver as well as assiociated software
compare between cli and gui

Command line interface :


Defination : Interaction is done by typing command
Memory : less memory is required for storage
Resource used: only keyboard
Accuracy : high
Understanding : command need to be memorized

Graphical user interface:


Defination : Interaction with device by graphical and virtual icon
Memory : more memory is requried as compared to cli
Resource used : mouse and keyboard both
Accuracy : low
Understanding : Virtual indicator and icon are easy to understand

Differentiate between long term scheduler and short term sheduler

Long term Scheduler :


It is an job scheduler
Speed is less than short term
Scheduler
It control the degree of multiprogramming
Process state from new to ready
Absent or minimal in time sharing system

Short term scheduler:


It is an cpu scheduler
Speed is more than long term scheduler
Less control over degree of multiprogramming

Process state from ready to running

Minimal time sharing system

What is linked file allocation explain in detail?

You might also like