1. A CUDA program is comprised of two primary components: a host and a _____. cpu??kernel gpu??kernel os None of the options 2. _________ is Callable from the device only _host_ __global__?? _device_ None of the options 3. CUDA supports ____________ in which code in a single thread is executed by all other threads. tread division thread abstraction tread termination None of the options 4. The CUDA architecture consists of --------- for parallel computing kernels and functions. ptx instruction set architecture zisc instruction set architecture risc instruction set architecture cisc instruction set architecture 5. A grid is comprised of ________ of threads. block bunch host None of the options 6. _____ method is used in centralized systems to perform out of order execution. optimizing redundancy score boarding scorecard 7. In CUDA, a single invoked kernel is referred to as a _____. block tread grid None of the options 8. Triple angle brackets mark in a statement inside main function, what does it indicates? a call from host code to device code a call from device code to host code greater than comparison less than comparison 9. The computer cluster architecture emerged as an alternative for ____. isa super computers workstation distributed systems 10. Each streaming multiprocessor (SM) of CUDA herdware has ------ scalar processors (SP). 512 8 128 1024 11. ______ is Callable from the host _device_ __global__ _host_ None of the options 12. CUDA stands for --------, designed by NVIDIA. complex unidentified device architecture common union discrete architecture complex unstructured distributed architecture compute unified device architecture 13. Each NVIDIA GPU has ------ Streaming Multiprocessors 8 16 512 1024 14. a solution of the problem in representing the parallelismin algorithm is cuda cda cud pta 15. NVIDIA CUDA Warp is made up of how many threads? 312 1024 512 32 16. A block is comprised of multiple _______. bunch treads host None of the options 17. The kernel code is dentified by the ________qualifier with void return type _host_ _device_ __global__?? void 18. What makes a CUDA code runs in parallel kernel name outside triple angle bracket indicates excecution of kernel n times in parallel __global__ indicates parallel execution of code first parameter value inside triple angle bracket (n) indicates excecution of kernel n times in parallel main() function indicates parallel execution of code 19. Graph search involves a closed list, where the major operation is a _______ searching sorting lookup None of the options 20. Cost of a parallel system is sometimes referred to____ of product processor time both work and processor time none work 21. Breadth First Search is equivalent to which of the traversal in the Binary Trees? in-order traversal level-order traversal post-order traversal pre-order traversal 22. Which of the following is not a stable sorting algorithm in its typical implementation. bubble sort insertion sort merge sort quick sort 23. Time Complexity of Breadth First Search is? (V - number of vertices, E - number of edges) o(e) o(v + e) o(v) o(v*e) 24. Scaling Characteristics of Parallel Programs Ts is constant none decreases increase 25. ______ can be comparison-based or noncomparison-based. searching both searching and sorting sorting None of the options 26. Speedup tends to saturate and efficiency _____ as a consequence of Amdahls law. none decreases increase constant 27. how many basic communication operations are used in matrix vector multiplication 3 4 2 1 28. Which of the following is not an application of Breadth First Search? when the graph is a n-ary tree when the graph is a linked list when the graph is a binary tree when the graph is a ternary tree 29. In the Pipelined Execution, steps contain elimination all normalization communication 30. In BFS, how many times a node is visited? thrice twice once equivalent to number of indegree of the node 31. In DNS algorithm of matrix multiplication it used 3d partition both 1d partition and 2d partition 2d partition 1d partition 32. The fundamental operation of comparison-based sorting is ________. searching compare-exchange sorting swapping 33. the cost of the parallel algorithm is higher than the sequential run time by a factor of __ 3*2 02-03-2020 00:00 03-02-2020 00:00 2/3+3/2 34. A parallel algorithm is evaluated by its runtime in function of the number of processors, all the input size, the communication parameters. 35. many interactions in oractical parallel programs occur in _____ pattern straight well defined reverse zig-zac 36. In a broadcast and reduction on a balanced binary tree reduction is done in ______ straight order vertical order recursive order parallel order 37. if "X" is the message to broadcast it initially resides at the source node 0 2 8 1 38. For a problem consisting of W units of work, p__W processors can be used optimally. <= > >= < 39. The dual of all-to-all broadcast is all-to-one reduction none both all-to-all reduction and all-to-one reduction all-to-all reduction 40. C(W)__T(W) for optimality (necessary condition). <= < equals > 41. Group communication operations are built using which primitives? point to point one to all all to all None of the options 42. Generalization of broadcast in Which each processor is only destination source as well as destination only source None of the options 43. Similar communication pattern to all-to-all broadcast except in the_____ straight order parallel order reverse order vertical order 44. All-to-one communication (reduction) is the dual of ______ broadcast. one-to-one all-to-all one-to-all all-to-one 45. logical operators used in algorithm are xor and none both xor & and 46. Which is known as Broadcast? one-to-one all-to-all all-to-one one-to-all 47. All-to-all broadcast algorithm for the 2D mesh is based on the ring algorithm both A. linear array algorithm and ring algorithm linear array algorithm none 48. ___ can be performed in an identical fashion by inverting the process. recursive doubling reduction broadcast None of the options 49. Which is known as Reduction? all-to-all all-to-one one-to-all one-to-one 50. efficient implementation of basic communication operation can improve algorithm communication performance All of the options Submit Answers Retake Test More Computer Science Engineering Study Material › Computer Science Engineering Mock Tests with Answers Distributed Computing System Mock Test Software Project Management Mock TestArtificial Intelligence and Robotics Mock TestBasics of Database Management Mock TestC# Programming Mock TestC#.NET Programming Mock TestCloud Computing Mock TestCommunication Network Mock TestComputer Architecture Mock TestComputer Architecture and Organization Mock TestComputer Fundamentals Mock TestComputer Networking Mock TestComputer Networks Mock TestCPP Programming Mock TestData Analysis Mock TestData Communication and Computer Network Mock TestData Compression and Data Retrieval Mock TestData Mining and Business Intelligence Mock TestData Mining and Data Warehouse Mock TestData Structure and Algorithms Mock TestData Structures Mock TestDataBase Management System Mock TestDesign and Analysis of Algorithms Mock TestDigital Electronics and Logic Design Mock TestDigital Logic Circuits Mock TestDigital Principles and System Design Mock TestDiscrete Mathematics Mock TestDiscrete Structure Mock TestDotNet Technology Mock TestEmbedded Real Time Operating System Mock TestGreen Computing Mock TestHigh Performance Computing Mock TestInformation Cyber Security Mock TestInformation and Network Security Mock TestInformation Retrival Techniques Mock TestInformation Systems and Engineering Economics Mock TestMachine Learning Mock TestMicroprocessor and Interfacing Technique Mock TestMicroprocessors Mock TestMuli core Architectures and Pro Mock TestMulti core processors Mock TestNetwork Security Mock TestNeural Networks and Fuzzy Control Object Oriented Programming Mock TestOperating System Architecture Mock TestOperating System Mock TestProblem Solving and Python Programming Mock TestProgramming for Problem Solving Mock TestPython Programming Mock TestSoft Computing Mock TestSoftware Design Modeling Mock TestSoftware Engineering Mock TestSoftware Testing Mock TestSoftware Testing and Quality Assurance Mock TestTheory of Computation and Compiler Design Mock TestTheory of Computation Mock TestUbiquitous Computing System Mock Test Computer Science Engineering Mock Tests
