Operating System 2
Operating System 2
What is MUTEX ?
What isthe difference between a 'thread' and a 'process'?
What is INODE?
Explain the working of Virtual Memory.
How does Windows NT supports Multitasking?
Explain the Unix Kernel.
What is Concurrency? Expain with example Deadlock and Starvation.
What are your solution strategies for "Dining Philosophers Problem" ?
Explain Memory Partitioning, Paging, Segmentation.
Explain Scheduling.
Operating System Security.
What is Semaphore?
Explain the following file systems : NTFS, Macintosh(HPFS), FAT .
What are the different process states?
What is Marshalling?
Define and explain COM?
What is Marshalling?
Difference - Loading and Linking ?
What are the basic functions of an operating system?
Explain briefly about, processor, assembler, compiler, loader, linker and the functions executed by them.
What are the difference phases of software development? Explain briefly?
Differentiate between RAM and ROM?
What is DRAM? In which form does it store data?
What is cache memory?
What is hard disk and what is its purpose?
Differentiate between Complier and Interpreter?
What are the different tasks of Lexical analysis?
What are the different functions of Syntax phase, Sheduler?
What are the main difference between Micro-Controller and Micro- Processor?
Describe different job scheduling in operating systems.
What is a Real-Time System ?
What is the difference between Hard and Soft real-time systems ?
What is a mission critical system ?
What is the important aspect of a real-time system ?
If two processes which shares same system memory and system clock in a distributed system, What is it
called?
What is the state of the processor, when a process is waiting for some event to occur?
What do you mean by deadlock?
Explain the difference between microkernel and macro kernel.
Give an example of microkernel.
When would you choose bottom up methodology?
When would you choose top down methodology?
Write a small dc shell script to find number of FF in the design.
Why paging is used ?
Which is the best page replacement algorithm and Why? How much time is spent usually in each phases and
why?
Difference between Primary storage and secondary storage?
What is multi tasking, multi programming, multi threading?
Difference between multi threading and multi tasking?
What is software life cycle?
Demand paging, page faults, replacement algorithms, thrashing, etc.
Explain about paged segmentation and segment paging
While running DOS on a PC, which command would be used to duplicate the entire diskette?
Basic Questions In Operating System Part-1
1.Explain the concept of Reentrancy.
It is a useful, memory-saving technique for multiprogrammed timesharing systems. A Reentrant Procedure is
one in which multiple users can share a single copy of a program during the same period. Reentrancy has 2
key aspects: The program code cannot modify itself, and the local data for each user process must be stored
separately. Thus, the permanent part is the code, and the temporary part is the pointer back to the calling
program and local variables used by that program. Each execution instance is called activation. It executes
the code in the permanent part, but has its own copy of local variables/parameters. The temporary part
associated with each activation is the activation record. Generally, the activation record is kept on the
stack.
Note: A reentrant procedure can be interrupted and called by an interrupting program, and still execute
correctly on returning to the procedure.
4.What is thrashing?
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.
Circular Wait: A closed chain of processes exist such that each process holds at least one resource needed by
another process in the chain.
20.Define latency, transfer and seek time with respect to disk I/O.
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.
22.What is time-stamping?
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
23.How are the wait/signal operations for monitor different from those for semaphores?
If a process in a monitor signal and no task is waiting on the condition variable, the signal is lost. So this
allows easier program design. Whereas in semaphores, every operation affects the value of the semaphore,
so the wait and signal operations should be perfectly balanced in the program.
24.In the context of memory management, what are placement and replacement algorithms?
Placement algorithms determine where in available real-memory to load a program. Common methods are
first-fit, next-fit, best-fit. Replacement algorithms are used when memory is full, and one process (or part of
a process) needs to be swapped out to accommodate a new program. The replacement algorithm determines
which are the partitions to be swapped out.
25.In loading programs into memory, what is the difference between load-time dynamic linking and
run-time dynamic linking?
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.
30.What are the four layers that Windows NT have in order to achieve independence?
Hardware abstraction layer
Kernel
Subsystems
System Services.
31.What is SMP?
To achieve maximum efficiency and reliability a mode of operation known as symmetric multiprocessing is
used. In essence, with SMP any process or threads can be assigned to any processor.
32.What are the key object oriented concepts used by Windows NT?
Encapsulation
Object class and instance
33.Is Windows NT a full blown object oriented operating system? Give reasons.
No Windows NT is not so, because its not implemented in object oriented language and the data structures
reside within one executive component and are not represented as objects and it does not support object
oriented capabilities .
40.What is mutant?
In Windows NT a mutant provides kernel mode or user mode mutual exclusion with the notion of ownership.
42.What is FtDisk?
It is a fault tolerance disk driver for Windows NT.
47.What are DDks? Name an operating system that includes this feature.
DDks are device driver kits, which are equivalent to SDKs for writing device drivers. Windows NT includes
DDks.
2) Which of the following is crucial time while accessing data on the disk?
1 Seek time
2 Rotational time
3 Transmission time
4 Waiting time
Ans ) 1
3) The host repeatedly checks if the controller is busy until it is not. It is in a loop that status register's busy
bit becomes clear. This is called _____________ and a mechanism for the hardware controller to notify the
CPU that it is ready is called ___________.
1 Interrupt and Polling
2 Polling and Spooling
3 Polling and Interrupt
4 Deadlock and Starvation
Ans ) 3
5) Which of the following memory allocation scheme suffers from External fragmentation?
1 Segmentation
2 Pure demand paging
3 Swapping
4 Paging
Ans ) 1
10) The program is known as _________ which interacts with the inner part of called kernel.
1 Compiler
2 Device Driver
3 Protocol
4 Shell
Ans ) 4
11) The time taken by the disk arm to locate the specific address of a sector for getting information is called
__________.
1 Rotational Latency
2 Seek Time
3 Search Time
4 Response Time
Ans ) 2
17) An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of
processes is ________.
1 FCFS scheduling algorithm
2 Round robin scheduling algorithm
3 Shorest job - first scheduling algorithm
4 None of the above
Ans ) 3
19) Which technique was introduced because a single job could not keep both the CPU and the I/O devices
busy?
1 Time-sharing
2 SPOOLing
3 Preemptive scheduling
4 Multiprogramming
Ans ) 4
21) In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to
the process with the highest priority (smallest integer = highest priority). The problem of, Starvation ? low
priority processes may never execute, is resolved by __________.
1 Terminating the process.
2 Aging
3 Mutual Exclusion
4 Semaphore
Ans ) 2
23) PCB =
1 Program Control Block
2 Process Control Block
3 Process Communication Block
4 None of the above
Ans ) 2
24) Software is a program that directs the overall operation of the computer, facilitates its use and interacts
with the user. What are the different types of this software ?
1 Operating system
2 Language Compiler
3 Utilities
4 All of the above
Ans ) 4
25) A __________ is a software that manages the time of a microprocessor to ensure that all time critical
events are processed as efficiently as possible. This software allows the system activities to be divided into
multiple independent elements called tasks.
1 Kernel
2 Shell
3 Processor
4 Device Driver
Ans ) 1
26) The primary job of the operating system of a computer is to ________.
1 Command Resources
2 Manage Resources
3 Provide Utilities
4 Be user friendly
Ans ) 2
27) With the round robin CPU scheduling in a time-shared system ________.
1 Using very large time slice degenerates in to first come first served algorithm
2 Using extremely small time slices improve performance
3 Using extremely small time slices degenerate in to last in first out algorithm
4 Using medium sized time slices leads to shortest request time first algorithm
Ans ) 1
2) Using Priority Scheduling algorithm, find the average waiting time for the following set of processes given
with their priorities in the order: Process : Burst Time : Priority respectively .
P1 : 10 : 3 ,
P2 : 1 : 1 ,
P3 : 2 : 4 ,
P4 : 1 : 5 ,
P5 : 5 : 2.
1 8 milliseconds
2 8.2 milliseconds
3 7.75 milliseconds
4 3 milliseconds
Ans ) 2
3) Which of the following will determine your choice of systems software for your computer ?
1 Is the applications software you want to use compatible with it ?
2 Is it expensive ?
3 Is it compatible with your hardware ?
4 Both 1 and 3
Right Ans ) 4
Associate Ans) 4
4) What is a shell ?
1 It is a hardware component
2 It is a command interpreter
3 It is a part in compiler
4 It is a tool in CPU scheduling
Ans ) 2
6) The Hardware mechanism that enables a device to notify the CPU is called __________.
1 Polling
2 Interrupt
3 System Call
4 None of the above
Ans ) 2
7) ___________ begins at the root and follows a path down to the specified file
1 Relative path name
2 Absolute path name
3 Standalone name
4 All of the above
Ans ) 2
11) The kernel keeps track of the state of each task by using a data structure called __
1 Process control block
2 User control block
3 Memory control block
4 None of the above
Ans ) 1
15) _________ is a high speed cache used to hold recently referenced page table entries a part of paged
virtual memory
1 Translation Lookaside buffer
2 Inverse page table
3 Segmented page table
4 All the above
Ans ) 1
16) If you don¿t know which version of MS-DOS you are working with, which command will you use after
booting your operating system ?
1 Format command
2 FAT command
3 VER command
4 DISK command
Ans ) 3
17) _______ OS pays more attention on the meeting of the time limits.
1 Distributed
2 Network
3 Real time
4 Online
Ans ) 3
18) A process said to be in ___________ state if it was waiting for an event that will never occur.
1 Safe
2 Unsafe
3 Starvation
4 Dead lock
Ans ) 4
19) The removal of process from active contention of CPU and reintroduce them into memory later is known
as ____________.
1 Interrupt
2 Swapping
3 Signal
4 Thread
Ans ) 2
24) _________ allocates the largest hole (free fragmant) available in the memory.
1 Best Fit
2 Worst Fit
3 First Fit
4 None of the above
Ans ) 2
30) The operating system of a computer serves as a software interface between the user and the ________.
1 Hardware
2 Peripheral
3 Memory
4 Screen
Ans ) 1
6) ___________ begins at the root and follows a path down to the specified file
1 Relative path name
2 Absolute path name
3 Standalone name
4 All of the above
Ans ) 2
8) Consider the two statements. (A) Protection is an internal problem. (B) Security is considered as an
external environment within which the system works. Which of the statement is not true?
1 Only A
2 Only B
3 Both A and B
4 None of the above
Ans ) 4
9) The process related to process control, file management, device management, information about system
and communication that is requested by any higher level language can be performed by __________.
1 Editors
2 Compilers
3 System Call
4 Caching
Ans ) 3
12) What is the name of the software which can be legally compiled and often used for free?
1 Shareware program
2 Public domain program
3 Firmware program
4 Mind Ware
Ans ) 2
14) In interactive environments such as time-sharing systems, the primary requirement is to provide
reasonably good response time and in general, to share system resources equitably. In such situations, the
scheduling algorithm that is most popularly applied is ________.
1 Shortest Remaining Time Next (SRTN) Scheduling
2 Priority Based Preemptive Scheduling
3 Round Robin Scheduling
4 None of the above
Ans ) 3
18) The section of code which accesses shared variables is called as __________.
1 Critical section
2 Block
3 Procedure
4 Semaphore
Ans ) 1
20) In memory management , a technique called as paging, physical memory is broken into fixed-sized blocks
called ___________.
1 Pages
2 Frames
3 Blocks
4 Segments
Ans ) 2
22) In one of the deadlock prevention methods, impose a total ordering of all resource types, and require
that each process requests resources in an increasing order of enumeration. This voilates the
_______________ condition of deadlock
1 Mutual exclusion
2 Hold and Wait
3 Circular Wait
4 No Preemption
Ans ) 3
23) Which of the following file name extension suggests that the file is Backup copy of another file ?
1 TXT
2 COM
3 BAS
4 BAK
Ans ) 4
25) The higher versions of operating systems are so written that programs designed for earlier versions can
still be run. What is it called ?
1 Up gradiability
2 Upward mobility
3 Universality
4 Upward Compatibility
Ans ) 4
29) The operating system of a computer serves as a software interface between the user and the ________.
1 Hardware
2 Peripheral
3 Memory
4 Screen
Ans ) 1
30) What is the name of the software which deals with the running of the actual computer and not with the
programming problems?
1 Operating system
2 System program
3 Object program
4 Source program
Ans ) 2
3) Which of the following will determine your choice of systems software for your computer ?
1 Is the applications software you want to use compatible with it ?
2 Is it expensive ?
3 Is it compatible with your hardware ?
4 Both 1 and 3
Right Ans ) 4
4) Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements
wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above
situation depicts a _________ .
1 Semaphore
2 Deadlock
3 Signal
4 Interrupt
Right Ans ) 2
5) What is a shell ?
1 It is a hardware component
2 It is a command interpreter
3 It is a part in compiler
4 It is a tool in CPU scheduling
Right Ans ) 2
6) Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main
program is loaded into memory & is executed. This type of loading is called _________
1 Static loading
2 Dynamic loading
3 Dynamic linking
4 Overlays
Right Ans ) 3
10) The process related to process control, file management, device management, information about system
and communication that is requested by any higher level language can be performed by __________.
1 Editors
2 Compilers
3 System Call
4 Caching
Right Ans ) 3
11) If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk
queue of I/O blocks requests are 98,37,14,124,65,67.
1 310
2 324
3 315
4 321
Right Ans ) 4
17) The number of processes completed per unit time is known as __________.
1 Output
2 Throughput
3 Efficiency
4 Capacity
Right Ans ) 2
18) _________ is the situation in which a process is waiting on another process,which is also waiting on
another process ... which is waiting on the first process. None of the processes involved in this circular wait
are making progress.
1 Deadlock
2 Starvation
3 Dormant
4 None of the above
Right Ans ) 1
19) Which of the following file name extension suggests that the file is Backup copy of another file ?
1 TXT
2 COM
3 BAS
4 BAK
Right Ans ) 4
20) Which technique was introduced because a single job could not keep both the CPU and the I/O devices
busy?
1 Time-sharing
2 SPOOLing
3 Preemptive scheduling
4 Multiprogramming
Right Ans ) 4
23) PCB =
1 Program Control Block
2 Process Control Block
3 Process Communication Block
4 None of the above
Right Ans ) 2
25) Switching the CPU to another Process requires to save state of the old process and loading new process
state is called as __________.
1 Process Blocking
2 Context Switch
3 Time Sharing
4 None of the above
Right Ans ) 2
28) A thread
1 is a lightweight process where the context switching is low
2 is a lightweight process where the context swithching is high
3 is used to speed up paging
4 none of the above
Right Ans ) 1
2) Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main
program is loaded into memory & is executed. This type of loading is called _________
1 Static loading
2 Dynamic loading
3 Dynamic linking
4 Overlays
Right Ans ) 3
5) The kernel of the operating system remains in the primary memory because ________.
1 It is mostly called (used)
2 It manages all interrupt calls
3 It controls all operations in process
4 It is low level
Right Ans ) 1
6) The process related to process control, file management, device management, information about system
and communication that is requested by any higher level language can be performed by __________.
1 Editors
2 Compilers
3 System Call
4 Caching
Right Ans ) 3
9) Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is
slightly ___________.
1 Lengthened; Shortened
2 Shortened; Lengthened
3 Shortened; Shortened
4 Shortened; Unchanged
Right Ans ) 2
12) A set of resources' allocations such that the system can allocate resources to each process in some order,
and still avoid a deadlock is called ________.
1 Unsafe state
2 Safe state
3 Starvation
4 Greeedy allocation
Right Ans ) 2
15) The technique, for sharing the time of a computer among several jobs, which switches jobs so rapidly
such that each job appears to have the computer to itself, is called ________.
1 Time Sharing
2 Time out
3 Time domain
4 Multitasking
Right Ans ) 1
17) If all page frames are initially empty, and a process is allocated 3 page frames in real memory and
references its pages in the order 1 2 3 2 4 5 2 3 2 4 1 and the page replacement is FIFO, the total number of
page faults caused by the process will be __________.
1 10
27
38
49
Right Ans ) 4
18) Situations where two or more processes are reading or writing some shared data and the final results
depends on the order of usage of the shared data, are called ________.
1 Race conditions
2 Critical section
3 Mutual exclusion
4 Dead locks
Right Ans ) 1
19) When two or more processes attempt to access the same resource a _________ occurs.
1 Critical section
2 Fight
3 Communication problem
4 Race condition
Right Ans ) 4
20) Which technique was introduced because a single job could not keep both the CPU and the I/O devices
busy?
1 Time-sharing
2 SPOOLing
3 Preemptive scheduling
4 Multiprogramming
Right Ans ) 4
21) _________ allocates the largest hole (free fragmant) available in the memory.
1 Best Fit
2 Worst Fit
3 First Fit
4 None of the above
Right Ans ) 2
24) The time taken to bring the desired track/cylinder under the head is _________.
1 Seek time
2 Latency time
3 Transfer time
4 Read time
Right Ans ) 1
25) Replace the page that will not be used for the longest period of time. This principle is adopted by
____________.
1 FIFO Page replacement algorithm
2 Optimal Page replacement algorithm
3 Round robin scheduling algorithm
4 SCAN scheduling algorithm
Right Ans ) 3
27) The operating system of a computer serves as a software interface between the user and the ________.
1 Hardware
2 Peripheral
3 Memory
4 Screen
Right Ans ) 1
29) A process that is based on IPC mechanism which executes on different systems and can communicate
with other processes using message based communication, is called ________.
1 Local Procedure Call
2 Inter Process Communication
3 Remote Procedure Call
4 Remote Machine Invocation
Right Ans ) 3
30) A process is
1 program in execution
2 a concurrent program
3 any sequential program
4 something which prevents deadlock
Right Ans ) 1
2) The Hardware mechanism that enables a device to notify the CPU is called __________.
1 Polling
2 Interrupt
3 System Call
4 None of the above
Right Ans ) 2
4) Which of the following is crucial time while accessing data on the disk?
1 Seek time
2 Rotational time
3 Transmission time
4 Waiting time
Right Ans ) 1
8) The kernel keeps track of the state of each task by using a data structure called __
1 Process control block
2 User control block
3 Memory control block
4 None of the above
Right Ans ) 1
12) _________ is a high speed cache used to hold recently referenced page table entries a part of paged
virtual memory
1 Translation Lookaside buffer
2 Inverse page table
3 Segmented page table
4 All the above
Right Ans ) 1
14) In interactive environments such as time-sharing systems, the primary requirement is to provide
reasonably good response time and in general, to share system resources equitably. In such situations, the
scheduling algorithm that is most popularly applied is ________.
1 Shortest Remaining Time Next (SRTN) Scheduling
2 Priority Based Preemptive Scheduling
3 Round Robin Scheduling
4 None of the above
Right Ans ) 3
15) In the multi-programming environment, the main memory consisting of _________ number of process.
1 Greater than 100
2 Only one
3 Greater than 50
4 More than one
Right Ans ) 4
18) In one of the deadlock prevention methods, impose a total ordering of all resource types, and require
that each process requests resources in an increasing order of enumeration. This voilates the
_______________ condition of deadlock
1 Mutual exclusion
2 Hold and Wait
3 Circular Wait
4 No Preemption
Right Ans ) 3
19) In the ___________ method of data transfer, the participation of the processor is eliminated during data
transfer.
1 Buffering
2 Caching
3 Direct Memory Access
4 Indirect Memory Access
Right Ans ) 3
21) Data reside in file on disk under DOS environment, which of the following file name is invalid ?
1 OSCONCEPTS.doc
2 RAW
3 COMPAQ.BOOK
4 JUMPSTART.BOS
Right Ans ) 3
22) In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to
the process with the highest priority (smallest integer = highest priority). The problem of, Starvation ? low
priority processes may never execute, is resolved by __________.
1 Terminating the process.
2 Aging
3 Mutual Exclusion
4 Semaphore
Right Ans ) 2
25) ________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.
1 Long term
2 Short term
3 Medium term
4 None of the above
Right Ans ) 1
27) Saving the state of the old process and loading the saved state of the new process is called ________.
1 Context Switch
2 State
3 Multi programming
4 None of the above
Right Ans ) 1
30) A thread
1 is a lightweight process where the context switching is low
2 is a lightweight process where the context swithching is high
3 is used to speed up paging
4 none of the above
Right Ans ) 1