MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 170 Mcqs, each offering curated multiple-choice questions to sharpen your Electrical Engineering knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
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» D. none of the mentioned | |
| 52. |
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» C. one more process can execute in its critical section | |
| 53. |
If timestamps of two events are same, then the events are |
| A. | concurrent |
| B. | non-concurrent |
| C. | monotonic |
| D. | non-monotonic |
| Answer» B. non-concurrent | |
| 54. |
In distributed systems, a logical clock is associated with |
| A. | each instruction |
| B. | each process |
| C. | each register |
| D. | none of the mentioned |
| Answer» C. each register | |
| 55. |
In Log-based fault tolerance, logs of undetermined events are saved and replayed on failure. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 56. |
In N-version programming which is the independent generation of N, the value of N is |
| A. | greater than 1 |
| B. | less than 1 |
| C. | greater than 2 |
| D. | less than 2 |
| Answer» D. less than 2 | |
| 57. |
Non-occurrence of improper alteration of information is known as |
| A. | available dependability |
| B. | confidential dependability |
| C. | maintainable dependability |
| D. | integral dependability |
| Answer» E. | |
| 58. |
A system maintaining its integrity while accepting a temporary halt in its operation is said to be in a state of |
| A. | full fault tolerance |
| B. | graceful degradation |
| C. | fail soft |
| D. | fail safe |
| Answer» E. | |
| 59. |
What type of fault remains in the system for some period and then disappears? |
| A. | permanent |
| B. | transient |
| C. | intermittent |
| D. | all of the mentioned |
| Answer» C. intermittent | |
| 60. |
A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. Can the processes be scheduled without missing the deadlines? |
| A. | yes |
| B. | no |
| C. | maybe |
| D. | none of the mentioned |
| Answer» C. maybe | |
| 61. |
If a set of processes cannot be scheduled by rate monotonic scheduling algorithm, then |
| A. | they can be scheduled by edf algorithm |
| B. | they cannot be scheduled by edf algorithm |
| C. | they cannot be scheduled by any other algorithm |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 62. |
The scheduler admits a process using |
| A. | two phase locking protocol |
| B. | admission control algorithm |
| C. | busy wait polling |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 63. |
Is it possible to schedule these tasks so that each meets its deadline using Rate monotonic scheduling? |
| A. | yes |
| B. | no |
| C. | maybe |
| D. | none of the mentioned |
| Answer» B. no | |
| 64. |
In rate monotonic scheduling, a process with a shorter period is assigned |
| A. | a higher priority |
| B. | a lower priority |
| C. | higher & lower priority |
| D. | none of the mentioned |
| Answer» B. a lower priority | |
| 65. |
If the period of a process is ‘p’, then what is the rate of the task? |
| A. | p2 |
| B. | 2*p |
| C. | 1/p |
| D. | p |
| Answer» D. p | |
| 66. |
Rate monotonic scheduling assumes that the |
| A. | processing time of a periodic process is same for each cpu burst |
| B. | processing time of a periodic process is different for each cpu burst |
| C. | periods of all processes is the same |
| D. | none of the mentioned |
| Answer» B. processing time of a periodic process is different for each cpu burst | |
| 67. |
To schedule the processes, they are considered |
| A. | infinitely long |
| B. | periodic |
| C. | heavy weight |
| D. | light weight |
| Answer» C. heavy weight | |
| 68. |
Which estimation technique can be used if interfaces to software synthesis tools and hardware synthesis tools exist? |
| A. | performance value |
| B. | estimated cost |
| C. | estimated cost and performance value |
| D. | accurate cost and performance value |
| Answer» E. | |
| 69. |
Which estimate approach takes more time to consume? |
| A. | accurate value |
| B. | estimated value |
| C. | accurate cost and performance value |
| D. | estimated cost and performance value |
| Answer» D. estimated cost and performance value | |
| 70. |
Which of the following is the base for scheduling algorithm? |
| A. | wcet |
| B. | time |
| C. | execution time |
| D. | address accessing time |
| Answer» B. time | |
| 71. |
Which estimate approach is more precise? |
| A. | estimated cost and performance value |
| B. | accurate cost and performance value |
| C. | performance value and execution time |
| D. | estimated cost |
| Answer» C. performance value and execution time | |
| 72. |
Which estimation approach is used by Jha and Dutt for hardware? |
| A. | accurate cost and performance value |
| B. | estimated cost and performance value |
| C. | performance value |
| D. | accurate cost |
| Answer» C. performance value | |
| 73. |
The WCET of which component can be computed if the task is mapped to hardware? |
| A. | hardware |
| B. | task |
| C. | both task and hardware |
| D. | application manager |
| Answer» B. task | |
| 74. |
For which of the following WCET can be computed? |
| A. | c program |
| B. | assembly language |
| C. | vhdl |
| D. | program without recursion |
| Answer» E. | |
| 75. |
What does WCTE stand for? |
| A. | wait case execution time |
| B. | wait case encoder time |
| C. | worst case execution time |
| D. | worst code execution time |
| Answer» D. worst code execution time | |
| 76. |
Identify the standard software components that can be reused? |
| A. | application manager |
| B. | operating system |
| C. | application software |
| D. | memory |
| Answer» C. application software | |
| 77. |
VxWorks is centered around |
| A. | wind microkernel |
| B. | linux kernel |
| C. | unix kernel |
| D. | none of the mentioned |
| Answer» B. linux kernel | |
| 78. |
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» C. execution latency | |
| 79. |
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» C. equal share scheduling | |
| 80. |
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» B. priority inversion protocol | |
| 81. |
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» B. longer duration job has higher priority | |
| 82. |
For real time operating systems, interrupt latency should be |
| A. | minimal |
| B. | maximum |
| C. | zero |
| D. | dependent on the scheduling |
| Answer» B. maximum | |
| 83. |
In real time operating system |
| A. | all processes have the same priority |
| B. | a task must be serviced by its deadline period |
| C. | process scheduling can be done only once |
| D. | kernel is not required |
| Answer» C. process scheduling can be done only once | |
| 84. |
How can one compute the power consumption of the cache? |
| A. | lee power model |
| B. | first power model |
| C. | third power model |
| D. | cacti |
| Answer» E. | |
| 85. |
What is the solution to the knapsack problem? |
| A. | many-to-many mapping |
| B. | one-to-many mapping |
| C. | many-to-one mapping |
| D. | one-to-one mapping |
| Answer» E. | |
| 86. |
Which model is based on precise measurements using real hardware? |
| A. | encc energy-aware compiler |
| B. | first power model |
| C. | third power model |
| D. | second power model |
| Answer» B. first power model | |
| 87. |
What does SPM stand for? |
| A. | scratch pad memories |
| B. | sensor parity machine |
| C. | scratch pad machine |
| D. | sensor parity memories |
| Answer» B. sensor parity machine | |
| 88. |
Which compiler is based on the precise measurements of two fixed configurations? |
| A. | first power model |
| B. | second power model |
| C. | third power model |
| D. | fourth power model |
| Answer» D. fourth power model | |
| 89. |
Who proposed the third power model? |
| A. | tiwari |
| B. | russell |
| C. | jacome |
| D. | russell and jacome |
| Answer» E. | |
| 90. |
Who proposed the first power model? |
| A. | jacome |
| B. | russell |
| C. | tiwari |
| D. | russell and jacome |
| Answer» D. russell and jacome | |
| 91. |
Which of the following is an important ingredient of all power optimization? |
| A. | energy model |
| B. | power model |
| C. | watt model |
| D. | power compiler |
| Answer» C. watt model | |
| 92. |
Which browser gives maximum parallel connections per host? |
| A. | opera 10 |
| B. | chrome 1 and 2 |
| C. | safari 3 and 4 |
| D. | firefox 3 |
| Answer» B. chrome 1 and 2 | |
| 93. |
Which of the following is not the layer of the OSI Model? |
| A. | transport layer |
| B. | network layer |
| C. | session layer |
| D. | atomic layer |
| Answer» E. | |
| 94. |
Which of the following is the Waterfall tool? |
| A. | webpagetest.org |
| B. | dotcom-monitor |
| C. | pingdom speed test |
| D. | gtmetrix |
| Answer» B. dotcom-monitor | |
| 95. |
Which of the following help to meet and prove real-time constraints? |
| A. | simulator |
| B. | debugger |
| C. | emulator |
| D. | compiler |
| Answer» E. | |
| 96. |
What is not the work of database optimization? |
| A. | cleaning out old tables |
| B. | creating indexes |
| C. | optimize datatype |
| D. | delete database |
| Answer» E. | |
| 97. |
For best speed position of CSS code should be at |
| A. | at the bottom of the code |
| B. | at the middle of the code |
| C. | at the top of the code |
| D. | anywhere in the code |
| Answer» D. anywhere in the code | |
| 98. |
What is hotlink protection? |
| A. | stopping other sites from displaying images |
| B. | stopping other sites from displaying videos |
| C. | stopping access of source code |
| D. | compresses an image |
| Answer» B. stopping other sites from displaying videos | |
| 99. |
What is the work of Gzip compression? |
| A. | compresses an image |
| B. | compresses web pages only |
| C. | compresses javascript and css code only |
| D. | compresses web pages, javascript and css |
| Answer» E. | |
| 100. |
For best speed position of JavaScript code should be at |
| A. | top of the code |
| B. | bottom of the code |
| C. | middle of the code |
| D. | anywhere in the code |
| Answer» C. middle of the code | |