sample question papers

yakconspiracyΛογισμικό & κατασκευή λογ/κού

14 Δεκ 2013 (πριν από 3 χρόνια και 7 μήνες)

144 εμφανίσεις


1

Question Bank
-

Operating Systems


One Mark Questions


1.

What is batch processing?

2.

Define turn
-
around time?

3.

Process scheduling is often known as _______ scheduling?

4.

What is dispatcher?

5.

Name the 2 solutions for the fragmentation problem?

6.

Two main approaches t
o virtual storage implementation are ____
and____.

7.

What is a file scan?

8.

_____allows computation to proceed in parallel with input
\
output.

9.

SCSI stands for____ ______ _____ _____.

10.

The unix systems password is stored in _____ form.

1.

What is the function of a T
raffic controller?

2.

List two advantages of Multiprogramming?

3.

What is the difference between Process and Processor?

4.

What is the function of a Processor Scheduler?

5.

Define Round Robin Method.

6.

What are the techniques available for handling deadly embraces?

7.

List

any two page Removal Algorithms.

8.

What is rollout?

9.

What is the purpose of OPEN command in a file system?

10.

What are the techniques available for Managing and Allocating
devices?

11.

--------------

increases the CPU utilization by organizing jobs so
that the CPU
always has one job to execute.

12.

PCB is also called as
----------------
.

13.

-------------

is a non
-
preemptive scheduling algorithm.

14.

-------------

selects the process from the pool and load it into the
memory.

15.

Spinlock is an implementation of
---------------

in
multiprocessor
system.

16.

Compaction is one of the solutions to
----------------
.

17.

The very high page fault activity is known as
-------------
.


2

18.

LRU page replacement algorithm suffers from
-------------
.

19.

Reference string is a string of
-------------
.

20.

State True
/False: Two processes are allowed to get access the
shared resource at the same point of time is known as mutual
exclusion.

21.

State True/False: Wait
-
for graph is used for deadlock avoidance.

22.

State True/False: Hash table is one of the data structure used for
secondary storage management.

23.

State True/False: C
-
SCAN algorithm is sometimes called elevator
algorithm.

24.

State True/False: Mirroring of hard disk is done through RAID.

25.

State True/False: Fairness is an important goal in time sharing
systems.

26.

What is turn ar
ound time?

27.

What is a thread?

28.

Define virtual memory.

29.

What is semaphore?

30.

How the external fragmentation can be solved?

31.

The other name given to the operating system is a _____ manager.

32.


_______ deals with deciding which programs should get each
resource and w
hen they should get it.

33.

An _____ is an immediate transfer of control caused by an event
in the system.

34.

True or False: All operating system services are provided by the
system calls.

35.

A_______ is a connection protocol for communication between
processes
.

36.

________ is a situation where more one process is in the state of
execution.

37.

True or False: Two processes trying to access the same resource at
the same time is called deadlock.

38.

A program in execution is called a _________.

39.

True or False: One condition f
or deadlock to occur is that the
resources are preemptable.

40.

_______is a primitive for achieving process synchronization.

41.

In Unix, file descriptors are called _________.


3

42.

_________ is a technique that reduces information to a smaller
size.

43.

Password is an app
roach for providing _______to file.

44.

An __________backup does not backup every file on the disk, but
only those files that have changed since the last time they were
backed up.

45.

NT uses a_______ driver model where all device drivers and file
system drivers h
ave the same interface.

46.

In a _______network, the sites are organized as a tree.

47.

The name a file does not need to be changed when the file’s
physical storage location changes is called _________
independence.

48.

The using site issues the request to _________ a
nd _________ a
remote file.

49.

Another name used for a thread is ___________ process to
emphasize the fact that a thread is like a process, which uses fewer
resources.

50.

In Unix, the __________ system call loads a binary file into
memory and starts its executio
n.

51.

What is meant by graceful degradation?

52.

Differentiate hard real system and soft real system?

53.

Define multiprogramming?

54.

Distinguish symmetric and asymmetric multiprocessing?

55.

______ is a program in execution.

56.

Define short term schedular.

57.

Distinguish I/O bou
nd and CPU bound process.

58.

What is a semaphore?

59.

State the difference between logical address space and physical
address space?

60.

What is a page fault?

61.

What is the difference between page and a page frame?

62.

Define race condition?

63.

Define a file?

64.

What is open cou
nt associated with?

65.

What do you mean by internal fragmentation?

66.

Define FAT?


4

67.

State the use of ‘ make ‘ facility of UNIX?

68.

Define symbolic link?

69.

What is the use of the ‘ fork ‘ system call in Unix?

70.

What are the three main parts of the linux system?

71.

Define os
?

72.

Differentiate hard real system and soft real system?

73.

Define race condition?

74.

Define starvation?

75.

Define dynamic linking?

76.

What is the function of a Traffic controller?

77.

List two advantages of Multiprogramming?

78.

What is the difference between Process and Proce
ssor?

79.

What is the function of a Processor Scheduler?

80.

Define Round Robin Method.

81.

What are the techniques available for handling deadly embraces?

82.

List any two page Removal Algorithms.

83.

What is rollout?

84.

What is the purpose of OPEN command in a file system?

85.

Wha
t are the techniques available for Managing and Allocating
devices?

86.

--------------

increases the CPU utilization by organizing jobs so
that the CPU always has one job to execute.

87.

PCB is also called as
----------------
.

88.

-------------

is a non
-
preemptive sch
eduling algorithm.

89.

-------------

selects the process from the pool and load it into the
memory.

90.

Spinlock is an implementation of
---------------

in multiprocessor
system.

91.

Compaction is one of the solutions to
----------------
.

92.

The very high page fault acti
vity is known as
-------------
.

93.

LRU page replacement algorithm suffers from
-------------
.

94.

Reference string is a string of
-------------
.

95.

State True/False: Two processes are allowed to get access the
shared resource at the same point of time is known as mu
tual
exclusion.

96.

State True/False: Wait
-
for graph is used for deadlock avoidance.


5

97.

State True/False: Hash table is one of the data structure used for
secondary storage management.

98.

State True/False: C
-
SCAN algorithm is sometimes called elevator
algorithm.

99.

Sta
te True/False: Mirroring of hard disk is done through RAID.

100.

State True/False: Fairness is an important goal in time sharing
systems.

101.

What is turn around time?

102.

What is a thread?

103.

Define virtual memory.

104.

What is semaphore?

105.

How the external fragmentation can be

solved?

106.

State the three main purposes of an OS.

107.

Differentiate symmetric and asymmetric multiprocessing.

108.

Define convoy effect.

109.

A___________ semaphore is a semaphore with an integer value
that can range between 0 and 1.

110.

What are the four main tasks of the r
esource manager?

111.

What is the purpose of the device driver?

112.

Give the basic idea behind dynamic memory allocation.

113.

Why are there two levels of memory management?

114.

When do you say that a process is in safe state?

115.

FAT stands for_____________.


Three Marks Ques
tions


1.

Write a note on parallel computing system?

2.

Discuss briefly the evolution of personal computer systems?

3.

What are the three important levels of scheduling?

4.

A scheduling mechanism should consider various scheduling
criteria to realize the scheduling ob
jectives. List atleast three
criteria?

5.

What are the three basic concepts of Virtual Storage?

6.

State and explain any two
-
page replacement strategies?

7.

Draw the block diagram of a two
-
level hierarchical file system?

8.

Give any three File system functions?


6

9.

What a
re I/O channels?

10.

Write a note on SCSI device drives?

11.

What are distributed systems? Explain the same with reference to
parallel systems?

12.

Briefly discuss the view of an OS as a Resource Manager?

13.

State and explain Round Robin Scheduling?

14.

Give an example of a
deadlock involving only a single process?

15.

Write a note on storage compaction in variable partition
multiprogramming?

16.

Explain the basic concepts of Paging?

17.

Explain briefly the use of hierarchical file in UNIX operating
system?

18.

Discuss the process management

issues pertaining to Windows
NT operating system?

19.

Write a detailed note on Access Strategies?

20.

Discuss the various resources available in an OS for the protection
of HW & SW?

21.

Discuss briefly the implementation scheduling algorithms in OS/2
or WINDOWS?

22.

What

is a Deadlock? Explain the necessary conditions for
deadlocks to occur in a system? How to recover from deadlocks?

23.

Explain briefly the SEGMENTED memory management scheme?

24.

Write a short note on (i) Working set theory and (ii) Disk device
drives?

25.

What are t
he types of Interrupts?

26.

What are the functions of an OS as a Device Manager?

27.

Discuss the TEST

AND
-
SET mechanism for synchronization of
processes.

28.

What is deadly embrace?

29.

What are the major advantages of partitioned allocation?

30.

Explain the First
-
in
-
First
-
o
ut Page Removal algorithm.

31.

Explain about I/O Traffic Controller.

32.

Explain Encryption and Decryption.

33.

Discuss the inadequacies of simple file system.

34.

What are the basic functions of Device Strategy Module?


7

35.

Explain the abstract view of the components of a com
puter
system.

36.

What is PCB and its contents.

37.

Consider the set of process<p1,p2,p3,p4,p5> with the length of the
cpu burst<10,1,2,1,5> and they arrive in the same order at time
0.Find out the turn around and waiting time for each process using
FCFS and SJF.

38.

Explain the necessary conditions for deadlock and draw resource
allocation graph for following situation.


P={p1,p2,p3} R={r1,r2,r3,r4}


E={p1

r1, p2

r3, r1

p2, r2

p2, r2

p1, r3

p3}

39.

Discuss about logical versus physical addre
ss space with an
example.

40.

How does the system detect thrashing and eliminate the same.

41.

Explain the acyclic graph directory structure.

42.

Explain the FCFS disk scheduling algorithm with an example.

43.

List and explain the components of LINUX system.

44.

Write note on

design principles of WINDOWS NT.

45.

Explain the features of a time
-
sharing system.

46.

Explain the creation of a processing system calls in Unix operating
system.

47.

Explain the criteria to be considered in case of CPU scheduling.

48.

Define a critical section problem
and also mention the
requirements for solving a critical section problem.

49.

Explain the terminology used in constructing the resource
allocation graph.

50.

Explain the implementation of semaphores in attaining process
synchronization.

51.

What are the various operat
ions that can be performed on files?

52.

Explain any three types of files and their functions.

53.

Explain location transparency and location independence.

54.

Explain how mapping of a file descriptor to an Inode is made
incase of Unix operating system.

55.

What is an ope
rating system and state its purpose?

56.

State the three requirements for a solution to the critical section
problem must satisfy?


8

57.

Differentiate I/O bound program and CPU bound program?

58.

State the 4 necessary conditions for a deadlock situation to arise?

59.

Compar
e paging and segmentation?

60.

What is an overlay? State its use?

61.

Describe the layout of a file system?

62.

What is the difference between contiguous and interleaved files?

63.

What are the design goals of Windows NT?

64.

Write short notes on UNIX sockets?

65.

What are the ty
pes of Interrupts?

66.

What are the functions of an OS as a Device Manager?

67.

Discuss the TEST

AND
-
SET mechanism for synchronization of
processes.

68.

What is deadly embrace?

69.

What are the major advantages of partitioned allocation?

70.

Explain the First
-
in
-
First
-
out Pa
ge Removal algorithm.

71.

Explain about I/O Traffic Controller.

72.

Explain Encryption and Decryption.

73.

Discuss the inadequacies of simple file system.

74.

What are the basic functions of Device Strategy Module?

75.

Explain the abstract view of the components of a computer

system.

76.

What is PCB and its contents.

77.

Consider the set of process<p1,p2,p3,p4,p5> with the length of the
cpu burst<10,1,2,1,5> and they arrive in the same order at time
0.Find out the turn around and waiting time for each process using
FCFS and SJF.

78.

Expla
in the necessary conditions for deadlock and draw resource
allocation graph for following situation.

79.


P={p1,p2,p3} R={r1,r2,r3,r4}

80.


E={p1

r1, p2

r3, r1

p2, r2

p2, r2

p1, r3

p3}

81.

Discuss about logical versus physical address sp
ace with an
example.

82.

How does the system detect thrashing and eliminate the same.

83.

Explain the acyclic graph directory structure.

84.

Explain the FCFS disk
-
scheduling algorithm with an example.

85.

List and explain the components of LINUX system.


9

86.

Write note on desi
gn principles of WINDOWS NT.

87.

Why are distributed systems reliable?

88.

Under what circumstances would a user is better off using time
-
sharing system rather than a personal computer or single
-
user
workstations.

89.

Define starvation and suggest some solutions.

90.

Rela
te the terms race condition, atomic action, critical section and
mutual exclusion.

91.

Differentiate logical and physical address spaces.

92.

Why is memory protection important in a multiprogramming
system?

93.

What are the Meta data that a file system maintains about

a file?

94.

Differentiate contiguous and interleaved files.

95.

Define double buffering. Why it is useful?

96.

Differentiate block device and character device.


Descriptive Type Questions


1.

Explain the basic features of UNIX as an operating system.

2.

Discuss briefly abo
ut Batch Processing Systems.

3.

Discuss how scheduling is done in OS/2.

4.

Explain Two
-
Phase Locking.

5.

Explain any two
-
page replacement algorithms.

6.

Explain any two
-
page replacement algorithms.

7.

Explain the file storage methods.

8.

Give short notes on File System of M
S
-
DOS.

9.

Discuss about the disk device driver.

10.

Explain the mechanism for protecting Hardware and Software
Resources.

11.

Explain the various synchronization mechanisms available to
provide inter process coordination and communication.

12.

Explain Dynamic Memory Allo
cation Strategy.

13.

Explain the general model of a File System.

14.

Explain the Segmented Memory Management.

15.

Compare and contrast Multiprogramming, Multitasking and
Multiprocessing.


10

Explain the memory and I/O production.

16.

Discuss in detail the critical section pro
blem and also write the
algorithm for readers
-
writers problem with semaphore.

17.

Explain the differences in the degree to which FCFS, RR and
Non
-
preemptive SJF scheduling algorithms discriminate in favour
of short processes.

18.

Explain the concept of process swi
tching in an operating system.

19.

Explain how operating system services are provided by system
calls.

20.

Explain direct and indirect communication between processes.

21.

Explain any 3 preemptive CPU scheduling algorithms.

22.

Explain any two classical problems of synchr
onization.

23.

Explain the approaches used for preventing deadlock.

24.

Explain tree structured and acyclic graph directories.

25.

Explain the linked and indexed methods for allocating disk space
to files.

26.

Explain the execution of remote procedure calls.

27.

Explain the m
ethods for designing an operating system for a 2
-
processor system.

28.

Discuss in detail the various services provided by the OS?

29.

Explain how semaphore can be used to solve the readers and
writers problem?

30.

Explain any 2 CPU scheduling algorithms?

31.

Discuss ways
by which deadlock can be detected and explain an
algorithm for detected deadlocks?

32.

Compare and contrast contiguous linked and indexed methods of
allocating disk space?

33.

Discuss the following disk scheduling algorithms with e.g. 1)
SSTF 2) LOOK

34.

Differentiate

sequential access and direct access methods which
are used to access files?

35.

Discuss the following page replacement algorithms with e.g.
1)FIFO 2)LRU

Find out % of page faults?

36.

Describe the file system of UNIX?

37.

Discuss in details ‘process management ‘ in
LINUX system?

38.

Explain the basic features of UNIX as an operating system.


11

39.

Discuss briefly about Batch Processing Systems.

40.

Discuss how scheduling is done in OS/2.

41.

Explain Two
-
Phase Locking.

42.

Explain any two
-
page replacement algorithms.

43.

Explain any two
-
page re
placement algorithms.

44.

Explain the file storage methods.

45.

Give short notes on File System of MS
-
DOS.

46.

Discuss about the disk device driver.

47.

Explain the mechanism for protecting Hardware and Software
Resources.

48.

Explain the various synchronization mechanisms av
ailable to
provide inter process coordination and communication.

49.

Explain Dynamic Memory Allocation Strategy.

50.

Explain the general model of a File System.

51.

Explain the Segmented Memory Management.

52.

Compare and contrast Multiprogramming, Multitasking and
Multip
rocessing.

53.

Explain the memory and I/O production.

54.

Discuss in detail the critical section problem and also write the
algorithm for readers
-
writers problem with semaphore.

55.

Explain the differences in the degree to which FCFS, RR and
Non
-
preemptive SJF schedul
ing algorithms discriminate in favour
of short processes.

56.

Write and illustrate the banker’s algorithm for the following
snapshot.



Allocation


Max


Available



ABC



ABC


ABC


P0


010



753


332


P1


200



322


P2


302



902


P3


211



22
2


P4


002



433

57.

Describe the first fit, best
-
fit and worst fit allocation algorithms.
Give memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and
600 KB, how would each of the above place processes of 212 KB,
417 KB, 112 KB and 426 KB in order?


12

58.

Expla
in the concept of demand paging and the performance issues
of demand paging?

59.

Discuss in detail the performances issues of secondary storage
management?

60.

Explain the file system allocation methods in detail?

61.

(i) Explain the architecture of Windows NT.

(ii) W
rite notes on threads, exceptions and interrupts.

62.

Discuss about fork/exec process model and virtual file model of
LINUX.

63.

Define the essential properties of the following types of OS.

a.

Batch

b.

Multiprocessing

c.

Time
-
sharing

64.

Discuss how OS have evolved over the y
ears.

65.

Discuss in detail any three pre
-
emptive scheduling methods.

66.

Two phase locking can lead to starvation. Explain how this can
happen. Explain why deadlock is not possible?

67.

Compare swapping and overlays.

68.

Compare segments and pages.

69.

Relate the following t
erms:

a.

Component name

b.

Directory name

c.

Absolute path name.

d.

Relative path name.

e.

Working directory.

f.

Root directory.

70.

Discuss the various ways by which file system can be optimized.

71.

State and explain the vasrious ways authenticating user.

72.

Define and explain how d
isk catching can improve disk
performance.

73.

Discuss the various mechanisms used for protecting software
resources?

74.

Explain the various strategies for dealing with the deadlocks
namely prevention, avoidance and recovery?

75.

Discuss how virtual memory is managed
?

76.

Explain in detail how the file system is implemented?