Home > Computer Engineering > Quizzes > Multi-core Architectures and Programming Practice Test: Parallel Program Development
Multi-core Architectures and Programming Practice Test: Parallel Program Development
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 59% • Most missed: “An _____________ is a program that finds the solution to an n-body problem by si…”
Multi-core Architectures and Programming Practice Test: Parallel Program Development
Time left 00:00
25 Questions

1. An _____________ is a program that finds the solution to an n-body problem by simulating the behavior of the particles.
2. What are the scoping clauses in OpenMP _________
3. ________________ takes the data in data to be packed and packs it into contig_buf.
4. A _____________ function is called by Fulfillrequest.
5. What are the algorithms for identifying which subtrees we assign to the processes or threads __________
6. Which of the following is not valid with reference to Message Passing Interface (MPI)?
7. _____________ begins by checking on the number of tours that the process has in its stack.
8. The ____________________ is a pointer to a block of memory allocated by the user program and buffersize is its size in bytes.
9. ________________ takes the data in data to be packed and packs it into contig_buf.
10. What are the algorithms for identifying which subtrees we assign to the processes or threads __________
11. For the reduced n-body solver, a ________________ will best distribute the workload in the computation of the forces.
12. The newly created stack into our private stack, set the newstack variable to_____________.
13. What are the scoping clauses in OpenMP _________
14. Using _____________ we can systematically visit each node of the tree that could possibly lead to a least-cost solution.
15. The ____________ is the distributed-memory version of the OpenMP busywait loop.
16. ______________ sent to false and continue in the loop.
17. The run-times of the serial solvers differed from the single-process MPI solvers by ______________.
18. The function My_avail_tour count can simply return the ________
19. Each node of the tree has an_________________ , that is, the cost of the partial tour.
20. Pthreads has a nonblocking version of pthreads_mutex_lock called __________
21. For the reduced n-body solver, a ________________ will best distribute the workload in the computation of the forces.
22. Pthreads has a nonblocking version of pthreads_mutex_lock called __________
23. Using _____________ we can systematically visit each node of the tree that could possibly lead to a least-cost solution.
24. Which of the following statements is not true?
25. Which of the following statements is not true?

⚡ Recently practiced quizzes in this topic
Live quiz activity
Information Technology Knowledge Test Computational Thinking Concepts Computer Fundamentals Practice Test: Secondary Storage Devices Computer Network MCQs General CS (Computer Science) Knowledge Test Big Data: NoSQL Green Computing Practice Test Natural Language Processing: Word Level Analysis Computer Fundamentals Practice Test Operating Systems Practice Test: Introduction to OS
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.