Q1. Define the term Big Omega notation with illustration.
Q2. Define the term external sorting with illustration.
Q3. Define the term acyclic graph with illustration.
Q4. Describe different tree traversal methods.
Q5. Describe Divide and Conquer strategy. Why recursion is most suitable for divide and conquers?
Q6. Describe Greedy method in detail with illustration.
Q7. Define the NP complete and NP hard problems with illustration.