Structuring Data & Building Algorithms: Website

SDBA YZU Specific Course Info
(Semester 981)

Textbook

Preferred Edition: Structuring Data and Building Algorithms by I Chai and J D White (Revised Edition, McGraw-Hill, 2009). Alternate Edition: Structuring Data and Building Algorithms by I Chai and J D White (First Edition, McGraw-Hill, 2006). No longer availabel. 80% of the material is the same as revised edition.

Evaluation

tut-ques.pdf10%Each tutorial: 1 mark preparation, 1 mark for participation. e.g., a student who copies the correct answer may get 0/2 while a student who tried the problem himself but got the wrong answer may receive 2/2.
Midterm15%Short answer and multiple choice questions.. Students must answer all questions. Open Book*
Project15%Term Project (odt)
exam60%Long answer questions. Choice of questions to answer. Open Book.*
*you may bring an original copy of the textbook or other C programming book into the midterm and final examination. You may not bring photocopies, calculators, cell phones or other electronic aids.
mark.pdf-Marks to date

Schedule

Estimate Class Schedule based on 971 school year (2 hours / week of lectures + 1 hour/week of lab)
Week(~Date)LecTutorialTextbook Section
1(0912)1-Preview, Introduction to Course, Text Section 1.1
1(0912)2-1.2 Variables
1(0917)-1Using JEdit, Review of C-Compiler
2(0919)3-1.3a Pointers
2(0919)4-1.3b,1.4 Pointers
Note Lab and Class times are swapped.
2(0924)5-2.1 Arrays
2(0924)6-2.2 Records
3(0926)-2Variables and Pointers
3(1001)7-2.2 Advanced Records + 2.3 Arrays of Records
3(1001)8-3.1-3.3 Linked Lists
4(1003)-3Pointers and Arrays
4(1008)9-3.4 Stacks
4(1008)10-3.5 Queues
project.pdf--Deadline to Submit Project Choice Form
5(1010)--National Day Holiday -- no lab :)
5(1015)11-6.1 Direct Recursion
5(1015)12-6.2 Mutual Recursion
6(1017)-4Records
6(1022)13-6.3 Backtracking
6(1022)14-6.4 Lookahead (Note New Code)
7(1024)-53 Linked Lists
7(1029)15-6.4 Lookahead (Note New Code)
7(1029)16-7.1-7.3 Algorithms -- Evaluation
8(1031)-6Recursion
8(1105)17-7.4 Big-OH
8(1105)18-Spare Class
9(1107) Midterm Paper (Covers up to Section 6.4, Location/Times TBA)
10(1114)-7Big-OH and Time Complexity
10(1119)19-7.5 Error Propagation in Algorithms
10(1119)20-4.1 to 4.3 General Tree Concepts
project.pdf--Deadline to Submit Project Audio Script File
11(1121)-8Discussion of Midterm Paper
11(1126)21-4.4.1 Binary Tree Implementation: Linked Lists
11(1126)22-8.1 Sequential Searching
12(1129)-9Trees + Searching Pt 1
12(1203)23-8.2 Binary Searching with Arrays
12(1203)24-8.3 Hash Tables
13(1205)-10Searching
13(1210)25-9.1-9.2 Simple Sorting
13(1210)26-9.3 Divide & Conquer + Merge Sort
14(1212)-11Sorting
14(1217)27-9.3 Quick Sort
14(1217)28-5.0 to 5.2 Graphs
15(1219)-12QuickSort and Graphs
15(1224)29-5.3 to 5.4 Graph Implementation & Traversal
15(1224)30-10.1 Traveling Salesman & 10.2 Greedy Algorithms
project.pdf--Deadline to submit the Completed Project
16(1226)-13Greedy Algorithms
16(1231)31-5.5 Sets
16(1231)32-10.3 Dijkstra Algorithm
17(1231)-14Dijkstra Algorithm
17(0107)33-Spare class
17(0107)34-Spare class
18(0114) Final Paper

Other Files