シラバス参照
|
シラバス参照
|
| 講義概要/Course Information |
| 科目基礎情報/General Information |
| 授業科目名 /Course title (Japanese) |
学域特別講義A (Algorithms for Dummies) | ||
|---|---|---|---|
| 英文授業科目名 /Course title (English) |
Special Lecture on Informatics and Engineering A (Algorithms for Dummies) | ||
| 科目番号 /Code |
UEC020z | ||
| 開講年度 /Academic year |
2020年度 | 開講年次 /Year offered |
1/2/3/4 |
| 開講学期 /Semester(s) offered |
前学期 | 開講コース・課程 /Faculty offering the course |
情報理工学域 |
| 授業の方法 /Teaching method |
講義 | 単位数 /Credits |
1 |
| 科目区分 /Category |
総合文化科目 | ||
| 開講学科・専攻 /Cluster/Department |
情報理工学域 | ||
| 担当教員名 /Lecturer(s) |
Belmonte Remy | ||
| 居室 /Office |
西9 号館507 室 West No. 9 Building 507 rooms | ||
| 公開E-Mail |
remy.belmonte@uec.ac.jp | ||
| 授業関連Webページ /Course website |
なし None | ||
| 更新日 /Last updated |
2020/04/23 14:29:39 | 更新状況 /Update status |
公開中 /now open to public |
| 講義情報/Course Description |
| 主題および 達成目標 /Topic and goals |
This course provides a (brief) introduction to the design and analysis of algorithms. We will learn how to efficiently solve some important everyday problems such as: • sorting books on a shelf, • multiplying two integers, • cutting a rod to make as much money as possible when selling it for parts, • commuting between home and the university. The course is intended to be appropriate for a general audience and no special knowledge of mathematics or computer science is required. |
|---|---|
| 前もって履修 しておくべき科目 /Prerequisites |
なし None |
| 前もって履修しておくこ とが望ましい科目 /Recommended prerequisites and preparation |
なし None |
| 教科書等 /Course textbooks and materials |
The course will follow material from “Introduction to Algorithms”, by Cormen, Leiserson, Rivest and Stein. However, buying the book is not required. |
| 授業内容と その進め方 /Course outline and weekly schedule |
Below is a tentative breakdown of the 8 lectures comprising the course. They may be slightly altered based on receptiveness of the audience. Session 1: Introduction Session 2: A simple sorting algorithm Session 3: A bit of (heavily hand-waved) math Session 4: Divide-and-conquer Session 5: Elementary data structures Session 6: Dynamic programming Session 7: Elementary graph algorithms Session 8: Limits of computation In addition, note that every session, bar the first one, will involve roughly 30 minutes of exercises (either collectively or in small groups). As mentioned above, no prior knowledge of anything mathematical is required. The course will put heavy emphasis on general ideas and concepts rather than specific techniques. |
| 実務経験を活かした 授業内容 (実務経験内容も含む) /Course content utilizing practical experience |
|
| 授業時間外の学習 （予習・復習等） /Preparation and review outside class |
なし None |
| 成績評価方法 および評価基準 （最低達成基準を含む） /Evaluation and grading |
Active participation to the exercise sessions (100%) |
| オフィスアワー： 授業相談 /Office hours |
授業相談を電子メイルで随時受け付ける。 We accept class consultation from time to time by electronic mail. |
| 学生へのメッセージ /Message for students |
授業中はディスカッションに積極的に参加すること。 Actively Participate in the Discussion During the Lecture. |
| その他 /Others |
なし None |
| キーワード /Keyword(s) |
Algorithms, sorting, introduction, data structures, graphs |