Introduction to Algorithms-E2
| Numbering Code | U-LAS30 20030 LE10 | Year/Term | 2022 ・ Second semester | |
|---|---|---|---|---|
| Number of Credits | 2 | Course Type | Lecture | |
| Target Year | All students | Target Student | For all majors | |
| Language | English | Day/Period | Mon.2 | |
| Instructor name | Jesper Jansson (Graduate School of Informatics Program-Specific Associate Professor) | |||
| Outline and Purpose of the Course |
An algorithm is a well-defined procedure for solving a computational problem. Reliable algorithms have become crucial components of people's daily lives; for example, the Internet or our smartphones would not work without them. The purpose of this course is to provide a basic introduction to algorithms for non-computer science students. General techniques for designing algorithms and analyzing their efficiency, as well as examples of widely used algorithms with important real-life applications, will be presented. |
|||
| Course Goals |
After completing this course, the student should be able to: - Apply various algorithm design techniques for solving computational problems. - Measure the efficiency of an algorithm. - Explain how famous algorithms such as Google's PageRank, Quicksort, and Dijkstra's shortest-path algorithm work. |
|||
| Schedule and Contents |
The course will cover the following topics: 1. Introduction 2. Graph traversal 3. Data compression 4. Cryptography 5. Topological sort 6. Shortest paths 7. PageRank 8. Voting systems 9. Searching 10. Sorting 11. Hash tables 12. String matching 13. Randomization 14. Course summary and Q & A session < 15. Feedback |
|||
| Evaluation Methods and Policy | A written examination at the end of the course. | |||
| Course Requirements |
An ability to think abstractly and to solve problems of a mathematical nature will be required for this course. No programming skills are needed. |
|||
| Study outside of Class (preparation and review) | Students will be expected to spend about 5 hours per week to prepare for and review the lessons. | |||
| Textbooks | Textbooks/References | Real-World Algorithms - A Beginner's Guide, P. Louridas, The MIT Press, 2017. ISBN-13: 978-0262035705. | ||
