Fall 2009

CS 33001-600 Computer Science II: Data Structures and Abstraction

TR 3:30 PM - 4:45 PM - Room  MH 306

Instructor: Dr. Angela Guercio

GO DIRECTLY TO THIS WEEK'S SCHEDULE!

Syllabus

All the files required in this course, as well as the slides, can be downloaded from Flashline.

HOW?

  1. Login in Flashline with your username and password.
  2. Select MyCourses
  3. Select the CS33001 Course.

The Course

  Month/Day Weekday Topic Reading Assignments and Deadlines
1 Sept 1 T Introduction to Data Structures: A quick review of  class, constructors, member functions. Read Chapter 1
Introduction

HW1: Review Ex. 1-4
p.43 n.14,15
p.47 n.29
p.48 n.31
p.49 n.35
Deadline: HW1 is due by Sept 8

2 Sept 3 R Introduction to Data Structures: Strings Object Oriented Technique: Software Design Read ahead Ch. 2  
3 Sept 8 T Object Design Techniques      
4 Sept 10 R Object Design Techniques/ Simple Search Algorithms Read ahead Ch. 3 HW2: Pick one problem of your choice among the exercises at the end of the chapter that require writing a program that uses either composite objects or error handling or both.
Deadline: HW2 is due by Sept 17
5 Sept 15 T Operator Overloading. Selection Sort and Simple Search Algorithms    
6 Sept 17 R Professor sick - no class    
7 Sept 22 T Templates, Algorithms Complexity, Recursion: Fibonacci Read ahead Ch. 4 HW3: p.172 n.17, p.177 n.31, 38
HW3bis: p. 179, n. 41
Each problem is wirth 10 points

Deadline: HW3 is due by Sept 24 - HW3bis is due by Sept 29 - 4 extra points to HW3bis if returned by Sept 24.

8 Sept 24 R Review and Practice    
9 Sept 29 T Exam 1 (Ch 1-3) Read ahead Ch. 5  
10 Oct 1 R The vector container    
11 Oct 6 T The vector container    
12 Oct 8 R Pointers    
13 Oct 13 T Pointers and Intro to Dynamic Memory: Vector   HW4: p.273 n.24 - p.277 n.36 - p. 278, n.38
Deadline: HW4 is due by Oct 20
14 Oct 15 R Dynamic Memory Read ahead Ch. 6  
15 Oct 20 T The Mini Vector example - The List container    
16 Oct 22 R Iterators Read ahead Ch. 7

HW5: Review Exercises p.317 n.1-6
p.319 n.13, 15, 20, 27. Test all your answers on a machine. No handwriting accepted.
Deadline: HW5 is due by Oct 29

17 Oct 27 T Stack - work on HW5 during class    
18 Oct 29 R Stack    
19 Nov 3 T Review    
20 Nov 5 R Exam 2   Project to be issued
21 Nov 10 T Stack Example. Intro to Queue Read ahead Ch. 8
Read ahead Ch. 14 until p.810

Project issued.
Deadline: Project is due by 11:59pm - Dec 8
Project will be presented in class on Dec 8
22 Nov 12 R Vector Based Queues    
23 Nov 17 T Queues - Radix Sort and other examples   Return Ex. 429, n.20 for .2 extra credit
24 Nov 19 R Circular Queues and Heap - Brief Intro to Linked Lists   HW6: p, 431, n.26.
Deadline: HW6 is due by Dec 1.
Extra Credit: 0.2 E.C.for returning it by Nov 23.
25 Nov 23 T Linked Lists    
  Nov 25-29        
26 Dec 1 T Trees    
27 Dec 3 R Trees    
28 Dec 8 T Project Presentation    
29 Dec 10 R Review and Practice    
30 Dec 17 R 3:30 pm - 5:30 pm - Final Exam    

Useful Links....

C++ references
How to compile a C++ program made out of several files
Makefiles
Basic References to the Vim Editor
Linux
Vi and Vim editor: advanced Features
Vi Quick reference card Improved
Vi (Vim) quick reference card
Unix Manual and Emacs references
X11 Emacs quick reference card
The one page Linux Manual
Unix commands reference Card
Introduction to cshell
GCC releases and GCC manual
GNU Project
GNU for Windows Reference Cards Getting started with GDB

Back to the top

Remember.....this page is constantly under construction....so check it often!!!
Constr.gifconst.gif lavoriincorso3.gif
Nov_12