CSC 214 (intermediate Java)
with a grade of a C or better
[it is recommended that you had a B or better to actually do well in this class — as this class is more demanding/challenging in time and intellectual difficulty]
Data Structures and Problem Solving Using Java; Mark Alen Weiss; Addison Wesley, 4th Edition
Big Java, Horstmann, John Wiley
Absolute Java, Savitch, Addison Wesley
Compared to What? An Introduction to the Analysis of Algorithms, Rawlins, Computer Science Press
Data Structures, Algorithms, and Applications in Java, Sahni, McGraw Hill
SAMS Teach Yourself Data Structures and Algorithms in 24 Hours, Lafore, MacMillian
Data Structures and Algorithm Analysis in Java, Weiss, Addison Wesley
To foster the student's understanding of proper storage and retrieval of data. We will emphasize algorithm analysis to compare various approaches and determine which is best for different situations. The Java programming language will be used (experimentally).
Attendance is an important aspect of classroom learning. It provides access to both the teacher's years of experience and the experience and understanding of other students (during discussions and group work). It is in the classroom that we find a sounding board for our conceptualizations of the ideas read in the book. It is also a place where we can hear explanations of topics from the book in a different light (from a different angle). All classes should be attended by the student.
Cheating is never a good thing. Some people think of cheating as merely copying their friend's (friends') or other's work.
Nope. Cheating also includes plagiarism (of your textbook, other books, journals, magazines, Web pages, etc.). Plagiarism is also a federal crime.
Cheating earns both parties 0's on the assignment. Continued cheating will result in failure of the course.
Please turn in your OWN work. It would be a shame for you to fail simply for lack of thinking on your own.
Also note that you cannot earn a C in this course without having shown at least a 70% competency on each and every topic covered during the semester (not a 70% average over all topics, but 70% on each topic). (See main page for the course for a topic list.)
The homework, labs, paper, and projects portions of your grade will come from the three portfolios you will be handing in (see below). Tests will be done in lecture time -- not take-home.
Lecture tests consist (most often) of true/false, fill in the blank (no word list), short answer, and hand-execution of code. Lecture tests may also include hand-coding of small (5-15 line) segments of code. Multiple choice can also occur, but all correct answers must be chosen (i.e. it isn't multiple guess). Finally, matching is a rare occurrence. (The online homework makes a pretty good sample of questions and style.)
Make-up exams (with reasonable excuse -- see attendance), will be ALL essay and/or hand-coding/execution.
Also there will be five tests (including the final) during the semester. This means that each test will be worth 7% of your overall grade.
When an assignment is given (i.e. placed on the web page), you can hand it in as soon as you are done for a review of its content. ('done' here means that you've made a reasonable attempt to start the program or answer the questions. You don't have to have it perfect before you hand it in. You can even hand in something you've merely outlined/flow-charted, if it is a complete enough outline.)
I will give the checked paper back to you ASAP so that you can make any needed corrections to it before using it in a portfolio (if you so choose). You can also hand papers in as many times as you like before the portfolio is due. (Remember that this corrections policy is good for ANY of the online assignments: the paper, projects, labs, and even homework.)
Finally, every assignment will also be rated (typically between 1 and 7) as to its difficulty (1 is quite easy, 7 is fairly challenging). These ratings will help you determine what (corrected) assignments you'd like to hand in for your portfolios. Also, labs and projects often have options which can be done that will increase the level rating of the assignment.
Three times during the semester, you will turn in what you consider to be your best work up to that point (since the last portfolio). Collect together your best (corrected) assignments and hand them in as a portfolio. (This doesn't have to be a fancy bound work, just make sure your papers aren't going to go flying around. It is a good idea to have your name on each item as well.) The portfolio must contain a project (2 during the semester) or paper (1 during the semester) as well as a certain total ratings value each of homework and labs and consist of only a certain total number of items. These totals will be mentioned in the portfolio announcement on the web page and/or during class. The announcement is purposely delayed until at least a week before the due date so that you will concentrate on doing and understanding and not meeting minimum requirements.
Any assignments you turn in that exceed the total ratings value for their category will be added to an extra credit pile for review at the end of the semester. This extra credit work will be added to some part of your grade where it will do the most good (typically projects or tests).
Example: If the projects section of a portfolio said the minimum ratings value was 16 and the maximum number of projects were 4, you could choose several different combinations of project ratings to satisfy these requirements. You might choose to hand in 3 projects which were rated 6. You might choose to hand in 4 projects rated 4. You might choose to hand projects in rated at 4, 6, and 7.
You might choose to hand in a 4, a 6, and 2 7's. If you did this, I might place either the 4, the 6, or either of the 7's on the extra credit pile (the remaining items already add up to more than 16). To avoid me picking, you can mark those items you wish to be extra credit with XC or EC or XCred or Extra Credit marked in plain large type/writing at the top.
Due dates (on portfolios) are present for a reason. If you do not turn in your papers by the due dates given, credit may be denied. (Reasonable excuses may be accepted.)
|Chapters 1-4; Appendix B||Review of Java Basics and Intermediates|
|Chapter 5||Algorithm Analysis|
|Chapter 6||Standard containers collections|
|Chapter 9||Randomized Algorithms|
|Chapter 15||nested and inner classes|
|Chapter 16||Stacks & Queues|
|Chapter 17||Linked Lists|
|Chapter 19||Binary Search Trees|
|Chapter 20||Hash Tables|
|Chapter 21||Priority Queues (Heaps)|
|Chapter 24||The Disjoint Set Class|
|Chapter 22||Splay Trees|
|Chapter 23||Merging Priority Queues|
Always look for online notes to supplement (and sometimes correct/override) the book information.