COP 3502
Computer Science I
Fall 2011
Instructor
Sarah Buchanan
HEC-201
Office Hours: WF 10:30am-12pm
sbuchanan@knights.ucf.edu
C Review
Lectures - Part 1
Lectures - Part 2
- Lecture 14 - Algorithm Experimental AnalysisPDF PPSX
- Lecture 15 - Recurrence Relations Part 1PDF PPSX PPTX
- Lecture 15 - Recurrence Relations Part 2PDF PPSX PPTX
- Sorry there's so many different file types! Apparently you can only view ink (the handwritten notes on slides) in .pptx format. So that's the one I would use for studying.
- Lecture 15 - Stacks and Infix/PostfixPDF PPSX
- Lecture 16 - Stacks Implementation
- Handout DOC PDF
- Reversing a list of numbers example (Using a Linked List Implementation of a Stack): RevList.c stack_ll.h
- Matching Parentheses example(Using an Array Implementation of a Stack): RevList.c stack.h
- Lecture 18 - Stacks & Queues ImplementationPDF PPSX
- Arup's notes on pass by reference in C (in case you need a refresher) : Link
- Pass by reference example: PointersByReference.c
- Lecture 19 - Binary TreesPDF PPSX
- Lecture 20 - Binary Trees InsertionPDF PPSX
- Lecture 21 - Binary Trees DeletionPDF PPSX
- Binary Search Tree Deletion Handout: DOC PDF
- Lecture 22 - Hash TablesPDF PPSX
Lectures - Part 3
- Lecture 23 - N Squared SortingPDF PPSX
- Lecture 24 - Merge SortPDF PPSX
- Lecture 25 - Quick SortPDF PPSX
- Lecture 26 - HeapsPDF PPSX
- Lecture 27 - AVL Trees - Intro & InsertPDF PPSX
- Lecture 28 - AVL Trees - DeletePDF PPSX
- Lecture 29 - Jeopardy Review!PDF PPSX
- Lecture 30 - BacktrackingPDF PPSX
- Lecture 31 - GraphsPDF PPSX