Wolf Bein

CS 302 Introduction to Data Structures


ANNOUNCEMENTS




Posted 01-17-19:
The pages for this course are now ready. The syllabus is subject to change.


Posted 01-17-19:
If you do not have an account in the lab yet: Here is the account application.


Posted 01-17-19:
For assignment 1: Complex numbers explained. Also, headers, output, and code snippets for assignment 1.


Posted 01-17-19:
Seiden's Theoretical Computer Science Cheat Sheet.


Posted 01-17-19:
Current Reading: 1.4 - 1.7 in the 45 page handout, Chapter 2.



Posted 01-28-19:
Here are the office hours of our TA, Ms.Shradha Kapoor, kapoos1@unlv.nevada.edu:
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.


Posted 01-31-19:
Here is the Big-Oh Slide.


Posted 01-31-19:
Linked Lists: Reading is 3.5 and 3.6, see 45 page handout , the code is here list_class.cxx
How to generate random numbers.


Posted 02-07-19:
This is how to print the list:
for(ni=the_List.begin(); ni!=the_List.end(); ni++) { cout << *ni << " "; }


Posted 02-07-19:

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
time ./a.out
The output for time will have three lines like these.
real 59.95
user 55.24
sys 0.09
Use is the one called `user'. (55.24 in the example below.)
The other ones (real, sys) take operating system overhead
into account.



Posted 02-07-19:
Here is the Master Theorem.


Posted 02-07-19:
Current Reading: Chapter 3.


Posted 02-14-19:
Exam 1 will be on Friday, March 1.