Important:
CSci 241 - Class resources:
... with many thanks to Ben Coleman.
Things you should study for the final:
The exam is in room 020, Wednesday, Dec 17, @8:30am (don't forget to set your alarm
clock :)
- Chapter 1: forget about it ...
- Chapter 2, Recursion: key concepts; you should also know how to write a simple recursive
function (including its prototype/header) from a description of a problem.
- Chapter 3: Understand the UML language; study the ADT list: description and
functionality
- Chapter 4: Everything about the pointer-based implementation of the list
- Chapter 5: hmmmm, nothing here (it's recursion again!)
- Chapter 6: ADT Stack: compare various implementations (array-based, pointer-based,
ADT List-based)
- Chapter 7: ADT Queue: compare various implementations
- Chapter 8: Inheritance, overloaded operators (+constructors, destructors)
- Chapter 9: Sorting - the ideas behind selection-, bubble-, insertion-, merge-, and
quick-sort; know their complexity (you don't need to know how to actually compute it)
- Chapter 10: Trees: insist on this, read everything.
Final Exam Q&A :
Q1
Will we be expected to write out code for a copy constructor or destructor?
A:
An entire constructor from scratch, probably not.
But you might be asked to write a constructor using other
functions, already specified, which are given to you.
Grader rotation:
There will be three groups of 11 students each.
- A = last names start
with A-D;
- E = last names start with
E-K;
- L = last names start with
L-T;
The graders will rotate according to the following schedule:
|
Project 1
|
Project 2
|
Project 3
|
Project 4
|
Project 5
|
Project 6
|
Project 7
|
Project 8
|
Feng Chen
|
A
|
E
|
L
|
A
|
E
|
L
|
A
|
E
|
Jiexin Lian
|
E
|
L
|
A
|
E
|
L
|
A
|
E
|
L
|
Jun Wang
|
L
|
A
|
E
|
L
|
A
|
E
|
L
|
A
|
Java LED sign applet courtesy of java.sun.com