CS 201

Mon Aug 26 -- Syllabus stuff, including how to turn in programs. Meet neighbors. Define cheating. Late policy. What assignments will look like. Install visual studio. Compare Java and C++ Hello worlds at here. Show off debugger. Count down from 10 .. 1 a loop and using recursion.
Wed Aug 28 -- File paths. Five types of fileIO (bytes, lines, json, complicated). Basic file code and with getline. Easy file things.
Fri Aug 30 -- I do the file I/O programs.
Wed Sep 4 -- Use foreach loops. Use Vectors. Using Sorting an array and Sorting a vector. File reading assignment
Fri Sep 6 -- io manipulators. fstream vs ifstream vs ofstream. Seekg and tellg. Types of files (text, binary, json, application). ios::read() and ios::write. Copy files.
Mon Sep 9 -- Copying files. Binary search assignment.
Fri Sep 13 -- Fraction and how to do classes in c++.
Mon Sep 16 -- Quiz
Wed Sep 18 -- Go over quiz. Do this.
Fri Sep 20 -- Fraction.cpp. Now do Dollars!.
Mon Sep 23 -- Operator overloading an array. Making a set using operator overloading.
Wed Sep 26 -- Binky!!!!. Making a pointer in c++. Dereferencing a pointer in C++. Dereferencing parts of a pointer to class in c++. * vs ->. new vs malloc. Taking the address of '&'. Work on stack!
Wed Oct 2 -- Linked list. Comparing single and double linked lists. Tail pointer or not. Comparing linked lists and vectors. How to insert in the front, middle, back.
Fri Oct 4 -- LinkedList Assignment.
Mon Oct 7 -- Work on LL assignment.
Mon Oct 14 -- Go over quiz.
Mon Oct 21 -- Go over the second ll quiz. Second LL assignment.
Wed Oct 23 -- Count a LL. Count a target item in a LL. Biggest of all the items in a LL. Append two lists. Keep a list sorted. Searching a sorted list. Go over run times. Recursion.
Mon Oct 28 -- Templates. Standard template library. Recursion (day 2) .
Wed Oct 30 -- (1) Make your ll into a template. Show it working for ints and strings. (2) Add a recursive max() function to your ll. (3) Freedom.
Mon Nov 4 -- Go over quiz. Hash functions (1) requirements (2) crypt-stuff (3) how to. Hash table with (1) correctness and (2) speed.
Wed Nov 6 -- Sadness. Go over hash functions. Templated hash functions. How overflow works in c++. How bloom filters work.
Fri Nov 8 -- Bloom filter asignment.
Wed Nov 13 -- Dictionary-Checker-Compare.
Mon Nov 18 -- Binary Tree. Why? Run times. In order vs top-down. Finding the smallest/biggest item. Finding the successor to an item. Searching for an item. Balanced BT. Deleting
Mon Dec 2 -- Final Review.

	Name	Last modified	Size	Description
	Parent Directory		-
	Assignments/	2024-11-07 19:47	-
	CodeExamples/	2024-11-19 15:42	-
	Dictionary-Checker-Compare/	2024-11-15 13:30	-
	HEADER.html	2024-12-01 17:07	5.9K
	Notes/	2019-11-19 15:59	-
	OldStuff/	2024-11-07 19:44	-
	StackCodes/	2024-10-03 22:08	-
	Templates/	2024-10-03 21:02	-
	Tests/	2024-12-05 16:13	-
	syllabus.html	2024-08-23 16:55	3.3K