CS 302 Introduction to Data Structures
The pages for this course are now ready. The syllabus is subject to change.
If you do not have an account in the lab yet:
Here is the
For assignment 1:
Complex numbers explained.
for assignment 1.
Seiden's Theoretical Computer Science Cheat Sheet.
Current Reading: 1.4 - 1.7 in the 45 page handout, Chapter 2.
Here are the office hours of our TA, Ms.Shradha Kapoor, email@example.com:
Monday 1:00 pm - 2:00 pm
Tuesday 10:00am - 11:00 am
Wednesday 4:00 pm - 5:00 pm
The office hours will be held in lab TBE B346.
As announced in class today only <(Monday, January 28) Mr. Kaushik Deshmukh, will substitute
for Ms. Kapoor in lab TBE B 361.
Here is the Big-Oh Slide.
Reading is 3.5 and 3.6, see 45 page handout , the code is here list_class.cxx
How to generate random numbers.
This is how to print the list:
for(ni=the_List.begin(); ni!=the_List.end(); ni++)
cout << *ni << " ";
For assignment 3, here is how to measure the run of your program:
You need to use the command time.
The syntax for using time is
The output for time will have three lines like these.
Use is the one called `user'. (55.24 in the example below.)
The other ones (real, sys) take operating system overhead
Here is the Master Theorem.
Current Reading: Chapter 3.
Exam 1 will be on Friday, March 1.