McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Computer Applications (BCA) , Bachelor of Science in Computer Science (BSc CS) .
| 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 | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.