Department of Mathematics and Computer Science
University of Miami
MTH517 - Data Structures and Algorithms
Spring Semester 2000
Description
- Static data structures: arrays, stacks, queues.
- Dynamic data structures: linked lists, stacks, queues, sparse matrices,
trees, sets, graphs.
- Sorting and searching: sorting algorithms, hashing.
- Algorithms for manipulating data structures.
- Analysis of algorithms for manipulating data structures.
- Object oriented implementation of data structures and algorithms.
Learning Objectives
- Understand and analyse commonly used internal and external data
structures.
- Be able to implement these data structures using an object oriented
programming language;
- Appreciate time and space efficiency issues in selecting data structures
and appropriate algorithms for common tasks such as sorting and searching.
Preparation
MTH517 has the pre-requisites:
Students who have not successfully completed these courses must tell
the instructor.
There are also some
exercises to help you check your prerequisite knowledge.
Instructor
Dr Geoff Sutcliffe.
Contact details are on the WWW at
http://www.cs.miami.edu/~geoff.
The WWW page gives office hours when students are welcome, and
students are encouraged to ask questions by email at all times.
Teaching Assistant
Mr Jorge Escorcia
Contact details are on the WWW at
http://www.cs.miami.edu/~escorcia.
Contact Hours
Each week there are two 75 minute lectures.
- Monday 3:00-4:15pm in MM101
- Wednesday 3:00-4:15pm in MM101
Each week there will be optional 2 hour lab sessions, in which you can
receive help with lab tasks and assignments:
- Monday 4:30-6:30pm in the Indy lab (CC426)
- Tuesday 4:30-6:15pm in the Indy lab (CC426)
Students are required to read their email regularly, and to
consult the subject WWW page regularly.
Resource materials
You are strongly advised to buy the textbook:
A useful reference book is:
A decent book on C++ programming is:
Lecture slides,
exercises,
laboratory tasks,
and
assignments
will be available on the WWW.
Assessment
| 15%
| Data Structure Assignment (due 6:15pm 28th March)
|
| 10%
| Algorithm Assignment
|
| 15%
| Laboratory Tasks
|
| 10%
| Midterm Test (8th March 3:00-4:15pm)
|
| 50%
| Final Exam (10th May, 2:00-4:30pm)
|
In order to obtain a particular grade, you may be required to attain
that grade in all items of assessment.
Assignments will be placed on the WWW.
The submission requirements for each assignment will be given with each
assignment.
Late submissions will not be accepted.
Extensions of the due date will be granted if supporting documentary
evidence is supplied (e.g., a doctors certificate).
Application for an extension must be made to the instructor before
the due date (if possible).
Assessment items must be completed individually.
While general interaction between students is encouraged, plagiarism
is considered to be a serious offence. It is ok to talk to other
students about general solution techniques for assignments,
but it is not ok to copy solutions in part or as a whole.
Plagiarism will result in a loss of marks for all guilty students
involved.
Laboratory tasks are to be done before or during your lab session in the
week indicated in the lab tasks table.
The percentage value of each lab task is indicated with the task, and your
work will be assessed during during your lab session.
The total of your marks, upto a maximum of 15%, contributes to your
overall assessment.