C S 2413 – Data
Structures
Fall 2000
![]()
Instructor
|
Dr.
Sridhar Radhakrishnan
|
|
||
|
Office Hours |
9:00
AM to 11:00 AM (Monday and Wednesday) |
|
||
|
Course Timings |
1:30
PM to 2:45 PM (Monday and Wednesday)§ |
|
||
|
Course Location |
A235
(Sarkeys Energy Center) |
|
||
|
Course Prerequisite |
CS
1333 (Programming Structures and Abstractions) |
|
||
|
Course Material |
Data Structures
Featuring C++, S.
Radhakrishnan, Lee Wise, and Chandra N. Sekharan, 2000. Computer
Ethics, Second
Edition, Deborah G. Johnson |
|
||
|
Course Requirements |
1.
Students will be required to take two exams and a final. There will be no makeup exams except in
cases of emergencies. Failure to take
the final exam will result in an automatic F as the overall course grade. 2.
There will be set of programming projects that has to be written in
C++. 3.
There will be six quizzes. |
|
||
|
Course Grading |
The
course letter grade will be assigned based on the overall percentage: 90-100 (A),
80-89 (B), 70-79 (C), 60-69 (D), and < 60 (F). The allocation of percentages is given below: |
|
||
|
|
Percentages
|
|
||
Exam 1
|
15% |
|
||
|
Exam
2 |
15% |
|
||
|
Final |
20% |
|
||
|
Prog.
Projects |
38% |
|
||
|
Quizzes |
12% |
|
||
|
Special Note on Recorded
Lectures |
Lectures
have been recorded on CDs that will be distributed throughout the semester to
students who are registered in the class.
If alternate delivery mechanism such as streaming video or fast file
transfer is made available, then the distribution will make use of them
instead of CDs. Students are
required to listen to the lectures on the recorded CDs. |
|||
Project
One – Due September 8, 12:01 AM
Program
to Perform Multiplication
Project Two
– Due September 22, 12:01 AM
Project
Three – Due October 15, 12:01 AM
Project Four
– Due November 8, 12:01 AM
GeneralizedList.cpp – Make sure
this works!!
Project
Five – Due December 9, 12:01 AM
1.
You
will be provided with a sample input for each of the projects and you should
submit a script file before the
beginning of
the class period on which it is due.
2.
You
will also use the submit facility to submit the source program.
3.
After
you have generated the script file, you should place all your source code in a
directory named Completed.
The last
modified date on your source programs should be no later than the deadline date
and time.
4.
For
every 24 hours late, you will be deducted 10% of the grade of the programming
project.
Any project
that is more than 5 days late will not be evaluated.
5.
A
programming project that does not meet the specifications will receive an
automatic deduction 50% of the grade.
6.
You
are better of submitting a working project on the fifth day rather than the one
that does not on the day it is due.
7.
Programs
have to be documented clearly. Programs
that lack or weak in documentation will receive a deduction
of up to 30% of
the grade. Follow the documentation methods
that were used in programs presented in your data structures book.
8.
You
will demo your project to the grader during the grader assigned special office
hours if the grader so wishes.
Graders are not responsible
for debugging your programs.
9.
If
you are using Visual C++ or Borland C++ it is your responsibility to bring your
machine with the required compiler
to demonstrate the program.
10.
The
specification for the projects presented by the instructor may not contain all
the details of implementation.
It is your responsibility to
understand the specifications thoroughly.
11.
Copying
programs or consulting others for coding is strictly prohibited.
12.
Apart
from the above general policies for evaluating, each programming project will
also have a set of specifications that should be met.
It is advised that students attend all lectures.
Please advice your instructor of any of your special needs if you are an individual with a disability.
Tentative Course Schedule
|
August 21, 2000 |
Introductions; Appendix
(C++ Features) |
|
August 23, 2000 |
Appendix (C++ Features) |
|
August 28, 2000 |
Appendix (C++ Features)
and Chapter 1 Introduction (Object-Oriented Programming); Project 1 Assigned |
|
August 30, 2000 |
Chapter 1 Introduction
(Object-Oriented Programming); Quiz 1 |
|
September 4, 2000 |
Labor Day Holiday |
|
September 6, 2000 |
Chapter 2 Algorithms and
Recursion; Project 1 Due; Project 2 Assigned |
|
September 11, 2000 |
Chapter 2 Algorithms and Recursion
and Chapter 3 Arrays, Strings, and Vectors |
|
September 13, 2000 |
Chapter 3 Arrays, Strings,
and Vectors; Quiz 2 |
|
September 18, 2000 |
Chapter 3 Arrays, Strings,
and Vectors; Project 2 Due; Project 3 Assigned |
|
September 20, 2000 |
Chapter 4 Linked Lists |
|
September 25, 2000 |
Chapter 4 Linked Lists; Project 3 Due |
|
September 27, 2000 |
Chapter 4 Linked Lists; Project 4 Assigned; Quiz 3 |
|
October 2, 2000 |
Exam I |
|
October 4, 2000 |
Chapter 5 Stacks and
Queues |
|
October 9, 2000 |
Chapter 5 Stacks and
Queues |
|
October 11, 2000 |
Chapter 5 Stacks and
Queues |
|
October 16, 2000 |
Chapter 6 Sorting; Project 4 Due; Project
5 Assigned; |
|
October 18, 2000 |
Chapter 6 Sorting; Quiz 4 |
|
October 23, 2000 |
Chapter 7 Binary Search
Trees |
|
October 25, 2000 |
Chapter 7 Binary Search
Trees |
|
October 30, 2000 |
Chapter 7 Binary Search
Trees; Priority Search Trees |
|
November 1, 2000 |
Chapter 8 Priority Search
Trees; Project 5 Due; Project 6 Assigned |
|
November 6, 2000 |
Chapter 8 Priority Search
Trees |
|
November 8, 2000 |
Quiz 5; Chapter 8 Priority
Search Trees |
|
November 13, 2000 |
Exam II |
|
November 15, 2000 |
Chapter 9 Self Adjusting
Trees |
|
November 20, 2000 |
Chapter 9 Self Adjusting
Trees; Project 6 Due; Project 7 Assigned |
|
November 22, 2000 |
Thanksgiving Vacation |
|
November 27, 2000 |
Chapter 9 Self Adjusting
Trees; Chapter 10 Graphs |
|
November 29, 2000 |
Chapter 10 Graphs; Quiz
6 |
|
December 4, 2000 |
Chapter 10 Graphs |
|
December 6, 2000 |
Last Class; Final Review; Project 7 Due |
|
December 14, 2000 |
Final
Examination; 8:00 AM to 10:00 AM (Thursday) |