CS 216: Program and Data Representation
Fall 2005

Course Outline and Schedule

Labs

Gradebook

Mailing List Archive


News!
Dec. 10
Final Exam info (below in exams section and also here)

Instructor:  Tom Horton, Olsson Hall 228B, horton@cs.virginia.edu
Office Hours: Mon./Weds. 11am-noon, Tue./Thur.1:30pm-2:30pm, and by appointment
Graduate TAs: Nishit Tewari, Tenghui Zhu
Undergraduate TAs: Erika Chen, Erin Golub, Sam Guarnieri
Lab Meeting Times: Section 1: Tue, 7:30-9:15 pm. Section 2: Tue, 12:15-2 pm
TA Office Hours: (In the Thornton Stacks - Thornton A-Wing, 2nd Floor. Look for "CS216" sign on computer. Pictures of TA's below.)
Thursday: 6:15-8:15 pm (Erin)
Sunday: 8-10pm (Tenghui)
Monday: 7-9pm (Nishit)

Nishit Tewari
(Head TA, Both labs,
Office Hrs. Monday 7-9 pm)

Tenghui Zhu
(Tue. night lab, Office Hrs Sunday 8-10 pm)

Erika Chin
(Both labs)

Erin Golub
(Tue. night lab, Office Hrs. Thur. 6:15-8:15, Mon 7-9)

Sam Guarnieri
(Both labs)

Course Description: Introduction to program and data representation at the machine level. Data structuring techniques and the representation of data structures during program execution. Operations and control structures and their representation during program execution. Representations of numbers, arithmetic operations, arrays, records, recursion, hashing, stacks, queues, trees, graphs, and related concepts. [ABET Course Objectives]

Prerequisites: CS201 (Software Development Methods) and CS202 (Discrete Math) with grades of C- or above.

Course Text: Weiss, Mark Allen. Data Structures and Algorithm Analysis in C++. Addison Wesley: 1999, second edition.
Textbook errata  and Source code from Textbook

Recommended course text: Weiss, Mark Allen.  C++ for Java Programmers. Prentice Hall: 2003, ISBN: 0-13-919424-X.
Textbook errata  and Source code from Textbook

Class Meetings: Monday and Wednesday: 10:00-10:50am in MEC 341
Lab Meetings: In Olsson 001. Section 1 is Tuesday, 7:30-9:15 pm. Section 2 is Tuesday, 12:15-2:00 pm.

Final Exam: Tuesday, Dec. 13, 2005 9:00am - 12:00pm in our regular lecture room.

Class Attendance: Class attendance is mandatory.

Grading and Evaluation: Grades will be computed approximately as follows (weights may be modified):

Help and Pledge Policy


C++ Help and Lab Guidelines:

C++ for Java Programmers Slides from 8-29-05

Slides on Pointers and Dynamic Objects from 8-31-05

Creating Projects in VS .NET 2003

CS201 F03 Help links

CS216 Style Guide For more detailed formatting suggestions please refer to the CS201 C++ Style Guide


Lecture Notes & Resources:

Graphs: Slides from 11/30, Slides from 12/5

Huffman CodingSlides from 11/16 and 11/28

Priority Queues, Heaps (not on Exam 2!): Slides from 11/9 and 11/14 .

Memory Hierarchy (not on Exam 2!): Slides from 11/7.

IBCM, x86 Assembly, etc.

Trees, Hashing, Etc.

Number Representation Etc.

C++ Programming Etc.


Exams & Solutions:


Grade Information:

Grades will be maintained on the toolkit.  Be sure to check your grades regularly to ensure they were entered correctly.

Re-grade Policy

Late Policy


Anonymous Feedback


TA Resources (password-protected)