Comp 271-400: Data Structures

Peter Dordal, Spring 2018 second half

Lecture: Mondays 4:15-8:15, Cuneo 311
Lab: Wednesdays 4:15-6:30, Cuneo 311  (Anadi Misra / Neha Goel)

Schedule:

General notes

Lists (and hashing)

Searching and Sorting

Trees

Recursion

Objects and Inheritance

mini-Java compiler

Language Issues, C++ Intro, MinGW notes

Some (rather unindexed at the time being) demo programs are here.

The midterm will be towards the end of fifth class, Apr 9. There will be a study guide on Sakai.

The final exam will be Monday, April 30. The study guide will be on Sakai.

Textbooks and other resources (all online). These are all links to the original locations. If you have any difficulties, I can make these available on Sakai, locally.

• Bailey, Java Structures (this is the one we will use the most)
  
  
• Pat Morin, Open Data Structures, Java edition
• Horvick, Data Structures Succinctly, Part 1
• Horvick, Data Structures Succinctly, Part 2
• Cplusplus.com C++ Tutorial
• C++ STL reference

Languages: You have been studying Java. We will cover the following:

• Implementation of some data structures in Java
• Coverage of standard data structures and associated algorithms:
• lists, array and linked
• sorting and searching
• trees
• maps/dictionaries
• Programming that uses some complex data structures
• A brief introduction to C++

C++

    Here is a short intro to C++.

You should install a C++ compiler. Here are a few options:

• Microsoft Visual Studio, available free from the CS department under the MSDNAA program (you may need an MSDNAA id).
• Dev-C++, a free C++ IDE. It comes with Mingw, a windows port of g++ (the Gnu C++ compiler)
• Eclipse for C++, with Mingw installed separately. My instructions for installing minGW. I will try using eclipse in class. (old instructions here)