Eos MCQ
Eos MCQ
Eos MCQ
11. Which command is used to display the octal value of the text
a) octal
b) text_oct
c) oct
d) od
18. Which command creates an empty file if file does not exist?
a) cat
b) touch
c) ed
d) read
19. Which option of rm command is used to remove a directory with all its
subdirectories
a) –b
b) –o
c) –p
d) –r
23. Which of these commands could you use to show one page of output at a time?
a) less
b) sed
c) pause
d) grep
24. Which commands will give you information about how much disk space each file
in the current directory uses?
a) ls -l
b) ls -la
c) du
d) ls -a
26. Which command is used to display all the files including hidden files in your
current and its subdirectories ?
a) ls –aR
b) ls –a
c) ls –R
d) ls –l
27. Which of the following commands can be used to copy files across systems?
a) ssh
b) telnet
c) rsh
d) ftp
30. Which tar command option is used to list the files in a tape archive format?
a) cvf
b) tvf
c) xvf
d) ovf
31. Which of the following commands will allow the user to search contents of a file
for a particular pattern
a) touch
b) grep
c) find
d) ls
32. Write the command to display the current date in the form dd/mm/yyyy.
a) date +%d/%m/%Y
b) date +”%d/%m/%Y”
c) date +/%d/%m/20%y
d) date +”/%d/%m/20%y”
33. The command syntax to display the file ‘sample.txt’ one page at a time is
a) man sample.txt>more
b) cat sample.txt<more
c) cat sample.txt|more
d) none of the mentioned
35. How do you add (append) a file “file1” to the example.tar file
a) no you cannot add a file to example.tar
b) tar -cvf example.tar file1
c) tar -rvf file1 example.tar
d) tar -evf file1 example.tar
36. How to execute ls command inside a vi editor?
a) !ls
b) :ls
c) :!ls
d) we can’t execute
37. Which command gives the first byte where the difference is in the file1 & file2?
a) diff
b) cmp
c) comm
d) ls -a
41. Which screen manipulation command sets the screen back to normal?
a) tput cup
b) tput smso
c) tput rmso
d) tput blink
42. Which command will you use to see the available routes?
a) show route
b) route status
c) netstat -r
d) none of the mentioned
Vidyanidhi Info Tech Academy
PG DAC Question Bank
4. IPC is required in
a. Multiprocessing b. Single processing c. Both d. None
9. The operating system of a computer serves as a software interface between the user and the
a. Hardware b. Peripheral d. Memory d. Screen
11. A process said to be in ___________ state if it was waiting for an event that will never occur.
a. Safe b. Unsafe c. Deadlock d. All
12. The Hardware mechanism that enables a device to notify the CPU is called __________.
a. Polling b. Interrupt c. System Call d. None of the above
1
Vidyanidhi Info Tech Academy
PG DAC Question Bank
19. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
a. Time-sharing b. Spooling c. Preemptive scheduling d. Multiprogramming
20. Which of the following memory allocation scheme suffers from External fragmentation?
a. Segmentation b. Pure demand paging c. Swapping d. Paging
24. The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole
of available memory is :
a. the cost incurred b. the memory used c. the CPU used d. All of these
2
Vidyanidhi Info Tech Academy
PG DAC Question Bank
31. The two steps of a process execution are : (choose two)
a. I/O Burst b. CPU Burst c. Memory Burst d. OS Burst
34. The switching of the CPU from one process or thread to another is called :
a. process switch b. task switch c. context switch d. All of these
36. A problem encountered in multitasking when a process is perpetually denied necessary resources is called
a. deadlock b. starvation c. inversion d. aging
39. To ensure that the hold and wait condition never occurs in the system, it must be ensured that :
a. whenever a resource is requested by a process, it is not holding any other resources
b. each process must request and be allocated all its resources before it begins its execution
c. a process can request resources only when it has none
d. All of these
40. The disadvantage of invoking the detection algorithm for every request is :
a. overhead of the detection algorithm due to consumption of memory
b. excessive time consumed in the request to be allocated memory
c. considerable overhead in computation time
d. All of these
41. A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The
maximum value of ‘n’ for which the system is guaranteed to be deadlock free is :
a. 2 b. 3 c. 4 d. 1
3
Vidyanidhi Info Tech Academy
PG DAC Question Bank
42. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock :
a. can never occur b. may occur c. has to occur d. None of these
43. ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of
all their maximum needs is always less than m+n. In this setup, deadlock :
a. can never occur b. may occur c. has to occur d. None of these
44. The two ways of aborting processes and eliminating deadlocks are : (choose all that apply)
a. Abort all deadlocked processes b. Abort all processes
c. Abort one process at a time until the deadlock cycle is eliminated d. All of these
45. Those processes should be aborted on occurrence of a deadlock, the termination of which :
a. is more time consuming b. incurs minimum cost c. safety is not hampered d. All of these
46. Cost factors of process termination include : (choose all that apply)
a. number of resources the deadlock process is holding b. CPU utilization at the time of deadlock
c. amount of time a deadlocked process has thus far consumed during its execution d. All of the above
47. If we preempt a resource from a process, the process cannot continue with its normal execution and it must be :
a. aborted b. rolled back c. terminated d. queued
48. To _______ to a safe state, the system needs to keep more information about the states of processes.
a. abort the process b. roll back the process c. queue the process d. None of these
49. If the resources are always preempted from the same process, __________ can occur.
a. deadlock b. system crash c. aging d. starvation
51. The strategy of making processes that are logically runnable to be temporarily suspended is called :
a. Non preemptive scheduling b. Preemptive scheduling c. Shortest job first d. First come First served
52. Scheduling is :
a. allowing a job to use the processor b. making proper use of processor c. Both i and ii d. None of these
4
Vidyanidhi Info Tech Academy
PG DAC Question Bank
54. When the event for which a thread is blocked occurs,
a. thread moves to the ready queue b. thread remains blocked c. thread completes d. a new thread is provided
55. The register context and stacks of a thread are deallocated when the thread
a. terminates b. blocks c. unblocks d. spawns
57. The kernel keeps track of the state of each task by using a data structure called __
a. Process control block b. User control block c. Memory control block d. None of the above
58. In the multi-programming environment, the main memory consisting of _________ number of process.
a. Greater than 100 b. Only one c. Greater than 50 d. More than one
60. Saving the state of the old process and loading the saved state of the new process is called ________.
a. Context Switch b. State c. Multi programming d. None of the above
63. Piece of code that only one thread can execute at a time is called
a. Mutual Exclusion b. Critical Section c. Synchronization d. All
5
Vidyanidhi Info Tech Academy
PG DAC Question Bank
67. Invalid memory access to computer system is a
a. trap b. program c. process d. interrupt
linux
1. The directory contains special files associated with input output devices such as terminals, line printer etc
a. /etc b. /dev c. /bin d. /device e. /mnt
2. The utility program that searches a file, or more than one file, for lines which contain strings of a certain pattern
a. Find b. grep c. tr d. locate e. pr f. search
3. The Block of every file system contains the major pieces of information about the file system such as file system name ,
number of blocks reserved for inodes , free inode list etc
a. Inode block b. Super block c. Boot block d. Data block
6. A file may have more than one name. This is accomplished using which of the following commands?
a. dup b. ln c. name d. fork e. cp
8. Part of the system which manages the resources of computer system, keep track of the disks, tapes, printers, terminals,
communication lines and any other devices.
a. Schedular b. Kernel c. Shell d. Resource manager e. System call
10. If your process refuses to die with kill command in the normal number, signal number option used is
a. 13 b. 9 c. 3 d. 0 e. 99
6
Vidyanidhi Info Tech Academy
PG DAC Question Bank
a. X= b. X=’’ c. X=”” d. all the above
18. To find out a file’s inode number, use this option on the “ls” command.
a. -i b. -inode c. -inum d. -in
23. Use the following command to save and exit from Vi.
7
Vidyanidhi Info Tech Academy
PG DAC Question Bank
a. ZZ b.:w c. :q! d. wq e. Both a and d option
24. Which of the following Unix utilities are not commonly used to process regular expressions?
a. grep b. sed c. cut d. awk
26. Names are associated with the IP addresses, so that users do not have to remembers IP addresses, This association is the
job of the
a. IPN b. DNS c. INS d. TCP e. IP
29. To make a variable available to any subshells you execute using command
a. Import b. global c. export d. set e. path
30. User request background execution of a program by placing what at the end of the command line
a. # b. @ c. & d. * e. !
31. With a umask value of 12, What are the default permissions assigned to newly created files?
a. --x—x-wx b. -rw-rw-r— c. -r-xr-xr— d. -rw-rw----
34. Which command display the real name of the users who have currently logged on
a. Who ii) finger iii) talk iv) whoami v) users
8
Vidyanidhi Info Tech Academy
PG DAC Question Bank
a. Communicate with other users b. Improve relationships c. Change Priority levels of running processes
d. Create processes e. format a document so that its look nice
38. Which special variable contains the PID of its own process?
a. $job b. $$ c. PID d. $ps
39. The process that needs to run in the background as a daemon to ensure that logging happens is:
a. telnetd b. syslogd c. fsck d. All of these
sync (10)
$# (8)
13. od (9)
9
Vidyanidhi Info Tech Academy
PG DAC Question Bank
14. su (4)
What is the meaning of exit status value and how can we access the exit status value of any command
Ans: Exit status meaning the command return value to the environment indicating it is successfully executed or have error
Exit Status value is stored in environment variable $?
4) Write a command to substitute all occurrences of word “printf “with “cout” from a file myprog.c
Ans sed ‘1,$s/printf/cout/g’ myprog.c
MCQ
1. What is operating system?
a. collection of programs that manages hardware resources b. system service provider to the application programs
c. link to interface the hardware and application programs d. all of the mentioned
10
Vidyanidhi Info Tech Academy
PG DAC Question Bank
4. The systems which allows only one process execution at a time, are called
a. uniprogramming systems b. uniprocessing systems c. unitasking systems d. none of the mentioned
12. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called
a. job queue b. ready queue c. execution queue d. process queue
13. The interval from the time of submission of a process to the time of completion is termed as
a. waiting time b. turnaround time c. response time d. throughput
14. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
a. first-come, first-served scheduling b. shortest job scheduling c. priority scheduling d. none of the mentioned
11
Vidyanidhi Info Tech Academy
PG DAC Question Bank
18. On getting, an interrupt, CPU
a. finishes the current instruction and moves to interrupt service routine
b. immediately moves to interrupt service routine without completing current instruction [
c. releases the control on I/O lines and memory lines
d. makes the peripheral device, which requested the interrupt wait for fixed interval of time
20. The portion of the process scheduler in an operating system that dispatches processes is concerned with
a. assigning ready processes to CPU b. assigning ready processes to waiting queue
c. assigning running processes to blocked queue d. All of these
22. Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________.
a. Lengthened; Shortened b. Shortened; Lengthened c. Shortened; Shortened d. Shortened; Unchanged
25. Memory management technique in which system stores and retrieves data from secondary storage for use in main
memory is called
a. fragmentation b. paging c. none of the mentioned
29. When memory is divided into several fixed sized partitions, each partition may contain ________.
a. exactly one process b. atleast one process c. multiple processes at once d. None of these
12
Vidyanidhi Info Tech Academy
PG DAC Question Bank
32. Solution to the problem of external fragmentation problem is to
a. permit the logical address space of a process to be noncontiguous
b. permit smaller processes to be allocated memory at last
c. permit larger processes to be allocated memory at last d. All of these
34. When the memory allocated to a process is slightly larger than the process, then
a. internal fragmentation occur b. external fragmentation occur c. both a and b d. neither a nor b
36. Logical memory is broken into blocks of the same size called _________.
a. frames b. pages c. backing store d. None of these
40. When a program tries to access a page that is mapped in address space but not loaded in physical memory, then
a. segmentation fault occurs b. fatal error occurs c. page fault occurs d. no error occurs
41. The operating system of a computer serves as a software interface between the user and the
a. Hardware b. Peripheral c. Memory d. Screen
46. Process is
a. Program in high level language kept on disk b. Contents of main memory
c. A program in execution d. A program in secondary memory
13
Vidyanidhi Info Tech Academy
PG DAC Question Bank
47. Which among following scheduling algorithms give minimum average waiting time
a. FCFS b. SJF c. Round robin d. Priority
52. A process is selected from the ______ queue by the ________ scheduler, to be executed.
a. blocked, short term b. wait, long term c. ready, short term d. ready, long term
54. Scheduling is
a. allowing a job to use the processor b. making proper use of processor c. Both a and b d. None of these
56. The kernel keeps track of the state of each process by using a data structure called
a. Process control block b. User control block c. Memory control block d. None of the above
57. In the multi-programming environment, the main memory consisting of _________ number of process.
a. Greater than 100 b. Only one c. Greater than 50 d. More than one
58. ________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.
a. Long term b. Short term c. Medium term d. None of the above
64. An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.
a. FCFS scheduling algorithm b. Round robin scheduling algorithm c. Shorest job - first scheduling algorithm
d. None of the above
65. Which of the following memory allocation scheme suffers from External fragmentation?
a. Fixed Memory Partition b. Dynamic Memory Partition c. Paging d. None
66. Which of the following is crucial time while accessing data on the disk?
a. Seek time b. Rotational time c. Transmission time d. Waiting time
69. 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.
a. 8 milliseconds b. 8.2 milliseconds c. 7.75 milliseconds d. 3 milliseconds
71. PCB =
a. Program Control Block b. Process Control Block c. Process Communication Block d. None of the above PCB
15
Vidyanidhi Info Tech Academy
PG DAC Question Bank
75. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of
a. all process b. currently running process c. parent process d. init process
90. Which scheduler selects which processes should be brought into the ready queue?
a. Real-term b. Long-term c. Medium-term d. Short-term
95. Copying a process from memory to disk to allow space for other process is called
a. Swap out b. Deadlock c. Demand Paging d. Page fault
96. ............... is a large kernel containing virtually the complete operating system, including, scheduling, file system, device
drivers and memory management.
a. Multilithic kernel b. Monolithic kernel c. Micro kernel d. Macro kernel
97. .10 A .................... architecture assigns only a few essential functions to the kernel, including address spaces, Inter
process communication(IPC) and basic scheduling.
a. Monolithic kernel b. Micro kernel c. Macro kernel d. Mini kernel
98. With ................ only one process can execute at a time; meanwhile all other process are waiting for the processer. With
.............. more than one process can be running simultaneously each on a different processer.
17
Vidyanidhi Info Tech Academy
PG DAC Question Bank
O.S (1)
1. The page table entry contains_______________________
a. the information regarding given page is valid or not b. the information regarding given segment is valid or not
c. the information regarding given page table is valid or not d. All of the above
4. What will be the possibility, when process comes in wait or block state?
a. disk operation b. time since expire
c. due to the higher priority process arrival d. All of the above
5. What is attenuation?
a. Noise of the cable b. Loss of signal strength c. Unwanted signals d. None of the above
18
Vidyanidhi Info Tech Academy
PG DAC Question Bank
11. By using interrupt which kind of problem will be eliminated?
a. Spooling b. Polling c. Job Scheduling d. None of the above
22. Names are associated with the IP addresses, so that users do not have to remembers IP addresses, this association is the
job of the
a. IPN b. DNS c. INS d. TCP e. IP
19
Vidyanidhi Info Tech Academy
PG DAC Question Bank
c. It points to the next block of code in the execution d. None of the above
24. A pointer is said __________ if the definition of the type to which it points to is not included in the current translation unit.
A translation unit is the result of merging an implementation file with its headers and header file
a. This pointer b. Opaque pointer c. Function pointer d. Nested pointer
25. Which of the following stack operation could result as stack underflow/
a. is empty b. pop c. push d. Two or more of the above answers
26. User request background execution of a program by placing what at the end of the command line
a. # b. @ c. & d. * e. !
30. Which command display the real name of the users who have currently logged on
a. Who b. finger c. talk d. whoami e. users
20
Vidyanidhi Info Tech Academy
PG DAC Question Bank
38. Which of the following Unix utilities are not commonly used to process regular expressions?
a. grep b. sed c. cut d. awk
4. Computer that handles concurrent users and multiple jobs are called_____________
a. Client b. Network Client c. Network servers d. All of the above
21
Vidyanidhi Info Tech Academy
PG DAC Question Bank
c. Both 1 and 2 d. None of the above
9. The ability of an Operating System to execute different parts of a program simultaneously is known as __________________
a. Multi - Tasking b. Multi programming c. Multi – Threading d. Multi – scheduling
12. Which command will be used to display what date is it this Friday?
a. Date-fri b. Date-d fri c. Cal-d fri d. None of the above
13. Which command will be used to print selected parts of lines from each FILE to standard output?
a. Cut [option]…[FILE]… b. Print [option]…[FILE]… c. Cmp [option]…[FILE]… d. Comm. [option]…[FILE]…
15. When the processor is in user mode, all addresses are ________________
a. Physical address b. Logical address c. Absolute address d. Memory address
17. Plan ahead so that you never get into a situation where deadlock is inevitable is called as _____
a. Deadlock prevention b. Deadlock avoidance c. Deadlock recovery d. Avoiding Mutual exclusion
18. In which situation a process is prevented from proceeding because some other process always has the resources it needs?
a. Locking b. Deadlock c. Starvation d. Blocking
22
Vidyanidhi Info Tech Academy
PG DAC Question Bank
20. Anything that can be used by only a single process at any instant in time is called as ______________
a. Memory b. Thread c. Space d. Resources
26. The ability of a computer, machine, electronic system or network to maintain limited functionality even when a large
portion of it has been destroyed or rendered is called as ________________
a. Fault tolerance b. Fault Management c. Graceful degradation d. Denial of services
28. Which type of binding perform before the operation of a program begins?
a. Static binding b. Dynamic binding c. Synchronous binding d. Asynchronous binding
23
Vidyanidhi Info Tech Academy
PG DAC Question Bank
32. Which of the following mode is performing I/O operations?
a. Interrupt mode b. Running mode c. Memory access mode d. Safe mode
33. When a process terminates and all it’s child process must also be termed this situation is called as ___
a. Child termination b. Child parent termination c. Spawn termination d. Cascading termination
34. Which of the following register contains address of the next instruction to be executed by the CPU?
a. Program counter register b. CPU registers c. Control register d. Condition code register
35. When an interrupt arises during its execution and the scheduler selects some other program for execution is called as
________________
a. Preemption b. Non Preemption c. Priority d. Interrupt Processing
38. Which of the following policy is used by Linux for page replacement?
a. LRU b. Optimal c. FIFO d. MRU
40. A process sends data to another process and the sender does not wait till the data is received by the receiver. This type of
transfer is known as ____________________
a. Synchronous b. Asynchronous c. Blocking d. None of the above
41. Which command would yu use to create a sub-director in your home directory?
a. mkdir b. dir c. cp d. rm
43. The interval between submission of a request and the first response to that request is called as ______
a. Turnaround time b. Time delay c. Response time d. Request time
44. A unique number is used to look up an entry in the inode table which gives information on the type, size and location of the
file is called as __________________
a. Inode value b. Inode c. Inode number d. All of the above
24
Vidyanidhi Info Tech Academy
PG DAC Question Bank
46. How can you view the permission-settings on all files in the current directory?
a. displayall b. Is-I c. listall d. listdir
47. Which command sends file content to standard output and list the content of short files to the screen?
a. echo b. cp c. cat d. None of the above
49. In which scenario the First-Come, First-Served scheduling policy, I/O bound processes may have to wait long in the ready
queue waiting for a CPU bound job to finish?
a. Aging b. Priority inversion c. Priority Inheritance d. Convoy effect
50. How can we determined the minimum number of page frames that must be allocated to a running process in a virtual
memory environment?
a. the instruction set architecture b. page size c. number of processes in memory d. physical memory size
25
Vidyanidhi Info Tech Academy
PG DAC Question Bank
7. What will be the possibility, when process comes in wait or block state?
a. disk operation b. time since expire c. due to the higher priority process arrival d. All of the above
8. What is attenuation?
a. Noise of the cable b. Loss of signal strength c. Unwanted signals d. None of the above
12. Which inter processes Communication mechanism is fastest to exchange the data between processes?
a. PIPE b. FIFO c. Shared Memory d. Message Queue
26
Vidyanidhi Info Tech Academy
PG DAC Question Bank
18. How can we find out the free space size to use on Linux System hard disk partition?
a. df-hs b. freedisk-hs c. fdisk-hs d. None of the above
19. How can we get the information about the CPU on the Linux system?
a. cat /usr/cpuinfo b. cat /proc/cpuinfo c. cat /root/proc/cpuinfo d. cat /root/usr/cpuinfo
24. Where the main system message log file information get stored?
a. /var/log/message b. /usr/log/message c. /src/log/message d. /root/log/message
25. Which command can be use on Linux platform to shutdown the system?
a. shutdown-r now b. Shutdown c. init 0 d. init 6
27
Vidyanidhi Info Tech Academy
PG DAC Question Bank
29. What happens when a page fault occur for a valid legal virtual address?
a. Process will terminate b. Process will block c. None of the above
d. The process will restart after the page is brought to the main memory and page table entry will
33. Which command can be use on Linux platform to shutdown the system?
a. shutdown- r now b. Shutdown c. init 0 d. init 6
35. Which of the following stack operation could result as stack underflow? 1
a. is_empty b. Pop c. Push d. Two or more of the above answers
37. How can we find out the free space size to use Linux system hard disk partition?
a. df-hs b. freedisk-hs c. fdisk-hs d. None of the above
38. ______________ means that the data added by a subclass are discarded when an object of the subclass is passed or
returned by value or from a function expecting a base class object?
a. Slicing b. Up casting c. Down Casting d. Name Mangling
40. Which CPU scheduling algorithm is non- preemptive type from the following?
a. Shortest job first scheduling b. Round robin scheduling c. Priority based scheduling
d. First come first serve based scheduling
43. Which system call will you use to get the parent of the process?
a. getp() b. getppid() c. getparentid() d. None of the above
47. A pointer is said __________ if the definition of the type to which it points to is not included in the current
translation unit. A translation unit is the result of merging an implementation file with all its headers and header
files
a. This pointer b. Opaque pointer c. Function pointer d. Nested pointer
48. ___________ means that the data added by a subclass are discarded when an object of the subclass is passed
or returned by value or from a function expecting a base class object?
a. Slicing b. Up casting c. Down Casting d. Name mangling
50. Which of the following stack operation could result as stack underflow/
a. is_empty b. pop c. push d. Two or more of the above answers
51. An array is having 12 elements, what will be the maximum number of comparisons that
a. 144 b. 12 c. 11 d. 13
53. What happens when a page fault occur for an invalid_illegal virtual address?
29
Vidyanidhi Info Tech Academy
PG DAC Question Bank
a. Process will terminate b. Process will block c. All of the above
d. The process will restart after the page is brought to the main memory and page table entry will update.
54. ______________signal generate when we try to access the illegal memory location using invalid pointer
a. SIGSTOP b. SIGSEGV c. SIGTERM d. SIGNULL
55. An array is having 12 elements, what will be the maximum number of comparisons that required in Merge sort?
a.144 b. 11 c. 12 d. 13
57. If a program that analyses an airline’s ticketing transactions runs into an error, it should__
a. write the exceptions into a file and continue analysing transactions b. display an error message and halt processing
c. delete the record containing an error d. terminate the program
73. Which command will list out all files including hidden files?
a. ls -l b. ls –A c. ls -r d. ls -a
30
Vidyanidhi Info Tech Academy
PG DAC Question Bank
a. -a b. –v c. -R d. -c
75. How does a user find out which directory he is currently working in?
a. cwd b. mv c. pwd d. ls
84. How can read, write, execute ( rwx ) permission be represented in numeric form?
a. 0 b. 7 c. 5 d. 8
31
Vidyanidhi Info Tech Academy
PG DAC Question Bank
a. ALT + v b. CTRL + v c. SHIFT + v d. none of the above
89. Which should be the first line in every BASH ( shell ) script?
a. !#/bin/bash b. /bin/bash c. #!/bin/bash d. none of the above
94. Which command can be used to modify the color of the text which appears on screen?
a. echo b. color c. tput d. none of the above
105. Which system call will you use to get the parent of the process?
a. getp() b. getppid() c. getparentid() d. None of the above
109. What happens when a page fault occur for an invalid_illegal virtual address?
a. Process will terminate b. Process will block c. All of the above
d. The process will restart after the page is brought to the main memory and page table entry will update.
2. Which CPU scheduling algorithm may suffer from the Starvation Problem
a. Round Robin (RR) b. First Come First serve (FCFS) c. Priority scheduling d. None of the above.
4. Circular waiting is
33
Vidyanidhi Info Tech Academy
PG DAC Question Bank
a. not a necessary condition for deadlock
b. a necessary condition for deadlock, but not a sufficient condition.
c. a sufficient condition d. None of the above.
5. In an operating system using paging , if each 32-bit address is viewed as a 20-bit page identifier plus a 12-bit offset, what is
the size of each page?
a. 2^12 =4096 bytes b. 2^20 bytes c. 20 byte d. None of the above.
11. Spooling
a. In spooling, a process writes its output to a temporary file rather than to an output device, such as a printer
b. In spooling, a process writes its output to an output device, such as a printer
c. Both 1 & 2
d. None of the above.
13. The OS uses a round robin scheduler. The FIFO queue of ready processes holds three processes
34
Vidyanidhi Info Tech Academy
PG DAC Question Bank
A, B, C in that order. The time quantum is 18 msec. A context switch takes 2 msec. After running
for 13 msec, B will block to do a disk read, which will take 30 msec to complete. Trace what will
happen over the first 100 msec. What is the CPU efficiency over the first 100 msec?
a.80% b.70% c.90% 4.100%
15. An OS uses a paging system with 1Kbyte pages. A given process uses a virtual address space
Of 128K and is assigned 16K of physical memory. How many entries does its page table contain?
a. 1024 b. 128 c. 512 d. 64
19. A program which is loaded into memory & is executing is commonly referred to as a:
a. Software. b. Job. c. Process. d. Program
22. A ______ is a memory area that stores data while they are transferred between 2 devices:
a. Spool b. Buffer c. Cache d. Kernel
35
Vidyanidhi Info Tech Academy
PG DAC Question Bank
24. The ______ file stores information about file systems that are mountable during booting:
a. /lib b. /mnt c. /etc/fstab d. /usr/local
25. In Linux ____ command is used to change the current working directory & ____ command is Used to print the current
working directory on the screen:
a. cd, pwd b. pwd, cd c. cd, cp d. cp, cd
26. ______ Is a special user who has ultimate privilege on Linux system:
a. Any user b. Super user c. Administrator d. None of the above
27. In Linux, we can display the content of text file by using the command:
a. display b. show c. cat d. All of the above
29. If more than one process is blocked, the swapper chooses a process with the ______
a. Lowest Priority. b. Highest Priority. c. Medium priority d. No Priority.
30. In Batch processing system the memory allocator are also called as ______
a. Long – term scheduler b. Short – term scheduler c. Medium – term scheduler d. Batch – term scheduler.
31. Wait until the desired sector of a disk comes under the R/W head as the disk rotates. This time
Is called as ______
a. seek time b. latency time c. transmission time d. Read/Write time
32. All other processes wanting to enter their respective critical regions are kept waiting in a
queue called as _______.
a. Ready queue. b. Waiting queue c. Semaphore queue. d. Critical queue.
33. There would be some time lost in turning attention from process 1 to process 2 is called as ______
a. Process transferring. b. Process switching c. Process turning. d. Context switching
34. Some operating system follows the technique of _______ in which you skip two sector and then number the sector (eg
After starting from 0,you skip two sector and then number the sector as 1 and so on…)
a. Leaving. b. Skipping. c. Interleaving. d. Jumping
36
Vidyanidhi Info Tech Academy
PG DAC Question Bank
36. The kernel has to keep track of all the pages frames in terms of whether they are free, and if not, the process to which they
are allocated. This is done by maintaining another data structure called ______.
a. Page Map Table (PMT). b. Page Frame Data Table (PFDT). c. Page Table Entry (PTE). d. Disk Block Descriptor (DBD).
37. ______ processes tend to be faster, since they do not have to go to the kernel for every Rescheduling (Context switching).
a. heavyweight processes. b. Lightweight processes. c. Kernel processes. d. System processes
38. To know the name of the Shell program we use following command (Bourne Shell).
a. $0 b. $1 c. $2 d. $9
39. To hold the exit status of the previous command ______ command is used.
a. $$ b. $? 3. $/ 4. $
40. To know the Process id of the current process ______ command is used.
a. $$ b. $? c. $/ d. $
37
Vidyanidhi Info Tech Academy
PG DAC Question Bank
a. foo b. 10 c. x d. $x
50. fun(){
echo "enter a number"
read num
num=$(($num+1))
echo "$num"
}
fun
exit 0
Os re-Exam
1. The computer itself uses __________ language.
a. High level b. Natural c. Assembly d. Machine
38
Vidyanidhi Info Tech Academy
PG DAC Question Bank
2. Which of the following is not an operating system?
a. SuSE b. Unix c. OSD d. DOS
3. Object modules generated by assemblers may contain unresolved references. These are resolved using other
object modules by the __________.
a. linker b. loader c. debugger d. compiler
6. Match the operating system abstractions in the left column to the hardware components in the right column
a. Thread 1. Interrupt
b. Virtual Address Space 2. Memory
c. File System 3. CPU
d. Signal 4. Disk
1.a-2, b-4, c-3, d-1
2.a-3, b-2, c-4, d-1
3.a-1, b-2, c-3, d-4
4.a-4, b-2, c-2, d-1
7. Which of the following file streams is not opened automatically in a UNIX program?
a. Standard terminal b. Standard input c. Standard output d. Standard error
8. Transfer of information to and from main memory takes place in terms of _________.
a. Bytes b. Words c. Bits d. Nibbles
13. A 1000 MB hard disk has 512-byte sectors. Each track on the disk has 1000 sectors. The number of tracks on the
disk is ___________.
a.1024 b.2048 c.512 d.1000
14. Which of the following is not an advantage provided by shared libraries?
a. They save disk space b. They save space in main memory
c. Multiple versions of the same library can be loaded into main memory d. None of the above
17. Which of the following is not a solution for the critical section problem?
a. Monitor b. Semaphore c. Critical Region construct d. Segmentation
19. Paging is the transfer of pages between main memory and the ___________.
a. Kernel b. Computer system c. Auxiliary store d. Output device
20. Which of the following commands is used to count the total number of lines, words and characters contained in
a file?
a. count p b. wc c. wcount d.countw
21. The size of the virtual memory depends on the size of the ___________.
a. Address bus b. Data bus c. Memory bus d. None of the above
40
Vidyanidhi Info Tech Academy
PG DAC Question Bank
a. Processing b. kilobyte c. Binary d. Representational
25. The components that take data are located in the __________.
a. Input devices b. output devices c. system unit d. storage component
27. The heart of any computer is processing the input in order to provide useful ______________.
a. Information b. Output c. Kernel d. Communication
28. Which of the following memory management schemes does not allow multiprogramming? 3
a. Fixed partition b. Dynamic partition c. Single-user contiguous scheme d. Relocatable dynamic partitions
29. Which of the following is the correct way of calculating the address of the page frame?
a. Multiply the page frame number by the page frame size b. Divide the page frame size by the page frame number
c. Add the page frame number and the page frame size d. Multiply the page frame number by the Displacement
31.The total effect of all CPU cycles, from both I/O-bound and CPU-bound jobs, approximates which of the following
distribution curves?
a. Gaussian distribution b. Poisson distribution c. Lorentzian Distribution d. Random Distribution
32. Which of the following storage allocation scheme results in the problem of fragmentation?
a. Contiguous storage b. Non-contiguous storage c. Indexed storage d. Direct storage
41
Vidyanidhi Info Tech Academy
PG DAC Question Bank
33. Which of the following commands in UNIX gives the user the capability of executing one program from another
program?
a. nice b. fork c. exexv d. nohup
35. What kind of CPU burst an I/O-bound program would typically have?
a. Long b. Short c. Average d. All of the above
37. The ___________ command will display the absolute pathname for the directory that you are working in. 2
a. dir b.pwd c.ls d. whereami
38. Which command would you use to create a sub-directory in your home directory?
a. mkdir b. dir c. cp d. rm
39. Which command can be used to display the contents of a file on the screen?
a.ls b.cat c. dog d. grep
42. Using the SJF algorithm, which process is allocated the CPU first? 3
a. The process that requests the CPU first b. The process that requests the CPU last
c. The process with the smallest CPU execution time d. None of the above
42
Vidyanidhi Info Tech Academy
PG DAC Question Bank
43. Which of the following is not a scheduling algorithm?
a. First-Come First-Serve b. Round Bear c. Shortest Job First d. None of the above
45. What will be the order when information is processed with direct access?
a. Any order b. Sequential order c. Non-sequential order d. None of the above
46.What will be the order when information is processed with sequential access?
a. Any order b. Sequential order c. Non-sequential order d. None of the above
53. The ____________________ is used to store the highest location in memory accessible by each program.
43
Vidyanidhi Info Tech Academy
PG DAC Question Bank
54. ____________________ is the process of collecting fragments of available memory space into contiguous blocks
by moving programs and data in a computer’s memory or disk.
55. Which of the following are the disadvantages of a fixed partition scheme (choose all that apply)?
a. Requires that the entire program be loaded into memory
b. Requires that the entire program be stored contiguously
c. Requires that the entire program remain in memory until the job is completed
d. Does not allow multiprogramming
56. The phenomenon of partial usage of fixed partitions and the coinciding creation of unused spaces within the
partition is called ________________
5. Which system call will you use to get the parent of the process?
a. getp() b. getppid() c. getparentid() d. None of the above
44
Vidyanidhi Info Tech Academy
PG DAC Question Bank
a. Memory management b. Debuggers management
c. Interrupt management d. Timer and clock management
12. ________ signal generate when we try to access the illegal memory location using invalid pointer.
a. SIGSTOP b. SIGSEGV c. SIGTERM d. SIGNULL
13. What will be the possibility, when process comes in wait or block state?
a. disk operation b. time slice expire c. due to the higher priority process arrival d. All of the above
15. Which command can be use on Linux platform to shutdown the system?
a. shutdown –r now b. shutdown c. init 0 d. init 6
17. Which Inter Process Communication mechanism is fastest to exchange the data between processes?
a. PIPE b. FIFO c. Shared Memory d. Message Queue
29. What happens when a page fault occur for a valid legal virtual address?
a. Process will terminate b. Process will block c. None of the above
d. The process will restart after the page is brought to the main memory and page table entry will update.
30. What happens when a page fault occur for an invalid_illegal virtual address?
a. Process will terminate b. Process will block c. All of the above
d. The process will restart after the page is brought to the main memory and page table entry will update.
46
Vidyanidhi Info Tech Academy
PG DAC Question Bank
33. How can we find out the free space size to use on Linux system hard disk partition?
a. df –hs b. freedisk –hs c. fdisk –hs d. None of the above
34. How can we get the information about the CPU on the Linux system?
a. cat /usr/cpuinfo b. cat /proc/cpuinfo c. cat /root/proc/cpuinfo d. cat /root/usr/cpuinfo
35. Where the main system message log file information get stored?
a. /var/log/message b. /usr/log/message c. /src/log/message d. /root/log/message
36. Which is the Linux kernel image file from the following and what is location in the file system?
a. kimage and location is /boot b. kernelimage and location is /usr
c. vmliunz and location is /boot d. kimage and location is /usr
45. Which CPU scheduling algorithm is non-preemptive type from the following?
a. Shortest job first scheduling. b. Round robin scheduling.
c. Priority based scheduling. d. First come first serve based scheduling.
48
Vidyanidhi Info Tech Academy
PG DAC Question Bank
50. What are the resources for the computer system?
a. CPU cycles. b. System buses. c. Operating system code and data structure. d. All of the above
Operating Systems
Q.1 Fill in the blanks:
3. Short-term Scheduler or CPU-Scheduler_____________ scheduler selects the process that is ready to execute to CPU.
7. ___________is an example of shareable resource and ______________ is an example for non shareable resource.
8. _FIFO_ and _Optimum page replacement algorithm_ are the popular page replacement algorithms.
10. Give the expansion of the following with reference to the operating systems concepts: FCB is
12. Throughput in case of multiprogramming is Number of programs processed by it per unit time _.
13. ________________________________is process of modifying the addresses used in the address sensitive
14. instructions of a program such that the program can execute correctly from the designated area of memory.
15. A program is a Passive entity , whereas a process is a Active entity.
20. _______________________________________.
21. Multiprogramming degenerates to _________________________ system if there is no proper mix of CPU and I/O
bound jobs.
22. DMA stands for _ direct memory access __
49
Vidyanidhi Info Tech Academy
PG DAC Question Bank
24. _____________________________.
27. A ____________________________ operating system is an operating system which requires a timely response from a
computer system.
28. ______________________ is a program in execution.
40. Short-term Scheduler or CPU-Scheduler scheduler selects the process that is ready to execute to CPU.
43. __________is an example of shareable resource and ________ is an example for nonshareable resource.
44. ________ and ______ are the popular page replacement algorithms.
50
Vidyanidhi Info Tech Academy
PG DAC Question Bank
48. Short-term Scheduler or CPU-Scheduler scheduler selects the process that is ready to execute to CPU.
50. ________ and ______ are the popular page replacement algorithms.
53. ________ is when more time is spent in paging than in actually running programs.
55. The process of loading the OS into main memory is done by the ___________.
56. The motivations behind networks are __________, ________, ___________ & _____________.
57. NRU stands for _______ and LRU stands for Least Recently used .
59. Thrashing is the coincidence of high paging traffic and low CPU utilization.
61. The OS maintains information about each process in a record called ________ .
62. ________ is a relation between number of page faults and number of page frames allocated to a process.
63. ________ is the implementation method in case of MS-DOS for non-contiguous allocation.
64. ________ is a mechanism whereby the output of one process is directed into input of another process.
65. The time elapsed for position of Read/Write head under the desired sector is called ________ .
66. ________ , ________ are the two ways to achieve relocation and address translation.
70. ___________is an example of shareable resource and ______________ is an example for non-shareable resource.
9. The signal the keyboard sends to the computer is a special kind of message called ___.
a. keyboard request b. keyboard controller c. interrupt controller d. interrupt request
11. The interval from the time of submission of a process to the time of completion is _____.
a. Turnaround time b. Waiting time c. Response time
13. Which of the following CPU scheduling algorithms will prevent starvation problem?
a. Shortest-job-first b. Priority-scheduling c. Priorit echanism y-scheduling with aging
d. None of the above
18. A file system uses the contiguous space allocation mechanism for disk space allocation. For better utilization of disk space,
this file system must use
a. A garbage collection mechanism b. A disk compaction mechanism c. A linked-block allocation mechanism
d. An indexed-block allocation mechanism
53
Vidyanidhi Info Tech Academy
PG DAC Question Bank
a. region tables, u area, system level context b. register context, pregion tables, user level context
c. system-level context, register context, user-level context d. process table, user-level context, register context
23. Suppose the architecture of a computer system is layered into the following four layers –
a. Operating systems software b. users’ applications software c. hardware d. programming environment software
24. Which of the following is a logical sequence of the four layers from bottom to top?
a. 1, 2, 3, 4 b. 1, 3, 4, 2 c. 3, 1, 4, 2 d. 3, 4, 1, 2
54
Vidyanidhi Info Tech Academy
PG DAC Question Bank
33. A virtual memory is required for -
a. increasing the speed b. increasing the addressing modes
c. overcoming the size limitation of main memory d. overcoming the size limitation of cache memory
37. How well CPU interacts with the rest of the system
a. Both a and b b. None of the above
41. Which of the following CPU scheduling algorithms will prevent starvation problem?
a. Shortest-job-first b. Priority-scheduling c. Priority-scheduling with aging mechanism d. None of the above
46. A file system uses the contiguous space allocation mechanism for disk space allocation. For better utilization of disk space,
this file system must use
a. A garbage collection mechanism b. A disk compaction mechanism c. A linked-block allocation mechanism
55
Vidyanidhi Info Tech Academy
PG DAC Question Bank
d. An indexed-block allocation mechanism
47. Peak Bandwidth of a 64-bit, 33 MHz based PCI bus would be:
a. 133 MB/s b. 266 MB/s c. 512 MB/s d. 33 MB/s
50. Which of the following operating systems is available for non-intel platforms ?
a. Windows-NT b. Solaris c. linux d. all of the above.
51. In the systems which do not have multiple CPUs, is the ’cache coherency’ an issue while design?
a. Yes b. No
8. “It is possible to support multiprogramming without using timesharing. However it is impractical to support
timesharing without using multiprogramming”
12. What do you mean by “protection” incase of operating systems? How is it implemented?
19. Name secondary storage devices and explain where they are typically used.
22. Which condition(s) is/are very necessary for a deadlock. Justify your answer.
25. Give one difference between a .COM file and .EXE file in DOS.
31. Differentiate between the logical address space and physical address space.
57
Vidyanidhi Info Tech Academy
PG DAC Question Bank
32. Explain in brief what you mean by: 1.Multiprogramming 2.Multiprocessing.
33. Name the five typical file operations.
35. A process can change its state from block state to run state. Is this statement True or False? Justify your answer.
36. Can we prevent deadlocks by denying mutual-exclusion condition? Justify your answer.
37. How many different types of files are possible on UNIX operating system ?
2. 4,3, 2,1,4,3,5,4,3,2,1,5,2.
4. Considering the above reference string show how Belady’s anomaly occurs in case of FIFO.
6. With the help of an example show the mapping from virtual address space to physical address space in case of virtual
memory.
7. List the fields of the FCB and explain their use.
10. Which condition(s) is/are very necessary for a deadlock? Justify your answer.
58
Vidyanidhi Info Tech Academy
PG DAC Question Bank
11. Discuss the use of Active file tables.
59
Vidyanidhi Info Tech Academy
PG DAC Question Bank
60
EOS-MCQ
1. For which of the following offset can be positive or negative?
a) SEEK_SET
b) SEEK_END
c) SEEK_CUR
d) All of the above
e) None of the above
2. In which of the IPC mechanism, data is not copied from user space to kernel space and vice
a versa?
a) Pipe
b) Message queue
c) Shared memory
d) Socket
4. In which of the following state change in child process, performing wait allows the system
to release the resources associated with child process?
a) the child terminated
b) the child was stopped by a signal
c) the child was resumed by a signal
d) All of the above
5. Which of the following is not used to examine and change the signal action?
a) Signal
b) Sigaction
c) Sigprocmask
d) All of the above
6. Select the value of mode if O_CREAT flag is provided in open system call to give
permissions as user - read, write; group - read; others – nothing
a) 0640
b) 0644
c) 0460
d) 0464
10. If the size of logical address space is 2 to the power of m, and a page size is 2 to the power
of n addressing units, then the high order bits of a logical address designate the page
number, and the low order bits designate the page offset.
a) m, n
b) n, m
c) m – n, m
d) m – n, n
13. Thrashing
a) reduces page I/O
b) decreases the degree of multiprogramming
c) implies excessive page I/O
d) improves the system performance
14. While fork(), the child's set of pending signals is initially ___________.
a) filled with same as parent
b) empty
c) filled except masked signals in parent
d) None of the above
15. The child does not inherit _________.
a) semaphore adjustments from its parent
b) its parent's memory locks
c) timers from its parent
d) All of the above
e) None of the above
16. Which of the following architecture does not support embedded operating system?
a) semaphore adjustments from its parent
b) its parent's memory locks
c) timers from its parent
d) All of the above
e) None of the above
17. ____________ provide the information about the existence of files, their location on
secondary memory, their current status and other attributes.
a) Memory Table
b) I/O Table
c) File Tables
d) Process Tables
23. __________ is a technique of gradually increasing the priority of the processes that wait in the
system for a long time.
a) Starvation
b) Waiting queue
c) Aging
d) None of the above
24. Multiple source files are compiled together to form a single kernel binary image. Such a
kernel called as __________.
a) Micro-kernel
b) Monolithic kernel
c) Modular kernel
d) Hybrid kernel
29. Each thread has its own user stack and no kernel stack.
a) True
b) False
33. fork() returns non zero value in child process and zero in parent process.
a) False
b) True
36. The two ways of aborting processes and eliminating deadlocks are _____________.
a) Abort all deadlocked processes
b) Abort all processes
c) Abort one process at a time until the deadlock cycle is eliminated
d) All of the mentioned
39. What will happen if a non-recursive mutex is locked more than once?
a) Starvation
b) Deadlock
c) Aging
d) Signaling
40. The signal operation of the semaphore basically works on the basic __________ system call.
a) continue()
b) start()
c) wakeup()
d) getup()
42. To access the services of operating system, the interface is provided by the ___________
a) System calls
b) API
c) Library
d) Assembly instructions
43. Which one of the following is not true?
a) kernel is the program that constitutes the central core of the operating system
b) kernel is the first part of operating system to load into memory during booting
c) kernel is made of various modules which cannot be loaded in running operating system
d) kernel remains in the memory during the entire computer session
44. Which one of the following error will be handle by the operating system?
a) power failure
b) lack of paper in printer
c) connection failure in the network
d) all of the mentioned
46. In Operating Systems, which of the following is/are CPU scheduling algorithms?
a) Round Robin
b) Shortest Job First
c) Priority
d) All of the mentioned
47. If a process fails, most operating system write the error information to a ______
a) log file
b) another running process
c) new file
d) none of the mentioned
48. Which facility dynamically adds probes to a running system, both in user
processes and in the kernel?
a) DTrace
b) DLocate
c) DMap
d) DAdd
49. Which one of the following is not a real time operating system?
a) VxWorks
b) QNX
c) RTLinux
d) Palm OS
50. The MacOS X has ____________
a) monolithic kernel
b) hybrid kernel
c) microkernel
d) monolithic kernel with modules
51. The systems which allow only one process execution at a time, are called __________
a) uniprogramming systems
b) uniprocessing systems
c) unitasking systems
d) none of the mentioned
59. Which system call can be used by a parent process to determine the termination
of child process?
a) wait
b) exit
c) fork
d) get
60. The address of the next instruction to be executed by the current process is
provided by the __________
a) CPU registers
b) Program counter
c) Process stack
d) Pipe
61. A Process Control Block(PCB) does not contain which of the following?
a) Code
b) Stack
c) Bootstrap program
d) Data
62. The number of processes completed per unit time is known as __________
a) Output
b) Throughput
c) Efficiency
d) Capacity
66. The entry of all the PCBs of the current processes is in __________
a) Process Register
b) Program Counter
c) Process Table
d) Process Unit
74. If all processes I/O bound, the ready queue will almost always be ______ and the
Short term Scheduler will have a ______ to do.
a) full, little
b) full, lot
c) empty, little
d) empty, lot
77. The primary distinction between the short term scheduler and the long term
scheduler is __________
a) The length of their queues
b) The type of processes they schedule
c) The frequency of their execution
d) None of the mentioned
78. The only state transition that is initiated by the user process itself is __________
a) block
b) wakeup
c) dispatch
d) none of the mentioned
79. In a time-sharing operating system, when the time slot given to a process is
completed, the process goes from the running state to the __________
a) Blocked state
b) Ready state
c) Suspended state
d) Terminated state
81. Suppose that a process is in “Blocked” state waiting for some I/O service. When
the service is completed, it goes to the __________
a) Running state
b) Ready state
c) Suspended state
d) Terminated state
82. The context of a process in the PCB of a process does not contain __________
a) the value of the CPU registers
b) the process state
c) memory-management information
d) context switch time
83. Which of the following need not necessarily be saved on a context switch between
processes?
a) General purpose registers
b) Translation lookaside buffer
c) Program counter
d) All of the mentioned
86. When several processes access the same data concurrently and the outcome of
the execution depends on the particular order in which the access takes place is
called ________
a) dynamic condition
b) race condition
c) essential condition
d) critical condition
87. If a process is executing in its critical section, then no other processes can be
executing in their critical section. What is this condition called?
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
94. Restricting the child process to a subset of the parent’s resources prevents any
process from __________
a) overloading the system by using a lot of secondary storage
b) under-loading the system by very less CPU utilization
c) overloading the system by creating a lot of sub-processes
d) crashing the system by utilizing multiple resources
95. A parent process calling _____ system call will be suspended until children
processes terminate.
a) wait
b) fork
c) exit
d) exec
96. Cascading termination refers to termination of all child processes if the parent
process terminates ______
a) Normally
b) Abnormally
c) Normally or abnormally
d) None of the mentioned
97. With _____________ only one process can execute at a time; meanwhile all other
process are waiting for the processor. With ______________ more than one process
can be running simultaneously each on a different processor.
a) Multiprocessing, Multiprogramming
b) Multiprogramming, Uniprocessing
c) Multiprogramming, Multiprocessing
d) Uniprogramming, Multiprocessing
98. In UNIX, each process is identified by its __________
a) Process Control Block
b) Device Queue
c) Process Identifier
d) None of the mentioned
99. In UNIX, the return value for the fork system call is _____ for the child process and
_____ for the parent process.
a) A Negative integer, Zero
b) Zero, A Negative integer
c) Zero, A nonzero integer
d) A nonzero integer, Zero
101. The child process completes execution, but the parent keeps executing, then the
child process is known as __________
a) Orphan
b) Zombie
c) Body
d) Dead
104. Which of the following two operations are provided by the IPC facility?
a) write & delete message
b) delete & receive message
c) send & delete message
d) receive & send message
105. Messages sent by a process __________
a) have to be of a fixed size
b) have to be a variable size
c) can be fixed or variable sized
d) none of the mentioned
106. The link between two processes P and Q to send and receive messages is called
__________
a) communication link
b) message-passing link
c) synchronization link
d) all of the mentioned
111. Bounded capacity and Unbounded capacity queues are referred to as __________
a) Programmed buffering
b) Automatic buffering
c) User defined buffering
d) No buffering
112. The initial program that is run when the computer is powered up is called
__________
a) boot program
b) bootloader
c) initializer
d) bootstrap program
124. Which module gives control of the CPU to the process selected by the short-term
scheduler?
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned
125. The processes that are residing in main memory and are ready and waiting to
execute are kept on a list called _____________
a) job queue
b) ready queue
c) execution queue
d) process queue
126. The interval from the time of submission of a process to the time of completion
is termed as ____________
a) waiting time
b) turnaround time
c) response time
d) throughput
127. Which scheduling algorithm allocates the CPU first to the process that requests
the CPU first?
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned
129. In priority scheduling algorithm, when a process arrives at the ready queue, its
priority is compared with the priority of ____________
a) all process
b) currently running process
c) parent process
d) init process
133. Which one of the following can not be scheduled by the kernel?
a) kernel level thread
b) user level thread
c) process
d) none of the mentioned
138. A process is selected from the ______ queue by the ________ scheduler, to be
executed.
a) blocked, short term
b) wait, long term
c) ready, short term
d) ready, long term
139. In the following cases non – preemptive scheduling occurs?
a) When a process switches from the running state to the ready state
b) When a process goes from the running state to the waiting state
c) When a process switches from the waiting state to the ready state
d) All of the mentioned
140. The switching of the CPU from one process or thread to another is called __________
a) process switch
b) task switch
c) context switch
d) all of the mentioned
150. With round robin scheduling algorithm in a time shared system ____________
a) using very large time slices converts it into First come First served scheduling
algorithm
b) using very small time slices converts it into First come First served scheduling
algorithm
c) using extremely small time slices increases performance
d) using very small time slices converts it into Shortest Job First algorithm
151. The portion of the process scheduler in an operating system that dispatches
processes is concerned with ____________
a) assigning ready processes to CPU
b) assigning ready processes to waiting queue
c) assigning running processes to blocked queue
d) all of the mentioned
154. The strategy of making processes that are logically runnable to be temporarily
suspended is called ____________
a) Non preemptive scheduling
b) Preemptive scheduling
c) Shortest job first
d) First come First served
156. There are 10 different processes running on a workstation. Idle processes are
waiting for an input event in the input queue. Busy processes are scheduled with
the Round-Robin time sharing method. Which out of the following quantum
times is the best value for small response times, if the processes have a short
runtime, e.g. less than 10ms?
a) tQ = 15ms
b) tQ = 40ms
c) tQ = 45ms
d) tQ = 50ms
157. Orders are processed in the sequence they arrive if _______ rule sequences the
jobs.
a) earliest due date
b) slack time remaining
c) first come, first served
d) critical ratio
158. Which of the following algorithms tends to minimize the process flow time?
a) First come First served
b) Shortest Job First
c) Earliest Deadline First
d) Longest Job First
159. Under multiprogramming, turnaround time for short jobs is usually ________ and
that for long jobs is slightly ___________
a) Lengthened; Shortened
b) Shortened; Lengthened
c) Shortened; Shortened
d) Shortened; Unchanged
162. The real difficulty with SJF in short term scheduling is ____________
a) it is too good an algorithm
b) knowing the length of the next CPU request
c) it is too complex to understand
d) none of the mentioned
165. An SJF algorithm is simply a priority algorithm where the priority is ____________
a) the predicted next CPU burst
b) the inverse of the predicted next CPU burst
c) the current CPU burst
d) anything the user wants
166. Choose one of the disadvantages of the priority scheduling algorithm?
a) it schedules in a very complex manner
b) its scheduling takes up a lot of time
c) it can lead to some low priority process waiting indefinitely for the CPU
d) none of the mentioned
169. Which of the following scheduling algorithms gives minimum average waiting
time?
a) FCFS
b) SJF
c) Round – robin
d) Priority
171. A situation where several processes access and manipulate the same data
concurrently and the outcome of the execution depends on the particular order
in which access takes place is called ____________
a) data consistency
b) race condition
c) aging
d) starvation
172. The segment of code in which the process may change common variables,
update tables, write into files is known as ____________
a) program
b) critical section
c) non – critical section
d) synchronizing
173. Which of the following conditions must be satisfied to solve the critical section
problem?
a) Mutual Exclusion
b) Progress
c) Bounded Waiting
d) All of the mentioned
175. Bounded waiting implies that there exists a bound on the number of times a
process is allowed to enter its critical section ____________
a) after a process has made a request to enter its critical section and before the
request is granted
b) when another process is in its critical section
c) before a process has made a request to enter its critical section
d) none of the mentioned
185. The signal operation of the semaphore basically works on the basic _______ system
call.
a) continue()
b) wakeup()
c) getup()
d) start()
187. The code that changes the value of the semaphore is ____________
a) remainder section code
b) non – critical section code
c) critical section code
d) none of the mentioned
Process P1
wait(S1);
release(S0);
Process P2
wait(S2);
release(S0);
How many times will P0 print ‘0’?
a) At least twice
b) Exactly twice
c) Exactly thrice
d) Exactly once
190. Two processes, P1 and P2, need to access a critical section of code. Consider the
following synchronization construct used by the processes.
Process P1 :
while(true)
{
w1 = true;
while(w2 == true);
Critical section
w1 = false;
}
Remainder Section
Process P2 :
while(true)
{
w2 = true;
while(w1 == true);
Critical section
w2 = false;
}
Remainder Section
Here, w1 and w2 have shared variables, which are initialized to false. Which one
of the following statements is TRUE about the above construct?
a) It does not ensure mutual exclusion
b) It does not ensure bounded waiting
c) It requires that processes enter the critical section in strict alternation
d) It does not prevent deadlocks but ensures mutual exclusion
Process B
int Z;
B1: Z = X+1;
B2: X = Z;
X is set to 5 before either process begins execution. As usual, statements within
a process are executed sequentially, but statements in process A may execute in
any order with respect to statements in process B.
How many different values of X are possible after both processes finish
executing?
a) two
b) three
c) four
d) eight
197. The program follows to use a shared binary semaphore T.
Process A
int Y;
A1: Y = X*2;
A2: X = Y;
signal(T);
Process B
int Z;
B1: wait(T);
B2: Z = X+1;
X = Z;
T is set to 0 before either process begins execution and, as before, X is set to 5.
Now, how many different values of X are possible after both processes finish
executing?
a) one
b) two
c) three
d) four
200. In the bounded buffer problem, there are the empty and full semaphores that
__________
a) count the number of empty and full buffers
b) count the number of empty and full memory spaces
c) count the number of empty and full queues
d) none of the mentioned
205. All processes share a semaphore variable mutex, initialized to 1. Each process
must execute wait(mutex) before entering the critical section and signal(mutex)
afterward.
Suppose a process executes in the following manner.
signal(mutex);
.....
critical section
.....
wait(mutex);
In this situation :
a) a deadlock will occur
b) processes will starve to enter critical section
c) several processes maybe executing in their critical section
d) all of the mentioned
206. All processes share a semaphore variable mutex, initialized to 1. Each process
must execute wait(mutex) before entering the critical section and signal(mutex)
afterward.
Suppose a process executes in the following manner.
wait(mutex);
.....
critical section
.....
wait(mutex);
a) a deadlock will occur
b) processes will starve to enter critical section
c) several processes maybe executing in their critical section
d) all of the mentioned
207. Consider the methods used by processes P1 and P2 for accessing their critical
sections whenever needed, as given below. The initial values of shared boolean
variables S1 and S2 are randomly assigned.
Method used by P1 :
while(S1==S2);
Critical section
S1 = S2;
Method used by P2 :
while(S1!=S2);
Critical section
S2 = not(S1);
Which of the following statements describes properties achieved?
a) Mutual exclusion but not progress
b) Progress but not mutual exclusion
c) Neither mutual exclusion nor progress
d) Both mutual exclusion and progress
216. Which one of the following is a visual ( mathematical ) way to determine the
deadlock occurrence?
a) resource allocation graph
b) starvation graph
c) inversion graph
d) none of the mentioned
221. For a deadlock to arise, which of the following conditions must hold
simultaneously?
a) Mutual exclusion
b) No pre-emption
c) Hold and wait
d) All of the mentioned
227. To ensure that the hold and wait condition never occurs in the system, it must
be ensured that ____________
a) whenever a resource is requested by a process, it is not holding any other resources
b) each process must request and be allocated all its resources before it begins its
execution
c) a process can request resources only when it has none
d) all of the mentioned
228. The disadvantage of a process being allocated all its resources before beginning
its execution is ____________
a) Low CPU utilization
b) Low resource utilization
c) Very high resource utilization
d) None of the mentioned
230. One way to ensure that the circular wait condition never holds is to ____________
a) impose a total ordering of all resource types and to determine whether one
precedes another in the ordering
b) to never let a process acquire resources that are held by other processes
c) to let a process wait for only one resource at a time
d) all of the mentioned
231. CPU fetches the instruction from memory according to the value of ____________
a) program counter
b) status register
c) instruction register
d) program status word
234. Run time mapping from virtual to physical address is done by ____________
a) Memory management unit
b) CPU
c) PCI
d) None of the mentioned
235. Memory management technique in which system stores and retrieves data from
secondary storage for use in main memory is called?
a) fragmentation
b) paging
c) mapping
d) none of the mentioned
246. The operating system and the other processes are protected from being
modified by an already running process because ____________
a) they are in different memory spaces
b) they are in different logical addresses
c) they have a protection algorithm
d) every address generated by the CPU is being checked against the relocation
and limit registers
248. Using transient code, _______ the size of the operating system during program
execution.
a) increases
b) decreases
c) changes
d) maintains
249. When memory is divided into several fixed sized partitions, each partition may
contain ________
a) exactly one process
b) at least one process
c) multiple processes at once
d) none of the mentioned
255. If relocation is static and is done at assembly or load time, compaction _________
a) cannot be done
b) must be done
c) must not be done
d) can be done
256. The disadvantage of moving all process to one end of memory and all holes to
the other direction, producing one large hole of available memory is ____________
a) the cost incurred
b) the memory used
c) the CPU used
d) all of the mentioned
261. When the memory allocated to a process is slightly larger than the process, then
____________
a) internal fragmentation occurs
b) external fragmentation occurs
c) both internal and external fragmentation occurs
d) neither internal nor external fragmentation occurs
263. Logical memory is broken into blocks of the same size called _________
a) frames
b) pages
c) backing store
d) none of the mentioned
264. Every address generated by the CPU is divided into two parts. They are ____________
a) frame bit & page number
b) page number & page offset
c) page offset & frame bit
d) frame offset & page offset
265. The __________ is used as an index into the page table.
a) frame bit
b) page number
c) page offset
d) frame offset
266. The _____ table contains the base address of each page in physical memory.
a) process
b) memory
c) page
d) frame
269. The operating system maintains a ______ table that keeps track of how many
frames have been allocated, how many are there, and how many are available.
a) page
b) mapping
c) frame
d) memory
273. For larger page tables, they are kept in main memory and a __________ points to
the page table.
a) page table base register
b) page table base pointer
c) page table register pointer
d) page table base
277. If a page number is not found in the TLB, then it is known as a ____________
a) TLB miss
b) Buffer miss
c) TLB hit
d) All of the mentioned
278. An ______ uniquely identifies processes and is used to provide address space
protection for that process.
a) address space locator
b) address space identifier
c) address process identifier
d) none of the mentioned
279. The percentage of times a page number is found in the TLB is known as
____________
a) miss ratio
b) hit ratio
c) miss percent
d) none of the mentioned
281. When the valid – invalid bit is set to valid, it means that the associated page
____________
a) is in the TLB
b) has data in it
c) is in the process’s logical address space
d) is the system’s physical address space
283. When there is a large logical address space, the best way of paging would be
____________
a) not to page
b) a two level paging algorithm
c) the page table itself
d) all of the mentioned
284. In a paged memory, the page hit ratio is 0.35. The required to access a page in
secondary memory is equal to 100 ns. The time required to access a page in
primary memory is 10 ns. The average time required to access a page is?
a) 3.0 ns
b) 68.0 ns
c) 68.5 ns
d) 78.5 ns
285. To obtain better memory utilization, dynamic loading is used. With dynamic
loading, a routine is not loaded until it is called. For implementing dynamic
loading ____________
a) special support from hardware is required
b) special support from operating system is essential
c) special support from both hardware and operating system is essential
d) user programs can implement dynamic loading without any special support
from hardware or operating system
286. In paged memory systems, if the page size is increased, then the internal
fragmentation generally ____________
a) becomes less
b) becomes more
c) remains constant
d) none of the mentioned
288. In paging the user provides only ________ which is partitioned by the hardware
into ________ and ______
a) one address, page number, offset
b) one offset, page number, address
c) page number, offset, address
d) none of the mentioned
293. When the entries in the segment tables of two different processes point to the
same physical location ____________
a) the segments are invalid
b) the processes get blocked
c) segments are shared
d) all of the mentioned
295. If there are 32 segments, each of size 1Kb, then the logical address should have
____________
a) 13 bits
b) 14 bits
c) 15 bits
d) 16 bits
296. Consider a computer with 8 Mbytes of main memory and a 128K cache. The
cache block size is 4 K. It uses a direct mapping scheme for cache management.
How many different main memory blocks can map onto a given physical cache
block?
a) 2048
b) 256
c) 64
d) 8
297. A multilevel page table is preferred in comparison to a single level page table for
translating virtual address to physical address because ____________
a) it reduces the memory access time to read or write a memory location
b) it helps to reduce the size of page table needed to implement the virtual
address space of a process
c) it is required by the translation lookaside buffer
d) it helps to reduce the number of page faults in page replacement algorithms
299. The first linux kernel which supports the SMP hardware?
a) linux 0.1
b) linux 1.0
c) linux 1.2
d) linux 2.0
300. Which one of the following linux file system does not support journaling feature?
a) ext2
b) ext3
c) ext4
d) none of the mentioned
309. If one thread opens a file with read privileges then ___________
a) other threads in the another process can also read from that file
b) other threads in the same process can also read from that file
c) any other thread can not read from that file
d) all of the mentioned
310. The time required to create a new thread in an existing process is ___________
a) greater than the time required to create a new process
b) less than the time required to create a new process
c) equal to the time required to create a new process
d) none of the mentioned
311. When the event for which a thread is blocked occurs?
a) thread moves to the ready queue
b) thread remains blocked
c) thread completes
d) a new thread is provided
315. The register context and stacks of a thread are deallocated when the thread?
a) terminates
b) blocks
c) unblocks
d) spawns
326. Because the kernel thread management is done by the Operating System itself
___________
a) kernel threads are faster to create than user threads
b) kernel threads are slower to create than user threads
c) kernel threads are easier to manage as well as create then user threads
d) none of the mentioned
329. Which of the following system calls does not return control to the calling point,
on termination?
a) fork
b) exec
c) ioctl
d) longjmp
337. Signals that occur at the same time, are presented to the process ____________
a) one at a time, in a particular order
b) one at a time, in no particular order
c) all at a time
d) none of the mentioned
338. Which of the following is not TRUE?
a) Processes may send each other signals
b) Kernel may send signals internally
c) A field is updated in the signal table when the signal is sent
d) Each signal is maintained by a single bit
340. The three ways in which a process responds to a signal are ____________
a) ignoring the signal
b) handling the signal
c) performing some default action
d) all of the mentioned
343. The _______ maintains pending and blocked bit vectors in the context of each
process.
a) CPU
b) Memory
c) Process
d) Kernel
344. In UNIX, the set of masked signals can be set or cleared using the ________
function.
a) sigmask
b) sigmaskproc
c) sigprocmask
d) sigproc
345. The usefulness of signals as a general inter process communication mechanism
is limited because ____________
a) they do not work between processes
b) they are user generated
c) they cannot carry information directly
d) none of the mentioned
347. In UNIX, the abort() function sends the ________ signal to the calling process,
causing abnormal termination.
a) SIGTERM
b) SIGSTOP
c) SIGABORT
d) SIGABRT
348. In most cases, if a process is sent a signal while it is executing a system call
____________
a) the system call will continue execution and the signal will be ignored completely
b) the system call is interrupted by the signal, and the signal handler comes in
c) the signal has no effect until the system call completes
d) none of the mentioned
349. A process can never be sure that a signal it has sent _____________
a) has which identifier
b) has not been lost
c) has been sent
d) all of the mentioned
351. Because of virtual memory, the memory can be shared among ____________
a) processes
b) threads
c) instructions
d) none of the mentioned
352. _____ is the concept in which a process is copied into the main memory from the
secondary memory according to the requirement.
a) Paging
b) Demand paging
c) Segmentation
d) Swapping
355. When a program tries to access a page that is mapped in address space but not
loaded in physical memory, then ____________
a) segmentation fault occurs
b) fatal error occurs
c) page fault occurs
d) no error occurs
357. In FIFO page replacement algorithm, when a page must be replaced ____________
a) oldest page is chosen
b) newest page is chosen
c) random page is chosen
d) none of the mentioned
358. Which algorithm chooses the page that has not been used for the longest period
of time whenever the page required to be replaced?
a) first in first out algorithm
b) additional reference bit algorithm
c) least recently used algorithm
d) counting based page replacement algorithm
359. A process is thrashing if ____________
a) it is spending more time paging than executing
b) it is spending less time paging than executing
c) page fault occurs
d) swapping can not take place
360. Working set model for page replacement is based on the assumption of
____________
a) modularity
b) locality
c) globalization
d) random access
364. The ability to execute a program that is only partially in memory has benefits
like ____________
a) The amount of physical memory cannot put a constraint on the program
b) Programs for an extremely large virtual space can be created
c) Throughput increases
d) All of the mentioned
367. Segment replacement algorithms are more complex than page replacement
algorithms because ____________
a) Segments are better than pages
b) Pages are better than segments
c) Segments have variable sizes
d) Segments have fixed sizes
370. The valid – invalid bit, in this case, when valid indicates?
a) the page is not legal
b) the page is illegal
c) the page is in memory
d) the page is not in memory
372. When a page fault occurs, the state of the interrupted process is ____________
a) disrupted
b) invalid
c) saved
d) none of the mentioned
373. When a process begins execution with no pages in memory?
a) process execution becomes impossible
b) a page fault occurs for every page brought into memory
c) process causes system crash
d) none of the mentioned
374. If the memory access time is denoted by ‘ma’ and ‘p’ is the probability of a page
fault (0 <= p <= 1). Then the effective access time for a demand paged memory is
____________
a) p x ma + (1-p) x page fault time
b) ma + page fault time
c) (1-p) x ma + p x page fault time
d) none of the mentioned
376. Locality of reference implies that the page reference being made by a process
____________
a) will always be to the page used in the previous page reference
b) is likely to be one of the pages used in the last few page references
c) will always be one of the pages existing in memory
d) will always lead to page faults
377. ______ is a unique tag, usually a number identifies the file within the file system.
a) File identifier
b) File name
c) File type
d) None of the mentioned
381. Which file is a sequence of bytes organized into blocks understandable by the
system’s linker?
a) object file
b) source file
c) executable file
d) text file
384. Mapping of network file system protocol to local file system is done by ____________
a) network file system
b) local file system
c) volume manager
d) remote mirror
385. Which one of the following explains the sequential file access method?
a) random access according to the given byte number
b) read bytes one at a time, in order
c) read/write sequentially by record
d) read/write randomly by record
388. The heads of the magnetic disk are attached to a _____ that moves all the heads
as a unit.
a) spindle
b) disk arm
c) track
d) none of the mentioned
389. The set of tracks that are at one arm position make up a ___________
a) magnetic disks
b) electrical disks
c) assemblies
d) cylinders
390. The time taken to move the disk arm to the desired cylinder is called the
____________
a) positioning time
b) random access time
c) seek time
d) rotational latency
391. The time taken for the desired sector to rotate to the disk head is called
____________
a) positioning time
b) random access time
c) seek time
d) rotational latency
392. When the head damages the magnetic surface, it is known as _________
a) disk crash
b) head crash
c) magnetic damage
d) all of the mentioned
393. A floppy disk is designed to rotate ___________ as compared to a hard disk drive.
a) faster
b) slower
c) at the same speed
d) none of the mentioned
394. What is the host controller?
a) controller built at the end of each disk
b) controller at the computer end of the bus
c) all of the mentioned
d) none of the mentioned
395. ______ controller sends the command placed into it, via messages to the _____
controller.
a) host, host
b) disk, disk
c) host, disk
d) disk, host
398. If a process needs I/O to or from a disk, and if the drive or controller is busy then
____________
a) the request will be placed in the queue of pending requests for that drive
b) the request will not be processed and will be ignored completely
c) the request will be not be placed
d) none of the mentioned
399. Consider a disk queue with requests for I/O to blocks on cylinders.
98 183 37 122 14 124 65 67
Considering FCFS (first cum first served) scheduling, the total number of head
movements is, if the disk head is initially at 53 is?
a) 600
b) 620
c) 630
d) 640
400. Consider a disk queue with requests for I/O to blocks on cylinders.
98 183 37 122 14 124 65 67
Considering SSTF (shortest seek time first) scheduling, the total number of head
movements is, if the disk head is initially at 53 is?
a) 224
b) 236
c) 245
d) 240
402. Magnetic tape drives can write data at a speed ________ disk drives.
a) much lesser than
b) comparable to
c) much faster than
d) none of the mentioned
403. On media that use constant linear velocity (CLV), the _____________ is uniform.
a) density of bits on the disk
b) density of bits per sector
c) the density of bits per track
d) none of the mentioned
405. In the ______ algorithm, the disk arm starts at one end of the disk and moves
toward the other end, servicing requests till the other end of the disk. At the
other end, the direction is reversed and servicing continues.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
406. In the _______ algorithm, the disk head moves from one end to the other, servicing
requests along the way. When the head reaches the other end, it immediately
returns to the beginning of the disk without servicing any requests on the return
trip.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
407. In the ______ algorithm, the disk arm goes as far as the final request in each
direction, then reverses direction immediately without going to the end of the
disk.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
408. The process of dividing a disk into sectors that the disk controller can read and
write, before a disk can store data is known as ____________
a) partitioning
b) swap space creation
c) low-level formatting
d) none of the mentioned
410. The header and trailer of a sector contain information used by the disk
controller such as _________ and _________
a) main section & disk identifier
b) error correcting codes (ECC) & sector number
c) sector number & main section
d) disk identifier & sector number
411. The two steps the operating system takes to use a disk to hold its files are _______
and ________
a) partitioning & logical formatting
b) swap space creation & caching
c) caching & logical formatting
d) logical formatting & swap space creation
412. The _______ program initializes all aspects of the system, from CPU registers to
device controllers and the contents of main memory, and then starts the
operating system.
a) main
b) bootloader
c) bootstrap
d) rom
416. In SCSI disks used in high end PCs, the controller maintains a list of _________ on
the disk. The disk is initialized during ________ formatting which sets aside spare
sectors not visible to the operating system.
a) destroyed blocks, high level formatting
b) bad blocks, partitioning
c) bad blocks, low level formatting
d) destroyed blocks, partitioning
418. By default if any regular file is created, the number of link is displayed as 1 ?
a) True
b) False
419. How many links are created when we creat a directory file?
a) 1
b) 2
c) 3
d) 4
420. A user creates a link to a file file1 using the following command “ln file1 file2”.
Which of the following is not true?
a) file1 and file2 have the same inode numbers
b) The number of links for file1 is displayed as 1
c) The number of links for file1 is displayed as 2
d) The number of links for file2 is displayed as 2
421. There are two hard links to the “file1” say hl and h2 and a softlink sl. What
happens if we deleted the “file1”?
a) We will still be able to access the file with hl and h2 but not with sl
b) We will not be able to access the file with hl and h2 but with sl
c) We will be able to access the file with any of hl, h2 and sl
d) We will not be able to access the file with any of hl, h2 and sl
422. If two files on same partition point to the same inode structure they are called
a) Soft links
b) Hard links
c) Alias
d) Special files
428. What UNIX command is used to update the modification time of a file?
a) time
b) modify
c) cat
d) touch
429. Which of the following time stamps need not exist for a file on traditional unix
file system
a) Access Time
b) Modification Time
c) Creation Time
d) Change Time
431. Which option of rmdir command will remove all directories a, b, c if path is a/b/c
a) –b
b) –o
c) –p
d) –t
434. Executing the ‘cd ..’ command when at the root level causes
a) Error message indicating the user can’t access beyond the root level
b) Behavior is unix-flavor dependent
c) Results in changing to the ‘home’ directory
d) Nothing happens
438. Any file’s attribute information is stored in which structure on the disk
a) Inode
b) Data blocks
c) File blocks
d) Directory file
439. The soft link will increase the link counter of the file.(T/F)
a) True
b) False
440. When you use the ln command, which of the following occurs?
a) a file is created that points to an existing file
b) a file is created that is a copy of an existing file
c) a file is moved from one location to another
d) a file is renamed
441. srwxr-xrw- is a
a) internet socket file
b) unix domain socket file
c) symbolic link
d) shared file
446. Which of the following is not correct statement regarding file types?
a) Hard links share same inode number
b) Soft links cannot be created across partitions
c) Socket files are Unix domain sockets
d) Character file is a special file
447. Which are the two types of device files?
a) Character & Block
b) Character & Socket
c) Block & FIFO
d) Input & output
458. If user tries to remove (rm) a readonly file (444 permission), what will happen?
a) The file is removed successfully (and silently)
b) The rm command prompts for a confirmation, the command is successful
upon confirmation
c) The rm command prompts for a confirmation, however the operation fails because
of insufficient permissions
d) The rm command fails because of insufficient permissions
459. A user does a chmod operation on a file. Which of the following is true?
a) The last accessed time of the file is updated
b) The last modification time of the file is updated
c) The last change time of the file is updated
d) None of the mentioned
460. If the umask value is 0002. what will be the permissions of new directory
a) 777
b) 775
c) 774
d) 664
461. What is the command to set the execute permissions to all the files and
subdirectories within the directory /home/user1/direct
a) chmod –r +x /home/user1/direct
b) chmod –R +x /home/user1/direct
c) chmod –f –r +x /home/user1/direct
d) chmod –F +x /home/user1/direct
463. With a umask value of 112, what is the default permission assigned to newly
created regular file?
a) —x–x-wx
b) -rw-rw-r–
c) -r-xr-x-r–
d) -rw-rw-r–
466. Which of these commands will set the permissions on file textfile to read and
write for the owner, read for the group, and nothing for everyone else?
a) chmod 046 textfile
b) chmod 640 textfile
c) chmod 310 textfile
d) chmod rw r nil textfile
467. If you are a root user, how can you grand execute permission only for the owner
of the file project1?
a) chmod +x project1
b) chmod u+x project1
c) chmod a+x project1
d) chmod U+X project1
470. Which of the following umask settings doesn’t allow execute permission to be
set by default on directory files
a) 222
b) 111
c) 000
d) 444
471. Which of the following umask settings allow execute permission to be set by
default on regular files
a) 222
b) 111
c) 000
d) None of the mentioned
474. Which among the following allows fast file system recovery?
a) Ext2
b) Journaling
c) Caching
d) Sysfs
475. Which filesystem can be used to change certain kernel parameters at runtime
using sysctl command?
a) Ext3
b) Sysfs
c) Ext4
d) Procfs
478. Which file contains the filesystems to be automatically mounted during boot?
a) /etc/mount
b) /etc/fstab
c) /etc/inittab
d) /etc/boot
479. ____ is a directory (which should exist), on which to mount the file system?
a) Root
b) Boot
c) Mount-point
d) Partition
480. Which command is used to mount file system read only.
a) mount –a
b) mount –v
c) mount –f
d) mount –r
486. The shell used for Single user mode shell is:
a) bash
b) Csh
c) ksh
d) sh
487. Single user mode shell runs as
a) Admin user
b) Root user
c) Normal user
d) Log user
489. Which daemon manages the physical memory by moving process from physical
memory to swap space when more physical memory is needed.
a) Sched daemon
b) Swap daemon
c) Init daemon
d) Process daemon
496. Which command can be executed by a user who is already logged into the
system, in order to change to the root user? (type the command without any
parameters)
a) su
b) root
c) chroot
d) user
499. Which of the following values for STAT column of ps command is not true:
a) status R means running
b) Status S means sleeping
c) Status E means exited
d) Status Z means zombie
500. When a child process exits before the parent process exits, which of the
following is true:
a) the child process becomes defunct
b) the parent process becomes defunct
c) if the parent process does not handle SIGCHLD, the child process becomes a
zombie
d) none of the mentioned
If the user kills the bash process, then which of the following is true?
a) the second a.out process is also terminated
b) the second a.out process becomes a defunct process
c) the first a.out process becomes a zombie process
d) init process becomes parent of second a.out process
502. The signal sent to a process when the Ctrl-C key is pressed is
a) KILL
b) TSTP
c) TERM
d) INT
512. Shell is ?
a) Command Interpreter
b) Interface between Kernel and Hardware
c) Interface between user and applications
d) Command Compiler
513. If a file with execute permissions set, but with unknown file format is executed
a) The file is passed to /bin/sh
b) The system returns an error
c) The current shell will try to execute it
d) None of the mentioned
518. The user bhojas logged in and performed the following sequence of command.
What will be the output of the last command?
$ cd project/module1
$ pwd
a) /home/bhojas/project/module1
b) /home/project/module1
c) /usr/bhojas/project/module1
d) project/module1
524. Which of these is the correct method for appending “foo” in /tmp/bar file?
a) echo foo > /tmp/bar
b) echo foo >> /tmp/bar
c) echo foo | /tmp/var
d) /tmp/bar < echo foo
529. From where would the read statement read if the following statements were
executed?
exec < file1
exec < file2
exec < file3
read line
a) It would read all the files
b) It would not read any files
c) It would read all the files in reverse order
d) It would read only file3
535. The process which terminates before the parent process exits becomes
a) Zombie
b) Orphan
c) Child
d) None of the mentioned
543. The maximum time slice that can be given to a process in Linux (where tick is
10ms) is
a) 150ms
b) 10ms
c) 300 ms
d) 600ms
545. On x86-32 Linux, at which address the code segment of the program starts?
a) 0x00000000
b) 0x08048000
c) 0x80000000
d) 0xbfff0000
546. On x86-32 Linux, at which address the user stack resides normally?
a) 0x00000000
b) 0x3fff0000
c) 0x7fff0000
d) 0xbfff0000
547. A system has 512MB of physical memory. Which among the following is not a
suitable virtual memory size for this system architecture?
a) 512MB
b) 256M
c) 4GB
d) None of the mentioned
550. Which sytem call can be used by a user process to lock a memory so that it
cannot be swapped out?
a) memory files()
b) memlock()
c) pipe()
d) active memory regions
554. If one of the thread in multithreaded process is blocked on an I/O, which of the
following is true?
a) The entire process with block if their is no kernel supported threads
b) Other threads of the process will continue to execute even if there is no kernel
supported threads
c) It depends on specific implementatation
d) All of the mentioned
559. What is the default number of files open per user process?
a) 0
b) 1
c) 2
d) 3
567. namei() is
a) ANSI C library function
b) C library function
c) System call
d) kernel routine
568. dup2(1,0)
a) closes the stdout and copies the stdin descriptor to stdout
b) closes the stdin and copies the stdout descriptor to stdin
c) will produce compilation error
d) None of the mentioned
int main() {
int pid;
signal (SIGKILL, sig_handler);
pid = fork();
if (pid==0) {
kill(getppid(), SIGKILL);
exit(0);
} else {
sleep(20);
}
return 0;
}
a) Error child cannot send a SIGKILL signal to parent
b) Parent goes to the signal handler, prints handled the signal and goes back to sleep
c) Parent goes to the signal handler, prints handled the signal and exits
d) Parent exits without going to the signal handler
587. Which is not the correct option for removing a message queue
a) ipcrm -Q
b) ipcrm -q
c) ipcrm -m
d) none of the mentioned
590. The structure which keeps the information about shared memory in the kernel
is
a) struct ipc_perm
b) struct semid_ds
c) struct shmid_ds
d) struct msgid_ds
600. Pick the run level to run Linux in multi user mode with networking?
a) 0
b) 3
c) 5
d) 6
602. System call can be implemented using which assembly instruction(s) on x86
processors?
a) int 0×80
b) sysenter
c) both int 0×80 & sysenter
d) None
603. x86 architecture uses big endian or little endian addressing mechanism?
a) little-endian
b) endian
c) big-endian
d) none of the mentioned
Take Linux MCQ Online Test & Quiz to test your knowledge
We have listed below the best Linux MCQ Questions that check your basic knowledge of Linux. This Linux
MCQ Online Test contains 25 best multiple-choice questions and answers. You have to select the right answer
to every question. these MCQs are very popular & helpful for the best preparation of Linux Interviews. Finally,
you can also download below the Linux MCQ with Answers PDF.
A. fsck
B. mkfs
C. mount
D. None of the mentioned
A. Shell
B. Kernel
C. Terminal
D. Command
A. /dev/
B. /etc/
C. /bin/
D. /root/
A. True
B. False
A. rm
B. dm
C. erase
D. delete
A. rdir
B. rd
C. rmdir
D. None of the above
A. 16
B. 1
C. 2
D. 4
A. mail
B. mesg
C. grep
D. write
Q10. Which of the following combination of keys is used to exit from terminal?
A. Ctrl + z
B. Ctrl + t
C. Ctrl + d
D. Ctrl + e
A. BSD
B. Ubuntu
C. CentOs
D. Redhat
A. session
B. script
C. both 1 and 2
D. None of the above
A. Renaming a file
B. Move the file to different directory.
C. Both 1 and 2
D. None of these
A. -20 to 0
B. -20 to 19
C. 0 to 19
D. 10 to 10
A. etx
B. ext2
C. etx3
D. mimix
A. ls -a
B. ls -l
C. ls -h
D. Is - k
Q18. Linux is an operating system based on UNIX and was first introduced by Linus
Torvalds.
A. True
B. False
A. extract
B. tee
C. exec
D. chgrp
Q20. Which of the following sign represents the user home directory?
A. .
B. /
C. ..
D. ~
A. tty
B. ctty
C. stty
D. None of above
A. os
B. unix
C. uname
D. kernel
A. kernel
B. uname -t
C. uname -r
D. uname -n
A. cat
B. zcat
C. type
D. None of above
3. The component responsible for moving pages in and out of physical memory is
A. Long term scheduler
B. Short term scheduler
C. Medium term scheduler
D. Dispatcher
6.. When OS at the explicit request of another process creates a process, this action is
………………..?
A. Process Reentrancy
B. Process Spawning
C. Process Synchronization
D. Process preemtiveness
9. Which level of scheduler should make a decision to determine which ready process
should be
assigned the CPU when it next becomes available?
A. Short-term scheduler.
B. Medium-term scheduler.
C. Long-term scheduler.
D. None of the above.
10. A scheduling algorithm (at the level of short-term scheduling) favors those
programs, which have used little processor time in the recent past. Which of the
following is true?
A. This algorithm favors I/O bound processes.
B. This algorithm favors CPU bound processes.
C. This algorithm permanently starves CPU bound processes.
D. This algorithm permanently starves I/O bound processes.
13. The list of processes waiting for a particular I/O device is called.
A. Device Queue
B. Job Queue
C. Ready Queue
D. All of these
15. The section of process program that uses the shared memory will be the ……….of
the process.
A. critical Section
B. process Control Block
C. Semaphore
D. pip
16. Process opens an existing file or creates a new file; kernel returns a non-negative
integer, what is the return integer?
A. Inode number
B. Process Indentifier
C. File descriptor
D. Process return value
17. User whose user id is 0, called as
1) root 2) normal user
3) superuser 4) no user
A. a)only 1
B. only 4
C. both 1 &2
D. both 1&3
18. What is return value of read system call when end of file occurs?
A. -1
B. 0
C. Program hangs
D. none of these
21. If we are passing signal number 9 in our program, which signal we are sending?
A. SIGINT
B. SIGQUIT
C. SIGKILL
D. SIGSTOP
23. Which function will be used for deleting the message queue.
A. msgrcv
B. msgctl
C. msgget
D. msgrm
26. What happen when value of semaphore variable will be less than zero?
A. Value of semaphore will never go to zero.
B. All processes will be in wait state.
C. All processes have finished their execution.
D. None of these.
31.Device number is a 32 bit number out of which ….bit is major number and ..bit is
minor number.
A. 20,12
B. 12, 20
C. 24 ,8
D. None of these
39. In the definition of a real time system, which of the following is not true?
A. A real time system reacts to events in the environment by performing predefined
actions within specified time.
B. Logical correctness of the system is mandatory.
C. A real time deadline must be met irrespective of system load
D. Missing a soft deadline is catastrophic.
40. In a RTOS, as the number of tasks increase, the task switching time should
A. Remain constant
B. Increase with the number of tasks increase
C. Decrease when the number of tasks increases
D. cannot predict
43. Which command is used to search whole word “cdac” in given file path?
A. grep "cdac" path
B. grep "^cdac$" path
C. grep "*cdac*" path
D. grep "c*c" path
48. Which system call is used to read exit status of child process?
A. read()
B. waitpid()
C. signal()
D. kill()
49. Semaphore initial count is 4. If 3 P and 2 V operations are performed then what will be
count value?
A. 5
B. 3
C. 4
D. 9
50. Which Linux command is used to see SYS V semaphores created in the system?
A. ipcs -s
B. ipcs -m
C. ipcs -q
D. semctl
51. Which of the following care should be taken to use POSIX semaphores across the
process?
A. Semaphore must be declared in shared memory section.
B. Semaphore must be declared globally.
C. Semaphore must be declared locally.
D. Semaphore must be created in the kernel space.
56. If page requested by CPU is not present in main memory, which of the following
occur?
A. Page fault
B. Segmentation fault
C. Page interrupt
D. Segmentation interrupt
57. Which block contains information about the free data blocks?
A. Boot block
B. Super block
C. inode list
D. Data blocks
58. Which layer redirects the service request to the appropriate file system manager?
A. System Call
B. Virtual File System
C. Buffer Cache
D. Disk Device Driver
59. Which of the following system call does not create process?
A. fork()
B. exec()
C. vfork()
D. clone()
60. When process try to access invalid address, which signal is sent to process?
A. SIGINT
B. SIGSTOP
C. SIGKILL
D. SIGSEGV
63. Which IPC mechanism do not have waiting queue associated with it?
A. Message Queue
B. Pipe
C. Shared Memory
D. Semaphore
66. Which IPC mechanism is used to communicate between RTAI task and Linux
process?
A. FIFO
B. Semaphore
C. Shared Memory
D. Mailbox
70. Which of the following statement is NOT true about kernel modules?
A. Kernel modules can access standard C library.
B. Kernel module have entry point and exit point functions.
C. A bug in kernel module can crash whole kernel.
D. "insmod" command is used to load kernel module.
71. Which macro is used to add kernel module functions to kernel symbol table?
A. MODULE_EXPORT()
B. EXPORT_SYMBOL()
C. EXPORT_KERNEL()
D. EXPORT_FUNCTION()
72. I. Major number identifies the driver associated with the device.
II. Minor number is used to identify exactly which device is referred to.
Which of the above statements are true?
A. only I
B. only II
C. I and II
D. None of these
73. Which file operation in device driver allows issuing device specific commands?
A. ioctl
B. write
C. mmap
D. fsync
main() {
fork();
fork();
fork();
printf("Hello"); }
How many child processes will be created in this?
A. 3
B. 4
C. 6
D. 8
2. Relocatable programs
A. cannot be used with fixed partitions
B. can be loaded almost anywhere in memory
C. do not need a linker
D. can be loaded only at one specific location
3. Preemption is
A. forced de allocation of the CPU from a program which is executing on the CPU
B. release of CPU by the program after completing its task
C. forced allotment of CPU by a program to itself
D. a program terminating itself due to detection of an error
6. To avoid race condition, the number of processes that may be simultaneously inside
their critical section is
A. 8
B. 1
C. 16
D. 0
9. The interval from the time of submission of a process to the time of completion is
termed as
A. waiting time
B. turnaround time
C. response time
D. throughput
10. Which of the following is page replacement policy using this strategy “Replace the
page that hasn‟t been used for the longest period of time” ?
A. least recently used page replacement
B. optimal page replacement
C. fifo page replacement
D. second chance page replacement
13. What is the return value of read system call when end of file occurs?
A. 0
B. a positive number
C. -1
D. none of these
16. Using optimal page replacement algorithm calculate the number of page faults in
referencing the following string of page numbers with the number of frames 3
7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1
A. 6
B. 8
C. 9
D. 10
17. Thrashing
A. is a natural consequence of virtual memory systems
B. can always be avoided by swapping
C. always occurs on large computers
D. can be caused by poor paging algorithms
18. Using priority scheduling algorithm, find the average waiting time for the following set
of processes waiting time for the following set of processes given with their priorities in
the order:
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 4
P4 1 5
P5 5 2
A. 8
B. 8.2
C. 7.75
D. 3
20. If the resources are always preempted from the same process, …………. can occur.
A. deadlock
B. system crash
C. aging
D. starvation
23. With the FIFO page replacement policy and enough space for storing 3 page frames,
the memory page reference string „ABCABDDCABCD‟ would produce:
A. 5 page faults
B. 6 page faults
C. 7 page faults
D. 8 page faults
24. When the valid – invalid bit is set to valid, it means that the associated page:
A. is in the TLB
B. has data in it
C. is in the process’s logical address space
D. is the system‟s physical address space
25. Situation where two or more processes are reading or writing some shared data and
the final result depends upon who runs precisely is called?
A. race condition
B. critical section
C. mutual exclusion
D. message passing
34. Time duration required for scheduling dispatcher to stop one process and start
another is known as
A. process latency
B. dispatch latency
C. execution latency
D. interrupt latency
36. A task executing in the ready state cannot be moved into which of the following
states?
A. wait, ISR state
B. running state
C. dormant state
D. both (B) and (C)
37. The ......................... scheduling algorithm schedules periodic tasks using a static
priority policy with preemption.
A. earliest deadline first
B. rate monotonic
C. first cum first served
D. priority
2. Operating systems
A. Provides a layer so as to act as a user-friendly interface that enables the
programmer to draw a flow chart
B. Links the program with subroutines
C. Helps to create a flow chart of the programs
D. All of these
3. A process which is copied from main memory to secondary memory on the basis
of requirement is known as -
A. Demand paging
B. Paging
C. Threads
D. Segmentation
6. A systematic procedure for moving the CPU to new process is known as-
A. Synchronization
B. Deadlock
C. Starvation
D. Context Switching
8. Thread is a
A. Light weight process
B. Heavy weight process
C. Multi-process
D. 1/0 process
10. Among the following CPU scheduling algorithms, which of these allocated the CPU
first to the process that requests the CPU first?
A. FCFS
B. SJF
C. Priority scheduling
D. None
18. When are the register context and stack of thread deallocated?
A. when the thread terminates
B. when the thread blocks
C. when the thread unblocks
D. when the thread spawns
23. Identify the system calls that on termination does not return control to the calling
point.
A. exec
B. fork
C. longjmp
D. ioctl
28. When a thread terminates some target thread immediately, it is known as?
A. Immediate Termination
B. Asynchronous termination
C. Synchronous termination
D. Deferred cancellation
34. Which of the following is the only state transition that is initiated by the user
process itself?
A. dispatch
B. wakeup
C. block
D. none
41. Which of the following are two types of atomic operations performed by
semaphores?
A. wait, signal
B. wait, stop
C. signal, stop
D. signal, wait
44. The release and request of resources are a type of which of the following?
A. system calls
B. I/O interrupts
C. command lines
D. None
47. When can the binding of instructions and data to memory addresses be done?
A. Load time
B. Compile time
C. Execution time
D. All of the above
51. To access the services of operating system the interface is provided by the?
A. System Calls
B. API
C. Library
D. Assembly Instructions