University of Nevada Las Vegas
Howard R. Hughes
College of Engineering
School of Computer Science
My Home Page
Computer Science 302 (formerly CSC 269)
Introduction to Data Structures
Spring 2006
Revised January 31, 2006.
-
Instructor:
-
Dr. Larmore
- Office, TBE B378B.
Telephone ☎ 702-895-1096,
larmore@cs.unlv.edu
- Office Hours:
- 10:00 -- 11:00 Tuesdays and Thursdays.
- 7:15 -- 8:15 Tuesdays and Thursdays.
- 1:00 -- 2:00 Tuesdays and Thursdays.
-
Contacting Me:
- It's best to send me email at
larmore@cs.unlv.edu. Be sure to write "CS302" in the subject field
so that I know what the message is about. (I delete lots of messages
without reading them, based on the subject fields.)
-
You may also telephone my office and leave a message.
-
Please, never try to communicate with me by leaving notes on my
door, under my door, or in my mailbox in the department office, as
those notes get lost, and I can't retrieve them remotely.
-
Assistant:
Our graduate assistant is
Premalatha Reguraman.
She will hold office hours Wednesdays, 10:30 -- 11:30, in TBE B361.
-
-
Days of Instruction:
- January 17, 2006 - March 9, 2006.
- March 21, 2006 - May 4, 2006.
-
Time of Instruction:
- 8:30 - 9:45,
Tuesday and Thursday.
-
Place of Instruction:
- TBE B172.
-
Final Examination:
- Thursday, May 11, 8:00 AM.
-
Textbook:
-
Data Structures and Algorithm Analysis in C++
Third Edition
by Mark Allen Weiss
-
- Prerequisites:
-
CSC 202 (Computer Science II)
-
MAT 181 (Elementary Calculus I)
- Anyone who has not taken all
prerequisites and earned a grade of "C" or better in each must see
me immediately. I will not hesitate to administratively drop a
student who lacks the prerequisites, as unprepared students slow down
the class. I will be happy to sign a prerequisite waiver form if
you have actually taken the prerequisites but the registration system
doesn't know this, such as if you took them at another institution.
If you come to see me about this, please bring unofficial copies of
your transcripts from that other institution.
CSC 302 relies heavily on the material of CSC 135 and CSC 136.
CSC 302 is a prerequisite for many CSC courses. If you are a CSC
major, you realize that this is the "gateway" course to the upper
division.
There will be programming assignments, quizzes, midterms, and a final
examination. It would be wise for you to take MAT 351 at the same
time as CS 302, since both courses are prerequisites for CS 456 and CS 477.
All non-programming assignments must be hand-written by your own hand,
not typed or printed from a computer file. You may staple or paperclip
the pages together, but that is optional. Be sure to write your name
on each page.
All programming assignments must be
submitted electronically.
Submit them to the
graduate assistant
on or before the due date. In some cases, a programming assignment
consists of several files, to be mailed separately.
All programming assignments must be done in C++, using the College of
Engineering computer system. You may "practice" using other computers,
but the "official" version you turn in must work on our system.
Since there are many versions of C++, it is possible that what you do
at home will not be compatible, and it is your responsibility to check this.
All CSC 302 students must have a computer account on the College
of Engineering system.
If you do not already have an Engineering
computer account, one will be assigned to you. This assignment is automatic
if you are registered for this course, unless your registration was
too late for the College system to have noticed you.
The subject matter of this course is not C++ programming per se. What
you learn here will be valid throughout your programming lifetime,
regardless of future languages and computers.
If you do not know how to use data structures, you cannot be an excellent
programmer, no matter how many years of practical experience you have.
The experience of learning of data structures and how to use them
is like the experience of a person who did not know he was visually
impaired getting glasses for the first time.
Here is a quiz. Think of the answer, then click.
-
What's good about bubblesort?
Answer
-
When used in a program, a stack is always used to
store Answer
-
True or false: "Computers are so fast and
memory is so plentiful
nowadays that consideration of
time and space efficiency is less important than before."
Answer
-
"Divide and Conquer"
was used by Kublai Khan to take over China during the Thirteenth Century.
Answer
Homework assignments