Define P and NP classes. Differentiate between approximation and heuristic algorithm.

Define P and NP classes. Differentiate between approximation and heuristic algorithm.

From the BUET MSC (CSE) April 2024 – Written exam, question 9 of 13.

More from this paper

Previous: Consider a sequence consisting of symbols 1 (occurs with probability P) and 0 (occurs with probability Q, where Q=1-P). A run is a…
Next: Build XOR with a 2-to-4 decoder and a NOR gate.
All questions in BUET MSC (CSE) April 2024 – Written