Course title
M02220001
Data Structure and Algorithms

 LAOHAKANGVALVIT TIPPORN
Course description
This course provides the core concepts and techniques essential for efficient problem-solving in computer science, allowing students to explore various data structures, each with unique properties and applications. Additionally, it covers algorithm design paradigms, aiming to develop students’ analytical and problem-solving skills. Through lectures, assignments, and practical exercises with C programming language, students gain proficiency in implementing, analyzing, and optimizing algorithms, preparing them for tackling real-world computational challenges in software development, data analysis, and beyond.
Purpose of class
Students are expected to obtain knowledge, understanding, and technical skills to develop efficient data structures and algorithms as well as to apply them to solve various computational problems.
Goals and objectives

 Goals and objectives Course Outcomes
1. Students can explain fundamental data structures and algorithmic techniques to solve computational problems efficiently.
A-1
2. Students can apply theoretical concepts to design and implement well-structure and high-performance programs.
A-1
3. Students can explain and discuss the effective use of data structures and algorithms for practical use cases.
A-2
,
B
Relationship between 'Goals and Objectives' and 'Course Outcomes'

 Assignments Mid-term Examination Final Project In-class Activity Total.
1. 5% 10% 10% 10% 35%
2. 20% 5% 20% 0% 45%
3. 5% 10% 5% 0% 20%
4. 0%
Total. 30% 25% 35% 10% -
Class schedule

 Class schedule HW assignments (Including preparation and review of the class.) Amount of Time Required
1. Introduction to Data Structures and Algorithms Review after class and do assignment 190分
2. Data Structure: Array and Linked List Review after class and do assignment 190分
3. Data Structure: Stack and Queue Review after class and do assignment 190分
4. Data Structure: Loop, Iteration, Recursion Review after class and do assignment 190分
5. Data Structure: Tree Review after class and do assignment 190分
6. Data Structure: Graph Review after class and do assignment 190分
7. Mid-term examination & Discussion on solutions Review all previous classes and prepare for examination 220分
8. Algorithm: Searching (1) Review after class and do assignment 190分
9. Algorithm: Searching (2) Review after class and do assignment 190分
10. Algorithm: Sorting (1) Review after class and do assignment 190分
11. Algorithm: Sorting (2) Review after class and do assignment 190分
12. Project-based Learning: Design and Implementation Work on project 190分
13. Project-based Learning: Progress Report Work on project 190分
14. Course review & Final project presentation and discussion Preparation for presentation and discussion 220分
Total. - - 2720分
Goals and objectives (Other Courses)
A:Fundamental Mechanical Engineering B:Advanced Mechanical Engineering C:Environment and Materials Engineering D:Chemistry and Biotechnology E:Electrical Engineering and Robotics G:Advanced Electronic Engineering F:Information and Communications Engineering L:Computer Science and Engineering H:Urban Infrastructure and Environment
Language
English
Evaluation method and criteria
Assignments and in-class activities will contribute 40% of the grade.
Mid-term examination and final project will contribute 60% of the grade.
*Those who get at least 60% of the total score will receive the credits of this course.
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
・Data Structures using C (Second Edition). Reema Thareja. Oxford University Press (2014)
・Introduction to Algorithms (Fourth Edition). Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. MIT Press (2022).
・Additional materials will be provided in class.
Prerequisites
Knowledge and experience in basic C programming is required, as this course will involve advanced C programming.
(*Review on the basic C programming will not be provided.)
Office hours and How to contact professors for questions
  • Tipporn Laohakangvalvit
    Office hours: After class or by appointment
    For appointment, please contact me by e-mail: tipporn@shibaura-it.ac.jp
  • Peeraya Sripian
    Office hours: Friday 1PM-4PM
    Prior Appointment by email only (peeraya@shibaura-it.ac.jp)
Regionally-oriented
Non-regionally-oriented course
Development of social and professional independence
  • Course that cultivates a basic problem-solving skills
  • Course that cultivates an ability for utilizing knowledge
  • Course that cultivates a basic interpersonal skills
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
  • 4.QUALITY EDUCATION
Last modified : Wed Mar 12 04:10:52 JST 2025