Data Structures Basic level Programs

INTRODUCTION TO DATA STRUCTURE 1. Define data structure. List the various linear and non-linear data structures and explain them in brief. 2. What does abstract data type means? Briefly explain linear and non linear data structures. 3. Discuss the basic operations performed with linear structure. 4. Explain the dynamic memory allocation functions in C. 5. Differentiate the following terms:(a). Liner and Non-Linear Data Structures (b). Primitive and Non-Primitive Data Structures 6. Define following terms: Time and space complexity of an algorithm. 7. Discuss best case, average case and worst case time analysis with example. 8. Define Algorithm. Write an algorithm to multiply two matrices. Also Perform Time Analysis for the same. 9. Write short note on performance analysis and performance measurement of an algorithm. 10. Write algorithm to sum values in vector V and find out the execution time required. 11. Define Time complexity and Space complexity. Calculate time complexity for given expression. for (k=0; k<n; k++) { rows[k] = 0; for(j=0; j<n; j++) { rows[k] = rows[k] + matrix[k][j]; total = total + matrix[k][j]; } }

Data Structures: Sorting and Searching progra

Sorting 1. Name two divide and conquer algorithms for sorting. 2. Apply quick sort algorithm to sort the following data. Justify the steps. 42, 29, 74, 11, 65, 58 3. Write a ‘C’ program for insertion sort and discuss its efficiency. 4. Write an algorithm/C Function to implement Selection Sort Method. 5. Write an algorithm/C Function to implement Bubble Sort Method. 6. Write an algorithm/C Function to implement Quick Sort Method. 7. Write an algorithm/C Function to implement Merge Sort Method. 8. Using Quick sort give tracing for following set of numbers 42, 11,23,58,65,72,36,99. Searching 1. Write down precondition and algorithm of binary search meth