McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) .
| 251. |
What is the average running time of a quick sort algorithm? |
| A. | o(n) |
| B. | o(n log n) |
| C. | o(n2) |
| D. | o(log n) |
| Answer» B. o(n log n) | |
| 252. |
Odd-even transposition sort is a variation of |
| A. | quick sort |
| B. | shell sort |
| C. | bubble sort |
| D. | selection sort |
| Answer» C. bubble sort | |
| 253. |
What is the average case time complexity of odd-even transposition sort? |
| A. | o(n log n) |
| B. | o(n) |
| C. | o(log n) |
| D. | o(n2) |
| Answer» D. o(n2) | |
| 254. |
Shell sort is an improvement on |
| A. | quick sort |
| B. | bubble sort |
| C. | insertion sort |
| D. | selection sort |
| Answer» C. insertion sort | |
| 255. |
In parallel Quick Sort Pivot is sent to processes by |
| A. | broadcast |
| B. | multicast |
| C. | selective multicast |
| D. | unicast |
| Answer» A. broadcast | |
| 256. |
In parallel Quick Sort each process divides the unsorted list into |
| A. | n lists |
| B. | 2 lists |
| C. | 4 lists |
| D. | n-1 lists |
| Answer» B. 2 lists | |
| 257. |
Time Complexity of DFS is? (V – number of vertices, E – number of edges) |
| A. | o(v + e) |
| B. | o(v) |
| C. | o(e) |
| D. | o(v*e) |
| Answer» A. o(v + e) | |
| 258. |
A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use? |
| A. | bfs |
| B. | dfs |
| C. | prim\s |
| D. | kruskal\s |
| Answer» B. dfs | |
| 259. |
Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array |
| A. | n*p |
| B. | n-p |
| C. | p/n |
| D. | n/p |
| Answer» D. n/p | |
| 260. |
In parallel quick sort Pivot selecton strategy is crucial for |
| A. | maintaing load balance |
| B. | maintaining uniform distribution of elements in process groups |
| C. | effective pivot selection in next level |
| D. | all of the above |
| Answer» D. all of the above | |
| 261. |
In execution of the hypercube formulation of quicksort for d = 3, split along -----------dimention to partition sequence into two big blocks, one greater than pivot and other smaller than pivot as shown in diagram |
| A. | first |
| B. | scond |
| C. | third |
| D. | none of above |
| Answer» C. third | |
| 262. |
Which Parallel formulation of Quick sort is possible |
| A. | shared-address-space parallel formulation |
| B. | message passing formulation |
| C. | hypercube formulation |
| D. | all of the above |
| Answer» D. all of the above | |
| 263. |
Which formulation of Dijkstra's algorithm exploits more parallelism |
| A. | source-partitioned formulation |
| B. | source-parallel formulation |
| C. | partitioned-parallel formulation |
| D. | all of above |
| Answer» B. source-parallel formulation | |
| 264. |
In Dijkstra's all pair shortest path each process compute the single-source shortest paths for all vertices assigned to it in SOURCE PARTITIONED FORMULATION |
| A. | true |
| B. | false |
| Answer» A. true | |
| 265. |
A complete graph is a graph in which each pair of vertices is adjacent |
| A. | true |
| B. | false |
| Answer» A. true | |
| 266. |
The space required to store the adjacency matrix of a graph with n vertices is |
| A. | in order of n |
| B. | in order of n log n |
| C. | in order of n squared |
| D. | in order of n/2 |
| Answer» C. in order of n squared | |
| 267. |
Graph can be represented by |
| A. | identity matrix |
| B. | adjacency matrix |
| C. | sprse list |
| D. | sparse matrix |
| Answer» B. adjacency matrix | |
| 268. |
to solve the all-pairs shortest paths problem which algorithm's is/are used
|
| A. | a) and c) |
| B. | a) and b) |
| C. | b) and c) |
| D. | c) and d) |
| Answer» B. a) and b) | |
| 269. |
Simple backtracking is a depth-first search method that terminates upon finding the first solution. |
| A. | true |
| B. | false |
| Answer» A. true | |
| 270. |
Best-first search (BFS) algorithms can search both graphs and trees. |
| A. | true |
| B. | false |
| Answer» A. true | |
| 271. |
A* algorithm is a |
| A. | bfs algorithm |
| B. | dfs algorithm |
| C. | prim\s algorithm |
| D. | kruskal\s algorithm |
| Answer» A. bfs algorithm | |
| 272. |
identify Load-Balancing Scheme/s |
| A. | asynchronous round robin |
| B. | global round robin |
| C. | random polling |
| D. | all above methods |
| Answer» D. all above methods | |
| 273. |
important component of best-first search (BFS) algorithms is |
| A. | open list |
| B. | closed list |
| C. | node list |
| D. | mode list |
| Answer» A. open list | |
| 274. |
A CUDA program is comprised of two primary components: a host and a _____. |
| A. | gpu kernel |
| B. | cpu kernel |
| C. | os |
| D. | none of above |
| Answer» A. gpu kernel | |
| 275. |
The kernel code is dentified by the ________qualifier with void return type |
| A. | _host_ |
| B. | __global__ |
| C. | _device_ |
| D. | void |
| Answer» B. __global__ | |
| 276. |
the BlockPerGrid and ThreadPerBlock parameters are related to the ________ model supported by CUDA. |
| A. | host |
| B. | kernel |
| C. | thread abstraction |
| D. | none of above |
| Answer» C. thread abstraction | |
| 277. |
_________ is Callable from the device only |
| A. | _host_ |
| B. | __global__ |
| C. | _device_ |
| D. | none of above |
| Answer» C. _device_ | |
| 278. |
______ is Callable from the host |
| A. | _host_ |
| B. | __global__ |
| C. | _device_ |
| D. | none of above |
| Answer» B. __global__ | |
| 279. |
______ is Callable from the host |
| A. | _host_ |
| B. | __global__ |
| C. | _device_ |
| D. | none of above |
| Answer» A. _host_ | |
| 280. |
Cache memory works on the principle of |
| A. | locality of data |
| B. | locality of memory |
| C. | locality of reference |
| D. | locality of reference & memory |
| Answer» C. locality of reference | |
| 281. |
SIMD represents an organization that ______________. |
| A. | refers to a computer system capable of processing several programs at the same time. |
| B. | represents organization of single computer containing a control unit, processor unit and a memory unit. |
| C. | includes many processing units under the supervision of a common control unit |
| D. | none of the above. |
| Answer» C. includes many processing units under the supervision of a common control unit | |
| 282. |
Select different aspects of parallelism |
| A. | server applications utilize high aggregate network bandwidth |
| B. | scientific applications typically utilize high processing and memory system performance |
| C. | all of the above |
| D. | data intensive applications utilize high aggregate throughput |
| Answer» D. data intensive applications utilize high aggregate throughput | |
| 283. |
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» A. 20 | |
| 284. |
Analyze, if the second instruction has data dependencies with the first, but the third instruction does not, the first |
| A. | out-of-order |
| B. | both of the above |
| C. | none of the above |
| D. | in-order |
| Answer» B. both of the above | |
| 285. |
Select the parameters which captures Memory system performance |
| A. | bandwidth |
| B. | both of the above |
| C. | none of the above |
| D. | latency |
| Answer» C. none of the above | |
| 286. |
Consider the example of a fire- hose. If the water comes out of the hose five seconds after the hydrant is turned on. Once the water starts flowing, if the hydrant delivers water at the rate of 15 gallons/second. Analyze the bandwidth and latency. |
| A. | bandwidth: 5*15 gallons/second and latency: 15 seconds |
| B. | bandwidth: 15 gallons/second and latency: 5 seconds |
| C. | bandwidth: 3 gallons/second and latency: 5 seconds |
| D. | bandwidth: 5 gallons/second and latency: 15 seconds |
| Answer» C. bandwidth: 3 gallons/second and latency: 5 seconds | |
| 287. |
Select alternate approaches for Hiding Memory Latency |
| A. | multithreading |
| B. | spatial locality |
| C. | all of the above |
| D. | prefeching |
| Answer» D. prefeching | |
| 288. |
Select which clause in OpenMP is similar to the private, except values of variables are initialized to corresponding values before the |
| A. | firstprivate |
| B. | shared |
| C. | all of the above |
| D. | private |
| Answer» B. shared | |
| 289. |
Which of the following projects of Blue Gene is not in development? |
| A. | blue gene / m |
| B. | blue gene / p |
| C. | blue gene / q |
| D. | blue gene / l |
| Answer» B. blue gene / p | |
| 290. |
A decomposition can be illustrated in the form of a directed graph with nodes corresponding to tasks and edges indicating that the result of one task is required for processing the next. Such graph is called as |
| A. | task dependency graph |
| B. | task interaction graph |
| C. | process interaction graph |
| D. | process dependency graph |
| Answer» B. task interaction graph | |
| 291. |
In which case, the owner computes rule implies that the output is computed by the process to which the output data is assigned? |
| A. | output data decomposition |
| B. | both of the above |
| C. | none of the above |
| D. | input data decomposition |
| Answer» B. both of the above | |
| 292. |
Select relevant task characteristics from the options given below: |
| A. | task sizes |
| B. | size of data associated with tasks |
| C. | all of the above |
| D. | task generation |
| Answer» D. task generation | |
| 293. |
A classic example of game playing - each 15 puzzle board is the example of |
| A. | dynamic task generation |
| B. | none of the above |
| C. | all of the above |
| D. | static task generation |
| Answer» B. none of the above | |
| 294. |
Which model is equally suitable to shared-address- space or message- passing paradigms, since the interaction is naturally two ways. |
| A. | master slave model |
| B. | data parallel model |
| C. | producer consumer or pipeline model |
| D. | work pool model |
| Answer» B. data parallel model | |
| 295. |
In which type of the model, tasks are dynamically assigned to the processes for balancing the load? |
| A. | master slave model |
| B. | data parallel model |
| C. | producer consumer or pipeline model |
| D. | work pool model |
| Answer» A. master slave model | |
| 296. |
Select the appropriate stage of GPU Pipeline which receives commands from CPU and also pulls geometry information from system memory. |
| A. | vertex processing |
| B. | memory interface |
| C. | host interface |
| D. | pixel processing |
| Answer» D. pixel processing | |
| 297. |
In all-to-one reduction, data items must be combined piece-wise and the result made available at a processor. |
| A. | last |
| B. | target |
| C. | n-1 |
| D. | first |
| Answer» C. n-1 | |
| 298. |
Analyze the Cost of Scatter and Gather . |
| A. | t=ts log p + tw m (p-1) |
| B. | t=ts log p - tw m (p-1) |
| C. | t=tw log p - ts m (p-1) |
| D. | t=tw log p + ts m (p-1) |
| Answer» B. t=ts log p - tw m (p-1) | |
| 299. |
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» B. both of the above | |
| 300. |
All-to-all personalized communication is performed independently in each row with clustered messages of size on a mesh. |
| A. | p |
| B. | m√p |
| C. | p√m |
| D. | m |
| Answer» C. p√m | |
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.