Comp 121: Data Structures Spring 2001

Course Information

Instructor: Kelly Van Busum Office: SN 039 Phone: 962-1924 Email: vanbusum@cs.unc.edu

Schedule (subject to change): Daily Schedule



Instructor's Schedule

I should be around the office at the following times or by appointment:

WEEK OF April 9
Monday	--
Tuesday	5:20 - ?
Wednesday	2pm - 3:30pm
Thursday	--
Friday	???

I am generally in the office from 9am-5pm M-R. Feel free to drop by. Fridays I often work from home, but will be checking email regularly.
Please do NOT interrupt Kelly Ward except for during her posted office hours unless it is by appointment.

---




TA: Kelly Ward Office: SN 039 Phone: 962-1890 Email: wardk@cs.unc.edu

Office Hours (or by appointment): Tuesday 3pm - 4pm Wednesday 3pm - 4pm

---


Syllabus

Textbooks:

Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Addison Wesley.
Gary Bronson, A First Book of C++ from Here to There, West Publishing Company.

Honor Code Information

Old Announcements

Word Indexer (Adriane Boyd)
Neural Net (Shayne O'Neill, Angela Walker, Daniel Plaisted)

Read Chapter 11 in C++ book Homework #1: Due At the beginning of class, Wed, 1/17 Homework #2: Due Friday 1/26 by 5pm Read Chapters 9 and 10 in C++ Book Homework #3: Due Monday, February 5, at the beginning of class Homework #4: Due Tuesday, Febrary 13, at the beginning of class Read Section 4.7 in Data Structures Book: B-trees Read Section 4.5 (optional) splay-trees Homework #5: Due Wednesday, March 7, at the beginning of class Read Section 5.6: Extendible Hashing Read Section 6.4: Applications of Priority Queues Read Chapter 14 in C++ Book: File I/O Homework #6: Due Monday, April 2, at the beginning of class Homework #7: Due Wednesday, April 25, at the beginning of class Required reading C++ book, p. 523-542: Copy Constructors

Project 1 Project 2 Project 3 (Phase 1) Project 3 (Phase 2) EXAM 2 (html) or (Word doc) FINAL EXAM STUDY GUIDE



Old Assignments

Chomsky Normal Form: Questions & Answers Pointer 1 & Pointer 2 Theory Notes General Tree Implementations Expression Trees Topics Covered Through Exam 1 (html) or (Word doc) General Tree Implementations AVL Trees -- Balancing Algorithms Priority Queues Methods of Collision Detection AVL Trees Hashing Practice Automatic Compilation with make Intro. to Sorting Makefile Examples Strategies for Solving the Dynamic Equivalence Problem More Sample Makefiles Topics Covered Through Exam 2 (html) or (Word doc) More Makefiles

Study Guides Chapters 1 and 2 Chapter 3 Chapter 4 Chapter 5 Chapter 6 Chapter 7 Chapter 8 Chapter 9 Chapter 10 Chapter 11


* See Professor to get copies of handouts that do not have links, or to get copies of handouts that have diagrams

Old Handouts

• C++ Resources:
  • www.cplusplus.com (for general C++ reference)
  • http://www.cplusplus.com/ref/#libs (for a description of the C++ Standard Library)
  • The Annotated C++ Reference Manual, Ellis & Stroustrup
  • The C++ Programming Language, Stroustrup
  • Answers to C++ Questions
  • SAMS Teach Yourself C++ in 10 Minutes, Jesse Liberty
  • Standard C++ Bible, Al Stevens & Clayton Walnum

  
  

• Java Resources
  • On-line Java Resource: Sun's reference site for Java 2.0
  • Sample code for Java IO:
    • test1.java
    • test2.java

  
  

• Unix Resources
  • Unix Overview
  • vi Editor Pocket Reference, Arnold Robbins, published by O'Reilly
  • Unix Commands Learned to Date
  • Get X-Windows Here
  • Programming with GNU Software, Mike Loukides & Andy Oram, published by O'Reilly
  • http://help.unc.edu/documentation/site_index.shtml
  • LINUX info
  • More LINUX info
  • Still more LINUX info

  
  

• Makefiles Resources
  • http://www.delorie.com/gnu/docs/make/make_toc.html
  • http://arioch.unomaha.edu/~jclark/make.html
  • http://www.eng.hawaii.edu/Tutor/Make/index.html
  
  
  
• Other
  • http://www.collegeunited.com
    
  • Data Structures Info

  ---