CSI 3334: Data structures, Fall 2013
Data structures and the algorithms that operate on them are the keys to making efficient software. They are also very interesting. This course will cover data structures in a way that exercises your problem-solving skills. These problem-solving skills are what you will need to be a successful programmer, scientist, engineer, or mathematician.
This course covers:
- fundamental data structures: arrays, lists, queues, stacks, heaps, trees, and graphs
- appropriateness of different data structures for different tasks
- standard algorithms to operate on data structures, including searching and sorting
- analysis of algorithms for time and space complexity
- data abstraction (separation of interface and implementation)
- C++ implementation
This is a difficult course. My recommendation is to attend lectures, study hard, start projects early, and seek help from the professor when you need it.
Lectures are from 9:30 AM to 10:45 AM in Rogers 104 on Tuesday, Thursday. You may use the general labs on the first floor of Rogers, though there is no lab component of the course.
My office is in the Rogers Engineering and Computer Science building, and office hours are listed on my home page. I am glad to talk to students during and outside of office hours. If you can't come to my office hour, please make an appointment for another time, or just stop by.
The TA for this course is Nankai Pan.
Here is a schedule of the material we will cover:
|1||Aug 26-Sep 1||Overview, C++ review||1.1-1.6||Project 0 assigned||No class|
|2||Sep 2-8||Algorithm analysis||2||Homework 0 assigned; Project 1 assigned|
|3||Sep 9-15||Algorithm analysis||Homework 1 assigned||Project 2 assigned|
|4||Sep 16-22||ADTs, lists, stacks, queues||3.1-3.3, 3.6, 3.7|
|5||Sep 23-29||Trees||4||Homework 2 assigned||Project 3 assigned|
|6||Sep 30-Oct 6||Trees|
|7||Oct 7-13||Heaps||6||Project 4 assigned|
|8||Oct 14-20||Heaps||Midterm exam||Homework 3 assigned|
|10||Oct 28-Nov 3||Hashing||Homework 4 assigned||Project 5 assigned|
|11||Nov 4-10||Sorting||7 (skip 7.4)|
|12||Nov 11-17||Sorting, Graphs||9.1-9.5|
|13||Nov 18-24||Graphs||Homework 5 assigned||Project 6 assigned|
|14||Nov 25-Dec 1||Graphs||Thanksgiving|
|15||Dec 2-8||Disjoint set, Algorithm design||8, 10||Last day of class|
The final exam will be Friday, December 13th, 9:00-11:00. The latest university finals information is available here.
Textbooks & resources
Required text: we will be using Mark Weiss' textbook Data Structures and Algorithm Analysis in C++ (3rd Edition). We are not yet using the 4th edition. An older edition might be okay, but you are responsible in case there are differences between the editions. You can purchase this book from the Baylor bookstore or amazon, among other places.
Further online resources:
- We will use Blackboard for keeping records of assignment grades.
- Project submission guidelines for this course.
- Using the command-line shell for testing in this course.
- Coding style guidelines for this course.
- Bruce Eckel, Thinking in C++ (2nd edition).
- The Standard Template Library (STL) reference.
Grades will be assigned based on this breakdown:
- midterm exam: 20%
- final exam: 25%
- projects: 30% (including 5% for milestones)
- homework: 25%
Important: Each project not completed by the end of the semester will result in a drop of one letter grade. For example, if you would have received a 'B', but you did not complete two of the projects, then your letter grade will be a 'D'.
Different projects and assignments may have different point values. In-class exams are closed-book. The final will be comprehensive.
Homework is due at the beginning of class; homework turned in after it has been collected but before the end of class will receive a 20% penalty. Homework will not be accepted after class on the due date.
Final letter grades will be assigned at the discretion of the instructor, but
here is a minimum guideline for letter grades:
A: 90-100, B+: 88-89, B: 80-87, C+: 78-79, C: 70-77, D: 60-69, F: 0-59
- This website contains the official course information. Please check it regularly for updates.
- All work in this course is strictly individual, unless the instructor explicitly states otherwise. While discussion of course material is encouraged, collaboration on assignments is not allowed. Collaboration includes (but is not limited to) discussing with anyone (other than the professor) anything that is specific to completing an assignment. You are encouraged to discuss the course material with the professor, preferably in office hours, and also by email.
- Exams may be made up with prior arrangement (made at least one class before to the exam) or due to illness, with a note from a health care professional.
- Bring any grading correction requests to your professor's attention within 2 weeks of receiving the grade or before the end of the semester, whichever comes first.
- Class should be a place you are glad to go. After all, you signed up for the class, and we get to talk about data structures! To incent you further, there will be a bonus of 3% added to the final grade for any student who has "pristine" attendance — that is, no absences (excused or unexcused), no tardies.
- In order to facilitate keeping attendance, please choose a seat that you will use for the rest of the course.
I take academic honesty very seriously. Many studies, including one by Sheilah Maramark and Mindi Barth Maline have suggested that "some students cheat because of ignorance, uncertainty, or confusion regarding what behaviors constitute dishonesty" (Maramark and Maline, Issues in Education: Academic Dishonesty Among College Students, U.S. Department of Education, Office of Research, August 1993, page 5). In an effort to reduce misunderstandings, here is a minimal list of activities that will be considered cheating in this class:
- Using a source other than the course textbook, the course website, or your professor to obtain credit for any assignment, project, or exam.
- Copying another student's work. Simply looking over someone else's source code is copying.
- Providing your work for another student to copy.
- Collaboration on any assignment, unless the work is explicitly given as collaborative work. Any discussion of an assignment or project is considered collaboration.
- Using notes or books during any exam.
- Giving another student answers during an exam.
- Reviewing a stolen copy of an exam.
- Studying tests or using assignments from previous semesters.
- Providing someone with tests or assignments from previous semesters.
- Taking an exam for someone else.
- Turning in someone else's work as your own work.
- Studying a copy of an exam prior to taking a make-up exam.
- Providing a copy of an exam to someone who is going to take a make-up exam.
- Giving test questions to students in another class.
- Reviewing previous copies of the instructor's tests without permission from the instructor.
Copyright © 2013 Greg Hamerly, with some content
taken from a syllabus by Jeff Donahoo.
Computer Science Department