Instructor: James R. Glenn, Ph.D.
Office: AKW 013
Office Phone: TBD
Office Hours: TBD
e-mail: [first name][dot][last name]@yale.edu
Course Coordinator: Rob Brunstad (charles.[last name]@yale.edu)
TF and ULAs: (see Piazza for hours)
- Yu Zhang (TF)
- Andre Braga
- Maya Boateng
- Max Bu
- Alex Chen
- Blaise Fangman
- Adit Gupta
- Jonathan Kraft
- Chae Young Lee
- Kelly Rudder
- Iram Sharieff
- Vaibhav Sharma
- Kevin Tang
- Matt Tu
- Bradley Yam
Class Meeting:
Lecture Tue, Thu 2:30pm – 3:45pm on Zoom
(check
Yale Course Search for updates)
Prerequisites: CPSC 201 or equivalent (see Canvas for instructions for submitting a code sample used to determine if your previous experience is equivalent)
Recommended References:
- Notes on Data Structures and Programming Techniques from Prof. Aspnes (also as a pdf)
- C in a Nutshell (2nd edition)
by Prinz and Crawford
ISBN 978-1491904756
(retail price $69.99)
- Learning the Unix Operating System (5th edition)
by Peek, Todina, and Strang
ISBN 978-0596002619
(retail price $29.99)
- Unix in a Nutshell (4th edition)
by Arnold Robbins
ISBN 978-0596100292
(retail price $44.95)
- Data Structures Using C
by A.K. Sharma
ISBN 978-8131755662
(ebook price $70.00)
Most students use the notes from Prof. Aspnes as their primary reference.
The rest are available for online reading through the Yale Library, subject to a six simultaneous user limit. You will need to use the Yale
VPN to access the e-books from an off-campus network.
Catalog Description:
Topics include programming in C; data structures
(arrays, stacks, queues, lists, trees, heaps, graphs); sorting and searching;
storage allocation and management; data abstraction; programming style;
testing and debugging; writing efficient programs.
Course Outcomes:
Students will be able to
- use, implement, and adapt standard data structures to design
efficient solutions to problems in C on Unix systems
Academic Dishonesty:
Please see Yale College's
Undergraduate Regulations and
Definitions of Plagiarism, Cheating, and Documentation of Sources.
The implications for this course; note the distinction between Programming Projects and Programming Exercises:
- Programming Projects: The code you submit must be the result of your understanding
of the problem. You may discuss concepts and approaches with other students, but you
may not take any written or electronic records from such discussions
(this includes discussions on Piazza; such discussions are electronic records
so you may not post code there).
Furthermore,
you must engage in a full hour of mind-numbing activity (such as watching back-to-back
episodes of Gilligan's Island) before resuming work. This no-record/"Gilligan's Island" rule
applies to code found in online or other published sources as well
(aside from the class notes and material listed on this page, which can be used
without attribution and without triggering the "Gilligan's Island"
rule).
Under no circumstances may you examine a copy of another student's code nor may you provide
a copy of your code to another student.
You may consult course staff for help writing and debugging without attribution and doing
so does not trigger the Gilligan's Island rule.
(The Gilligan's Island rule originated with
Stanley Eisenstat and I obtained it through Stephen Slade.)
- Programming Exercises: You may freely collaborate or use resources you
find online without applying the Gilligan's Island rule.
But you may not copy code electronically – read and
retype code instead. You must cite the sources of code you did not write.
- Exams: each student must work individually.
Grading:
- Programming Exercises: 35%
- Programming Projects: 35%
- Exams: 15% each (self-scheduled outside class time Oct. 20 and Dec. 3)
It is very unlikely that we will be able to create make-up exams. If you have a Dean's Excuse and we cannot schedule a make-up then the other exam will be reweighted to make up the difference.
Schedule (subject to change):
| Week of |
Topics |
Reading
C = C in a Nutshell,
LU = Learning the Unix Operating System,
UN = Unix in a Nutshell,
DS = Data Structures in C,
A = CPSC 223 Notes from Prof. Aspnes
|
Events
white = 223 class days; black = holidays; grey = other |
| Mon |
Tue |
Wed |
Thu |
Fri |