Difference between revisions of "CISC220 F2023"

Comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation. Topics include recursion, stacks, queues, lists, heaps, hash tables, search trees, sorting, and graphs.

Full: http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021

Emma Adelmann, E-mail: eadel@udel.edu, office hours: 5-6 pm on Mondays, 1-2 pm on Thursdays in Smith 102A

• 50% Labs (5% each). These are problem sets/smaller programming exercises which are assigned in lab most weeks and due by midnight the night before the next lab. All written answers must be in PDF form. Attendance at labs is expected--this is your chance to ask questions face to face and get started early on the assignment
• 10% Open-ended programming project. Subject to a few constraints, you will be free to implement and apply a data structure and/or algorithm of your choosing.
• 20% Midterm
• 20% Final (essentially a midterm for the second half of the course)

Your labs and programming projects are due by midnight of the deadline day (with a small grace period afterward). All should be submitted directly to Canvas--e-mail submissions will not be accepted. A late homework is a 0 without a valid prior excuse. To give you a little flexibility, you have 6 "late days" to use over the semester to extend the deadline by one day each without penalty. No more than two late days may be used per assignment. Late days will automatically be subtracted, but as a courtesy please notify the instructor and TA in an e-mail of your intention to use them before the deadline.

Students can discuss problems with one another in general terms, but must work independently on all assignments. This also applies to online and printed resources: you may consult them as references (as long as you cite them), but the words you turn in must be yours alone. Any quoting must be clear and appropriately cited. The University's policies on academic dishonesty are set forth in the student code of conduct here.

For the overall course grade, a preliminary absolute mark will be assigned to each student based on the percentage of the total possible points they earn according to the standard formula: A = 90-100, B = 80-90, C = 70-80, etc., with +'s and -'s given for the upper and lower third of each range, respectively. Based on the distribution of preliminary grades for all students (i.e., "the curve"), the instructor may increase these grades monotonically to calculate final grades. This means that your final grade can't be lower than your preliminary grade, and your final grade won't be higher than that of anyone who had a higher preliminary grade.

I will try to keep you informed about your standing throughout the semester. If you have any questions about grading or expectations at any time, please feel free to ask me.

Data Structures and Algorithms in C++ (4th ed.), Adam Drozdek. It is NOT at the textbook store, don't look for it there

• 4th edition: Amazon ~$35 e-book rental, ~$44 hardcover rental as of Aug. 30
• 4th edition: Publisher (Cengage) ~$35 e-book rental as of Aug. 30

Code examples from the book can be downloaded here

keeping with CDC guidelines to slow the transmission of COVID-19 and the University of Delaware’s Return to Campus Guidelines (Health and Safety Section), we will adhere to the practice of wearing face masks and cleaning your seat and desk area at the beginning of class. This means that you:

• Must wear a cloth mask that covers your nose and mouth
• Must not eat or drink in class
• Upon entering the classroom, wipe down your seat and desk area

As necessary, the University may announce modifications to these practices. In that event, these guidelines will be updated to reflect those modifications.

cplusplus.com tutorial: Basics, Program Structure, Compound Data Types

cplusplus.com tutorial: Classes I & II, Special Members

cplusplus.com tutorial: Classes II, STL reference

Register/add deadline

Post-C++ lecture notes

Withdraw deadline

Wikipedia entry, UW slides (first 5 pages of PDF)
Optional: Princeton slides

Optional: Path-finding tutorial (stop at "Heuristic search")

Optional: Sorting algorithms animated