Skip to Main Content

CISC 3130 Data Structures: Lecture Notes

Professor Chuang Spring 2020 OER

Preview of Course Topics:

Data Structures:

Java 2D Arrays
Nodes & Linked Lists (Sample Code: https://repl.it/repls/TeemingQuarterlyAdmins, https://repl.it/repls/InvolvedPlayfulPreprocessor)
Logical structures Stacks, Queues
Tree structures
- Unordered Binary Trees
- Ordered Trees: Binary Search Trees, Binary Heaps
- Comparing Binary Search Trees and Heaps [Worksheet. Answers]
Key-Value storage with associative arrays Key-Value storage structures.
Graphs, Representing Graphs, Directed Graphs, [Worksheet+Answers]

Algorithms

Searching Algorithms, O(n) vs O(logn)
- Linear Search
- Binary Search
- Depth First Search (DFS) Tree Traversals
Sorting Algorithms
- O(n²) Sorting with Bubble Sort, Selection Sort, Insertion Sort (on Arrays)
Divide & Conquer Algorithms
- Merge Sort
- Quick Sort
Heapsort [Worksheet, Answers]

Analytical thinking skills:

Sorted order
Growth of functions, Loop Analysis
Arithmetic Notations : Infix, prefix, postfix notations; Infix to Postfix; Evaluating Postfix

Programming Project Planning/Management skills:

Project template example https://github.com/cisc3130-s20/assignment-template
Build Tools
- Make / Maven
Git Version Control Intro (will not be on exam)
- GitHub Repositories
- GitHub Pages

Technical skills

Java Review (Recommended reading: Teach Yourself Java in 21 Minutes)
- Java Specifications
- Java Collections Framework
- Recursion
Linux Terminal (will not be on exam)
- https://missing.csail.mit.edu/
Floating Point Arithmetic
Regular Expressions (regex) [Slides]