SURESHKUMAR

Thursday, December 14, 2017

IBPS SO IT 50 MCQ for OS

IBPS SO IT Operating Systems Questions and Answers Set - 1

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

2. To access the services of operating system, the interface is provided by the
a) System calls
b) API
c) Library
d) Assembly instructions

3. 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 can not be loaded in running operating system
d) kernel remains in the memory during the entire computer session

4. 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

5. 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

6. 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

7. 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

8. 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

9. Which one of the following is not a real time operating system?
a) VxWorks
b) Windows CE
c) RTLinux
d) Palm OS

10. The OS X has ____________
a) monolithic kernel
B) hybrid kernel 
c) microkernel
d) monolithic kernel with module


11. 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. 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
13. In Unix, Which system call creates the new process?
a) fork
b) create
c) new
d) none of the mentioned
14. A process can be terminated due to
a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned
15. 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.

16. What is interprocess communication?
a) communication within the process
b) communication between two process
c) communication between two threads of same process
d) none of the mentioned
17. 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

18. A process stack does not contain
a) Function parameters
b) Local variables
c) Return addresses
d) PID of child process

19. Which system call returns the process identifier of a terminated child?
a) wait
b) exit
c) fork
d) get

20. 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

21. Which process can be affected by other processes executing in the system?
a) cooperating process
b) child process
c) parent process
d) init process
22. 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
23. If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion

24. Which one of the following is a synchronization tool?
a) thread
b) pipe
c) semaphore
d) socket

25. A semaphore is a shared integer variable
a) that can not drop below zero
b) that can not be more than zero
c) that can not drop below one
d) that can not be more than one
26. Mutual exclusion can be provided by the
a) mutex locks
b) binary semaphores
c) both mutex locks and binary semaphores
d) none of the mentioned

27. When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called
a) priority inversion
b) priority removal
c) priority exchange
d) priority modification
28. Process synchronization can be done on
a) hardware level
b) software level
c) both hardware and software level
d) none of the mentioned
29. A monitor is a module that encapsulates
a) shared data structures
b) procedures that operate on shared data structure
c) synchronization between concurrent procedure invocation
d) all of the mentioned

30. To enable a process to wait within the monitor,
a) a condition variable must be declared as condition
b) condition variables must be used as boolean objects
c) semaphore must be used
d) all of the mentioned
31. 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
32. 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
33. 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
34. 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
35. In priority scheduling algorithm
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
c) Equal priority processes can not be scheduled
d) None of the mentioned

36. 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

37. Time quantum is defined in
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
38. Process are classified into different groups in
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
39. In multilevel feedback scheduling algorithm
a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
d) none of the mentioned

40. 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

41. What is the reusable resource?
a) that can be used by one process at a time and is not depleted by that use
b) that can be used by more than one process at a time
c) that can be shared between various threads
d) none of the mentioned

42. 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
43. 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

44. 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
45. 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

46. 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
47. For effective operating system, when to check for deadlock?
a) every time a resource request is made
b) at fixed time intervals
c) every time a resource request is made at fixed time intervals
d) none of the mentioned
48. A problem encountered in multitasking when a process is perpetually denied necessary resources is called
a) deadlock
b) starvation
c) inversion
d) aging
49. 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
50. 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.


๐Ÿ“ฃNext MCQ For Networking @ Tomorrow 
๐Ÿ”Š + following me

1 comment:

  1. This was very informative blog to read will recommend this blog to one who can be benefited by this. Bank Coaching Center in HyderabadThank you

    ReplyDelete