1. CSS106 Introduction to Elementary Algorithms M.Sc Askar Satabaldiyev

2. What is an “algorithm”?

3. algorithm(noun): a set of steps to accomplish a task

4. Go to bus station

5. Take a bus

6. Go to bus station Take a bus Go to university

7. Go to bus station Take a bus Go to university (!)

8. Slice bread

9. Apply cheese

10. Slice bread Apply cheese Get your cheese toast

11. Computer Science algorithms

12. Start with an input data

13. Do complex calculations

14. Start with an input data Do complex calculations Stop when we find answer

15. Computer Science

16. a few examples…

18. Compression algorithms

19. Finding optimal route algorithms

20. rendering algorithms

21. Optimization and scheduling algorithms

22. Which algorithms will you use?

23. Make your programs FASTER

26. Which algorithms could you CREATE?

29. Big Data Analysis

30. What makes a good algorithm?

31. What makes a good algorithm? 1. Correctness 2. Efficiency

33. Asymptotic Analysis #nodesNearest insertion Brute force 111 241 392 4166 … 25625620448401733239439360000 N2N2 N!

34. k = 0; for (i = 1; i <= N; i++) if (N % i == 0) k++; return k == 2; for (i = 2; i < n; i++) if(N % i == 0) return false; return true; another method… for (i = 2; i < sqrt(n); i++) if(N % i == 0) return false; return true; Which one is faster?

35. Grading Policy

36. Attendance 10% Midterm Exam 20% Assignment 15% Homework 15% Quizes 10% Final Exam 30% Contests/Codeforces/Bonus 20% Total 100%(+20?) Grading Policy

37. Intro to algorithms 01.Sept – 04.Sept Binary Search/Asymptotic notations 07.Sept – 11.Sept Selection sort/Insertion sort 15.Sept – 18.Sept Recursive algorithms 22.Sept – 25.Sept Towers of Hanoi/Merge Sort/Quick sort 29.Sept – 02.Oct Graph Representation 05.Oct – 09.Oct Breadth-first search 12.Oct – 16.Oct Midterm Exam 19.Oct – 23.Oct Upcoming Topics