Unit 3 Most Frequently Asked Questions for Data Structure
Q1: What do you
mean by searching ? Explain?
Q2: Write a
short note on sequential search and index sequential search?
Q3: Write down
algorithm for linear/sequential search technique? Give its analysis?
Q4: Write down
the algorithm of binary search technique? Write down the complexity of algorithm?
Q5: What do you
mean by Hashing ? Discuss types of hash functions?
Write a short note on hashing
Q6: Write a
short note on insertion sort?
Q7: Write a
short note on selection sort?
Q9: Explain and
give quick sort algorithm. Determine its complexity?
Q10: Write a
recursive quick sort algorithm?
Q11: What is
quick sort ? How the choice of pivot decide the efficiency of sort ? Sort the given values using quick sort present all steps :
Write algorithm for quick sort ? How
the choice of pivot decide the
efficiency of sort ? Trace your algorithm on the following data to sort the list : 2,13,4,21,7,56,51,85,59,1,9,10.
Use quick sort algorithm to sort
15,22,30,10,15,64,1,3,9,2. Is it a stable
sorting algorithm ? Justify?
two way merge sort method. Explain complexities of merge sort methods.
Q13: Write an
algorithm for merge sorting. Using the algorithm sort in ascending order : 10,25,16,5,35,48,8
Q14: Write a
short note on heap sort?
Explain heap sort?
Q15: Write a
short note on radix sort?
Explain radix sort?