|Name||:||Terry Sergeant||Office Hours|
|Office||:||JB 322||TTh||8:30-9:30; 1:30-3:00|
|Description||:||Study of lists, trees and other data structure concepts; algorithms for manipulating data structures; use of data structures in computer data organization and programming languages. Work in Computer Lab required.|
|Prerequisites||:||CSCI 2320 (Program Design II)|
|Textbook(s)||:||None required. One book that has been used in the past and matches the contents of our course pretty well is: Goodrich, Michael T. and Tamassia, Roberto, Data Structures and Algorithms in Java.|
A homework assignment is considered late if it is not submitted at or before the beginning of the class period on the day it is due. Late homework assignments will receive a 30% point penalty and must be completed within a week or the original due date. Assignments that miss the one week deadline will receive a grade of 0 (unless there are extenuating circumstances).
In order to do well on exams it will be necessary for each student to work homework assignments independently. There are times, however, when you may become stuck and require assistance. For this reason, the standard regarding independent homework is quite loose:
When working a homework assignment you must not make any sort of electronic copy of work that is not your own. Also, you must type assignments yourself. Failure to abide by these rules is a violation of the academic integrity standards for this course.
Unless directed otherwise, all assignments will be submitted by e-mail to the following address: firstname.lastname@example.org.
Office of the Director of Undergraduate Advising and Disabilities of such as soon as possible in the academic term (preferably during the first two weeks of a long semester) for which they are seeking accommodations. The director will prepare letters to appropriate faculty members concerning specific, reasonable academic adjustments for the student. The student is responsible for delivering accommodation letters and conferring with faculty members. Please refer to the most recent version of the Undergraduate Catalog for the complete policy. (Rachel King, Director of Undergraduate Advising and Disabilities, Office: SM-209, Phone: 670-5842, Email: email@example.com)
Cases of suspected academic dishonesty will be handled in accordance with university policies outlined in Undergraduate Catalog and in the Student Handbook. The current catalog prescribes that ``no student who has violated the Academic Integrity Policy will be allowed to graduate from Hardin-Simmons University with honors.'' Penalties will be assigned at the discretion of the instructor and typically range from failure on the assignment to failure of the course. A general rule-of-thumb is that a first offense (if not too major) will result in a zero on the assignment and a second offense will result in an F for the course. The current catalog states that an F earned in this way cannot be replaced by retaking the course.
Accordingly, absence from more than 25 percent of class meetings and/or laboratory sessions scheduled for a course (including absences because of athletic participation) is regarded as excessive, and a grade of F may be assigned as deemed appropriate by the professor.
|Week||Date||Topic / Schedules|
|Week 1||27 Aug||Lists / OOP / ADTs|
|Week 2||03 Sep||Complexity of Algorithms|
|Week 3||10 Sep||Stacks / Queues|
|Week 4||17 Sep||Trees|
|Week 5||24 Sep||BSTs; Wed: Exam #1|
|Week 6||01 Oct||BSTs|
|Week 7||08 Oct||Hashing|
|Week 8||15 Oct||Hashing|
|Week 9||22 Oct||Balanced Trees|
|Week 10||29 Oct||Balanced Trees; Wed: Exam #2|
|Week 11||05 Nov||Priority Queues|
|Week 12||12 Nov||Sorting|
|Week 13||19 Nov||Sorting; Wed-Fri: Thanksgiving Break!|
|Week 14||26 Nov||Graph Algorithms|
|Week 15||04 Dec||Graph Algorithms|
|-----||Final Exam: Mon 10 Dec at 3:30pm|