NP Problem stands for Non-Polynomial Time Problem.

A Greedy Strategy is guaranteed to provide an optimal solution

One of an algorithm characteristics is that it needs to be unambiguous.  What does that mean?

Induction is the best technique to prove the correctness of recursive functions.

What is the worst case asymptotic growth of the 10n³ + 24n² + 3n log n + 144 function.

Tabulation is an approach where you solve a dynamic programming problem by first filling up a table, and then compute the solution to the original problem based on the results in this table.

In this Adelson-Velsky and Landis Tree.  What is the balance factory on node 8?

The Cook-Levin theorem was able to demonstrate that if the 3SAT problem can be solved in Polynomial Time, then at least all NP-Complete Problems belong to the P Class.

Induction Step is the best technique to prove the correctness of a loop using Loop Invariants.

When does a Loop Invariant need to be true?