Instructor: 218 Bell 645-4738 Office hours: Tue. 1--3pm, Wed. 2--4pm
TAs: 1. Branislav Stojkovic
232 Bell no phone
Ofc. hrs.: Tue. 9--11am
2. Haifan Yao
232 Bell no phone
Ofc, hrs.: Thu. 9--11am
Week 2 Recitation Times: Tue 1-2 in Bell 224, and 2-3 in Commons 9, Wed. 12--12:50 in Bell 224, Thu. 1-2 in Commons 9. (Commons 9 is in the UB commons, closest to SW corner of bookstore lot.)
Course Organization and Policies (2011 version now)
CSE250 Course Resources
Includes links to C++ creator Bjarne Stroustrup's homepage and some
writings.
Assignments Page
Assignment 8, due
Fri. 11/18 in class,
Assignment 9 / Final Project, due
Fri. 12/9, 11:59pm online.
Assignment 10, due
Wed. Dec. 7 and Fri. 12/9 ,
Minimal Coding Guidelines, for submissions
in this course.
Template Errors from g++ on timberlake
by KWR, maybe others? Let me know if these ever help, and more than
a Google search on your error message does.
Error Wrapper for g++:
Installed on timberlake
is a "wrapper" for g++ that
sanitizes the template error messages. You can use
/util/bin/gfilt as a synonym for
g++, either from the
command line or in a Makefile. The Makefiles in the
/.../PROJECTS/F09BASE/ directory
now have this as an extra "CC" option---just
comment it in to use. Credit to
BDSoft.com for this utility
(aka. STLFilt---you
may find a home-usable free download there too).
Mirror of Java2C++ directory on timberlake, new and final-form files only. These files are equivalent to lecture notes.
Java2C++ Notes And a 2-page checklist
UNIX Tutorial . Parts One and Two will be followed in Week 1 recitations/office-hours. Another UNIX tutorial at the right level of detail.
Skeletal Nano Text Editor "Tutorial". Nano will also be introduced, along with vi/vim as options.
Recitation Slides (For weeks 2--5, we need to generate new passwords...)
Lecture Slides for Java2C++ Notes, Weeks 1--3
Quick-Reference Handout on Asymptotic Notation (by Tom Bylander of U.T. San Antonio, was given out in class on 9/14/11). Running Time Graphs by Jim Marshall of Sarah Lawrence. Notes (PowerPoint file) by Jeff Grundschlag of Columbia that include examples of counting code statements, loops, and recursion.
Lectures
Recitations--all in 21 Baldy
Examinations (All "cumulative")
Assignments
These total 45% of the grade, plus 5% that may include the
above-mentioned exam component.
Fri. 10/23 Lecture Notes (scanned PDFs) side 1, side 2.
Extra lecture notes Mon. 11/9 on STL make_heap:
page 1, page 2.
These include material not in the text, as well as a
second way of regarding the text's insert and removal algorithms, and
with actual STL names. [Note: the body of fixUp's
while-loop also needs
j = parent(j); and similarly for fixDown updating
j for the larger child. But, if instead of the
index "j"
you had a direct pointer to the heap-item, then the swap shown would
do all needed updating.]
Red-Black Tree Deletion---extra lecture notes given out for
lecture Wed. 12/9/09.