Course title
L00100002
Fundamental Exercise on Computer Science and Engineering 1A

 IJIRI Takashi

SHINKUMA Ryouichi
Course description
In this class, we will review the contents presented in Introduction to Programming 1 and 2 concerning C language, such as "pointers" and "structures." We also solve various problems concerning basic data structures and algorithms explained in the class "Data Structures and Algorithms 1'.
Purpose of class
Through programming exercises, we will experience and deepen our understanding of the various algorithms presented in the class 'Data Structures and Algorithms 1'. Additionally, we will develop the ability to implement various algorithms using the C language.
Goals and objectives
  1. Be able to write programs using pointers and structures.
  2. Be able to write programs related to search problems using representative algorithms.
  3. Be able to write programs related to representative data structures.
  4. Be able to write programs related to dynamic search problems using representative algorithms.
  5. Be able to efficiently debug programs.
Relationship between 'Goals and Objectives' and 'Course Outcomes'

 Fundamental assignments Advanced assignments Total.
1. 16% 4% 20%
2. 16% 4% 20%
3. 16% 4% 20%
4. 16% 4% 20%
5. 16% 4% 20%
Total. 80% 20% -
Evaluation method and criteria
Fundamental assignments (80%) mainly consist of programming tasks related to the algorithm newly explained.
Advanced assignments (20%) mainly consist of programming tasks requiring advanced knowledge on multiple algorithms

Solving only the basic parts of the fundamental assignments in each exercise will be considered 60%.
Solving all the fundamental assignments will be considered 80%.
Language
Japanese
Class schedule

 Class schedule HW assignments (Including preparation and review of the class.) Amount of Time Required
1. Introduction
environment Setup
Pseudocode and Flowchart 1 		Review assignments, solve advanced assignments. 200minutes
2. Pseudocode and Flowchart 2 Review assignments, solve advanced assignments. 200minutes
3. Pseudocode and Flowchart 3 Review assignments, solve advanced assignments. 200minutes
4. Pseudocode and Flowchart 4 Review assignments, solve advanced assignments. 200minutes
5. Review of C language 1:
scope, print, break continue, recursive call, bit operation, Boolean operation, compound assignment operator, function prototype, pointers, float, double, structures, array, structures, malloc, free, string, enum 		Review assignments, solve advanced assignments. 200minutes
6. Review of C language 2:
scope, print, break continue, recursive call, bit operation, Boolean operation, compound assignment operator, function prototype, pointers, float, double, structures, array, structures, malloc, free, string, enum 		Review assignments, solve advanced assignments. 200minutes
7. Data structure 1:
array, linked list, stack, queue, heap 		Review assignments, solve advanced assignments. 200minutes
8. Data structure 2:
array, linked list, stack, queue, heap 		Review assignments, solve advanced assignments. 200minutes
9. Data structure 3:
array, linked list, stack, queue, heap 		Review assignments, solve advanced assignments. 200minutes
10. Data structure 4:
array, linked list, stack, queue, heap

Dynamic search problem 1.
Binary search tree (add and delete nodes, find minimum and maximum nodes)
AVL tree 		Review assignments, solve advanced assignments. 200minutes
11. Sorting 1:
Bubble sort, Shell sort, Merge sort, Heap sort 		Review assignments, solve advanced assignments. 200minutes
12. Sorting 2:
Bubble sort, Shell sort, Merge sort, Heap sort

Dynamic search problem 2.
Binary search tree (add and delete nodes, find minimum and maximum nodes)
AVL tree 		Review assignments, solve advanced assignments. 200minutes
13. Sorting 3:
Bubble sort, Shell sort, Merge sort, Heap sort

Dynamic search problem 3.
Binary search tree (add and delete nodes, find minimum and maximum nodes)
AVL tree 		Review assignments, solve advanced assignments. 200minutes
14. Comprehensive Review Review assignments, solve advanced assignments. 200minutes
Total. - - 2800minutes
Feedback on exams, assignments, etc.
ways of feedback specific contents about "Other"
Feedback in outside of the class (ScombZ, mail, etc.)
Textbooks and reference materials
Reference material: IT Text アルゴリズム論　浅野哲夫・和田幸一・増澤利光共著，情報処理学会編集（オーム社）
Reference material: 問題解決力を鍛える!アルゴリズムとデータ構造 大槻 兼資 （講談社）
Prerequisites
It is necessary to have taken "Introduction to programming 1 and 2" or to understand basic grammar of C language.
Office hours and How to contact professors for questions
  • Shinkuma : email, and slack DM.
  • Ijiri: Friday 09:00-10:50, email, and slack DM.
Regionally-oriented
Non-regionally-oriented course
Development of social and professional independence
  • Course that cultivates a basic self-management skills
  • Course that cultivates a basic problem-solving skills
  • Course that cultivates an ability for utilizing knowledge
Active-learning course
Most classes are interactive
Course by professor with work experience
Work experience Work experience and relevance to the course content if applicable
N/A N/A
Education related SDGs:the Sustainable Development Goals
  • 9.INDUSTRY, INNOVATION AND INFRASTRUCTURE
  • 12.RESPONSIBLE CONSUMPTION & PRODUCTION
Last modified : Thu Mar 13 04:10:36 JST 2025