You will get familiar with the course, the instructor, your classmates, and the learning environment. The overview of the course will also be covered during the same session.

Activities

• Reading: Syllabus
• Join NTHU EEClass System
• Join Microsoft Teams
• Take Orientation Quiz before March 02, 2025

Computer Science can be viewed as the study of algorithms (and data). In this session, we will briefly introduce the concepts of algorithms and the tool for Online Judge Practice.

Activities

• Reading: Chapter 1 of our textbook
• Join Lab at 2/24 18:30-20:30 at Teams

Related Videos

• How algorithms shape our world by Kevin_Slavin
• What is an Algorithm? by Tech Policy Lab, University of Washington
• Introduction to Algorithms by Computer Education For all
• CS50 2020 - Lecture 3 - Algorithms by Prof. David J. Malan from Harvard University

C++ is an object-oriented and generic programming language. In this session, we will briefly review/introduce its important features.

Activities

• Assignment 0: due at 2025/3/9 23:59:59
• Join Online Judge Quiz at 3/10 18:30-20:30 at Computer Rooms

Related Videos

• Introduction to C++ by Marty Stepp from Stanford University
• Object Oriented Programming (OOP) and Inheritance by John Guttag from MIT OpenCourseWare
• Recap of C (Part 1) for Programming in C++ by Prof. Partha Pratim Das from IIT Kharagpur
• Recap of C (Part 2) for Programming in C++ by Prof. Partha Pratim Das from IIT Kharagpur
• Recap of C (Part 3) for Programming in C++ by Prof. Partha Pratim Das from IIT Kharagpur
• CS50 2020 - Lecture 1 - C by Prof. David J. Malan from Harvard University
• Dynamic Binding (Polymorphism) With The Virtual Keyword | C++ Tutorial from Portfolio Courses

"The array is often the only means for structuring data which is provided in a programming language." "An array is a set of pairs, index and value. For each index which is defined, there is a value associated with that index." In this session, we will introduce the details of this data structure.

Activities

• Reading: Chapter 2 of our textbook

Related Videos

• Arrays and ArrayList implementation (part 1) by Marty Stepp from Stanford University
• Arrays and ArrayList implementation (part 2) by Marty Stepp from Stanford University
• Arrays by Marty Stepp from Stanford University
• Arrays and Strings for Programming in C++ from Prof. Partha Pratim Das from IIT Kharagpur
• Linear transformations and matrices | Essence of linear algebra, chapter 3 by 3Blue1Brown
• Matrix multiplication as composition | Essence of linear algebra, chapter 4 3Blue1Brown
• CS50 2020 - Lecture 2 - Arrays by Prof. David J. Malan from Harvard University

"Two of the more common data objects found in computer algorithms are stacks and queues. Both these data objects are special cases of the more general data object, an ordered list which we considered in the previous chapter." In this session, we will introduce the details of this data structure.

Activities

• Reading: Chapter 3 of our textbook
• Assignment 1: due at 2025/3/30 23:59:59
• Join Online Judge Quiz for Stacks and Queues at 3/31 18:30-20:30 at Computer Rooms

Related Videos

• Stacks and Queues by Marty Stepp from Stanford University
• Stack and its Applications for Programming in C++ from Prof. Partha Pratim Das from IIT Kharagpur

In a linked list, the items of list may be placed anywhere in memory. "To access elements in the list in the correct order, with each element we store the address or location of the next element in that list. Thus, associated with each data item in a linked representation is a pointer to the next item. This pointer is often referred to as a link." In this session, we will introduce the details of this data structure.

Activities

• Assignment 2: due at 2025/4/13 23:59:59
• Online Judge Quiz for Linked Lists at 4/14 18:30-20:30 at Computer Rooms
• Reading: Chapter 4 of our textbook

Related Videos

• Pointers by Marty Stepp from Stanford University
• Linked Lists by Marty Stepp from Stanford University
• Linked Lists 2 by Marty Stepp from Stanford University
• Reference and Pointer for Programming in C++ from Prof. Partha Pratim Das from IIT Kharagpur
• Reference and Pointer (Part2) for Programming in C++ from Prof. Partha Pratim Das from IIT Kharagpur
• CS50 2020 - Lecture 5 - Data Structures by Prof. David J. Malan from Harvard University
• ITERATORS in C++ by The Cherno

"A tree structure means that the data is organized so that items of information are related by branches" In this session, we will introduce the details of this data structure.

Activities

• Assignment 3: due at 2025/4/27 23:59:59
• Online Judge Quiz for Trees at 4/28 18:30-20:30 at Computer Rooms
• Reading: Chapter 5 of our textbook

Related Videos

• Binary Tree by Marty Stepp from Stanford University
• Trees for Data Structures and Algorithms by Dr. Naveen Garg, IIT Delhi.

Time to evaluate. Different from other examination in our life, we do not want to assess how much we remember. It is more important to know how much we understand. Hence, each student can bring one A4-page paper with all kinds of notes into the classroom. Enjoy.

Notes

• No Classes in 2025/4/23
• Students can take one A4 page with them

"Graphs have been used in a wide variety of applications. Some of these applications are: analysis of electrical circuits, finding shortest routes, analysis of project planning, identification of chemical compounds, statistical mechanics, genetics, cybernetics, linguistics, and social sciences." In this session, we will introduce the details of this data structure.

Activities

• Assignment 4: due at 2025/5/11 23:59:59
• Online Judge Quiz for Graph at 5/12 18:30-20:30 at Computer Rooms
• Reading: Chapter 6 of our textbook

Related Videos

• Graphs: basic concepts by Marty Stepp from Stanford University
• Graphs for Data Structures and Algorithms by Dr. Naveen Garg, IIT Delhi.

"Sorting can be viewed as an aid in searching, and as a means for matching entries in files. Sorting also finds application in the solution of many other more complex problems, e.g. from operations research and job scheduling. In fact, it is estimated that over 25% of all computing time is spent on sorting with some installations spending more than 50% of their computing time sorting files. Consequently, the problem of sorting has great relevance in the study of computing." In this session, we will introduce the details of different sorting techniques.

Activities

• Assignment 5: due at 2025/5/25 23:59:59
• Online Judge Quiz for Sorting at 5/26 18:30-20:30 at Computer Rooms
• Reading: Chapter 7 of our textbook

Related Videos

• Selection sort by Marty Stepp from Stanford University
• Merge sort by Marty Stepp from Stanford University
• Insertion sort by Marty Stepp from Stanford University
• Why Sorting for Data Structures and Algorithms by Dr. Naveen Garg, IIT Delhi.
• More Sorting for Data Structures and Algorithms by Dr. Naveen Garg, IIT Delhi.

Hashing is a different indexing technique as compared to tree. The address is obtained by computing some arithmetic function. In this session, we will introduce the details of hashing techniques and other advanced topics.

Activities

• Reading: Chapter 9.3 and 10 of our textbook

Related Videos

• Hashing by Marty Stepp from Stanford University
• Hashing for Data Structures and Algorithms by Dr. Naveen Garg, IIT Delhi.

Time to evaluate. Different from other examination in our life, we do not want to assess how much we remember. It is more important to know how much we understand. Hence, each student can bring one A4-page paper with all kinds of notes into the classroom. Enjoy.

Notes

• Students can take one A4 page with them