Course title
V05103002
Data Structures and Algorithms

 OZAKI Katsuhisa Click to show questionnaire result at 2019
Course description
Data structure and algorithms are very important for the development of applications. The first topics are basic data structures such as stack, queue, array, list, and so forth. The next topic is sorting algorithms. Students learn selection sort, bubble sort, quick sort, radix sort, and bucket sort. Algorithms for matrix computations and computational geometry are introduced. Finally, students try to solve exercise problems using C and MATLAB.
Purpose of class
To know basic data structure is essential for engineers. Students can consider how to choose efficient sorting algorithms by checking computational complexity. Students understand basic ideas for informatics such as bisection, recursive, divide and conquer and so forth.
Goals and objectives
  1. Understanding basic data structures and implement them
  2. Understanding efficiency of algorithms and its data structure
  3. Making programming codes, basic data structures and sorting algorithms using C and MATLAB
Relationship between 'Goals and Objectives' and 'Course Outcomes'

 exam1 exam2 Total.
1. 25% 25%
2. 25% 25%
3. 25% 25% 50%
Total. 50% 50% -
Language
Japanese
Class schedule

 Class schedule HW assignments (Including preparation and review of the class.) Amount of Time Required
1. Algorithms and complexity review of linear algebra, especially, matrix multiplication 190minutes
2. Array and list review of array in C language 190minutes
3. Stack and Queue review of array and list 190minutes
4. Graph and Tree review of the previous class 190minutes
5. Sparse matrix review of the previous class 190minutes
6. Recursive Functions review of the previous class 190minutes
7. Exam 1 and its review total review 190minutes
8. Selection sort and bubble sort review of Selection sort and bubble sort 190minutes
9. Radix sort and bucket sort review of the previous class 190minutes
10. Quick sort and its computational complexity review of the previous class and recursive function 190minutes
11. Divide and conquer methods review of an algorithm and its complexity 190minutes
12. Fast algorithm for matrix multiplication review of matrix multiplication and recursive function 190minutes
13. Computational Geometry review of matrix determinant 190minutes
14. Examination and Explanation review of all topics 190minutes
Total. - - 2660minutes
Evaluation method and criteria
Basically two examinations.
Feedback on exams, assignments, etc.
ways of feedback specific contents about "Other"
Feedback in the class
Textbooks and reference materials
nothing
Prerequisites
Review of basic informatics and linear algebra.
Office hours and How to contact professors for questions
  • Lunch Time on Monday
Regionally-oriented
Non-regionally-oriented course
Development of social and professional independence
  • Course that cultivates a basic self-management skills
Active-learning course
More than one class is 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
  • 4.QUALITY EDUCATION
Last modified : Sat Mar 02 04:34:01 JST 2024