Design and analysis of algorithms material

How can we design an algorithm?
Algorithm design can be broken down into 5 distinct steps:
1. Understanding the problem – do you know exactly what you are being asked to do
2. Identify the inputs – what data needs to go into your program
3. Identify the processes – are there any calculations or computational operations happening?
What is the subject of DAA?
Design and Analysis of Algorithm help to design the algorithms for solving different types of problems in Computer Science.
It also helps to design and analyze the logic on how the program will work before developing the actual code for a program..
Course Description
Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.

This is a first course in data structures and algorithm design. Students will: 1. learn good principles of algorithm design; 2

1. Program costs: time and space. Worst case and average case analysis. As… 2

Basic strategies of algorithm design: top-down design, divide and conquer, average and worst-case criteria, asymptotic costs

1. Program cost and asymptotic analysis - slides 2

There will be 4 sets of problems. 1. Problem sheet 1 (answers to *-problems) 2. Problem sheet 2 (answers to *-problems) 3

1. Instructions 2. Brack-skeleton

1. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein. Introduction to A… 2

Students are formally asked for feedback at the end of the course. Students can also submit feedback at any point here

This form is not to be used by students studying for a degree in the Department of Computer Science

How can we design an algorithm?