La Sierra University
Department of Mathematics & Computer Science
CPTG244 Data Structures(4 Units)
Spring 2007
Instructor: Denny Lin
Office: Price Hall 250
Office Phone: (951) 785-2551
Office Hours: Tuesdays and Thursdays: 1:00PM – 3:00PM
E-mail: dlin@lasierra.edu
Purpose of course:
This course covers basic data structures such as lists, stacks, queues,
priority queues (heaps), binary search trees, hasing, and sorting
algorithms.
Lectures: 4/3/07 - 6/7/07, Tuesdays, and Thursdays 3:00PM - 4:30PM, Price Hall 259
Labs: 4/4/07 - 6/6/07, Wednesdays 12:00PM - 2:50PM,
Price Hall 147
Exams: Midterm 1: 4/25/07, Wednesday 12:00PM – 1:00PM; Midterm 2: 5/17/07, Thursday 3:00PM – 4:00PM; Final: 6/14/07, Thursday 2:00PM – 4:00PM
Pre-requisite: CPTG122
Grading criteria:
A range –
90%- 100%
B range – 80% - 89.9%
C range – 65% - 79.9%
D range – 50% - 64.9%
F range – Below 50%
Quizzes 10%: 5 questions from each day's assigned reading, given at beginning of class
Lab Assignments: 15%
Project: 10%
Homework: 15%
Midterm Exams: 25%
Final Exam (comprehensive): 25%
Required textbook:
"Data Structures: A Pseudocode Approach with C++, by Richard F. Gilberg
and Behrouz A. Forouzan.ISBN: 0-534-95216-X
Required Lab Manual:
"A Laboratory Course in C++ Data Structures" by James Roberge, Stefan Brandle, David Whittington. ISBN: 0-7637-1976-5
Recommended Books and Web Resources:
"Standard Version Of
Starting Out With C++", (4th Edition) by Tony Gaddis. ISBN:
1-57676-119-3
C and C++ Programming
Resources
C++ Resources
Class website and
lecture notes:
http://faculty.lasierra.edu/~dlin/classes/cptg244
Student Lab Materials: Chapter 1Schedule
Outline:
|
Month |
Date |
Topic |
Reading |
Pages |
Homework |
Lab Assignment |
|
APR |
T 3 |
Introduction |
1-1 |
1 – 7 |
|
|
|
|
W 4 |
1-2 – 1-5 |
7 – 25 |
|
Lab C: Ex. 1 |
|
|
|
TH 5 |
Searching and Hashes |
2-1 – 2-2 |
29 – 49 |
7, 12, 22 |
|
|
|
T 10 |
2-3 – 2-5 |
49 – 74 |
|
|
|
|
|
W 11 |
Linked Lists |
3-1 – 3-3 |
77 – 101 |
1, 4, 14 |
Lab 14: Ex. 1 |
|
|
TH 12 |
3-4 – 3-6 |
102 – 122 |
|
|
|
|
|
T 17 |
3-7 – 3-9 |
122 – 144 |
|
|
|
|
|
W 18 |
Stacks |
4-1 – 4-2 |
156 – 168 |
2, 9, 18 |
Decimal 2 Binary |
|
|
TH 19 |
4-3 – 4-4 |
168 – 195 |
|
|
|
|
|
T 24 |
4-5 – 4-7 |
195 – 210 |
|
|
|
|
|
W 25 |
Midterm 1 |
|
|
2, 7, 14 |
In2Postfix (HW) |
|
|
TH 26 |
Queues |
5-1 – 5-3 |
217 – 231 |
|
|
|
MAY |
T 1 |
5-4 – 5-8 |
231 – 262 |
|
|
|
|
|
W 2 |
Recursion |
6-1 – 6-4 |
271 – 285 |
2, 5, 14 |
Lab 6 Ex. 1, List Count |
|
|
TH 3 |
6-5 – 6-7 |
285 – 299 |
|
|
|
|
|
T 8 |
Introduction to Trees |
7-1 – 7-3 |
305 – 321 |
2, 4, 11 |
|
|
|
W 9 |
7-4 – 7-7 |
322 – 333 |
|
No Lab |
|
|
|
TH 10 |
Search Trees |
8-1 |
338 – 353 |
15, 26, 38 |
|
|
|
T 15 |
8-2 |
353 - 367 |
|
|
|
|
|
W 16 |
8-2 – 8-5 |
367 - 399 |
|
Lab 11: Ex. 1 |
|
|
|
TH 17 |
Midterm 2 |
|
|
4, 19, 20 |
|
|
|
T 22 |
Heaps |
9-1 – 9-5 |
406 – 421 |
|
|
|
|
W 23 |
9-6 – 9-8 |
421 – 434 |
|
Lab B: Ex. 1 |
|
|
|
TH 24 |
Multiway Trees |
10-1 – 10-2 |
439 – 460 |
3, 6, 20 |
|
|
|
T 29 |
10-2 – 10-5 |
460 – 478 |
|
|
|
|
|
W 30 |
10-6 – 10-7 |
478 – 499 |
|
B-Tree Insert and Delete |
|
|
|
TH 31 |
Advanced Sorting Concepts |
11-1 – 11-3 |
502 – 526 |
3, 4, 10 |
|
|
JUN |
T 5 |
11-4 – 11-7 |
526 – 554 |
|
|
|
|
|
W 6 |
Graphs |
12-1 – 12-4 |
560 – 584 |
4, 10, 15 |
Lab C: Ex. 2 |
|
TH 7 |
12-5 – 12-7 |
585 – 608 |
|
|
||
|
|
TH 14 |
Final exam @ 2:00PM |
|
|
3, 10, 19 |
|
Class Policies:
Attendance
It costs $2048.00 to attend this class, which meets 31 times. In addition to loss in learning, each meeting you miss is $66.07 wasted. This is a very time-intensive class and your attendance at every meeting is expected. Four (4) or more unexcused absences from class or lab sessions will result in an F grade. To be excused from a class or lab session due to medical reasons, you must show the instructor a doctor's note documenting the reason(s) for your absence. It is entirely your responsibility to catch up on any material you missed. Your performance on quizzes is used to measure your reading comprehension and attendance; missed quizzes cannot be re-taken.
Late assignments
Homework must be turned in by e-mail at the start of class hour on the day listed in the schedule outline. Lab assignments are late if they are not turned in at the conclusion of the lab session. All late assignments are worth half its value for each day the assignment is late.
Academic dishonesty
While you are encouraged to seek assistance from teachers or your fellow classmates, it is academically dishonest to turn in quizzes, assignments, or exams done by someone else.
Lab assignments are individual exercises. You must give proper credit for any help you receive, clearly stating who helped you, and how, whether it is from a classmate, faculty, or friend. Failure to give proper credit for expertise and guidance received will be treated as an act of academic dishonesty. Acts of academic dishonesty during exams will result in an automatic failure of the class for those involved, and may include further disciplinary action.
Disability
La Sierra University complies with the Americans with Disabilities Act (ADA) and Section 504 of the Rehabilitation Act of 1973. Any student with a documented disability (physical, learning, or psychological) needing academic accommodations should contact the Learning Support and Testing Center (LSTC) as early in the quarter as possible. All discussions will remain confidential. Please contact LSTC (La Sierra Hall, Suite 100, extension 2452) for additional information.
You are visitor number