Appendix C. Exercises and solutions
In this appendix, you will find a comprehensive set of exercises and their corresponding solutions, organized by chapter, to enhance your understanding and the application of the material presented in this book. These exercises are designed to reinforce the concepts, theories, and practical skills covered throughout the chapters.
C.1 Chapter 2: A deeper look at search and optimization
C.1.1 Exercises
1. Multiple choice: Choose the correct answer for each of the following questions.
1.1. _________ is the class of decision problems that can be solved by nondeterministic polynomial algorithms and whose solutions are hard to find but easy to verify.
a. P
b. NP
c. co-NP
d. NP-complete
Get Optimization Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
