A data structure is a representation of data in memory, and an algorithm is a specific procedure (method) to solve a problem.
Data structures and algorithms are among the most critical fields in computer science and are essential for writing efficient
programs.
This class will explain various basic data structures and algorithms that form the foundation of programming. Furthermore, through learning various basic data structures and algorithms, we aim to acquire standard techniques for designing and analyzing algorithms. In this lecture, we will use C language for demonstrations and exercises.
This class will explain various basic data structures and algorithms that form the foundation of programming. Furthermore, through learning various basic data structures and algorithms, we aim to acquire standard techniques for designing and analyzing algorithms. In this lecture, we will use C language for demonstrations and exercises.
To learn about basic data structure and algorithm knowledge, such as computational complexity and order notation.
To learn about basic data structures such as arrays, linked lists, stacks, queues, hash tables, trees, binary trees, and balanced binary trees.
To learn about basic algorithms for building the aforementioned data structures, binary search, sorting, and so on.
To develop foundational techniques for designing algorithms to solve real-world problems
To learn about basic data structures such as arrays, linked lists, stacks, queues, hash tables, trees, binary trees, and balanced binary trees.
To learn about basic algorithms for building the aforementioned data structures, binary search, sorting, and so on.
To develop foundational techniques for designing algorithms to solve real-world problems
- Be able to explain the standard techniques for designing and analyzing algorithms through various data structures and algorithms.
- Be able to understand basic algorithms and use them to solve fundamental exercises.
- Be able to create algorithms to solve various problems.
| 中間試験 | 期末試験 | レポート | 毎回の小テスト | Total. | |
|---|---|---|---|---|---|
| 1. | 10% | 10% | 10% | 25% | 55% |
| 2. | 5% | 5% | 5% | 14% | 29% |
| 3. | 2% | 2% | 2% | 10% | 16% |
| 4. | 0% | ||||
| Total. | 17% | 17% | 17% | 49% | - |
(1) 2 examinations, (2) 4 report,s (3) mini tests
mini test (after each class) 10ｘ12 times （49%）
report 10ｘ４（17%）
examination 1 40（17％）
examination 2 40（17%）
Understanding each lecture and being able to answer the exercise questions will be considered 80%.
Answering only the fundamental questions of each examination will be considered 60%.
mini test (after each class) 10ｘ12 times （49%）
report 10ｘ４（17%）
examination 1 40（17％）
examination 2 40（17%）
Understanding each lecture and being able to answer the exercise questions will be considered 80%.
Answering only the fundamental questions of each examination will be considered 60%.
| Class schedule | HW assignments (Including preparation and review of the class.) | Amount of Time Required | |
|---|---|---|---|
| 1. | ●Introduction + What is the algorithm + Efficiency of an algorithm + How to write an algorithm |
Preparation for the lecture content. | 200minutes |
| 2. | ●search problem 1 + search problem + Efficiency of sequential search + search algorithm using the order + computational complexity |
Preparation for the lecture content. | 100minutes |
| Review of the lecture content. | 100minutes | ||
| 3. | ●search problem 2 + m-block method + binary search ●report 1 |
Preparation for the lecture content. | 100minutes |
| Review of the lecture content. | 100minutes | ||
| 4. | ●search problem 3 + hash method ●basic data structure 1 + array + linked list |
Preparation for the lecture content. | 100minutes |
| Review of the lecture content. | 100minutes | ||
| 5. | ●basic data structure2 + data structure for binary search + stack + queue ●report 2 |
Preparation for the lecture content. | 100minutes |
| Review of the lecture content. | 100minutes | ||
| 6. | ●basic data structure3 + heap |
Preparation for the lecture content. | 100minutes |
| Review of the lecture content. | 100minutes | ||
| 7. | ●examination ●Summary of the important points in the first half |
Preparation for the examination | 200minutes |
| 8. | ●Dynamic search problem 1 + binary search tree ●Report 3 |
Preparation for the lecture content. | 100minutes |
| Review of the lecture content. | 100minutes | ||
| 9. | ●Dynamic search problem 2 + AVL tree + dynamic hash |
Preparation for the lecture content. | 100minutes |
| Review of the lecture content. | 100minutes | ||
| 10. | ●sort 1 + Bubble sort + selection sort + insertion sort ●report 4 |
Preparation for the lecture content. | 100minutes |
| Review of the lecture content. | 100minutes | ||
| 11. | ●sort 2 + shell sort + heap sort |
Preparation for the lecture content. | 100minutes |
| Review of the lecture content. | 100minutes | ||
| 12. | ●sort 3 + quick sort + merge sort + computational complexity of the sort algorithms |
Preparation for the lecture content. | 100minutes |
| Review of the lecture content. | 100minutes | ||
| 13. | ●Review of the class | Preparation for the lecture content. | 100minutes |
| Review of the lecture content. | 100minutes | ||
| 14. | ●Examination ●Summary of the important points in the last half |
Preparation for the examination | 200minutes |
| Total. | - | - | 2800minutes |
| ways of feedback | specific contents about "Other" |
|---|---|
| Feedback in outside of the class (ScombZ, mail, etc.) |
Textbook: IT Text アルゴリズム論 浅野哲夫・和田幸一・増澤利光共著，情報処理学会編集（オーム社）
Reference material: 問題解決力を鍛える!アルゴリズムとデータ構造 大槻 兼資 （講談社）
Reference material: 問題解決力を鍛える!アルゴリズムとデータ構造 大槻 兼資 （講談社）
It is desirable to have taken and understood "Introduction to Programming 1 and 2" regarding the C language basics.
Also, it is preferable to have studied mathematical programming and discrete mathematics.
Also, it is preferable to have studied mathematical programming and discrete mathematics.
- Hirakawa : Tuesday 12:30-13:20
- Ijiri : Friday10:50-12:30
- Course that cultivates a basic problem-solving skills
- Course that cultivates a basic self-management skills
- Course that cultivates an ability for utilizing knowledge
| Work experience | Work experience and relevance to the course content if applicable |
|---|---|
| Applicable | 実務経験のある教員による授業科目の具体的内容 : 一般企業でのプログラム開発経験を有する。実際にプログラムで扱う問題の規模が大きくなった際、実行時間が増大し困る場合がある。授業では実際の開発場面を想定した解説を行うなど、学んでいる技術が実践的な技術であることを実感できるよう努めている。 |
- 4.QUALITY EDUCATION
- 9.INDUSTRY, INNOVATION AND INFRASTRUCTURE
Last modified : Sat Mar 08 04:20:26 JST 2025