Design and analysis of algorithms practice questions

Is analysis of algorithms a hard class?
Algorithms is probably one of the harder courses in your comp sci. degree, but it's totally doable.
What makes it so difficult compared to other courses is how much intuition is involved in designing/analyzing algorithms..
What are the most important problem types are used to illustrate different algorithm design techniques and methods of algorithm analysis?
Important problems such as sorting, searching, string processing, graph problems, Combinational problems, numerical problems are basic motivations for designing algorithm.
The Basic objective of solving problem with multiple constraints such as problem size performance and cost in terms of space and time..
What is algorithm design and analysis process?
Algorithm analysis is an important part of computational complexity theory, which provides theoretical estimation for the required resources of an algorithm to solve a specific computational problem.
Analysis of algorithms is the determination of the amount of time and space resources required to execute it..

Is analysis of algorithms a hard class?