Office Hours: T R: 2:30 - 5:00 pm
Required Textbook: Goodrich, Tammasia, Goldwasser; Data Structures & Algorithms in Java, 6th ed,
Catalog Description: Linear lists, strings, arrays, and orthogonal lists.
Representation of trees and graphs. Storage systems, structures, storage allocation
and collection. Symbol tables, searching and sorting techniques. Formal
specification of data structures and data management systems.
3 ch
Prerequisite: COSC 211
Corequisite:COSC 221.
You can develop in any environment you choose. HOWEVER, demos must be given in NetBeans, Eclipse or console. Your demos must run on a departmental machine
Tutoring:The tutors in 513 PH can help. OBVIOUSLY do NOT allow them to write code for you. They will not be particularly helpful in figuring out the assignment. However, once you tell them what your program is supposed to do, they can help point out err ors in logic and syntax.
This is the most important class in the undergraduate computer science major or minor. You MUST be able to program in Java in order to pass this class.
Grading:
| Programs total program score must be above 65% to receive a passing score in this class | 50% |
| Homework/Quizzes | 15% |
| Two Hourly exams (non-cumulative) | 20% |
| Final Exam (cumulative) | 15% |
Assignment of grades:
Academic Honesty:
I expect you to behave according to the highest possible ethical standards. If you claim anyone else's work as your own, or if you allow someone else to claim your work, you will receive an E in this class.
Additionally, I will report your name to the Dean of Students for possible expulsion.
Warning: the Internet is seductive; there is a lot of publicly accessible material out there. I will tell you when and how it will be acceptable to cannibalize code for a project. It is never acceptable to cannibalize text (e.g., for a paper). Do not plagiarize! Theft is beneath you.