Karnataka SET (KSET) Computer System Architecture Previous Year Questions
Try the preview and open any solution for a worked explanation.
Karnataka SET (KSET) practice pack
The practice pack for Karnataka SET (KSET) is coming soon to LawMint.
Question 1
For a given Boolean expression, F = X.Y.Z + X.Y. + X.Y.Z + .Y, the simplified Boolean expression is
Question 2
The decimal equivalent of the hexadecimal number F3E is
Question 3
Match the following :
| List - I | List - II |
| a. MAR | (i) Holds the address of the next instruction to fetch |
| b. MBR | (ii) Holds the instruction for decoding |
| c. IR | (iii) Holds the address of instruction or data |
| d. PC | (iv) Holds the data |
Question 4
"Sequential portion of the program does not change with respect to machine size, however, the parallel portion is evenly executed by 'n' processors results in a reduced time" is
Question 5
The first machine cycle of an instruction is always a __________ cycle.
Question 6
If the operand is given explicitly in the instruction, the addressing mode is called
Question 7
Consider cache with 128 blocks of 16 words, and main memory has 4096 blocks of 16 words, and assume 64 sets for the Set Associate Mapping. Match the addressing scheme for cache memory mapping :
| a. Direct mapping | (i) 12 bit for tag and 4 bit for word |
| b. Associate mapping | (ii) 6 bit for tag, 6 bit for set and 4 bit for word |
| c. Set associate mapping | (iii) 5 bit for tag, 7 bit for block and 4 bit for word |
Question 8
Match the following:
| List-I | List-II |
| a. Temporal locality of reference | (i) If an instruction is executed now, more likely the instruction will be executed in future |
| b. Spatial locality of reference | (ii) Instructions are executed one after the other |
| c. Sequential locality of reference | (iii) If an instruction is referred to now, instructions at nearby addresses are more likely to be referred to soon |
Question 9
Match the following:
| List-I | List-II |
| a. DRAM | (i) Offloads data transfer main memory to devices bypassing CPU |
| b. DMA | (ii) Dynamic memory |
| c. Associative mapping | (iii) I/O devices treated as memory locations |
| d. Memory-mapped I/O | (iv) Flexible cache mapping by content |
Question 10
In the absence of data and control hazards, the k-unit instruction unit pipeline with n instructions has speed up
Previous papers with Computer System Architecture questions
Karnataka SET (KSET) practice pack
The practice pack for Karnataka SET (KSET) is coming soon to LawMint.