CSCI 2380

Instructor:	Robbie Schweller EIEAB 3.220 956-665-2667 (cell) 773-456-1722 robert.schweller@utrgv.edu
Office Hours:	Office hours: M: 8:00 am-12:00pm, W: 8:00am-9:15 pm, and by appointment.
Schedule:	TR, 12:30 - 1:45 pm, EIEAB 2.203 (was EEDUC 1.530) Lab: TR, 2-3:15pm, EIEAB 2.207
Books:	C++ Programming: Program Design Including Data Structures. D. S. Malik, 6th, 7th, or 8th edition.

Week	T	R
8/24		Review CS1: Ch. 1-8 piShoot.cpp
8/31	Review CS1: Arrays, Linear Search, Binary Search, Big-Oh notation binarySearch.cpp	Selection Sort vs. Merge Sort Templated functions selectionSort.cpp
9/7	Classes and Objects Ch.10 objectDemo.cpp	Stacks and Queues, Abstract Data Types: Ch. 17 stack.cpp
9/14	Exam 1 (CS1 Basics) Circular Arrays, Queue Implementation stack.h queue.h calculator.h driver.cpp	Pointers, Dynamic Memory Allocation pointerDemo.cpp
9/21	2D Arrays: static vs. dynamic pointerDemo2.cpp gameDriver.cpp pacGame.h	Dynamic 2D arrays, Linked Lists gameDriver.cpp pacGame.h linkedListsBasics.cpp
9/28	Linked Lists linkedLists.cpp	Linked Lists
10/5	Exam 2 (Classes, Pointers, Dynamic Memory Allocation, Linked Lists) Linked Lists, Deconstructors, Doubly Linked Lists	Doubly Linked Lists
10/12	Recursion	Recursion
10/19	Recursion, Linked Lists, Binary Search, Towers of Hanoi	Splitting, Merging and Sorting Linked Lists
10/26	Exam 3 (Linked Lists, Recursion) Asymptotic Notation	Fast Sorting: Heapsort, Mergesort, Quicksort, Read on your own: Radix Sort
11/2	Binary Search Trees	BST: Methods: Insertion, Traversals, Concepts: Leaves, Height
11/9	Binary Search Trees	BST Removal
11/16	Breadth First Search, Sorted Input Exam 4 (BSTs, Fast Sorting)	Maps, Unordered_maps, Hash Tables
11/23	Graphs, Breadth-First-Search, Shortest Paths	Thanksgiving
11/30	Graphs, Breadth-First-Search, Shortest Paths BFS.pdf	Study Day
12/7		Final Exam: 12/10, 10:15am - 12:00

Course Information