- HW3 ReadMe Sample And here is another very nice readme file for hw3. This one follows the required guidelines that state: Your readme file will detail your classes, their interfaces, the associated files
- HW3 Solution and Comments Example See an example solution for assignment 3 with excellent comments.
- HW4 Files Your solution to hw4 must use
the version of main
provided at this link.
Note, each assembly line has one rate. The number of assembly lines and the rates for each one are given on the command line.
HW4 Testing See this link for information about making sample data and testing your program.
- HW3 Solution See an example solution for assignment 3.
- HW3 Solution See a second example solution for assignment 3 from Alexander Koudijs.
- HW3 Solution See another example solution for assignment 3 from Bruce Molay.
- Binary Expression Tree Printer
A solution to printing a binary expression tree
An entire program to read and print FPBETs
- Practice Midterm comp15f13practicemidterm
- HW1 Solution See an example solution for assignment 1.
- HW3 Testing See this link for information about making sample data and testing your program.
- HW3 Files Your solution to hw3 must use the version of main provided at this link. To help you visualize your queue for testing and debugging, you can use the code provided at this link.
- TOT main and testing Click this link for a discussion of sample tests and multiple mains for the TOT assignment.
- Copy Constructors and Assignment Operators Click on this link for an explanation and exercise on how copy constructors and assignment operators are invoked in a program.
- Want to connect remotely and work from home? Click here for instructions: Remote Access
- Need a new CS account or to reactivate an old account? Click here: CS Accounts
- Want some quick pointers on emacs? Click here: Emacs Reference Card from refcards.com
- Want some quick pointers on vim? Click here: Vim Reference Card found via refcards.com There is a nice tutorial online located here (Thanks to Marshall for this pointer)
- For general Unix pointers, here is a nice one page reference from Bruce Unix Lab Review
- Coding styleguide is located here. There is an excellent article about why coding styles matters by Nicholas C. Zakas here
This course is intended as an introduction to data structures and more advanced programming techniques. Students will be able to solve real-world problems by reasoning about data structure choices, choose appropriate implementations, and analyze the costs associated with those choices. Students will learn to write, debug, and test large programs systematically. We hope to achieve these goal by presenting higher level concepts in lecture and hands-on computer practices in the lab. The programming assignments will be in C++.
The major topics within the course include: Abstraction, Problems Solving, Software Design, Sequences, Sets, Finite Maps, Linked Lists, Templates, Stacks, Queues, Trees, Heaps, Sorting Algorithms, Graphs, and Hashing, with exposure to complexity and algorithm analysis.
Both section 1 (H+ block, TR 1:30-2:45) and section 2 (L+ Block, TR 4:30-5:45) are located in Robinson Hall, room 253. All labs are held in room 116/118 in Halligan Hall.
Ben Hescott direct email: firstname.lastname@example.org
Bruce Molay direct email: email@example.com
Graduate Teaching Assistant:
The fastest way to get a response to a question is through piazza.com where comp15 has a course page, we will use the page to post questions and answers. The course webpage on piazza is https://piazza.com/tufts/fall2013/comp15
Professor Hescott's Office Hours: TBA
In addition the undergraduate teaching assistants will have many office hours. Click this link for the full schedule. All office hours, (including professors, graduate TAs, and undergraduate TAs) are in Halligan 118, 116, or 120. Check the doors and/or white boards for details.