Dana Vrajitoru
Office Hours
C243/A594 Data Structures
| Week
| Homework assignments
| Topics
| Reading assignments
| Tests
|
| 12.
| Homework 12
| Graph Theory
| Notes, Chapter 11
| Final: Wednesday, December 18
|
| 11.
| Homework 11
| Graph Theory
| Notes, Chapter 11
|
|
| 10.
| Homework 10
| Red-Black Trees, General Trees, Sorting
| Notes, Chapters 9, 6, 10
|
|
| 9.
| Homework 9
| Binary Search Trees, AVL, Red-Black
| Notes, Chapters 8, 9
|
|
| 8.
| Homework 8
| Binary Trees, Binary Search Trees
| Notes, Chapters 7, 8
|
|
| 7.
| Homework 7
| Binary Trees
| Notes, Chapter 7
|
|
| 6.
| Homework 6
| Tables, Hash Tables
| Notes, Chapters 4, 5
| Midterm: Wednesday, October 9
Covers everything up to (incl) alg. complexity
|
| 5.
| Homework 5
| Complexity of an Algorithm, Tables
| Notes, Chapters 3 and 4
|
|
| 4.
| Homework 4
| Complexity of an Algorithm
| Notes, Chapters 3
|
|
| 3.
| Homework 3
| Stacks and Queues
| Notes, Chapters 1 and 2
|
| 2.
| Homework 2
| Linked Lists
| Notes, Chapter 0.5
|
| 1.
| Homework 1
| Introduction, C201 review
| Notes, Chapter 0
|
Fall 2019 schedule: MW 10:00 - 11:50 am NS 223.
Prerequisite: C201 Computer Programming II, C151 Multi-user
Operating Systems (co-requisite).
Textbook: A set of class notes for this course written by
Dr. D. Vrajitoru will be available as a PDF file on Canvas as the
main resource. Do not print this file in the Linux labs.
Data Structures and Algorithm in C++, by M. Goodrich,
R. Tamassia, and D. Mount, used as a reference.
Grading system:
- About 12 homework assignments : 20 points each
- Midterm exam : 50 points
- Final exam : 50 points
- Class participation : up to 30 points
- Achievements : up to 12 points (extra credit)
Guidelines for assignments:
- The assignments will be posted on the course web page and on
Canvas (iu.instructure.com).
- The assignments are due at midnight of the due date.
- The programming assignments are turned in on Canvas.
- No homework accepted after 1 week from the due date. A late
homework loses 10% of the points per day, up to 50% of the points.
- The programs in this class must follow the rules described in
this guideline.
- Class participation items are not announced beforehand; there is
no make up for them.
- Attendance is expected.
- All the assignments are individual. Consulting with colleagues is
acceptable, but programs that are too similar can be penalized or
rejected. No credit will be given for programs obtained from external
sources unless explicitly allowed.
- See separate guideline for the achievements.
Programming environment:
- OS: Linux, labs NS 207 and NS 209. Access based on student ID card.
- Compiler: g++. An example of Makefile.
- Editor: any text editor, emacs (recommended), gedit, pico or vi
from telnet.
Last updated: Fall 2019.
d v r a j i t o a t i u s b d o t e d u.