Quiznetik
Operating System (OS) | Set 7
1. The backing store is generally a
A. fast disk
B. disk large enough to accommodate copies of all memory images for all users
C. disk to provide direct access to the memory images
D. all of the mentioned
Correct : D. all of the mentioned
2. Memory management technique in which system stores and retrieves data from secondary storage for use in main
A. fragmentation
B. paging
C. mapping
D. None of the mentioned
Correct : B. paging
3. A Process Control Block(PCB) does not contain which of the following?
A. Code
B. Stack
C. Bootstrap Program
D. Data
Correct : C. Bootstrap Program
4. Which of the following condition(s) is/are required for a deadlock to be possible?
A. mutual exclusion
B. a process may hold allocated resources while awaiting
C. no resource can be forcibly removed from a process
D. All of the mentioned
Correct : D. All of the mentioned
5. To avoid deadlock
A. there must be a fixed number of resources to
B. resource allocation must be done only
C. all deadlocked processes must be
D. inversion technique can be used
Correct : A. there must be a fixed number of resources to
6. What is the mounting of file system?
A. creating of a filesystem
B. deleting a filesystem
C. attaching portion of the file system into a directory
D. removing the portion of the file system into a directory structure
Correct : C. attaching portion of the file system into a directory
7. Data cannot be written to secondary storage unless written within a
A. file
B. swap space
C. directory
D. text format
Correct : A. file
8. The larger the block size, the the internal fragmentation.
A. greater
B. lesser
C. same
D. none of the mentioned
Correct : A. greater
9. With a shared file
A. actual file exists
B. there are two copies of the file
C. the changes made by one person are not reflected to the
D. the changes made by one person are reflected to the other
Correct : D. the changes made by one person are reflected to the other
10. 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
Correct : D. all of the mentioned
11. To access the services of operating system, the interface is provided by the
A. System calls
B. API
C. Library
D. Assembly instructions
Correct : A. System calls
12. 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
Correct : C. kernel is made of various modules which cannot be loaded in running operating system
13. 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
Correct : D. all of the mentioned
14. The main function of the command interpreter is
A. to get and execute the next user-specified command
B. to provide the interface between the API and application program
C. to handle the files in operating system
D. none of the mentioned
Correct : A. to get and execute the next user-specified command
15. By operating system, the resource management can be done via
A. time division multiplexing
B. space division multiplexing
C. both time and space division multiplexing
D. none of the mentioned
Correct : C. both time and space division multiplexing
16. 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
Correct : A. log file
17. Which one of the following is not a real time operating system?
A. VxWorks
B. Windows CE
C. RTLinux
D. Palm OS
Correct : D. Palm OS
18. The OS X has ____________
A. monolithic kernel
B. hybrid kernel
C. microkernel
D. monolithic kernel with modules
Correct : B. hybrid kernel
19. 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
Correct : B. uniprocessing systems
20. In operating system, each process has its own
A. address space and global variables
B. open files
C. pending alarms, signals and signal handlers
D. all of the mentioned
Correct : D. all of the mentioned
21. In Unix, Which system call creates the new process?
A. fork
B. create
C. new
D. none of the mentioned
Correct : A. fork
22. A process can be terminated due to
A. normal exit
B. fatal error
C. killed by another process
D. all of the mentioned
Correct : D. all of the mentioned
23. What is the ready state of a process?
A. when process is scheduled to run after some execution
B. when process is unable to run until some task has been completed
C. when process is using the CPU
D. none of the mentioned
Correct : A. when process is scheduled to run after some execution
24. What is interprocess communication?
A. Communication within the process
B. communication between two process
C. communications between two threads of same process
D. none of the mentioned
Correct : B. communication between two process
25. A set of processes is deadlock if
A. each process is blocked and will remain so forever
B. each process is terminated
C. all processes are trying to kill each other
D. none of the mentioned
Correct : A. each process is blocked and will remain so forever
26. A process stack does not contain
A. Function parameters
B. Local variables
C. Return addresses
D. PID of child process
Correct : D. PID of child process
27. Which system call returns the process identifier of a terminated child?
A. wait
B. exit
C. fork
D. get
Correct : A. wait
28. 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
Correct : B. Program counter
29. A Process Control Block(PCB) does not contain which of the following :
A. Code
B. Stack
C. Bootstrap program
D. Data
Correct : C. Bootstrap program
30. The number of processes completed per unit time is known as __________
A. Output
B. Throughput
C. Efficiency
D. Capacity
Correct : B. Throughput
31. The state of a process is defined by:
A. the final activity of the process
B. the activity just executed by the process
C. the activity to next be executed by the process
D. the current activity of the process
Correct : D. the current activity of the process
32. Which of the following is not the state of a process?
A. New
B. Old
C. Waiting
D. Running
Correct : B. Old
33. The Process Control Block is:
A. Process type variable
B. Data Structure
C. A secondary storage section
D. A Block in memory
Correct : B. Data Structure
34. The entry of all the PCBs of the current processes is in:
A. Process Register
B. Program Counter
C. Process Table
D. Process Unit
Correct : C. Process Table
35. The degree of multiprogramming is:
A. the number of processes executed per unit time
B. the number of processes in the ready queue
C. the number of processes in the I/O queue
D. the number of processes in memory
Correct : D. the number of processes in memory
36. A single thread of control allows the process to perform:
A. only one task at a time
B. multiple tasks at a time
C. only two tasks at a time
D. all of the mentioned
Correct : A. only one task at a time
37. The objective of multiprogramming is to :
A. Have some process running at all times
B. Have multiple programs waiting in a queue ready to run
C. To minimize CPU utilization
D. None of the mentioned
Correct : A. Have some process running at all times
38. Which of the following condition is required for deadlock to be possible?
A. mutual exclusion
B. a process may hold allocated resources while awaiting assignment of other resources
C. no resource can be forcibly removed from a process holding it
D. all of the mentioned
Correct : D. all of the mentioned
39. A system is in the safe state if
A. the system can allocate resources to each process in some order and still avoid a deadlock
B. there exist a safe sequence
C. all of the mentioned
D. none of the mentioned
Correct : A. the system can allocate resources to each process in some order and still avoid a deadlock
40. The circular wait condition can be prevented by
A. defining a linear ordering of resource types
B. using thread
C. using pipes
D. all of the mentioned
Correct : A. defining a linear ordering of resource types
41. Which one of the following is the deadlock avoidance algorithm?
A. banker’s algorithm
B. round-robin algorithm
C. elevator algorithm
D. karn’s algorithm
Correct : A. banker’s algorithm
42. What is the drawback of banker’s algorithm?
A. in advance processes rarely know that how much resource they will need
B. the number of processes changes as time progresses
C. resource once available can disappear
D. all of the mentioned
Correct : D. all of the mentioned
43. To avoid deadlock
A. there must be a fixed number of resources to allocate
B. resource allocation must be done only once
C. all deadlocked processes must be aborted
D. inversion technique can be used
Correct : A. there must be a fixed number of resources to allocate
44. If the wait for graph contains a cycle :
A. then a deadlock does not exist
B. then a deadlock exists
C. then the system is in a safe state
D. either deadlock exists or system is in a safe state
Correct : B. then a deadlock exists
45. All unsafe states are :
A. deadlocks
B. not deadlocks
C. fatal
D. none of the mentioned
Correct : B. not deadlocks
46. Physical memory is broken into fixed-sized blocks called ________
A. frames
B. pages
C. backing store
D. none of the mentioned
Correct : A. frames
47. Logical memory is broken into blocks of the same size called _________
A. frames
B. pages
C. backing store
D. none of the mentioned
Correct : B. pages
48. The __________ is used as an index into the page table.
A. frame bit
B. page number
C. page offset
D. frame offset
Correct : B. page number
49. _____ is the concept in which a process is copied into main memory from the secondary memory according to the requirement.
A. Paging
B. Demand paging
C. Segmentation
D. Swapping
Correct : B. Demand paging
50. Linux uses a time-sharing algorithm
A. to pair preemptive scheduling between multiple processes
B. for tasks where absolute priorities are more important than fairness
C. all of the mentioned
D. none of the mentioned
Correct : A. to pair preemptive scheduling between multiple processes
51. First linux kernel which supports the SMP hardware was
A. linux 0.1
B. linux 1.0
C. linux 1.2
D. linux 2.0
Correct : D. linux 2.0
52. Which one of the following linux file system does not support journaling feature?
A. ext2
B. ext3
C. ext4
D. none of the mentioned
Correct : A. ext2
53. Which binary format is supported by linux?
A. a.out
B. elf
C. both a.out and ELF
D. none of the mentioned
Correct : C. both a.out and ELF
54. Which one of the following bootloader is not used by linux?
A. GRUB
B. LILO
C. NTLDR
D. None of the mentioned
Correct : C. NTLDR
55. The first process launched by the linux kernel is
A. init process
B. zombie process
C. batch process
D. boot process
Correct : A. init process
56. Which desktop environment is not used in any linux distribution?
A. gnome
B. kde
C. unity
D. none of the mentioned
Correct : D. none of the mentioned
57. Standard set of functions through which interacts with kernel is defined by
A. system libraries
B. kernel code
C. compilers
D. utility programs
Correct : A. system libraries
58. Linux is
A. single user, single tasking
B. single user, multitasking
C. multi user, single tasking
D. multi user, multitasking
Correct : D. multi user, multitasking
59. Which one of the following is not a linux distribution?
A. debian
B. gentoo
C. open SUSE
D. multics
Correct : D. multics