Q1.Why do we use input size and basic operation to analyze the complexity of an algorithm? Can we use other measures for complexity analysis of algorithms? Illustrate the key concepts by example.
Q2. How can we say that an algorithm is "good" or "better"? Illustrate by example.
Q3. Why should we learn algorithms?
Q4. Why do we need to learn data structures before learning algorithms?
Q5. Key concepts of Algorithm.
Q6. Key concepts of Data structures.