Introduction to Algorithms and Data Structures
| Numbering Code |
U-ENG29 19115 LJ11 U-ENG29 19115 LJ10 |
Year/Term | 2022 ・ Second semester | |
|---|---|---|---|---|
| Number of Credits | 2 | Course Type | Lecture | |
| Target Year | Target Student | |||
| Language | Japanese | Day/Period | Mon.1 | |
| Instructor name | KASHIMA HISASHI (Graduate School of Informatics Professor) | |||
| Outline and Purpose of the Course | Algorithms and data structures are two fundamental components of computer programs. This course gives their basic concepts, design principles, techniques, and other important concepts in computer science. | |||
| Course Goals | The goals of the course is to understand: - mathematical models of computers and concepts of computational complexity, - basic algorithms and data structures, - design principles of algorithms, such as divide-and-conquer method and dynamic programming, - classes of hard problems and solutions to them, and - basic ideas of graph algorithms, approximation algorithms, and online algorithms. | |||
| Schedule and Contents |
Introduction,1time,Overview algorithms,2.5times,sorting, search, ... data structures,2.5times,list, stack, queue, binary search, heap, hash, ... algorithm design,2times,divide-and conquer, dynamic programming, ... graph algorithms,2times,- Trees and graphs - depth-/breadth-first search - shortest path algorithms - maximum-flow algorithms computational complexity,3times,P, NP, NP-complete, NP-hard, ... advanced topics,1time,approximation and online algorithms final exam,1time, |
|||
| Evaluation Methods and Policy | Mid-term and final examinations | |||
| Course Requirements | None | |||
| Textbooks | Textbooks/References | will be specified in the lectures | ||
| References, etc. | will be specified in the lectures | |||
| Related URL | ||||
