MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 445 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.
| 301. |
What is a CPS merges technologies? |
| A. | 5c |
| B. | 2c |
| C. | 3c |
| D. | 4c |
| Answer» D. 4c | |
| 302. |
Type of HPC applications of? |
| A. | management |
| B. | media mass |
| C. | business |
| D. | science |
| Answer» E. | |
| 303. |
Uniprocessor computing devices is called__________? |
| A. | grid computing |
| B. | centralized computing |
| C. | parallel computing |
| D. | distributed computing |
| Answer» C. parallel computing | |
| 304. |
Utility computing focuses on a______________ model? |
| A. | data |
| B. | cloud |
| C. | scalable |
| D. | business |
| Answer» E. | |
| 305. |
Distributed program in a distributed computer running a is known as? |
| A. | distributed process |
| B. | distributed program |
| C. | distributed application |
| D. | distributed computing |
| Answer» C. distributed application | |
| 306. |
Resources and clients transparency that allows movement within a system is called? |
| A. | mobility transparency |
| B. | concurrency transparency |
| C. | performance transparency |
| D. | replication transparency |
| Answer» B. concurrency transparency | |
| 307. |
Broader concept offers Cloud computing .to select which of the following? |
| A. | parallel computing |
| B. | centralized computing |
| C. | utility computing |
| D. | decentralized computing |
| Answer» D. decentralized computing | |
| 308. |
Data access and storage are elements of Job throughput, of __________? |
| A. | flexibility |
| B. | adaptation |
| C. | efficiency |
| D. | dependability |
| Answer» D. dependability | |
| 309. |
Billions of job requests is over massive data sets, ability to support known as? |
| A. | efficiency |
| B. | dependability |
| C. | adaptation |
| D. | flexibility |
| Answer» D. flexibility | |
| 310. |
We have an internet cloud of resources In cloud computing to form? |
| A. | centralized computing |
| B. | decentralized computing |
| C. | parallel computing |
| D. | all of these |
| Answer» E. | |
| 311. |
Virtualization that creates one single address space architecture that of, is called? |
| A. | loosely coupled |
| B. | peer-to-peer |
| C. | space-based |
| D. | tightly coupled |
| Answer» D. tightly coupled | |
| 312. |
Type HTC applications are? |
| A. | business |
| B. | engineering |
| C. | science |
| D. | media mass |
| Answer» B. engineering | |
| 313. |
Built of Peer machines are over? |
| A. | many server machines |
| B. | 1 server machine |
| C. | 1 client machine |
| D. | many client machines |
| Answer» E. | |
| 314. |
Significant characteristics of Distributed systems have of ? |
| A. | 5 types |
| B. | 2 types |
| C. | 3 types |
| D. | 4 types |
| Answer» D. 4 types | |
| 315. |
No special machines manage the network of architecture in which resources are known as? |
| A. | peer-to-peer |
| B. | space based |
| C. | tightly coupled |
| D. | loosely coupled |
| Answer» B. space based | |
| 316. |
In which systems desire HPC and HTC? |
| A. | adaptivity |
| B. | transparency |
| C. | dependency |
| D. | secretive |
| Answer» C. dependency | |
| 317. |
Dynamic networks of networks, is a dynamic connection that grows is called? |
| A. | multithreading |
| B. | cyber cycle |
| C. | internet of things |
| D. | cyber-physical system |
| Answer» D. cyber-physical system | |
| 318. |
Simplifies applications of three-tier architecture is ____________? |
| A. | maintenance |
| B. | initiation |
| C. | implementation |
| D. | deployment |
| Answer» E. | |
| 319. |
The gather operation is exactly the inverse of the? |
| A. | scatter operation |
| B. | broadcast operation |
| C. | prefix sum |
| D. | reduction operation |
| Answer» B. broadcast operation | |
| 320. |
In the scatter operation? |
| A. | single node send a unique message of size m to every other node |
| B. | single node send a same message of size m to every other node |
| C. | single node send a unique message of size m to next node |
| D. | none of above |
| Answer» B. single node send a same message of size m to every other node | |
| 321. |
The Prefix Sum Operation can be implemented using the? |
| A. | all-to-all broadcast kernel. |
| B. | all-to-one broadcast kernel. |
| C. | one-to-all broadcast kernel |
| D. | scatter kernel |
| Answer» B. all-to-one broadcast kernel. | |
| 322. |
The dual of one-to-all broadcast is? |
| A. | all-to-one reduction |
| B. | all-to-one receiver |
| C. | all-to-one sum |
| D. | none of above |
| Answer» B. all-to-one receiver | |
| 323. |
Speculative Decomposition consist of ? |
| A. | conservative approaches |
| B. | optimistic approaches |
| C. | both a and b |
| D. | only b |
| Answer» D. only b | |
| 324. |
A simple application of exploratory decomposition is? |
| A. | the solution to a 15 puzzle |
| B. | the solution to 20 puzzle |
| C. | the solution to any puzzle |
| D. | none of above |
| Answer» B. the solution to 20 puzzle | |
| 325. |
The Owner Computes Rule generally states that the process assigned a particular data item are responsible for? |
| A. | all computation associated with it |
| B. | only one computation |
| C. | only two computation |
| D. | only occasionally computation |
| Answer» B. only one computation | |
| 326. |
The First step in developing a parallel algorithm is? |
| A. | to decompose the problem into tasks that can be executed concurrently |
| B. | execute directly |
| C. | execute indirectly |
| D. | none of above |
| Answer» B. execute directly | |
| 327. |
A single control unit that dispatches the same Instruction to various processors is? |
| A. | simd |
| B. | spmd |
| C. | mimd |
| D. | none of above |
| Answer» B. spmd | |
| 328. |
The fraction of data references satisfied by the cache is called? |
| A. | cache hit ratio |
| B. | cache fit ratio |
| C. | cache best ratio |
| D. | none of above |
| Answer» B. cache fit ratio | |
| 329. |
The primary forms of data exchange between parallel tasks are? |
| A. | accessing a shared data space |
| B. | exchanging messages. |
| C. | both a and b |
| D. | none of above |
| Answer» D. none of above | |
| 330. |
Memory system performance is largely captured by? |
| A. | latency |
| B. | bandwidth |
| C. | both a and b |
| D. | none of above |
| Answer» D. none of above | |
| 331. |
VLIW processors rely on? |
| A. | compile time analysis |
| B. | initial time analysis |
| C. | final time analysis |
| D. | mid time analysis |
| Answer» B. initial time analysis | |
| 332. |
A pipeline is like? |
| A. | overlaps various stages of instruction execution to achieve performance. |
| B. | house pipeline |
| C. | both a and b |
| D. | a gas line |
| Answer» B. house pipeline | |
| 333. |
Data intensive applications utilize? |
| A. | high aggregate throughput |
| B. | high aggregate network bandwidth |
| C. | high processing and memory system performance. |
| D. | none of above |
| Answer» B. high aggregate network bandwidth | |
| 334. |
Scheduling of instructions is determined? |
| A. | true data dependency |
| B. | resource dependency |
| C. | branch dependency |
| D. | all of above |
| Answer» E. | |
| 335. |
Conventional architectures coarsely comprise of a? |
| A. | a processor |
| B. | memory system |
| C. | data path. |
| D. | all of above |
| Answer» E. | |
| 336. |
Gather operation is also known as ________? |
| A. | one to all personalized communication |
| B. | one to all broadcast |
| C. | all to one reduction |
| D. | all to all broadcast |
| Answer» B. one to all broadcast | |
| 337. |
In which of the following operation, a single node sends a unique message of size m to every other node? |
| A. | gather |
| B. | scatter |
| C. | one to all personalized communication |
| D. | both a and c |
| Answer» E. | |
| 338. |
Parallel algorithms often require a single process to send identical data to all other processes or to a subset of them. This operation is known as _________? |
| A. | one-to-all broadcast |
| B. | all to one broadcast |
| C. | one-to-all reduction |
| D. | all to one reduction |
| Answer» B. all to one broadcast | |
| 339. |
The gather operation is exactly the inverse of the ? |
| A. | scatter operation |
| B. | broadcast operation |
| C. | prefix sum |
| D. | reduction operation |
| Answer» B. broadcast operation | |
| 340. |
The Prefix Sum Operation can be implemented using the ? |
| A. | all-to-all broadcast kernel. |
| B. | all-to-one broadcast kernel. |
| C. | one-to-all broadcast kernel |
| D. | scatter kernel |
| Answer» B. all-to-one broadcast kernel. | |
| 341. |
In the scatter operation ? |
| A. | single node send a unique message of size m to every other node |
| B. | single node send a same message of size m to every other node |
| C. | single node send a unique message of size m to next node |
| D. | none of above |
| Answer» B. single node send a same message of size m to every other node | |
| 342. |
A hypercube has? |
| A. | 2d nodes |
| B. | 2d nodes |
| C. | 2n nodes |
| D. | n nodes |
| Answer» B. 2d nodes | |
| 343. |
The dual of one-to-all broadcast is ? |
| A. | all-to-one reduction |
| B. | all-to-one receiver |
| C. | all-to-one sum |
| D. | none of above |
| Answer» B. all-to-one receiver | |
| 344. |
The___ time collectively spent by all the processing elements Tall = p TP? |
| A. | total |
| B. | average |
| C. | mean |
| D. | sum |
| Answer» B. average | |
| 345. |
_________ is a method for inducing concurrency in problems that can be solved using the divide-and-conquer strategy? |
| A. | exploratory decomposition |
| B. | speculative decomposition |
| C. | data-decomposition |
| D. | recursive decomposition |
| Answer» D. recursive decomposition | |
| 346. |
Parallel computing means to divide the job into several __________? |
| A. | bit |
| B. | data |
| C. | instruction |
| D. | task |
| Answer» E. | |
| 347. |
Speed up is defined as a ratio of? |
| A. | s=ts/tp |
| B. | s= tp/ts |
| C. | ts=s/tp |
| D. | tp=s /ts |
| Answer» B. s= tp/ts | |
| 348. |
Type of parallelism that is naturally expressed by independent tasks in a task-dependency graph is called _______ parallelism? |
| A. | task |
| B. | instruction |
| C. | data |
| D. | program |
| Answer» B. instruction | |
| 349. |
Interaction overheads can be minimized by____? |
| A. | maximize data locality |
| B. | maximize volume of data exchange |
| C. | increase bandwidth |
| D. | minimize social media contents |
| Answer» B. maximize volume of data exchange | |
| 350. |
The pattern of___________ among tasks is captured by what is known as a task-interaction graph? |
| A. | interaction |
| B. | communication |
| C. | optmization |
| D. | flow |
| Answer» B. communication | |