Question Bank

Posted By on September 18, 2014


Download PDF
Recursion Trees
What is complexity of T(n) = 2T(n/2) + C, using recurrence equations?

UNIT  1:

  1. Introduction to Algorithm
  2. Relations
  3. Linear equality and Unequality
  4. Set

UNIT 2:

  1. Asymptotic Notations
  2. Amortized Analysis
  3. Selection Sort
  4. Insertion Sort
  5. Bubble Sort
  6. Master Method

UNIT 3:

  1. Merge Sort
  2. Quick Sort
  3. Heap Sort
  4. Exponentatiom
  5. Binary Search Algorithms

UNIT 4:

  1. Activity Selection
  2. Job Selections
  3. Dijkstra`s Algorithm
  4. Knapsack problem
Recursion Trees
What is complexity of T(n) = 2T(n/2) + C, using recurrence equations?

Download PDF

Posted by Akash Kurup

Founder and C.E.O, World4Engineers Educationist and Entrepreneur by passion. Orator and blogger by hobby

Website: http://world4engineers.com