Unit-I

1. Define and explain the ADT?

2. Write the short note on linear data structure
3. Write the short note on non linear data structure
4. Differentiate between linear and non linear data structures
5. Explain static data structure with example
6. Explain dynamic data structure with example
7. Write the note on persistent data structure
8. Explain problem solving techniques in detail
9. State and explain characteristics of algorithm
10. What is complexity analysis of an algorithm? Explain with an example
11. Explain asymptotic notations- Big O, Omega and Theta with example
12. Prove that
3n2 +4n+6=O(n2)
13. Explain the Divide and Conquer algorithm strategy and do its efficiency analysis
14. Explain the greedy strategy with example. Also comment on its time complexity

Unit-II
1. Define and explain term sequential organization and derive address calculation formula
for one dimensional array with one example
2. Write python code that counts a number of times a given int or data occurs in a array
3. Given a two dimensional array A(2:9,9:18) stored in column major order with base
address 100 and size of each element is 4 bytes. Find the address of the element A1(4,12)
4. Write the applications of array
5. Define and explain the term ordered list
6. Explain polynomial representation using arrays with suitable example
7. Write pseudo python code to perform polynomial multiplication using arrays
8. What is sparse matrix? Explain with suitable example
9. Write a python code for sparse matrix addition
10. Explain the concept of transpose of sparse matrix