Comp 410-001: Data Structures

MEETING TIMES AND PLACE: MW 9:05 - 10:20. SN 014

INSTRUCTOR: Sanjoy Baruah. (Click here for instructor's office hours, which are held at FB 134)

Teaching Assistants:

TEXT: There is one required text for this course:

Mark Alan Weiss. Data Structures and Algorithm Analysis in Java, Third Edition. Pearson.
The UNC Undergraduate Bulletin description of this course is
COMP 410 Data Structures (3). The analysis of data structures and their associated algorithms. Abstract data types, lists, stacks, queues, trees, and graphs. Sorting, searching, hashing.

SYLLABUS: Here is the syllabus (latest update: Jan 3) for this offering of COMP 410-001.


SPECIAL NEEDS: If you are entitled to extra accommodation for any reason (such as a disability), we make every reasonable attempt to accommodate you. However, it is your responsibility to discuss this with the instructor during the first week of the course.

DISCUSSION FORUM: We will use Piazza to supplement classroom discussion - you will find our class page here. I encourage you to post your questions on Piazza and participate in discussions there. The instructor and TAs will monitor these discussions (and occasionally participate, though the idea is to primarily use it as a forum for students to hold active discussions and help one another.)

TOPICS COVERED: Lecture outlines and handouts are made available here (you may need a UNC Computer Science login ID to access this site; you can get yours here if you do not already have one.)