Data Structures [CYIM, Fall 2022]
Course Description
It is important for programmers to know how best to arrange data in their programs so that frequently executed parts of the programs can run efficiently. We also need to be able to mathematically compare the efficiency of different ways of storing and processing data. In this course we begin with a bit of mathematics, the asymtotic notations, and use them to analyze different ways of sorting data. Then the 8-queen problem is used to illustrate the general idea of recursion. Pointers and linked lists in the ancient C programming language is briefly discussed. Trees and graphs are powerful data structures that appear in almost all non-trivial programs. Finally we give practical suggestions for programmers. The students are expected to know basic python programming such as arrays and loops. More interesting and advanced features of python will be introduced in this course.
- Course ID: 2637 / Time: Thu 789 / Place: M212
- Instructor: Greg Chao-Kuei Hung
- Textbook: None. We use free online materials heavily. See Class Outline and Teaching Materials
- Class announcement: please check this link regularly, especially the day before the class: "Greg's Class" (containing information for many different classes) or use RSS to read info only for im2d.
- Other useful links: collaboratory notes, bonus sheet,
- prerequisite: basic python programming knowledge.
Grading
- There are also 3 to 5 quizzes which together account for roughly 70% of total grades.
- Class participation and attendence, including hands-on labs, account for roughly 30% of total grades.
- Total grade = \( \frac{ \sum_i x_i }{ \sum_i F_i } * 100 \) where \( x_i \) is your i-th grade and \( F_i \) is the full grade for the i-th quiz or assignment. For a quiz or assignment where you ask for leave, "full grade for i-th quiz or assignment" is replaced by "full grade for i-th quiz or assignment * \( \mu \)" \( \mu \) is roughly 0.3. It means that the more leaves you ask for, the worse it will adversely affect your total grades.
Important Notes:
- Cheating behaviors in quizzes are strictly forbidden and will result in failing the class.
- If you cannot come to the class, you must ask for a personal day off before the class. This is most important especially for those classes when we have quizzes.
Other Notes:
- Please prepare a usb flash drive for installing linux.
111 學年度下學期課表
洪朝貴 [ ckhung 小老鼠 cyut 點 edu 點 tw ]
研究室: L737 ; 分機 7805
https://www.cyut.edu.tw/~ckhung/
一 | 二 | 三 | 四 | 五 | |
---|---|---|---|---|---|
3 10:25 11:15 |
資訊社會 通識:中興Y308 |
||||
4 11:20 12:10 |
資訊社會 通識:中興Y308 |
||||
N 12:30 13:20 |
祐綸 研究:L-737 |
||||
5 13:30 14:20 |
|||||
6 14:30 15:20 |
OH *:L-737 |
OH *:L-737 |
|||
7 15:30 16:20 |
OH *:L-737 |
OH *:L-737 |
Programming 日1D:M-212 |
DataViz 日3D:M-212 |
|
8 16:30 17:20 |
Programming 日1D:M-212 |
DataViz 日3D:M-212 |
|||
9 17:30 18:20 |
Programming 日1D:M-212 |
DataViz 日3D:M-212 |
|||
A 18:25 19:10 |
3D 專題:L-737 |
||||
B 19:10 19:55 |
|||||
C 20:00 20:45 |
|||||
D 20:50 21:35 |
|||||
E 21:35 22:20 |