Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2012:journals:jeanpaul:section2 [2012/01/17 05:01] – mugabej
+++ courses:cs211:winter2012:journals:jeanpaul:section2 [2012/01/17 05:02] (current) – mugabej
@@ Line 64: / Line 64: @@
 Motivations for discussing the five representative problems is obvious: They will serve as reference as we solve problems relating to algorithms. They simply form a reference for other problems. The question I have though is: "Do these problems represent all of the problems we can ever encounter when dealing with algorithm analysis or they serve as reference for most of the problems?". As for proofs, they make sense after carefully reading them. After rereading this section, I was able to see how these problems do arise in real life and how they can cover a wide range of problems.\\
-I want to remember the difference between Np-complete and PSPACE-complete problems: For NP-complete,you can check the solutions while for PSPACE-complete even checking is challenging. This is a very important difference that will help me identify the hard problems I will be presented with.\\
+I want to remember the difference between NP-complete and PSPACE-complete problems: For NP-complete,you can easily check the solutions whilst for PSPACE-complete even checking the solutions is challenging. This is a very important difference that will help me identify the hard problems I will be presented with.\\
 Since this section was straightforward,essential and very interesting,I give this reading a 9/10.