CS2013-final-report

◦ Comparison of results for small and large data sets
◦ Introduction of tight-bound analysis (Big-θ)
• Elements of Java programming
◦ Basic syntax and semantics
◦ Interfaces and classes
◦ Exceptions
◦ Strings
◦ Arrays, ArrayLists, vectors
◦ Comparators; sorting
◦ Generics
◦ Java type system
◦ Iterators
◦ Introduction to the Java class library
• An integrated development environment (IDE) (e.g., Eclipse)
Course textbooks, materials, and assignments
The main textbook is Mark Allen Weiss, Data Structures and Problem Solving Using Java, Fourth Edition,
Addison-Wesley, 2009. ISBN: 0-321-54040-5. This is supplemented by numerous on-line readings. In-class
work involves an equal mix of lecture and lab-based activities. Students work collaboratively in pairs on the 23
required labs. Students also work individually on several programming assignments and on tests.
Body of Knowledge coverage
KA Knowledge Unit Topics Covered Hours
AL Basic Analysis Knowledge Unit covered in full; additional material in 5
later Analysis of Algorithms course
AL Algorithmic Strategies Divide and conquer ; much more in later Analysis of 1
Algorithms course
AL Fundamental Data
Additional sorting, trees, analysis of algorithms; 8
Structures and Algorithms searching and sorting done in earlier course; graphs in
later Analysis of Algorithms course
CN Fundamentals Several examples, problems, and assignments utilize 1
modeling and simulation; Math/Stat Dept. offers a full
course in Modeling
PL Object-Oriented
Knowledge Unit covered in full 10
Programming
PL Type Systems Supplement to discussion in earlier courses to cover 2
Knowledge Unit in full; additional material in later
Programming Language Concepts course
PL Language Translation and Automatic vs. manual memory management, garbage 0
Execution
collection
SDF Algorithms and Design Comparison of iterative and recursive strategies 3
SDF Fundamental Programming Simple I/O, iteration over structures (e.g., arrays) 2
Concepts
SDF Fundamental Structures Stacks, queues, priority queues, sets, references and 5
aliasing, choosing data structures covered in objectoriented
context
SDF Development Methods Program correctness, defensive programming,
exceptions, code reviews, test-case generation, pre- and
post-conditions, modern programming environments,
library APIs, debugging, documentation, program style
6
- 461 -