CSC 270 - Fundamental Data Structures and Techniques

Tutors	Tutorial Room	Student's surname
Alfredo Gabaldon	SS 2135	A - C
Babak Farzad	SS 2106	D - I
Carl Kumaradas	SS 1074	J - L
Thomas El-Maraghi	SS 1072	M - S
Luke Stras	SS 2111	T - Z

Check information in the CSC270 newsgroup (post by sending e-mail to:ut.cdf.csc270h@cdf.toronto.edu).

Current announcements

This space will be used for announcements. Check it regularly.

• Remember that my account for issues related with this course is daniel@cdf.toronto edu. Please, do not write to any of my other accounts. Thanks!
• The course is over!
• Find the final unofficial grades for the course at the door of my office (SF2303A). They are unofficial until the Chair of the Department makes them offical but for all that matters they are the final marks. Happy holidays!
• All assignments (including old ones, new ones, and remarkings) are in CSSU.

General Information

• Most handouts are in postcript format. If you don't have a software to view postscript files, you may download a ghostview software.
• The general information handout for the course is in text and in postcript formats.
• Tentative lecture schedule (text file) as of August 1999 (before classes start).
  The actual material covered in each lecture is below.
• Previous webpages for this course: Summer 1999, Spring 1999, Fall 1998.
• Here are the CSCB70F webpage at Scarborough Campus, and the CSC270F webpage at Erindale Campus.
• Find old exams for this course.

Policies

• on plagiarism (html file)
• on remarking (html file)
• on missed-midterm (html file)
• on lateness (html file)

Lecture notes

• TA's webpages by Luke Stras, Kenneth Sinn.
• Some useful links posted in the newsgroup and/or obtained from the internet using searching engines:
  • Unix: commands, a helper page, a manual page;
  • C: FAQ;
  • GCC: tons of links;
  • Emacs: manual + FAQ.
• Introductory C slides (ps file) by Jeremy Cooperstock and Phil Edmonds
• Some questions and answers about makefile are here (html file).
• Examples of DFS and BFS.
• A new C++ version by Jim Clarke of the gas station simulation in the notes:
  README, arrival.h, arrival.cc, car.h, car.cc, carqueue.h, carqueue.cc,
  data1, data2, depart.h, depart.cc, endsim.h, event.h, evlist.h, evlist.cc,
  main.h, main.cc, Makefile, porting.h, pstand.h, pstand.cc, pump.h, pump.cc,
  random.h, random.cc, report.h, report.cc, stats.h, stats.cc.
  
• The material covered in tutorial about integer representation (text file).
  

Lectures per month

• September 1999 (html file)
• October 1999 (html file)
• November-December 1999 (html file)

Assignments and tests

• Assignment 1 (postcript file), Assignment 1 (html file), starter code (C file).
  An illustration 1 (postcript file), some sample functions and results.
  The deadline is Tuesday October 12 at 5:00 PM.
  We will run your program in this way: gcc -Wall -o a1 a1.c func.c -lm
  Submit your files in the following way: submit -N a1 csc270h *
  (for more information about the submit command, type ``man submit'').
  Save your functions to be integrated in files called ``func.c'', ``func1.c'', ``func2.c'', and so on (three files is enough). As I explained in class, the function to be integrated must be called ``func'' (in all these files). Also, as I explained in class, for sure we will run your program with your function in the file ``func.c'', and with one function of our choice. In addition, we may run your program with your other functions. Include your results for all your functions in the report.
  There is no need of makefiles in this assignment (we will use makefiles later in the course). Use it at your own risk.
  Solution of assignment 1 (text file).
• Assignment 2 (postcript file), starter code (several files).
  The deadline is Monday November 1 at 10:00 AM.
  Submit your files in the following way: submit -N a2 csc270h *
  Read the notes on Graphs from pages 451-484 (up to Section 9.5, inclusive).
  Instructions for input/output (text file).
  Comments about assignment 2 (text file).
  Several sample functions/output (text file).
  Advice for generating test inputs (text file).
  About the report part of assignment 2.
  A solution of assignment 2 (several files),
  and another solution of assignment 2 (several files).
  Explanation of marks taken in assignment 2.
  Matrices used when testing your assignment 2 and associated solutions (txt files):
  • test 1, solution of test 1; test 2, solution of test 2; test 3, solution of test 3;
  • test 4, solution of test 4; test 5, solution of test 5; test 6, solution of test 6;
  • test 7, solution of test 7.
• Explanation of marks taken in the midterm test.
• Assignment 3 (postcript file), starter code (several files).
  A tar file of all the files needed. After downloading a3.tar, excute: tar -xvf a3.tar
  this will create a directory ``a3'' with all required files for assignment 3.
  The deadline is Monday November 22 at 5:00 PM.
  There are 2 SEPARATE submissions. The first submission should be your solution which produces statistics of the supermarket *without* coffee breaks, and the second submission should be your solution which produces statistics *with* coffee breaks implemented.
  Submit them as follows:
  submit -N a3part1 csc270h names_of_files_with_part_1_changes_only
  submit -N a3part2 csc270h names_of_files_with_all_changes
  Make sure you submit ALL the files necessary to successfully compile your solution ON THE CDF SYSTEM using 'make' as the compile command. This should at least include your .C, .h and Makefile files. Also submit any input output files you used in your analysis, and anything else you think would be helpful to the marking TAs.
  Submit a single hard copy of all your source code, and separately highlight the changes you made for part 1 and part 2 (using for example, different coloured pens).
  Submit hard copies of your reports (separated reports for each part).
  Do not forget to include your name and student number in the report.
  Questions and answers about assignment 3 (last update Nov 19).
  The material covered in tutorials about C++ (text file), and about all-pairs shortest paths.
  Solutions of assignment 3: part 1 (several files) and part 2 (several files).
  The marking scheme of assignment 3 contains a cover page, comments on part 1 and comments on part 2.
• Assignment 4 (postcript file).
  The deadline is Wednesday December 1 at 11:10 (beginning of lecture) if you submit only Problems 1 and 2.
  If you are submitting the entire assignment (4 problems including C implementations), the deadline is Wednesday December 8, 5:00 PM. The worth of the assignment is the same whichever way you prefer.
  There was a typo in Question 3 of assignment 4 corrected on Thursday November 25. The version above has this typo fixed. Of course, this affects only those students planning to submit on December the 8th. If you are in this case, print the assignment again.
  The material covered in tutorial about the knapsack problem (text file) should be useful for assignment 4.
  A message posted by Tyronne in the newsgroup of the course about Question 2.
  Solution of assignment 4 (text file).

Contact Information: