McqMate
| 501. |
A block device transfers |
| A. | bytes one by one |
| B. | block of bytes as a unit |
| C. | with unpredictable response times |
| D. | none of the mentioned |
| Answer» B. block of bytes as a unit | |
| 502. |
What is a dedicated device? |
| A. | opposite to a sharable device |
| B. | same as a sharable device |
| C. | can be used concurrently by several processes |
| D. | none of the mentioned |
| Answer» A. opposite to a sharable device | |
| 503. |
A keyboard is an example of a device that is accessed through a interface. |
| A. | block stream |
| B. | set of blocks |
| C. | character stream |
| D. | none of the mentioned |
| Answer» C. character stream | |
| 504. |
In polling |
| A. | busy – wait cycles wait for i/o from device |
| B. | interrupt handler receives interrupts |
| C. | interrupt-request line is triggered by i/o device |
| D. | all of the mentioned |
| Answer» A. busy – wait cycles wait for i/o from device | |
| 505. |
A non blocking system call |
| A. | halts the execution of the application for an extended time |
| B. | does not halt the execution of the application |
| C. | does not block the interrupts |
| D. | none of the mentioned |
| Answer» B. does not halt the execution of the application | |
| 506. |
An asynchronous call |
| A. | returns immediately, without waiting for the i/o to complete |
| B. | does not return immediately and waits for the i/o to complete |
| C. | consumes a lot of time |
| D. | is too slow |
| Answer» A. returns immediately, without waiting for the i/o to complete | |
| 507. |
Buffering is done to |
| A. | cope with device speed mismatch |
| B. | cope with device transfer size mismatch |
| C. | maintain copy semantics |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 508. |
Caching is spooling. |
| A. | same as |
| B. | not the same as |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» B. not the same as | |
| 509. |
Caching |
| A. | holds a copy of the data |
| B. | is fast memory |
| C. | holds the only copy of the data |
| D. | holds output for a device |
| Answer» A. holds a copy of the data | |
| 510. |
Spooling |
| A. | holds a copy of the data |
| B. | is fast memory |
| C. | holds the only copy of the data |
| D. | holds output for a device |
| Answer» C. holds the only copy of the data | |
| 511. |
The keeps state information about the use of I/O components. |
| A. | cpu |
| B. | os |
| C. | kernel |
| D. | shell |
| Answer» C. kernel | |
| 512. |
The kernel data structures include |
| A. | process table |
| B. | open file table |
| C. | close file table |
| D. | all of the mentioned |
| Answer» B. open file table | |
| 513. |
If the number of cycles spent busy – waiting is not excessive, then |
| A. | interrupt driven i/o is more efficient than programmed i/o |
| B. | programmed i/o is more efficient than interrupt driven i/o |
| C. | both programmed and interrupt driven i/o are equally efficient |
| D. | none of the mentioned |
| Answer» B. programmed i/o is more efficient than interrupt driven i/o | |
| 514. |
A is a full duplex connection between a device driver and a user level process. |
| A. | bus |
| B. | i/o operation |
| C. | stream |
| D. | flow |
| Answer» C. stream | |
| 515. |
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 |
| Answer» D. linux 2.0 | |
| 516. |
Which one of the following linux file system does not support journaling feature? |
| A. | ext2 |
| B. | ext3 |
| C. | ext4 |
| D. | none of the mentioned |
| Answer» A. ext2 | |
| 517. |
Which binary format is supported by linux? |
| A. | a.out |
| B. | elf |
| C. | both a.out and elf |
| D. | none of the mentioned |
| Answer» C. both a.out and elf | |
| 518. |
Which one of the following bootloader is not used by linux? |
| A. | grub |
| B. | lilo |
| C. | ntldr |
| D. | none of the mentioned |
| Answer» C. ntldr | |
| 519. |
The first process launched by the linux kernel is |
| A. | init process |
| B. | zombie process |
| C. | batch process |
| D. | boot process |
| Answer» A. init process | |
| 520. |
Which desktop environment is not used in any linux distribution? |
| A. | gnome |
| B. | kde |
| C. | unity |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 521. |
Standard set of functions through which interacts with kernel is defined by |
| A. | system libraries |
| B. | kernel code |
| C. | compilers |
| D. | utility programs |
| Answer» A. system libraries | |
| 522. |
What is Linux? |
| A. | single user, single tasking |
| B. | single user, multitasking |
| C. | multi user, single tasking |
| D. | multi user, multitasking |
| Answer» D. multi user, multitasking | |
| 523. |
Which one of the following is not a linux distribution? |
| A. | debian |
| B. | gentoo |
| C. | open suse |
| D. | multics |
| Answer» D. multics | |
| 524. |
Which one of the following is not shared by threads? |
| A. | program counter |
| B. | stack |
| C. | both program counter and stack |
| D. | none of the mentioned |
| Answer» C. both program counter and stack | |
| 525. |
A process can be |
| A. | single threaded |
| B. | multithreaded |
| C. | both single threaded and multithreaded |
| D. | none of the mentioned |
| Answer» C. both single threaded and multithreaded | |
| 526. |
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 |
| Answer» B. other threads in the same process can also read from that file | |
| 527. |
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 |
| Answer» B. less than the time required to create a new process | |
| 528. |
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 |
| Answer» A. thread moves to the ready queue | |
| 529. |
The jacketing technique is used to |
| A. | convert a blocking system call into non blocking system call |
| B. | create a new thread |
| C. | communicate between threads |
| D. | terminate a thread |
| Answer» A. convert a blocking system call into non blocking system call | |
| 530. |
Termination of the process terminates |
| A. | first thread of the process |
| B. | first two threads of the process |
| C. | all threads within the process |
| D. | no thread within the process |
| Answer» C. all threads within the process | |
| 531. |
Which one of the following is not a valid state of a thread? |
| A. | running |
| B. | parsing |
| C. | ready |
| D. | blocked |
| Answer» B. parsing | |
| 532. |
The register context and stacks of a thread are deallocated when the thread? |
| A. | terminates |
| B. | blocks |
| C. | unblocks |
| D. | spawns |
| Answer» A. terminates | |
| 533. |
Thread synchronization is required because |
| A. | all threads of a process share the same address space |
| B. | all threads of a process share the same global variables |
| C. | all threads of a process can share the same files |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 534. |
A thread is also called |
| A. | light weight process(lwp) |
| B. | heavy weight process(hwp) |
| C. | process |
| D. | none of the mentioned |
| Answer» A. light weight process(lwp) | |
| 535. |
A thread shares its resources(like data section, code section, open files, signals) with |
| A. | other process similar to the one that the thread belongs to |
| B. | other threads that belong to similar processes |
| C. | other threads that belong to the same process |
| D. | all of the mentioned |
| Answer» C. other threads that belong to the same process | |
| 536. |
Resource sharing helps |
| A. | share the memory and resources of the process to which the threads belong |
| B. | an application have several different threads of activity all within the same address space |
| C. | reduce the address space that a process could potentially use |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 537. |
Multithreading on a multi – CPU machine |
| A. | has multiple threads of execution |
| B. | has a single thread of execution |
| C. | can have multiple or a single thread for execution |
| D. | none of the mentioned |
| Answer» B. has a single thread of execution | |
| 538. |
A process having multiple threads of control implies |
| A. | it can do more than one task at a time |
| B. | it can do only one task at a time, but much faster |
| C. | it has to use only one thread per process |
| D. | none of the mentioned |
| Answer» A. it can do more than one task at a time | |
| 539. |
The kernel is of user threads. |
| A. | a part of |
| B. | the creator of |
| C. | unaware of |
| D. | aware of |
| Answer» C. unaware of | |
| 540. |
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 |
| Answer» B. kernel threads are slower to create than user threads | |
| 541. |
If a kernel thread performs a blocking system call, |
| A. | the kernel can schedule another thread in the application for execution |
| B. | the kernel cannot schedule another thread in the same application for execution |
| C. | the kernel must schedule another thread of a different application for execution |
| D. | the kernel must schedule another thread of the same application on a different processor |
| Answer» A. the kernel can schedule another thread in the application for execution | |
| 542. |
Which of the following is FALSE? |
| A. | context switch time is longer for kernel level threads than for user level threads |
| B. | user level threads do not need any hardware support |
| C. | related kernel level threads can be scheduled on different processors in a multiprocessor system |
| D. | blocking one kernel level thread blocks all other related threads |
| Answer» D. blocking one kernel level thread blocks all other related threads | |
| 543. |
The model in which one kernel thread is mapped to many user-level threads is called |
| A. | many to one model |
| B. | one to many model |
| C. | many to many model |
| D. | one to one model |
| Answer» A. many to one model | |
| 544. |
The model in which one user-level thread is mapped to many kernel level threads is called |
| A. | many to one model |
| B. | one to many model |
| C. | many to many model |
| D. | one to one model |
| Answer» B. one to many model | |
| 545. |
In the Many to One model, if a thread makes a blocking system call |
| A. | the entire process will be blocked |
| B. | a part of the process will stay blocked, with the rest running |
| C. | the entire process will run |
| D. | none of the mentioned |
| Answer» A. the entire process will be blocked | |
| 546. |
In the Many to One model, multiple threads are unable to run in parallel on multiprocessors because of |
| A. | only one thread can access the kernel at a time |
| B. | many user threads have access to just one kernel thread |
| C. | there is only one kernel thread |
| D. | none of the mentioned |
| Answer» A. only one thread can access the kernel at a time | |
| 547. |
The One to One model allows |
| A. | increased concurrency |
| B. | decreased concurrency |
| C. | increased or decreased concurrency |
| D. | concurrency equivalent to other models |
| Answer» A. increased concurrency | |
| 548. |
Which of the following is the drawback of the One to One Model? |
| A. | increased concurrency provided by this model |
| B. | decreased concurrency provided by this model |
| C. | creating so many threads at once can crash the system |
| D. | creating a user thread requires creating the corresponding kernel thread |
| Answer» D. creating a user thread requires creating the corresponding kernel thread | |
| 549. |
When is the Many to One model at an advantage? |
| A. | when the program does not need multithreading |
| B. | when the program has to be multi- threaded |
| C. | when there is a single processor |
| D. | none of the mentioned |
| Answer» A. when the program does not need multithreading | |
| 550. |
In the Many to Many model true concurrency cannot be gained because |
| A. | other threads are strictly prohibited from running |
| B. | other threads are allowed to run |
| C. | other threads only from other processes are allowed to run |
| D. | none of the mentioned |
| Answer» B. other threads are allowed to run | |
| 551. |
Which of the following system calls does not return control to the calling point, on termination? |
| A. | fork |
| B. | exec |
| C. | ioctl |
| D. | longjmp |
| Answer» B. exec | |
| 552. |
Which of the following system calls transforms executable binary file into a process? |
| A. | fork |
| B. | exec |
| C. | ioctl |
| D. | longjmp |
| Answer» B. exec | |
| 553. |
Which of the following calls never returns an error? |
| A. | getpid |
| B. | fork |
| C. | ioctl |
| D. | open |
| Answer» A. getpid | |
| 554. |
A fork system call will fail if |
| A. | the previously executed statement is also a fork call |
| B. | the limit on the maximum number of processes in the system would be executed |
| C. | the limit on the minimum number of processes that can be under execution by a single user would be executed |
| D. | all of the mentioned |
| Answer» B. the limit on the maximum number of processes in the system would be executed | |
| 555. |
If a thread invokes the exec system call |
| A. | only the exec executes as a separate process |
| B. | the program specified in the parameter to exec will replace the entire process |
| C. | the exec is ignored as it is invoked by a thread |
| D. | none of the mentioned |
| Answer» B. the program specified in the parameter to exec will replace the entire process | |
| 556. |
If exec is called immediately after forking |
| A. | the program specified in the parameter to exec will replace the entire process |
| B. | all the threads will be duplicated |
| C. | all the threads may be duplicated |
| D. | none of the mentioned |
| Answer» A. the program specified in the parameter to exec will replace the entire process | |
| 557. |
If a process does not call exec after forking |
| A. | the program specified in the parameter to exec will replace the entire process |
| B. | all the threads should be duplicated |
| C. | all the threads should not be duplicated |
| D. | none of the mentioned |
| Answer» B. all the threads should be duplicated | |
| 558. |
What is Thread cancellation? |
| A. | the task of destroying the thread once its work is done |
| B. | the task of removing a thread once its work is done |
| C. | the task of terminating a thread before it has completed |
| D. | none of the mentioned |
| Answer» C. the task of terminating a thread before it has completed | |
| 559. |
When a web page is loading, and the user presses a button on the browser to stop loading the page? |
| A. | the thread loading the page continues with the loading |
| B. | the thread loading the page does not stop but continues with another task |
| C. | the thread loading the page is paused |
| D. | the thread loading the page is cancelled |
| Answer» D. the thread loading the page is cancelled | |
| 560. |
When one thread immediately terminates the target thread, it is called |
| A. | asynchronous cancellation |
| B. | systematic cancellation |
| C. | sudden termination |
| D. | deferred cancellation |
| Answer» A. asynchronous cancellation | |
| 561. |
When the target thread periodically checks if it should terminate and terminates itself in an orderly manner, it is called? |
| A. | asynchronous cancellation |
| B. | systematic cancellation |
| C. | sudden termination |
| D. | deferred cancellation |
| Answer» D. deferred cancellation | |
| 562. |
Cancelling a thread asynchronously |
| A. | frees all the resources properly |
| B. | may not free each resource |
| C. | spoils the process execution |
| D. | none of the mentioned |
| Answer» B. may not free each resource | |
| 563. |
Cancellation point is the point where |
| A. | the thread can be cancelled – safely or otherwise doesn’t matter |
| B. | the thread can be cancelled safely |
| C. | the whole process can be cancelled safely |
| D. | none of the mentioned |
| Answer» B. the thread can be cancelled safely | |
| 564. |
If multiple threads are concurrently searching through a database and one thread returns the result then the remaining threads must be |
| A. | continued |
| B. | cancelled |
| C. | protected |
| D. | none of the mentioned |
| Answer» B. cancelled | |
| 565. |
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 |
| Answer» B. one at a time, in no particular order | |
| 566. |
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 |
| Answer» C. a field is updated in the signal table when the signal is sent | |
| 567. |
Signals of a given type |
| A. | are queued |
| B. | are all sent as one |
| C. | cannot be queued |
| D. | none of the mentioned |
| Answer» B. are all sent as one | |
| 568. |
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 |
| Answer» D. all of the mentioned | |
| 569. |
Signals are identified by |
| A. | signal identifiers |
| B. | signal handlers |
| C. | signal actions |
| D. | none of the mentioned |
| Answer» A. signal identifiers | |
| 570. |
When a process blocks the receipt of certain signals? |
| A. | the signals are delivered |
| B. | the signals are not delivered |
| C. | the signals are received until they are unblocked |
| D. | the signals are received by the process once they are delivered |
| Answer» A. the signals are delivered | |
| 571. |
The maintains pending and blocked bit vectors in the context of each process. |
| A. | cpu |
| B. | memory |
| C. | process |
| D. | kernel |
| Answer» D. kernel | |
| 572. |
In UNIX, the set of masked signals can be set or cleared using the function. |
| A. | sigmask |
| B. | sigmaskproc |
| C. | sigprocmask |
| D. | sigproc |
| Answer» C. sigprocmask | |
| 573. |
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 |
| Answer» C. they cannot carry information directly | |
| 574. |
The usual effect of abnormal termination of a program is |
| A. | core dump file generation |
| B. | system crash |
| C. | program switch |
| D. | signal destruction |
| Answer» A. core dump file generation | |
| 575. |
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 |
| Answer» C. the signal has no effect until the system call completes | |
| 576. |
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 |
| Answer» B. has not been lost | |
| 577. |
In UNIX, the system call is used to send a signal. |
| A. | sig |
| B. | send |
| C. | kill |
| D. | sigsend |
| Answer» C. kill | |
| 578. |
Thread pools are useful when |
| A. | when we need to limit the number of threads running in the application at the same time |
| B. | when we need to limit the number of threads running in the application as a whole |
| C. | when we need to arrange the ordering of threads |
| D. | none of the mentioned |
| Answer» A. when we need to limit the number of threads running in the application at the same time | |
| 579. |
Instead of starting a new thread for every task to execute concurrently, the task can be passed to a |
| A. | process |
| B. | thread pool |
| C. | thread queue |
| D. | none of the mentioned |
| Answer» B. thread pool | |
| 580. |
Each connection arriving at multi threaded servers via network is generally |
| A. | is directly put into the blocking queue |
| B. | is wrapped as a task and passed on to a thread pool |
| C. | is kept in a normal queue and then sent to the blocking queue from where it is dequeued |
| D. | none of the mentioned |
| Answer» B. is wrapped as a task and passed on to a thread pool | |
| 581. |
What is the idea behind thread pools? |
| A. | a number of threads are created at process startup and placed in a pool where they sit and wait for work |
| B. | when a process begins, a pool of threads is chosen from the many existing and each thread is allotted equal amount of work |
| C. | all threads in a pool distribute the task equally among themselves |
| D. | none of the mentioned |
| Answer» A. a number of threads are created at process startup and placed in a pool where they sit and wait for work | |
| 582. |
If the thread pool contains no available thread |
| A. | the server runs a new process |
| B. | the server goes to another thread pool |
| C. | the server demands for a new pool creation |
| D. | the server waits until one becomes free |
| Answer» D. the server waits until one becomes free | |
| 583. |
Thread pools help in |
| A. | servicing multiple requests using one thread |
| B. | servicing a single request using multiple threads from the pool |
| C. | faster servicing of requests with an existing thread rather than waiting to create a new thread |
| D. | none of the mentioned |
| Answer» C. faster servicing of requests with an existing thread rather than waiting to create a new thread | |
| 584. |
The number of the threads in the pool can be decided on factors such as |
| A. | number of cpus in the system |
| B. | amount of physical memory |
| C. | expected number of concurrent client requests |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 585. |
The swaps processes in and out of the memory. |
| A. | Memory Manager |
| B. | CPU |
| C. | CPU Manager |
| D. | User |
| Answer» A. Memory Manager | |
| 586. |
The address generated by the CPU is referred to as |
| A. | Physical Address |
| B. | Logical Address |
| C. | Neither Physical nor Logical |
| D. | None of the mentioned |
| Answer» B. Logical Address | |
| 587. |
Operating System maintains the page table for |
| A. | each process |
| B. | each thread |
| C. | each instruction |
| D. | each address |
| Answer» A. each process | |
| 588. |
What is operating system? |
| A. | collection of programs that manages hardware |
| B. | system service provider to the |
| C. | link to interface the hardware and |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 589. |
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 |
| Answer» B. ready state | |
| 590. |
In virtual memory, which is not a page replacement algorithm ? |
| A. | FIFO |
| B. | BFS |
| C. | LRU |
| D. | Optimal |
| Answer» B. BFS | |
| 591. |
Thrashing the CPU utilization. |
| A. | increases |
| B. | keep constant |
| C. | decreases |
| D. | None of the mentioned |
| Answer» C. decreases | |
| 592. |
Mutual exclusion can be provided by the |
| A. | mutex locks |
| B. | binary semaphores |
| C. | both mutex locks and binary |
| D. | none of the mentioned |
| Answer» C. both mutex locks and binary | |
| 593. |
A parent process calling system call will be suspended until children processes terminate. |
| A. | wait |
| B. | fork |
| C. | exit |
| D. | exec |
| Answer» A. wait | |
| 594. |
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 |
| Answer» B. Zombie | |
| 595. |
When the process issues an I/O request |
| A. | It is placed in an I/O queue |
| B. | It is placed in a waiting queue |
| C. | It is placed in the ready queue |
| D. | It is placed in the Job queue |
| Answer» A. It is placed in an I/O queue | |
| 596. |
Which one of the following is the deadlock avoidance algorithm? |
| A. | banker’s algorithm |
| B. | elevator algorithm |
| C. | karn’s algorithm |
| D. | none of the mentioned |
| Answer» A. banker’s algorithm | |
| 597. |
File type can be represented by |
| A. | file name |
| B. | file extension |
| C. | file identifier |
| D. | none of the mentioned |
| Answer» B. file extension | |
| 598. |
Which of the following are the two parts of the file name? |
| A. | name & identifier |
| B. | identifier & type |
| C. | extension & name |
| D. | type & extension |
| Answer» C. extension & name | |
| 599. |
Which of the following are forms of malicious attack? |
| A. | Theft of information |
| B. | Modification of data |
| C. | Wiping of information |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 600. |
From the following, which is not a common file permission? |
| A. | Write |
| B. | Execute |
| C. | Stop |
| D. | Read |
| Answer» C. Stop | |
Done Reading?