MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 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.
| 1. |
CUDA Hardware programming model supports:a) fully generally data-parallel archtecture;b) General thread launch;c) Global load-store;d) Parallel data cache;e) Scalar architecture;f) Integers, bit operation |
| A. | a,c,d,f |
| B. | b,c,d,e |
| C. | a,d,e,f |
| D. | a,b,c,d,e,f |
| Answer» E. | |
| 2. |
In CUDA memory model there are following memory types available:a) Registers;b) Local Memory;c) Shared Memory;d) Global Memory;e) Constant Memory;f) Texture Memory. |
| A. | a, b, d, f |
| B. | a, c, d, e, f |
| C. | a, b, c, d, e, f |
| D. | b, c, e, f |
| Answer» D. b, c, e, f | |
| 3. |
The time that elapses from the moment the first processor starts to the moment the last processor finishes execution is called as . |
| A. | parallel runtime |
| B. | overhead runtime |
| C. | excess runtime |
| D. | serial runtime |
| Answer» C. excess runtime | |
| 4. |
to solve the all-pairs shortest paths problem which algorithm's is/are used a) Floyd's algorithm b) Dijkstra's single-source shortest paths c) Prim's Algorithm d) Kruskal's Algorithm |
| A. | and c) |
| B. | and b) |
| C. | and c) |
| D. | and d) |
| Answer» C. and c) | |
| 5. |
All-to-All Broadcast and Reduction algorithm on a Ring terminates in steps. |
| A. | p+1 |
| B. | p-1 |
| C. | p*p |
| D. | p |
| Answer» D. p | |
| 6. |
In All-to-All Personalized Communication on a Ring, the size of the message reduces by at each step |
| A. | p |
| B. | m-1 |
| C. | p-1 |
| D. | m |
| Answer» B. m-1 | |
| 7. |
Select correct answer: DRAM access times have only improved at the rate of roughly % per year over this interval. |
| A. | 20 |
| B. | 40 |
| C. | 50 |
| D. | 10 |
| Answer» B. 40 | |
| 8. |
All-to-all personalized communication is also known as . |
| A. | total exchange |
| B. | both of the above |
| C. | none of the above |
| D. | partial exchange |
| Answer» C. none of the above | |
| 9. |
Which is the sorting algorithm in below given steps - 1. procedure X_SORT(n)2. begin3. for i := n - 1 downto 1 do4. for j := 1 to i do5. compare-exchange(aj, aj + 1);6. end X_SORT |
| A. | selection sort |
| B. | bubble sort |
| C. | parallel selcetion sort |
| D. | parallel bubble sort |
| Answer» C. parallel selcetion sort | |
| 10. |
Which of the following is TRUE for Bitonic Sequencea) Monotonically increasingb) Monotonically Decreasingc) With cyclic shift of indicesd) First increasing then decreasing |
| A. | and b) |
| B. | and b) and d) |
| C. | and b) and c) |
| D. | and b) and c) and d) |
| Answer» E. | |