CS 14 SPRING 2002
Instructors: Kelsey Lick Deganit Armon
Office: Bourns
A375 Bourns A375
Phone: 787-6437 787-6437
Email: klick@cs.ucr.edu deganit@cs.ucr.edu
Office
Hours: TR 12:30 - 2:00 p.m W
11:00 – 1:00 p.m.
Lecture: TR
2:10 - 3:30 p.m., BOURNS A125 (Sec 1)
TR
3:40 - 5:00 p.m., BOURNS A125 (Sec 2)
Midterm: Thursday,
May 2nd (scantron & pencil needed)
Final: You
must show up to the final scheduled for the lecture section you are enrolled
in.
Wednesday, June 12, 3:00 –
6:00pm, BOURNS A125 (Sec 1) (scantron & pencil needed)
Thursday,
June 13, 3:00- 6:00pm, BOURNS A125 (Sec 2) (scantron & pencil needed)
Book: Data Abstraction and Problem Solving with C++
by Frank Carrano and Janet Prichard
Course
Web Page: http://www.cs.ucr.edu/~klick
Written Assignments 15%
Programs 40%
Quizzes 8%
Midterm 15%
Final 22%
Important topics will be covered each week in lab
that will help with your programming.
Quizzes will also be periodically given over topics you need to know and
that were covered in labs.
You will have periodic written assignments that will
be due in class. No late assignments
will be accepted.
You will have programming assignments to be done on
your own time throughout the quarter.
No late programming assignments will be accepted. Partial credit will be given. Programs that do not compile will only be
given up to half credit. If you have a
problem with getting an assignment in on time, you must take care of this prior
to the due date. Programming
assignments will be turned in electronically.
Programs will be graded based on correctness as well
as commenting, style, and readability.
You should include your name and login at the top of every file you
write.
Any questions or problems regarding the grading will need to be addressed within one week after the assignment has been given back to you. Please take responsibility for your grade so there will not be any problems. Your grades will be available for you to verify on the course web page.
Every student will start the
quarter with 20 bonus points. These points
account for the fact that throughout the quarter you probably should receive a
point or two more than you did on some of your assignments or homeworks (every
effort is made for good, consistent grading but can be difficult for a class of
this size). The first time you come to
beg for more points on an assignment, your homework or assignment will be
evaluated as to whether your grade needs adjusting, but these points will be
lost.
1.
Big
O Notation
2.
Lists
3.
Stacks
and Queues
4.
Hash
Tables
5.
Trees
6.
Heaps
7.
Sorting
Algorithms