Students will examine, implement, and analyze common data structures such as stacks, queues, lists, trees, heaps, and graphs. Students will understand how to choose an appropriate data structure for a real-world problem and use it in solving such problems.
Data Structures and Abstractions with Java, 5th ed., Frank M. Carrano and Timothy M. Henry, Pearson Education, 2019.
The assignments this semester will require students to use the Java Development Kit and IDE software to design, code, compile, debug and submit programs written in Java. Students may opt to program on Adelphi's Linux system, Panther, using the JDK on Panther using vi.
Each programming assignment will be graded with a base grade of 90%, with points added to reflected areas in which the assignment exceeded specified requirements and/or points deducted to show areas where the assignment is deficient.
Late penalties may be assessed of 2 points per class after the due date.
The final average will be weighted (based on the following ratio:
Programming Assignments | 25% |
Quizzes | 25% |
Midterm Exam | 25% |
Final Exam | 25% |
The following is the Adelphi University General Attendance Policy: Only students who are registered for courses, and whose name appears on the Official Class Roster may attend courses at the University. Adelphi students make a commitment to be active participants in their educational program; class attendance is an integral part of this commitment. Attendance requirements for each course will be announced by the faculty member at the beginning of each term. Students are expected to be present promptly at the beginning of each class period, unless prevented by illness or by other compelling cause. In the event of such absence, students may request that faculty members be notified by the Office of Academic Services and Retention. Students are responsible for completing course work missed through absences. Students should wait a reasonable length of time for an instructor in the event that the instructor is delayed.
Additionally, you are also responsible for whatever work is covered in class whether or not you are there. Absence from the final exam will be excused only for a good and well-documented reason. The decision to allow a make-up exam will be made in accordance with the policies of Adelphi University.
Date | Topic | Assignment due | |
---|---|---|---|
August 26 | Bags | ||
August 28 | Bags | ||
August 30 | Bags | ||
September 4 | Efficiency of Algorithms | ||
September 6 | Stacks | Assn 1- A Concordance Program | |
September 9 | Stacks | ||
September 11 | Stacks | ||
September 13 | Recursion | Assn 2 - Working with Bags | |
September 16 | Recursion | Assn 3 - Working with Prefix and Postfix Notation | |
September 18 | No class - video presentation on Recursion | ||
September 20 | Recursion | Assn 4 - The Bashemin Parking Garage | |
September 20 | Recursion | Assn 4 - the Bashemin Parking Garage | |
September 23 | Quiz #1 - Sorting | ||
September 25 | Sorting | ||
September 27 | Sorting | Assn 5 - Writing a Recursive Solution to Greatest Common Divisor | |
September 30 | No class - to be made up December 11 | ||
October 2 | Sorting | ||
October 4 | Queues, Dequeues, and Priority Queues | ||
October 7 | Queues, Dequeues, and Priority Queues | Assn 7 - Evaluating the Efficiency of Various Sort | |
October 9 | No class - video presentation on Queues | ||
October 11 | Queues, Dequeues, and Priority Queues | ||
October 16 | Lists | ||
October 18 | Lists | ||
October 21 | No class - video presentation on Lists | ||
October 23 | Review for Midterm Exam | Assn 8 - A simple Queue Program | |
October 25 | Midterm Exam | ||
October 28 | Lists | ||
October 30 | Lists | ||
November 1 | Searching | ||
November 4 | Searching | Assn 9 - Working with Lists | |
November 6 | Searching | ||
November 8 | Searching | ||
November 11 | Dictionaries | ||
November 13 | Dictionaries | Assn 10 - Searching | |
November 15 | Dictionaries | ||
November 18 | Quiz #2 - Trees | ||
November 20 | Trees | Assn 11 - Working with Dictionaries | |
November 22 | Trees | ||
November 25 | Trees | ||
December 2 | Graphs | Assn 13 - Working with Trees | |
December 4 | Graphs | ||
December 6 | Graphs | ||
December 9 | Graphs | ||
December 11 | Review for Final Exam | Assn 14 - Working with Graphs | |
FRiday, December 13 | Final Exam (10:30 AM - 12:30 PM) |
If you have a disability that may significantly impact your ability ability to carry out assigned coursework, please contact the Student Access Office (SAO) at 516-877-3806 or send an email to sao@adelphi.edu. The staff will review your concerns and determine, with you, appropriate and necessary accommodations. Please allow for a reasonable time frame for requesting ASL Interpreters or Transcription Services
Students enrolled in this course are expected to abide by the Adelphi University Honor Code. The purpose of the Honor Code is to protect the academic integrity of the University by encouraging consistent ethical behavior in assigned coursework by students. Following is excerpted from the Student Honor Code:
The code of academic honesty prohibits behavior, which can broadly be described as lying, cheating, or stealing. Violations of the code of academic honesty will include, but are not limited to, the following:
During the last two weeks of the class, you will receive notification, via mail and eCampus, that the course evaluation is available for your input electronically. Availability will end at the start of the final examination period. Your feedback is valuable and I encourage you to respond. Please be assured that your responses are anonymous and the results will not be available to the instructor until after the end of the semester and therefore after course grades have been submitted.
Tear off this and return with information required below: STUDENT ACKNOWLEDGEMENT: I HAVE RECEIVED AND READ THE SYLLABUS FOR [INSERT COURSE NUMBER AND SECTION]. SIGNED: __________________________________________ PRINT NAME: _________________________________________ DATE: ___________________________ Warning - This page must be signed and returned to the instructor to receive a complete grade in this course.