Abstract Data Types and Programming Methodologies
Prof. Daniel R. Schlegel, 395 Shineman Center, firstname.lastname@example.org
Office/Lab hours: Thursday 9:30-11:30am; Friday 12:30-1:30pm; by appointment
Section 800: MWF 9:10-10:05pm, Shineman 122
Teaching Assistants: Sushmita Banerjee, Tara O’Grady, Anne Reynolds, and Yingying Xia
Weekly Meeting Schedule:
|9:30||Dan's Office/Lab Hours
|10:30||Lab Section L51|
|Sushmita's Office Hours|
|11:30||Lab Section L52|
|12:30||Lab Section L53|
|Dan's Office/Lab Hours
|1:30||Annie's Office Hours
|4:00||Lab Section L54|
|4:30||Yingying's Office Hours|
|Tara's Office Hours|
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
Data Structure Visualizations
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-featured editor like nano or Notepad++ (but don’t expect me to know how to use it :)).
There will be several structured labs assigned during the semester (roughly one every 2 weeks). You will complete these during your specified lab period, and the supervising TA will sign your lab sheet when the lab has been completed to specifications. Labs may be submitted during the lab period for which it was assigned, or the following lab period. There is no late or partial credit available.
After you have completed the assigned lab, you should feel free to use the lab period as a kind of office hours to ask the supervising TA for help on issues you’re experiencing in class, including on homework. Keep in mind that this will only be assistance at the most basic level, clarifying confusions and pointing you in appropriate directions – you are expected to complete the work on your own.
Assignments will be submitted via Blackboard and graded according to the grading criteria. There may be in-class presentations of your work.
You will be able to either submit a single assignment late by up to one week, or 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. In either case, submit the assignment on Blackboard and send me an email to let me know you have done so and I will grade 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||1/22||First day of class
Syllabus and Project Overview
Assignment 1 Due 2/4, 11:59PM on Blackboard
Lab 1: Development Environment Configuration
|Wednesday||1/24||Brief presentation from Computer Science Association
Quick Gradle / Error Prone Introduction
Object Orientation In Java Review / Introduction
|Friday||1/26||Object Orientation In Java Review / Introduction (continued)
|2||Monday||1/29||Object Orientation In Java Review / Introduction (continued) - Enums and Class Design
Lab: Homework / Environment Setup Help
Object Orientation In Java Review / Introduction (concluded)
Value vs. Reference
|Friday||2/2||OO Concepts: Inheritance
|3||Monday||2/5||OO Conceps: Abstract Classes and Interfaces
Assignment 2 Due 2/18, 11:59PM on Blackboard
Lab 2: Inheritance and Abstract Classes (on Blackboard)
OO Concepts: Interfaces
The Comparable interface
|4||Monday||2/12||OO Concepts: Interfaces wrap-up, Polymorphism
Lab: Finish up Lab 2; Assignment 2 help!
Readings: Parsing an XML File Using SAX
|Wednesday||2/14||Event-Driven Programming Intro; XML Parsing
|5||Monday||2/19||Class Cancelled; Labs Still Scheduled!
Lab 3: SAX Parsing
Assignment 3 Due
|Wednesday||2/21||Review for Exam 1;
Preview of Part 2
|6||Monday||2/26||Intro to Asymptotic Analysis|
Exam 1 Corrections Due 3/7 at the beginning of class
Java 8 ArrayList source
If you are doing an assignment 2 resubmission, they are due 3/9, 11:59pm on Blackboard
|7||Monday||3/5||Asymptotic Analysis, continued
Readings: Java Generics Tutorial
Lab: Array Based List Structures
|Wednesday||3/7||Linked Lists, continued
Assignment 4 Due
|Friday||3/9||Linked Lists, continued
|8||Monday||3/12||No Class - Spring Break|
|Wednesday||3/14||No Class - Spring Break|
|Friday||3/16||No Class - Spring Break|
|9||Monday||3/19||Iterator and Iterable
|Wednesday||3/21||Linked List Variations: Circular, Doubly Linked
Stacks and Queues
|10||Monday||3/26||Insertion Sort, concluded
Lab: Doubly Linked Lists
Assignment 5 Due 4/8, 11:59pm on Blackboard
|Wednesday||3/28||Recursion, Tree Traversal|
|Friday||3/30||No Class - Easter Weekend|
Recursive vs. Iterative Solutions
In-order Tree Traversal Without Recursion
|Wednesday||4/4||No Class - Quest Day|
|12||Monday||4/9||Depth-First and Breadth-First Search
|Wednesday||4/11||Assignment 6 due
Binary Search Trees
|Friday||4/13||Binary Search Trees, concluded.|
|13||Monday||4/16||Lambda Expressions in Java 8+
Lab 6: Binary Search Trees
|Wednesday||4/18||Reading: Stream Tutorial
|Friday||4/20||Go over Exam 2
How to write a good driver class
Comparison Sort Visualizer
|Wednesday||4/25||N-squared search benchmarks
Assignment 7 due 5/11, 4PM demoed in person
|15||Monday||4/30||Merge sort, concluded
Lab 7: Lambdas and Streams
CSA Review Session, 6PM in 425
|Friday||5/4||Last day of class
Quick sort, concluded
Final Exam Study Guide
|Finals Week||Wednesday||5/9||Final Exam 8-10am, 122 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 email@example.com and x3358.