Abstract Data Types and Programming Methodologies
Prof. Daniel R. Schlegel, 395 Shineman Center, email@example.com
Office/Lab hours: Monday 4pm-5pm; Tuesday 4pm-5pm; Friday 10am-11am
Section 810: MWF 3:00-3:55pm, Shineman 174
A developing computer scientist must understand and explain how their proposed data structure and algorithmic solutions compare to other solutions in terms of complexity, run time, and resource requirements. This course introduces students to traditional techniques used to describe such solutions. In addition, we will look at classic data structures and their applications in order to expand the depth and breadth of a student’s knowledge.
This course is intended to challenge the student to design and implement a large-scale software system based on specifications prepared by the instructor. Throughout the semester, each student will need to identify appropriate design elements and justify their selections.
To employ object-oriented design techniques to model problems and solutions.
To employ decomposition techniques to break a program into smaller pieces
To analyze algorithmic solutions using asymptotic notation
To demonstrate effective use of abstract data types (ADTs), e.g., stacks, queues, lists, hash tables, trees, etc., in their designs
To demonstrate correct use of recursive algorithms and data structures
To articulate the advantages and disadvantages of competing algorithmic solutions
Recommended: Koffman, E.B. and Wolfgang, P.A.T., Data Structures: Abstraction and Design Using Java, 3e. Wiley, 2015.
Introduction to Computer Science Using Java
Data Structures @ Wikibooks
Java Tutorials @ Oracle
Java 8 Standard Libraries @ Oracle
Java on Lynda.com
GNU Emacs Reference Card
Compiling on the Command Line Workshop Activity (by Oswego CSA)
Attendance Policy and Classroom Etiquette:
As per college policy, attendance in all sessions is obligatory. If you cannot attend a class meeting due to religious, athletic, health related circumstance, or circumstance of particular hardship, please notify me in advance via email. Please be ready to present proof, if necessary. Cell phones and headphones should not be out or used during lecture, and laptops should only be used for taking notes (I don’t recommend this). If use of any electronics becomes districting to other students I reserve the right to discontinue the allowance of their use.
All assignments will be completed alone, but working together without writing or sharing code to come up with general solutions is encouraged. The assignments are difficult, and I recommend starting work on them early, avoiding any tendency toward procrastination. You should plan on spending at least 10 hours per week on course work outside of class.
You will complete all assignments using a text editor, NOT an IDE like Netbeans or Eclipse. I will use GNU Emacs much of the time, but you are free to use Vim or a less fully-features editor (but don’t expect me to know how to use it :)).
Assignments will be evaluated in one of two ways, depending on the assignment:
Submitted via Blackboard and graded according to the grading criteria.
Satisfactorily demoed in person (i.e., everything works, good practices were used, and you can explain it), then submitted on Blackboard. In this case, partial solutions will not receive any credit.
You will be able to resubmit a single assignment to be re-graded, provided it is submitted before the next assignment is due, and that you submitted compiling code by the original deadline. Submit it again on Blackboard and send me an email to let me know you have done so and I will regrade it.
It is expected that each person participate during each class. As discussed above, attendance is required.
Each exam question will be assigned a point value (generally some multiple of 3 depending on difficulty), where the following scheme will be used in grading it:
0 – Did not attempt / No serious attempt
1 – Mostly incorrect solution
2 – Somewhat incorrect solution
3 – Perfect solution
If the problem is a multiple of 3, then intermediate scores will be given as appropriate. The total points received on all questions will then be summed and divided by the points possible and scaled as appropriate according to the percentages given below.
You may not receive a grade more than one letter grade above min(exams, assignments). That is, if your exam average is D, the best grade you can achieve in the course is a C. Likewise if you receive an E average on your assignments, the highest grade you can expect is a D.
The default grading for the course will be along the university’s standard grading curve:
|A: 93-100||C+: 77-79|
|A-: 90-92||C: 73-76|
|B+: 87-89||C-: 70-72|
|B: 83-86||D+: 67-69|
|B-: 80-82||D: 60-66|
A more generous curve may be used, but should not be expected.
During the semester we aim to cover the following topics:
Basic Search Algorithms
Lambdas and Streams in Java
This syllabus and the course schedule are subject to change by the instructor. All changes and related justifications will be announced in class, and updates will be reflected in this web version.
Lecture slides will be maintained on Blackboard, but many lectures will include use of the whiteboard which may not be reflected in notes elsewhere.
|1||Monday||8/28||First day of class
Syllabus and Project Overview
Assignment 1 Due
|Wednesday||8/30||Object orientation in Java intro/review|
|2||Monday||9/4||Labor Day - No Class|
|Wednesday||9/6||Quick Emacs / console demo
Object orientation in Java intro/review (continued)
|Friday||9/8||Value vs. Reference
Assignment 2 Due 9/24, 11:59pm on Blackboard
Readings: Review class inheritance on your own; Try these exercises
|Wednesday||9/13||Interfaces & Abstract Classes
|Friday||9/15||Abstract Classes & Polymorphism
Event-driven Programming; XML Parsing (SAX)
|Wednesday||9/20||SAX Parsing; JavaFX / FXML
Readings: FXML Tutorials
|Friday||9/22||Rosh Hashanah - No Class|
|5||Monday||9/25||Quick HashMap Introduction;
Drawing with JavaFX
JavaFX Scene Graph
Assignment 3 due 10/8, 11:59pm
|Wednesday||9/27||Review for Exam 1|
|6||Monday||10/2||Intro to Data Structures
Intro to Asymptotic Analysis
Expandable Array (see Java's ArrayList)
Readings: Asymptotic notation @ Khan Academy
Assignment 4 Due 10/22, 11:59PM on Blackboard
Readings: Java Generics Tutorial
|Friday||10/13||Iterator and Iterable
Linked List Variations: Circular, Doubly Linked
|8||Monday||10/16||Stacks and Queues
Assignment 5 Due
|Wednesday||10/25||Binary Search Trees
|Friday||10/27||Binary Search Trees, cont'd
|10||Monday||10/30||Class Cancelled - Dan Sick|
Functional Interfaces and java.util.function
Readings: Streams Tutorial
|Wednesday||11/8||No Class - Dan at AMIA|
|12||Monday||11/13||Streams, concluded (map)
Assignment 6 Due
|Wednesday||11/15||Selection sort, concluded
|Friday||11/17||Insertion sort, concluded
Comparing quadratic sorting methods
Sorting algorithms, visualized
|13||Monday||11/20||Divide and conquer algorithms
|Wednesday||11/22||No Class - Thanksgiving Recess|
|Friday||11/24||No Class - Thanksgiving Recess|
|14||Monday||11/27||No Class - Dan Sick|
|Wednesday||11/29||Merge sort, concluded
|Friday||12/1||Quick sort, concluded
Just for fun: Advent of Code
Assignment 7 due 12/15/17, 11:59PM on Blackboard
|Wednesday||12/6||In-class Game Demos!|
|Friday||12/8||Last day of class
Final Exam Study Guide
In-class Game Demos!
|Finals Week||Wednesday||12/13||Final Exam, 2-4pm, 174 Shineman|
While it is acceptable to discuss general approaches with your fellow students, the work you turn in must be your own. You may not turn in code found on the internet. If you have any problems doing the assignments, consult the instructor. Please be sure to read the webpage, “Academic Integrity“, which spells out all the details of this, and related policies. See my page on plagiarism for an explanation of what I consider cheating.
If you have a disabling condition, which may interfere with your ability to successfully complete this course, please contact the Office of Disability Services at firstname.lastname@example.org and x3358.