McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Electrical Engineering .
| 151. |
If timestamps of two events are same, then the events are |
| A. | concurrent |
| B. | non-concurrent |
| C. | monotonic |
| D. | non-monotonic |
| Answer» A. concurrent | |
| Explanation: none. | |
| 152. |
If a process is executing in its critical section |
| A. | any other process can also execute in its critical section |
| B. | no other process can execute in its critical section |
| C. | one more process can execute in its critical section |
| D. | none of the mentioned |
| Answer» B. no other process can execute in its critical section | |
| Explanation: none. | |
| 153. |
For proper synchronization in distributed systems |
| A. | prevention from the deadlock is must |
| B. | prevention from the starvation is must |
| C. | prevention from the deadlock & starvation is must |
| D. | none of the mentioned |
| Answer» C. prevention from the deadlock & starvation is must | |
| Explanation: none. | |
| 154. |
In the token passing approach of distributed systems, processes are organized in a ring structure |
| A. | logically |
| B. | physically |
| C. | both logically and physically |
| D. | none of the mentioned |
| Answer» A. logically | |
| Explanation: none. | |
| 155. |
In distributed systems, what will the transaction coordinator do? |
| A. | starts the execution of transaction |
| B. | breaks the transaction into number of sub transactions |
| C. | coordinates the termination of the transaction |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| Explanation: none. | |
| 156. |
5 CLOCK SYNCHRONISATION |
| A. | bully algorithm |
| B. | ring algorithm |
| C. | both bully and ring algorithm |
| D. | none of the mentioned |
| Answer» C. both bully and ring algorithm | |
| Explanation: none. | |
| 157. |
In distributed systems, election algorithms assumes that |
| A. | a unique priority number is associated with each active process in system |
| B. | there is no priority number associated with any process |
| C. | priority of the processes is not required |
| D. | none of the mentioned |
| Answer» A. a unique priority number is associated with each active process in system | |
| Explanation: none. | |
| 158. |
According to the ring algorithm, links between processes are |
| A. | bidirectional |
| B. | unidirectional |
| C. | both bidirectional and unidirectional |
| D. | none of the mentioned |
| Answer» B. unidirectional | |
| Explanation: none. | |
| 159. |
Which of the following works by dividing the processor’s time? |
| A. | single task operating system |
| B. | multitask operating system |
| C. | kernel |
| D. | applications |
| Answer» B. multitask operating system | |
| Explanation: the multitasking operating system works by dividing the processor’s time into different discrete time slots, that is, each application requires a defined number of time slots to complete its execution. | |
| 160. |
Which of the following decides which task can have the next time slot? |
| A. | single task operating system |
| B. | applications |
| C. | kernel |
| D. | software |
| Answer» C. kernel | |
| Explanation: the operating system kernel decides which task can have the next time slot. so instead of the task executing continuously until completion, the execution of the processor is interleaved with the other tasks. | |
| 161. |
Which of the following controls the time slicing mechanism in a multitasking operating system? |
| A. | kernel |
| B. | single tasking kernel |
| C. | multitasking kernel |
| D. | application manager |
| Answer» C. multitasking kernel | |
| Explanation: the multitasking operating | |
| 162. |
Which of the following provides a time period for the context switch? |
| A. | timer |
| B. | counter |
| C. | time slice |
| D. | time machine |
| Answer» C. time slice | |
| Explanation: the time period required for each task for execution before it is stopped and replaced during a context switch is known as the time slice. | |
| 163. |
Which of the following can periodically trigger the context switch? |
| A. | software interrupt |
| B. | hardware interrupt |
| C. | peripheral |
| D. | memory |
| Answer» B. hardware interrupt | |
| Explanation: the multitasking operating systems are associated with the multitasking kernel which controls the time slicing mechanism. the time period required for each task for execution before it is stopped and replaced during a context switch is known as the time slice. these are periodically triggered by a hardware interrupt from the system timer. | |
| 164. |
Which interrupt provides system clock in the context switching? |
| A. | software interrupt |
| B. | hardware interrupt |
| C. | peripheral |
| D. | memory |
| Answer» B. hardware interrupt | |
| Explanation: the multitasking operating systems deals with the multitasking kernel which controls the time slicing mechanism and the time period required for each task for execution before it is stopped and replaced during a context switch is known as the time slice which are periodically triggered by a hardware interrupt from the system timer. this hardware interrupt provides the system clock in which several interrupts are executed and counted before a context switch is performed. | |
| 165. |
The special tale in the multitasking operating system is also known as |
| A. | task control block |
| B. | task access block |
| C. | task address block |
| D. | task allocating block |
| Answer» A. task control block | |
| Explanation: when a context switch is | |
| 166. |
Which of the following stores all the task information that the system requires? |
| A. | task access block |
| B. | register |
| C. | accumulator |
| D. | task control block |
| Answer» D. task control block | |
| Explanation: the task control block stores all the task information that the system requires and this is done when the context switch is performed so that the currently running program is interrupted. | |
| 167. |
Which of the following contains all the task and their status? |
| A. | register |
| B. | ready list |
| C. | access list |
| D. | task list |
| Answer» B. ready list | |
| Explanation: the ‘ready’ list possesses all the information regarding a task, that is, all the task and its corresponding status which is used by the scheduler to decide which task should execute in the next time slice. | |
| 168. |
Which determines the sequence and the associated task’s priority? |
| A. | scheduling algorithm |
| B. | ready list |
| C. | task control block |
| D. | application register |
| Answer» A. scheduling algorithm | |
| Explanation: the scheduling algorithm determines the sequence and an associated task’s priority. it also determines the present status of the task. | |
| 169. |
Which can control memory usage? |
| A. | operating system |
| B. | applications |
| C. | hardware |
| D. | kernel |
| Answer» D. kernel | |
| Explanation: the kernel can control the memory usage and it can also prevent the tasks from corrupting each other. | |
| 170. |
Which can control the memory sharing between the tasks? |
| A. | kernel |
| B. | application |
| C. | software |
| D. | os |
| Answer» A. kernel | |
| Explanation: the kernel can control memory sharing between tasks which allow sharing common program modules. | |
| 171. |
Which of the following can carry information and control task? |
| A. | semaphore |
| B. | messages |
| C. | flags |
| D. | address message |
| Answer» B. messages | |
| Explanation: the messages can carry information and it can also control the task regarding the real-time operating systems. these are also known as events. | |
| 172. |
How many types of messages are associated with the real-time operating system? |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» A. 2 | |
| Explanation: there are two basic types of messages associated with the real-time operating system. these are semaphores and messages. | |
| 173. |
For real time operating systems, interrupt latency should be |
| A. | minimal |
| B. | maximum |
| C. | zero |
| D. | dependent on the scheduling |
| Answer» A. minimal | |
| Explanation: interrupt latency is the time duration between the generation of interrupt and execution of its service. | |
| 174. |
In rate monotonic scheduling |
| A. | shorter duration job has higher priority |
| B. | longer duration job has higher priority |
| C. | priority does not depend on the duration of the job |
| D. | none of the mentioned |
| Answer» A. shorter duration job has higher priority | |
| Explanation: none. | |
| 175. |
In which scheduling certain amount of CPU time is allocated to each process? |
| A. | earliest deadline first scheduling |
| B. | proportional share scheduling |
| C. | equal share scheduling |
| D. | none of the mentioned |
| Answer» B. proportional share scheduling | |
| Explanation: none. | |
| 176. |
The problem of priority inversion can be solved by |
| A. | priority inheritance protocol |
| B. | priority inversion protocol |
| C. | both priority inheritance and inversion protocol |
| D. | none of the mentioned |
| Answer» A. priority inheritance protocol | |
| Explanation: none. | |
| 177. |
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 |
| Answer» B. dispatch latency | |
| Explanation: none. | |
| 178. |
Time required to synchronous switch from the context of one thread to the context of another thread is called? |
| A. | threads fly-back time |
| B. | jitter |
| C. | context switch time |
| D. | none of the mentioned |
| Answer» C. context switch time | |
| Explanation: none. | |
| 179. |
VxWorks is centered around |
| A. | wind microkernel |
| B. | linux kernel |
| C. | unix kernel |
| D. | none of the mentioned |
| Answer» A. wind microkernel | |
| Explanation: none. | |
| 180. |
Message passing system allows processes to |
| A. | communicate with one another without resorting to shared data |
| B. | communicate with one another by resorting to shared data |
| C. | share data |
| D. | name the recipient or sender of the message |
| Answer» A. communicate with one another without resorting to shared data | |
| Explanation: none. | |
| 181. |
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 |
| Answer» D. receive & send message | |
| Explanation: none. | |
| 182. |
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 |
| Answer» C. can be fixed or variable sized | |
| Explanation: none. | |
| 183. |
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 |
| Answer» A. communication link | |
| Explanation: none. | |
| 184. |
Which of the following are TRUE for direct communication? |
| A. | a communication link can be associated with n number of process(n = max. number of processes supported by system) |
| B. | a communication link can be associated with exactly two processes |
| C. | exactly n/2 links exist between each pair of processes(n = max. number of processes supported by system) |
| D. | exactly two link exists between each pair of processes |
| Answer» B. a communication link can be associated with exactly two processes | |
| Explanation: none. | |
| 185. |
In indirect communication between processes P and Q |
| A. | there is another process r to handle and pass on the messages between p and q |
| B. | there is another machine between the two processes to help communication |
| C. | there is a mailbox to help communication between p and q |
| D. | none of the mentioned |
| Answer» C. there is a mailbox to help communication between p and q | |
| Explanation: none. | |
| 186. |
In the non blocking send |
| A. | the sending process keeps sending until the message is received |
| B. | the sending process sends the message and resumes operation |
| C. | the sending process keeps sending until it receives a message |
| D. | none of the mentioned |
| Answer» B. the sending process sends the message and resumes operation | |
| Explanation: none. | |
| 187. |
In the Zero capacity queue |
| A. | the queue can store at least one message |
| B. | the sender blocks until the receiver receives the message |
| C. | the sender keeps sending and the messages don’t wait in the queue |
| D. | none of the mentioned |
| Answer» B. the sender blocks until the receiver receives the message | |
| Explanation: none. | |
| 188. |
The Zero Capacity queue |
| A. | is referred to as a message system with buffering |
| B. | is referred to as a message system with no buffering |
| C. | is referred to as a link |
| D. | none of the mentioned |
| Answer» B. is referred to as a message system with no buffering | |
| Explanation: none. | |
| 189. |
Bounded capacity and Unbounded capacity queues are referred to as |
| A. | programmed buffering |
| B. | automatic buffering |
| C. | user defined buffering |
| D. | no buffering |
| Answer» B. automatic buffering | |
| Explanation: none. | |
| 190. |
During the execution of the instructions, a copy of the instructions is placed in the |
| A. | register |
| B. | ram |
| C. | system heap |
| D. | cache |
| Answer» D. cache | |
| Explanation: none. | |
| 191. |
A processor performing fetch or decoding of different instruction during the execution of another instruction is called |
| A. | super-scaling |
| B. | pipe-lining |
| C. | parallel computation |
| D. | none of the mentioned |
| Answer» B. pipe-lining | |
| Explanation: pipe-lining is the process of improving the performance of the system by processing different instructions at the same time, with only one instruction performing one specific operation. | |
| 192. |
For a given FINITE number of instructions to be executed, which architecture of the processor provides for a faster execution? |
| A. | isa |
| B. | ansa |
| C. | super-scalar |
| D. | all of the mentioned |
| Answer» C. super-scalar | |
| Explanation: in super-scalar architecture, the instructions are set in groups and they’re decoded and executed together reducing the amount of time required to process them. | |
| 193. |
An optimizing Compiler does |
| A. | better compilation of the given piece of code |
| B. | takes advantage of the type of processor and reduces its process time |
| C. | does better memory management |
| D. | none of the mentioned |
| Answer» B. takes advantage of the type of processor and reduces its process time | |
| Explanation: an optimizing compiler is a compiler designed for the specific purpose of increasing the operation speed of the processor by reducing the time taken to compile the program instructions. | |
| 194. |
The ultimate goal of a compiler is to |
| A. | reduce the clock cycles for a programming task |
| B. | reduce the size of the object code |
| C. | be versatile |
| D. | be able to detect even the smallest of errors |
| Answer» A. reduce the clock cycles for a programming task | |
| Explanation: none. | |
| 195. |
SPEC stands for |
| A. | standard performance evaluation code |
| B. | system processing enhancing code |
| C. | system performance evaluation corporation |
| D. | standard processing enhancement corporation |
| Answer» C. system performance evaluation corporation | |
| Explanation: spec is a corporation that started to standardize the evaluation method of a system’s performance. | |
| 196. |
As of 2000, the reference system to find the performance of a system is |
| A. | ultra sparc 10 |
| B. | sun sparc |
| C. | sun ii |
| D. | none of the mentioned |
| Answer» A. ultra sparc 10 | |
| Explanation: in spec system of measuring a system’s performance, a system is used as a reference against which other systems are compared and performance is determined. | |
| 197. |
When Performing a looping operation, the instruction gets stored in the |
| A. | registers |
| B. | cache |
| C. | system heap |
| D. | system stack |
| Answer» B. cache | |
| Explanation: when a looping or branching operation is carried out the offset value is stored in the cache along with the data. | |
| 198. |
The average number of steps taken to execute the set of instructions can be made to be less than one by following |
| A. | isa |
| B. | pipe-lining |
| C. | super-scaling |
| D. | sequential |
| Answer» C. super-scaling | |
| Explanation: the number of steps required to execute a given set of instructions is sufficiently reduced by using super-scaling. in this method, a set of instructions are grouped together and are processed. | |
| 199. |
If a processor clock is rated as 1250 million cycles per second, then its clock period is |
| A. | 1.9 * 10-10 sec |
| B. | 1.6 * 10-9 sec |
| C. | 1.25 * 10-10 sec |
| D. | 8 * 10-10 sec |
| Answer» D. 8 * 10-10 sec | |
| Explanation: none. | |
| 200. |
If the instruction, Add R1, R2, R3 is executed in a system that is pipe-lined, then the value of S is (Where S is a term of the Basic performance equation)? |
| A. | 3 |
| B. | ~2 |
| C. | ~1 |
| D. | 6 |
| Answer» C. ~1 | |
| Explanation: s is the number of steps required to execute the instructions. | |
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.