Intro to Algorithms - Time and Space Complexity
- 1. “I Hear and I Forget, I See and I Remember, I Do and I Understand.” - Chinese Proverb CS 310 - ALGORITHMS
- 2. Think before you leap. Designing an algorithm is a creative and rewarding process
- 3. Think before you leap code. Designing an algorithm is a creative and rewarding process
- 4. “Weeks of programming can save you hours of planning.” - Anonymous quote
- 5. 514 × 401 - courses.ischool.utexas.edu 1730 × 1155 - makeawebsitehub.com 472 × 445 - isoin.es
- 7. Algorithms make the world run! Why Study Algorithms?
- 8. Computers are ubiquitous Education and research Networks (internet, local nets, ...) Banks and commerce Business management Communication Defense and military Health Management Medical imaging Exploration (space, sea, land) Data analytics Transportation Multimedia Robotics Simulations Manufacturing Entertainment Governance Security AI and automation Social media …
- 11. What are Algorithms again?
- 12. “An algorithm is a finite, definite, effective procedure, with some input and some output. ” - Donald Knuth
- 13. An algorithm stays the same whether the program is in java on Windows or C on Linux or python on Mac OS X.
- 14. Muhammad ibn Musa Al-Khwarizmi formerly latinized as Algoritmi Kitāb al-jabr wa'l-muqābala, which evolved into today's high school algebra text. “Algorism”: technique of performing arithmetic with Hindu-Arabic numerals developed by al-Khwārizmī. Famous 9th century Persian mathematician, astronomer, and geographer. (Source: Wikipedia.) Concept of an algorithm has existed for centuries
- 15. Core computer science problems that arise in many different applications. - Many problems reduce to them. What we’ll do in this course
- 16. Follow a design process using a variety of computing problems. What we’ll do in this course
- 17. Understand the problem. What we’ll do in this course
- 18. Discuss design techniques based on the structure of the problem. What we’ll do in this course
- 19. Analyze the algorithm and discover efficient solutions to the problem and show it’s correct. What we’ll do in this course
- 20. How many have not taken Data Structures?
- 21. Course Syllabus
- 22. - Algorithm Analysis Lecture Modules
- 23. - Algorithm Analysis - Graph Algorithms Lecture Modules
- 24. - Algorithm Analysis - Graph Algorithms - Design Techniques Lecture Modules
- 25. - Algorithm Analysis - Graph Algorithms - Design Techniques - Greedy Algorithms Lecture Modules
- 26. - Algorithm Analysis - Graph Algorithms - Design Techniques - Greedy Algorithms - Divide and Conquer Lecture Modules
- 27. - Algorithm Analysis - Graph Algorithms - Design Techniques - Greedy Algorithms - Divide and Conquer - Dynamic Programming Lecture Modules
- 28. - Algorithm Analysis - Graph Algorithms - Design Techniques - Greedy Algorithms - Divide and Conquer - Dynamic Programming - Reductions Lecture Modules
- 29. - Algorithm Analysis - Graph Algorithms - Design Techniques - Greedy Algorithms - Divide and Conquer - Dynamic Programming - Reductions - Network Flow Lecture Modules
- 30. - Algorithm Analysis - Graph Algorithms - Design Techniques - Greedy Algorithms - Divide and Conquer - Dynamic Programming - Reductions - Network Flow - NP Complete Problems (if time permits) Lecture Modules
- 31. - Assignments: 25% (No-show for vivas=70% reduction) - Quizzes, In-class problems, homework: 20% - Midterm Examination: 25% - Final Examination: 30% Grading breakup
- 32. - Ali Ahad ([email protected]) - Javaria Hassan ([email protected]) - Sheikh Abdul Mannan ([email protected]) - Syed Hamza Ahmad ([email protected]) CS 310 TAs (in alphabetical order)
- 33. What should you do to succeed in this course?
- 34. Visual source: Barbara Oakley - Learning how to learn
- 35. Visual source: Barbara Oakley - Learning how to learn
- 36. Visual source: Barbara Oakley - Learning how to learn Students who: - Enjoy problem solving and thinking about creative solutions - Review material after class and through spaced repetitions. - Focus on understanding in-class, homework and practice problems - Start work on assignments early Students who: - Cram for exam a couple of days before it. - Don’t review material after class - Waste time during class - Don’t spend sufficient time on problem solving - Procrastinate on the assignments
- 37. The first time you actually understand something is when you can do it yourself.
- 38. Come to class on time (5 minute rule) Be an active participant. Enjoy learning! What should you do to succeed in this course?
- 39. What things are important in software design?
- 40. Why is performance (time) important?
- 41. How long are you willing to wait for a web page to load?
- 43. How do we determine efficiency of an algorithm?
- 44. Running Times of different algorithms on inputs of increasing sizes 44