CourseCISC 210 – Data Structures
Date/TimeMonday/Wednesday/Friday 11:00AM – 12:20PM
LocationMeen 101
InstructorWalter Wimberly

Course Description: This course is a continuation of CISC 205. At this level, students write programs that deal with interactive processing, manipulation of arrays, files, linked lists, queues and stacks.
Prerequisites: Computer Literacy and CISC 205 – Java Programming

Weekly Activities

ModulesClass NotesVideos
1Introduction to Class

Primitive Data Types
Installing Visual Studio Code
2Native Complex Data Types
When Should a Number Not Be a Number		Install Visual Studio Code
Intro to Java
Declaring variables in Java
3Arrays as a Data Type
Arrays in Java		Java Arrays
4Pointers and References
Vectors in Java		Java Vectors
5User Define Data Types
6Intro to Object Oriented Programming
The Three Components of Object Oriented Languages 
Instantiating Objects 
7Copying Data – Deep vs Shallow
Multi-Tier Applications
8Unit Tests
Linked Lists
Linked List Sample Code (YouTube Video)		Java Linked Lists
9Double Linked Lists
Circular Linked Lists
10How Queues Work
Programming a Queue
Priority Queues		Java Queue
Basic Java Priority Queue
Java Priority Queue – Custom Object
Java Priority Queue – Custom Object Part 2
11An Introduction to Stacks
Stacks in Computers
Programming the Stack 		Java Stacks
12Binary Trees
13Hash TablesJava Maps
14Associative Arrays
15SetsJava Unsorted Sets
Java Sorted Sets

Former Sectional Notes

Searching

Brute Force Searching
Binary Search

Sorting

An Intro to Sorting Data
The Bubble Sort
Quick Sort
Merge Sort
Merge Sorted
Insertion Sort