MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 950 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 351. |
The            process divides the disk into sectors and tracks. |
| A. | creation |
| B. | initiation |
| C. | formatting |
| D. | modification |
| Answer» D. modification | |
| 352. |
To distinguish between two sectors we make use of |
| A. | inter sector gap |
| B. | splitting bit |
| C. | numbering bit |
| D. | none of the mentioned |
| Answer» B. splitting bit | |
| 353. |
The read and write operations usually start at               of the sector. |
| A. | center |
| B. | middle |
| C. | from the last used point |
| D. | boundaries |
| Answer» E. | |
| 354. |
The access time is composed of |
| A. | seek time |
| B. | rotational delay |
| C. | latency |
| D. | both seek time and rotational delay |
| Answer» E. | |
| 355. |
The data can be accessed from the disk using |
| A. | surface number |
| B. | sector number |
| C. | track number |
| D. | all of the mentioned |
| Answer» E. | |
| 356. |
The set of corresponding tracks on all surfaces of a stack of disks form a |
| A. | cluster |
| B. | cylinder |
| C. | group |
| D. | set |
| Answer» C. group | |
| 357. |
A hard disk with 20 surfaces will have            heads. |
| A. | 10 |
| B. | 5 |
| C. | 1 |
| D. | 20 |
| Answer» E. | |
| 358. |
The air pressure can be countered by putting               in the head-disc surface arrangement. |
| A. | air filter |
| B. | spring mechanism |
| C. | coolant |
| D. | none of the mentioned |
| Answer» C. coolant | |
| 359. |
The method of placing the heads and the discs in an air tight environment is also called as |
| A. | raid arrays |
| B. | atp tech |
| C. | winchester technology |
| D. | fleming reduction |
| Answer» D. fleming reduction | |
| 360. |
           pushes the heads away from the surface as they rotate at their standard rates. |
| A. | magnetic tension |
| B. | electric force |
| C. | air pressure |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 361. |
The drawback of Manchester encoding is |
| A. | the cost of the encoding scheme |
| B. | the speed of encoding the data |
| C. | the latency offered |
| D. | the low bit storage density provided |
| Answer» E. | |
| 362. |
One of the most widely used schemes of encoding used is |
| A. | nrz-polar |
| B. | rz-polar |
| C. | manchester |
| D. | block encoding |
| Answer» D. block encoding | |
| 363. |
The read/write heads must be near to disk surfaces for better storage. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 364. |
For the synchronization of the read head, we make use of a |
| A. | framing bit |
| B. | synchronization bit |
| C. | clock |
| D. | dirty bit |
| Answer» D. dirty bit | |
| 365. |
The digital information is stored on the hard disk by |
| A. | applying a suitable electric pulse |
| B. | applying a suitable magnetic field |
| C. | applying a suitable nuclear field |
| D. | by using optic waves |
| Answer» B. applying a suitable magnetic field | |
| 366. |
The main reason for the discontinuation of semi conductor based storage devices for providing large storage space is |
| A. | lack of sufficient resources |
| B. | high cost per bit value |
| C. | lack of speed of operation |
| D. | none of the mentioned |
| Answer» C. lack of speed of operation | |
| 367. |
The associatively mapped virtual memory makes use of |
| A. | tlb |
| B. | page table |
| C. | frame table |
| D. | none of the mentioned |
| Answer» B. page table | |
| 368. |
The virtual memory basically stores the next segment of data to be executed on the |
| A. | secondary storage |
| B. | disks |
| C. | ram |
| D. | rom |
| Answer» B. disks | |
| 369. |
The DMA doesn’t make use of the MMU for bulk data transfers. |
| A. | true |
| B. | false |
| Answer» C. | |
| 370. |
              translates the logical address into a physical address. |
| A. | mmu |
| B. | translator |
| C. | compiler |
| D. | linker |
| Answer» B. translator | |
| 371. |
                      is used to implement virtual memory organisation. |
| A. | page table |
| B. | frame table |
| C. | mmu |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 372. |
The binary address issued to data or instructions are called as |
| A. | physical address |
| B. | location |
| C. | relocatable address |
| D. | logical address |
| Answer» E. | |
| 373. |
The techniques which move the program blocks to or from the physical memory is called as |
| A. | paging |
| B. | virtual memory organisation |
| C. | overlays |
| D. | framing |
| Answer» C. overlays | |
| 374. |
The program is divided into operable parts called as |
| A. | frames |
| B. | segments |
| C. | pages |
| D. | sheets |
| Answer» C. pages | |
| 375. |
The physical memory is not as large as the address space spanned by the processor. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 376. |
If the instruction Add R1, R2, R3 is executed in a system which is pipelined, 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» D. 6 | |
| 377. |
Two processors A and B have clock frequencies of 700 Mhz and 900 Mhz respectively. Suppose A can execute an instruction with an average of 3 steps and B can execute with an average of 5 steps. For the execution of the same instruction which processor is faster. |
| A. | a |
| B. | b |
| C. | both take the same time |
| D. | insufficient information |
| Answer» B. b | |
| 378. |
The performance of the system is greatly influenced by increasing the level 1 cache. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 379. |
An effective to introduce parallelism in memory access is by |
| A. | memory interleaving |
| B. | tlb |
| C. | pages |
| D. | frames |
| Answer» B. tlb | |
| 380. |
The main purpose of having memory hierarchy is to |
| A. | reduce access time |
| B. | provide large capacity |
| C. | reduce propagation time |
| D. | reduce access time & provide large capacity |
| Answer» E. | |
| 381. |
The performance depends on |
| A. | the speed of execution only |
| B. | the speed of fetch and execution |
| C. | the speed of fetch only |
| D. | the hardware of the system only |
| Answer» C. the speed of fetch only | |
| 382. |
A common measure of performance is |
| A. | price/performance ratio |
| B. | performance/price ratio |
| C. | operation/price ratio |
| D. | none of the mentioned |
| Answer» B. performance/price ratio | |
| 383. |
The memory transfers between two variable speed devices are always done at the speed of the faster device. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 384. |
The key factor/s in commercial success of a computer is/are |
| A. | performance |
| B. | cost |
| C. | speed |
| D. | both performance and cost |
| Answer» E. | |
| 385. |
The counter that keeps track of how many times a block is most likely used is |
| A. | count |
| B. | reference counter |
| C. | use counter |
| D. | probable counter |
| Answer» C. use counter | |
| 386. |
The algorithm which removes the recently used page first is |
| A. | lru |
| B. | mru |
| C. | ofm |
| D. | none of the mentioned |
| Answer» C. ofm | |
| 387. |
The LRU can be improved by providing a little randomness in the access. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 388. |
In set associative and associative mapping there exists less flexibility. |
| A. | true |
| B. | false |
| Answer» C. | |
| 389. |
In associative mapping during LRU, the counter of the new block is set to ‘0’ and all the others are incremented by one when            occurs. |
| A. | delay |
| B. | miss |
| C. | hit |
| D. | delayed hit |
| Answer» C. hit | |
| 390. |
The algorithm which replaces the block which has not been referenced for a while is called |
| A. | lru |
| B. | orf |
| C. | direct |
| D. | both lru and orf |
| Answer» B. orf | |
| 391. |
The directly mapped cache no replacement algorithm is required. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 392. |
Highly encoded schemes that use compact codes to specify a small number of functions in each micro instruction is |
| A. | horizontal organisation |
| B. | vertical organisation |
| C. | diagonal organisation |
| D. | none of the mentioned |
| Answer» C. diagonal organisation | |
| 393. |
The signals are grouped such that mutually exclusive signals are put together. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 394. |
The case/s where micro-programmed can perform well |
| A. | when it requires to check the condition codes |
| B. | when it has to choose between the two alternatives |
| C. | when it is triggered by an interrupt |
| D. | none of the mentioned |
| Answer» E. | |
| 395. |
Every time a new instruction is loaded into IR the output of                   is loaded into UPC. |
| A. | starting address generator |
| B. | loader |
| C. | linker |
| D. | clock |
| Answer» B. loader | |
| 396. |
The special memory used to store the micro routines of a computer is |
| A. | control table |
| B. | control store |
| C. | control mart |
| D. | control shop |
| Answer» C. control mart | |
| 397. |
Individual control words of the micro routine are called as |
| A. | micro task |
| B. | micro operation |
| C. | micro instruction |
| D. | micro command |
| Answer» D. micro command | |
| 398. |
A sequence of control words corresponding to a control sequence is called |
| A. | micro routine |
| B. | micro function |
| C. | micro procedure |
| D. | none of the mentioned |
| Answer» B. micro function | |
| 399. |
In micro-programmed approach, the signals are generated by |
| A. | machine instructions |
| B. | system programs |
| C. | utility tools |
| D. | none of the mentioned |
| Answer» B. system programs | |
| 400. |
A word whose individual bits represent a control signal is |
| A. | command word |
| B. | control word |
| C. | co-ordination word |
| D. | generation word |
| Answer» C. co-ordination word | |