Home > Computer Engineering > Quizzes > Multi-core Architectures and Programming Practice Test: Parallel Program Challenges
Multi-core Architectures and Programming Practice Test: Parallel Program Challenges
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 73% • Most missed: “Mutual exclusion implies that ____________.”
Multi-core Architectures and Programming Practice Test: Parallel Program Challenges
Time left 00:00
25 Questions

1. What are Spinlocks?
2. A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4V (signal) operations were completed on this semaphore. The resulting value of the semaphore is ___________
3. The signal operation of the semaphore basically works on the basic _______ system call.
4. To avoid deadlock ____________
5. To ensure difficulties do not arise in the readers – writer’s problem, _______ are given exclusive access to the shared object.
6. To ensure difficulties do not arise in the readers – writer’s problem, _______ are given exclusive access to the shared object.
7. A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem.
8. Which of the following conditions must be satisfied to solve the critical section problem?
9. If the semaphore value is negative ____________.
10. Paths that have an unbounded number of allowed nonminimal hops from packet sources, this situation is referred to as __________.
11. _____________ refers to the ability of multiple process (or threads) to share code, resources or data in such a way that only one process has access to shared object at a time.
12. Spinlocks are intended to provide __________ only.
13. What are the two atomic operations permissible on semaphores?
14. The segment of code in which the process may change common variables, update tables, write into files is known as :
15. A critical section is a program segment ______________.
16. If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called ___________.
17. A semaphore is a shared integer variable ____________.
18. Mutual exclusion implies that ____________.
19. To avoid deadlock ____________
20. Spinlocks are intended to provide __________ only.
21. What is the main disadvantage of spinlocks?
22. Paths that have an unbounded number of allowed nonminimal hops from packet sources, this situation is referred to as __________.
23. A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4V (signal) operations were completed on this semaphore. The resulting value of the semaphore is ___________
24. What are the two atomic operations permissible on semaphores?
25. Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ..-; signal(S);signal(Q) and wait(Q); wait(S);..-;signal(Q);signal(S); respectively. The above situation depicts a _________.

⚡ 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.