Data Structures [CYIM, Fall 2021]

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 apply them to 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 stuffs will be introduced in this course.

Grading

  1. There are also 3 to 5 quizzes which together account for roughly 90% of total grades. The quizzes are in the form of blank-filling questions. (But in reality they are more like matching questions.)
  2. Class participation and attendence account for 10% of total grades.

Important Notes:

  1. Cheating behaviors in quizzes are strictly forbidden and will result in failing the class.
  2. 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:

  1. Please prepare a usb flash drive for installing linux.
一 二 三 四 五
1
08:10
09:00
 
2
09:10
10:00
 
3
10:10
11:00
 		 媒體識讀
通識:中興Y1308
4
11:10
12:00
 		 媒體識讀
通識:中興Y1308
5
13:10
14:00
 
6
14:10
15:00
 
7
15:10
16:00
 
8
16:10
17:00