CIS2168: Data Structures and Algorithms in JAVA

Information (info)

Class: Tuesday 5:30 PM - 8:00 PM
Date Range: Aug 26, 2013 - Dec 14, 2013
Location: Tuttleman Learning Center 0305A
Labs: Wachman Hall 00200

Course Descriptions

The course introduces basic data structures, e.g. linked lists, stacks, queues, trees and graphs. Along with these, algorithms to utilize these data structures are introduced, e.g. insertion, deletion into lists, or tree traversal. The knowledge of these data structures is indispensable to be considered as a serious programmer in industry or research.
MAIN GOAL: to be familiar with a variety of basic data structures, to be able to implement them, to analyze their behavior, and to know when to utilize which data structure. This course will empower you to master these tasks. This course is at the heart of many challenges you will encounter in your programming life. It might also change your approach to solve problems outside of a programming environment. In short, it will give you a new perspective on organizing your data in professional, and probably private life. The class topics will be motivated by their use in serious computer science areas, such as search engines, databases, game programming or computer vision. Data structures and Algorithms will be implemented/examined using JAVA, and, although the theoretical part of this class is valid for all usual programming languages, this course will be heavy on JAVA object oriented programming. Weekly programming assignments, discussed in the lab, will support the more theoretical classes. The assignments tend to have graphical output or text processing oriented. The course will use a software package, SimpleGUI (developed by Prof. Rolf Lakaemper), to have easy access to graphics programming and GUI input.

Textbook

Recommended: Data Structures: Abstraction and Design Using Java, Second Edition
Older editions are accepted. They may even be cheaper.

Workload

- Weekly quizzes Quizes
- Weekly programing assignments
- Midterm Exam (Date: TBD)
- Final Exam (Date: TBD) . Final exam is cumulative.

Grading

The final grade will be based upon the following:
- Quizes: 25%. The weakest two grades in your quizes will not be considered.
- Programing assignments: 25%.
- Midterm Exam: 20%
- Final Exam: 30%
- Extra-credit points may be given, up to 5%, based on the activity in class and the labs. The TA input will be taken into consideration.

Late Submission Policy

Late submission is subject to a 10% penalty for each day late. After three days, late submissions will not be accepted. Students are strongly advised that any act of cheating will result in a score of 0 for the entire assignment and repeat offences will be reported to the Office of the Dean of Students and will result in an automatic F grade. You are encouraged to discuss problems and ideas but the final solution or code must be your own.

Disability Disclosure

Any student who has a need for accommodation based on the impact of a disability should contact me privately to discuss the specific situation as soon as possible. Contact Disability Resources and Services at 215-204-1280 in Room 100, Ritter Annex to coordinate reasonable accommodations for students with documented disabilities.