Lecture: TR 11:00 - 12:15 in Gore 208

Lab (20L): F 9:05 - 9:55 in Spencer Lab 010

Lab (21L): F 10:10 - 11:00 in Spencer Lab 010

Lab (22L): F 11:15 - 12:05 in Spencer Lab 010

Lecture: TR 2:00 - 3:15 in Willard Hall 116

Lab (30L): F 12:20 - 1:10 in Spencer Lab 010

Lab (31L): F 1:25 - 2:15 in Spencer Lab 010

Lab (32L): F 2:30 - 3:20 in Spencer Lab 010

We take tests at night: Sharp Lab 130 Tuesday March 15th 5-7pm and April 19th 5-7pm

Email: andynovo@udel.edu

Office Hours: MW 11:15-12 Evans 201G

Bagel Office Hours: Newark Deli and Bagel Wednesdays 12:15-1:30

Mini Hackathons Fridays 1-5pm (http://friday.prof.ninja for details )

My Notes at ds.prof.ninja/notes

Projects at ds.prof.ninja/projects

Submission Rules at ds.prof.ninja/submission.html

Homework Assignments at ds.prof.ninja/hw

Lab Assignments at ds.prof.ninja/labs

Speaker Randomizer at ds.prof.ninja/speaker

Course Grades on SAKAI

In-class survey system survey.prof.ninja

Our GitHub organization at github.com/cisc220

A huge list of data structures: https://xlinux.nist.gov/dads/

http://opendatastructures.org/ (a free data structures textbook)

**Textbook:**We are using a custom electronic/interactive zyBook for learning C++. Instructions for access:- Sign up at zyBooks.com
- Enter zyBook code
**UDelCISC220Spring2016** - Click
`Subscribe`

**Laptop**I would like students to bring a laptop regularly if possible, we will code in class. If not possible then email me and find a partner to "partner code" with. If some number of students bring a power strip then we can keep those batteries charged.**GitHub Account**Think of every project as a portfolio worthy project.**Cloud9 Account**Use your github account to register with Cloud9 IDE**Work Ethic**I am expecting 10-15 focused hours of your time every week to go towards this course. I wouldn't ask this of you without a promise of benefits (see "superpowers" below).

- C++ on your resume.
- The ability to think intelligently about managing collections of dynamic data.
- Mastery of pointers.
- Basics of complexity theory.
- Practical knowledge of the following data structures:
- Array
- Vector
- Linked List
- Stack
- Queue
- Map/Dictionary
- Set
- Priority Queue
- Hash Table
- Binary Tree
- Graph

- The ability to model real world problems as well studied (but abstract) problems.

- Two mid-term exams 15% each
- Final exam 20%
- Eleven lab assignments 1% each
- Three group projects 8% each
- Participation exercises from the book 7% (If you get 90% completion that is sufficient for all 7%)
- Four Homework Assignments 2% each

- Read Chapters 1 and 2 in ZyBook (suggested Feb 11, final chance Feb 15)
- Lab 1 in-lab Feb 12
- Read Chapters 3 and 4 in ZyBook (suggested Feb 16, final chance Feb 22)
- Read Chapters 5 and 6 in ZyBook (suggested Feb 18, final chance Feb 24)
- Lab 2 in-lab Feb 19
- Read Chapter 7 in ZyBook (suggested Feb 23, final chance Feb 29)
- Read Chapter 8 in ZyBook (suggested Feb 25, final chance Mar. 2)
- Lab 3 in-lab Feb 26
- Homework 1 due March 8th
- Project 1 due March 10th (present in class)
- Test 1 March 15th 5-7pm
- HW2 due April 5th
- Project 2 due April 14th
- HW3 due April 19th
- Test 2 April 19th