Description
CS 310 continues the study of data structures from CS 211. Students will learn how to approach larger and more challenging programming problems than the projects in CS 211. Programming is a significant part of this course and students should expect to spend a good deal of time on the programming projects. The course also introduces a variety of data structures and illustrates the types of problems for which they are useful.
Topics to be covered include.
Generics and Collections
Basic Complexity Analysis
Linked Lists
Stacks and Queues
Simple and Balanced Binary Search Trees
B-Trees and File Organization
Hash Tables
Priority Queues
Graphs and Basic Graph Algorithms
Topics to be covered include.
Generics and Collections
Basic Complexity Analysis
Linked Lists
Stacks and Queues
Simple and Balanced Binary Search Trees
B-Trees and File Organization
Hash Tables
Priority Queues
Graphs and Basic Graph Algorithms
General Information
Homework Specs
Lecture Materials and Schedule
Java Development Kit (JDK) 1.8
DrJava: Officially Supported IDE
Textbook: Data Structures and Problem Solving by Weiss, 4th Edition
Textbook Resources/Source Code
Source Code for java.util.* Classes
| Name | Office Hours | |
|---|---|---|
Chris Kauffman | When? Where? | |
Fardina Fathmiul Alam | When? Where? |