CE264 : Design & analysis of algorithms

CO-1 : Analyze how to analyze algorithms and estimate their best case, worst-case and average-case behavior (in easy cases).  

CO-2 :Describe the greedy paradigm and explain when an algorithmic design situation calls for it. Recite algorithms that employ this paradigm and analyze them.

CO-3: Describe the dynamic-programming paradigm and explain when an algorithmic design situation calls for it. Recite algorithms that employ this paradigm and analyze them.

CO-4:Describe the divide-and-conquer paradigm and explain when an algorithmic design situation calls for it. Recite algorithms that employ this paradigm. Derive and solve recurrences describing the performance of divide-and-conquer algorithms.

CO-5: Understand and apply various graph algorithms for finding shorted path and minimum spanning tree.

CO-6: Understand and apply string matching algorithms for finding the pattern from the text.

CO-7: Understand a problem as computationally tractable or intractable, and discuss strategies to address intractability.