Set “A” Set “C” Set “E”

1. Write short notes on Big O notation. 1. Write short notes on Big O notation. 1. Write short notes on Big O notation.
2. Write code for push for stack. 2. Write enqueue code for queue. 2. Write algorithm for push in stack.
3. Define recursion. Write recursive function 3. Define recursion. Write recursive function for 3. Differentiate between iteration and
factorial.
for Fibonacci. recursion.
4. Convert infix to postfix
4. Write algorithm to covert infix to prefix. (A+B*C $ (D+E)*F)+G
4. Write algorithm to convert infix to postfix.
5. Define tail recursion. Write tail recursive 5. Define tail recursion. Write tail recursive 5. Define tail recursion. Write tail recursive
function for factorial. function for Fibonacci. function for factorial.

Set “B” Set “D” Set “F”

1. Write characteristics of good algorithm. 1. Write characteristics of good algorithm. 1. Write characteristics of good algorithm.
2. Write algorithm for pop for stack 2. Write dequeue code for queue. 2. Write insertion code for circular queue.
3. Define recursion. Write recursive function 3. Define recursion. Write recursive function for 3. Write advantages and disadvantages of
tower of hanoi.
for GCD. recursion.
4. Convert infix to prefix
4. Write algorithm to evaluate postfix (A+B*C $ (D+E)*F)+G
4. Evaluate postfix expression
expression. 5. Define tail recursion. Write tail recursive 23+5*67+*
5. Define tail recursion. Write tail recursive function for factorial. 5. Define tail recursion. Write tail recursive
function for fibonacci. function for Fibonacci.

Set “C”
Set “A” 1. Write short notes on Big O notation. Set “E”
1. Write short notes on Big O notation. 2. Write enqueue code for queue. 1. Write short notes on Big O notation.
2. Write code for push for stack. 3. Define recursion. Write recursive function for 2. Write algorithm for push in stack.
factorial.
3. Define recursion. Write recursive function 3. Differentiate between iteration and
4. Convert infix to postfix
for Fibonacci. (A+B*C $ (D+E)*F)+G
recursion.
4. Write algorithm to covert infix to prefix. 5. Define tail recursion. Write tail recursive 4. Write algorithm to convert infix to postfix.
5. Define tail recursion. Write tail recursive function for Fibonacci. 5. Define tail recursion. Write tail recursive
function for factorial. function for factorial.

Set “D”
Set “B” 1. Write characteristics of good algorithm. Set “F”
1. Write characteristics of good algorithm. 2. Write dequeue code for queue. 1. Write characteristics of good algorithm.
2. Write algorithm for pop for stack 3. Define recursion. Write recursive function for 2. Write insertion code for circular queue.
tower of hanoi.
3. Define recursion. Write recursive function 3. Write advantages and disadvantages of
4. Convert infix to prefix
for GCD. (A+B*C $ (D+E)*F)+G
recursion.
4. Write algorithm to evaluate postfix 5. Define tail recursion. Write tail recursive 4. Evaluate postfix expression
expression. function for factorial. 23+5*67+*
5. Define tail recursion. Write tail recursive 5. Define tail recursion. Write tail recursive
function for fibonacci. function for Fibonacci.