MCQS : 
- Thetha n2 ki complexity 
- Recurrence Solving technique 
- Independency of Algorithm 
- Divide & Conquer 
- Quick Sort 
- Summation I=0 to n for n is ? 
- Which is not a stable algorithm. ( selection sort ) 
- T( n) = 3n + log2(log2n) , time.complexity ? 
- 2D Maximal 
- 3D Maximal 
- Heap 

 Short Ques: 
- Name the strategy and algorithm for T(n) = 2T(n/2)+n 
- How can we avoid repetition of recursion in Fibonacci Numbers 

 Long Ques : 
- Write basic functionalities of Counting Sort Algortim. 
- Following is the list of number of burgers sold in last 20 weeks .Find the median of the data. Write all steps to get full marks.( isma algorithm likhna tha , maths ka ques smjh kr solve nahi krdena )

Mcqs easy thy 
 Short question
1. Array de gyai thi jis ma max value batani thi... 
2. Define Fibonacci sequence.. 

 Long
1. How bubble sort algorithm work? 
2. N= 31 tha merge sort algorithm se recurrence find krni thi