CS 1332 - Data Structures and Algorithms for Applications
Overview
Topic List
CS 1332 covers commonly used data structures and relevant algorithms, and uses the Java language for implementation.
- Arrays
- ArrayLists and LinkedLists
- Stacks and Queues
- Binary Search Trees
- Heaps
- Self-Balancing Binary Trees (AVLs and 2-4 Trees)
- HashMaps
- Sorting Algorithms
- Pattern Matching Algorithms
- Graphs and Graph Algorithms
- A selection of more advanced algorithms and data structures (varies by semester)
How it fits in the Curriculum
CS 1332 is the third introductory CS class (after CS 1301 and 1331) and continues to use the Java language that was first introduced in CS 1331. It is required for ALL threads, and is one of the more important class for prerequisites, as a large majority of Intelligence thread classes require it as a prereq. Data Structures knowledge is also generally helpful for all CS classes after this one.
Current Registration Info
CS 1332 is NOT a linked course. However, there is a second, optional, but highly recommended component of the class: Recitation. Recitation sections are under CS 1332R.
You must register for one of the lecture sections, marked by a single letter (A, B, C, etc.). If you do decide to register for recitation, you must register for a recitation section with the same leading letter (e.g. if you register for lecture section B, you must register for recitation section B01, B02, etc.).
Prerequisites
The sole prerequisite is a C or higher in CS 1331.
Majors That Require This Class
- Computational Media
- Computer Engineering
- Computer Science
Other Registration Info
- Computer Engineering students must wait 2 weeks before being given access to register for this course (unlike CS, CM students, who can register immediately).
- This is still shorter than the wait period for other majors, which is roughly 4 weeks.
Resources
Dr. HB's Summer 2020 syllabus is linked here. Note that the class now uses Java 11 instead of Java 8.
