| Instructor |
Dr. Robert Kline
office: 25 Univ. Ave.
(UNA),
#146
phone: 610-436-2181
email:
|
| Office Hours |
Mo,We 2:00–4:00
Fr 2:00–3:00
|
|
Website
|
http://www.cs.wcupa.edu/~rkline/csc241/
|
| Textbook |
Mark Allen Weiss,
Data Structures and Algorithm Analysis in Java
Addison-Wesley, 2007,
(isbn: 0-321-37013-9)
|
| Description |
This course teaches data structures with a strong focus
on algorithm analysis. One goal is to illuminate the classes
which make up the so-called Java collections.
The student is encouraged to
use a modern full-featured IDE such as NetBeans (my preference)
or Eclipse for programming projects.
|
| Content |
Topics roughly follow the order in the textbook. They include:
-
Algorithmic analysis, including O, o, Ω, Θ
-
Lists, Stacks & Queues, Array-based and Link-based lists.
-
Arithmetic expression stack-based algorithms.
-
Trees, TreeSets, TreeMaps. Binary trees. AVL trees.
-
Hashing: open form, chaining, and closed form.
-
Priority Queues. Binary heap.
-
Sorting algorithms and timing comparisons.
-
Graphs. Graph algorithms. Shortest path algorithms.
|
| Grading |
|
70%
|
3 tests
25%
homework/programming projects
|
|
5%
|
attendance and class participation
|
Assignments should be done by you.
Please read the
policy on academic honesty.
|
Classroom
Behavior
Expectations
|
You are expected to behave in a responsible manner during class:
- Arrive on time
and stay in your seat the whole class time
unless you give prior notification to the instructor.
In particular, go to the bathroom before class!
- No laptops or other distracting electronic devices during class
unless approved by instructor.
-
If you miss a test or quiz, contact me that day and provide a valid reason
for missing.
-
Attend most classes. Those who miss more than
5 (valid or other)
classes are subject to grade deterioration.
|