View source for CISC220 F2023

==Course information==
{| class="wikitable" border="0" cellpadding="5" 
!width="5%"|
!width="95%"|
|-
|valign="top"|'''Description'''
|CISC 220 -- Data Structures (Honors)<br>
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.
|-
|valign="top"|'''Requirements'''
|This is a course for undergraduates who have obstained a grade of C- or better in CISC 181, and have taken or are currently taking CISC 210 and MATH 241.  
|-
|valign="top"|'''Instructor'''
|Christopher Rasmussen<br>E-mail: cer@cis.udel.edu<br>Office: Smith 446<br>Office hours: Wednesdays, 2:30-4:30 pm 
|-
|valign="top"|'''URL'''
|
Full: http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021<br>
|-
|valign="top"|'''TA'''
|
Emma Adelmann, E-mail: eadel@udel.edu, office hours: 5-6 pm on Mondays, 1-2 pm on Thursdays in Smith 102A
|-
|valign="top"|'''Schedule'''
|Lectures are Tuesdays and Thursdays 9:30 am to 10:45 am in [https://css-rdms1.win.udel.edu/maps/?find=NE67 ISE 305], all labs are Wednesdays 4:40 pm to 5:30 pm in [https://css-rdms1.win.udel.edu/maps/?find=NW34 Smith 040] (basement).  In the schedule below note that there is NOT a lab every week
|-
|valign="top"|'''Grading'''
|
* 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 [http://www.udel.edu/canvas 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 [https://www1.udel.edu/stuguide/21-22/code.html 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.

|-
|valign="top"|'''Textbook'''
|
''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: [http://www.amazon.com/Data-Structures-Algorithms-Adam-Drozdek/dp/1133608426/ref=dp_ob_title_bk Amazon] ~$35 e-book rental, ~$44 hardcover rental as of Aug. 30
* 4th edition: [http://www.cengagebrain.com/shop/ISBN/9781133608424?cid=APL1 Publisher (Cengage)]  ~$35 e-book rental as of Aug. 30

Code examples from the book can be downloaded [http://www.cengage.com/cgi-wadsworth/course_products_wp.pl?fid=M63&product_isbn_issn=9781133608424&chapter_number=0&resource_id=21&altname=Student%20Data%20Files%20and%20Source%20Code here]

|-
|valign="top"|'''University Covid policy'''
|Student learning can only occur when students and their instructors feel safe, respected, and supported by each other. To ensure that our learning environment is as safe as possible, and in
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.
<!--
|-
|valign="top"|'''Set-up instructions'''
|All example code and template code for this course has been developed and tested on a Linux system.  To do labs and programming projects, you should have access to one as well for coding, compiling, and debugging.  Options:

* Access UD compute machines remotely.  [https://www.eecis.udel.edu/wiki/ececis-docs/index.php/FAQ/RemoteAccess hoek.eecis.udel.edu] runs Linux and [http://www.udel.edu/it/help/unix/using.html strauss.udel.edu] runs SunOS.  The latter typically requires some Makefile path changes. 
* A very basic option for playing around, which is not enough for homeworks, is an [http://cpp.sh/ online C++ shell].  Try it!
* Run Linux on your own Windows/MacOS laptop/desktop.  I recommend [http://www.ubuntu.com/desktop Ubuntu desktop] (version 12.04 or 14.04).  If you don't have a Linux distribution already, there are 3 standard approaches:
** Install Linux to a DVD or USB stick and run it "live" by booting your machine from it (details in [http://www.ubuntu.com/download/desktop Ubuntu install instructions]).  This may require fiddling with your BIOS boot order settings, but it offers the advantages of (a) not changing your hard drive at all, and (b) theoretically you can walk up to any machine and run Linux on it.  Unfortunately the Spencer 010 machines will not boot from the USB port without an admin password, but a DVD should work.
** Add a boot-time Linux option (aka "dual-booting").  This is pretty easy and built into the Ubuntu installer (again, see [http://www.ubuntu.com/download/desktop Ubuntu install instructions]).  Usually I make a USB stick first to test that everything works on my machine (trackpad/mouse buttons, wifi, graphics drivers, and power button/lid closing are the most common issues with laptops), and then inside Ubuntu there is an option to install it to the hard drive permanently.
** Create a ''virtual machine'', which lets you run Linux from within Windows or MacOS without rebooting.  Performance is generally slower than the above options, but for CISC 220 it should be entirely acceptable.  Here are two free options:
*** [http://www.virtualbox.org VirtualBox].  I found [http://www.psychocats.net/ubuntu/virtualbox these] instructions helpful when setting up VirtualBox for Ubuntu.  If you have VirtualBox with Ubuntu left over from CPEG 202, I recommend doing a fresh install -- several students had problems trying to reuse this installation.  If you are having trouble with low screen resolution, try [http://askubuntu.com/questions/452108/cannot-change-screen-size-from-640x480-after-14-04-installation-on-virtualbox-os this fix]
*** [https://udeploy.udel.edu/Research/Win/VMware/index.html VMWare], an alternative if/when VirtualBox doesn't work for you

After Ubuntu is installed, you need to make sure there's a C++ compiler and a text editor or integrated development environment (IDE) as well:
* In Ubuntu, ''apt-get install g++'' will install the compiler and related basic libraries
* [https://help.gnome.org/users/gedit/stable/ gedit] is Ubuntu's built-in text editor and is what will open if you double-click a code file in the file explorer.  It has syntax highlighting and should work just fine.  
* [http://www.xemacs.org/ xemacs] is my old-school text editor of choice.  It has mouse-and-menu options like gedit, but also keyboard shortcuts to speed things up.  ''apt-get install xemacs21'' to get it, and untar [http://nameless.cis.udel.edu/class_data/cg/xemacs_colors.tar this] in your home directory to get one flavor of syntax highlighting.  Here's a [http://www.xemacs.org/Documentation/21.5/html/new-users-guide.html getting started guide]
* [http://www.codeblocks.org/ Code::Blocks] and [http://www.eclipse.org/cdt/ Eclipse] are cross-platform, full-featured IDEs for C++ and [http://www.geany.org/ geany] is an Ubuntu coding-oriented text editor with IDE features.  I will not explain how to install or use them beyond what is written below, but feel free to try them if just a bare-bones text editor doesn't do it for you.
** Code::Blocks: Make a new C++ project of type "Console Application" and follow the wizard instructions to name it, choose a directory, etc.  Once it's created, put the CISC220-supplied main.cpp and any .txt files into the project directory, overwriting the Code::Blocks-created main.cpp.  To compile, choose "Build and run" from the "Build" menu.  If the program expects command-line input (like the name of a file to read), go to the Project / Set Programs' Arguments menu and type the filename or whatever into the Program Arguments text box.

Further links for help in Unix:
* To invoke the ''terminal'' (aka command line) in Ubuntu, click on the Ubuntu icon in the upper-left of the start bar to bring up the "dashboard".  Type "terminal" in the search box and an icon for the terminal app will appear.  Click this, or you can drag it to the start bar so it's always there.  Once you are in the terminal, here is a [https://help.ubuntu.com/community/UsingTheTerminal tutorial on commands], but the key ones are:
** ''ls'': List directory contents.  This tells you what files and subdirectories are in the current directory.
** ''cd'': Change directory.  This is how you move around between directories/folders.  ''cd'' all by itself takes you back to your home directory, ''cd <name of subdirectory>'' takes you down to a subdirectory of the one you're in, and ''cd ..'' takes you up to the next higher-level directory.
* tar/untar
** General instructions [https://help.ubuntu.com/community/FileCompression here].  You can do both operations from the file explorer: right-click on a tar file and choose "Extract Here", or right-click on a directory and choose "Compress".
** To untar a file named ''foo.tar'' from the command line: ''tar -xvf foo.tar'' while you are in the same directory as foo.tar
** To tar a directory named ''foo'' into a a tarfile named ''foo.tar'': ''tar -cvf foo.tar foo'' while you are at the directory level ''ABOVE'' foo.
-->
<!--|-
|valign="top"|'''Discussion/questions'''
|We will be using [https://piazza.com/ Piazza] as a forum for questions about labs, homeworks, exams, and any other course topic.  Rather than sending e-mail to a TA or the professor, post your question there so that everyone else can see the answer, and other students can contribute their knowledge.  
* To enroll: http://piazza.com/udel/fall2014/cisc220 
* After you enroll: http://piazza.com/udel/fall2014/cisc220/home 
-->
<!--
|-
|valign="top"|'''UD Capture'''
|Capture of lectures started on Sep. 18.  Links to the recordings for each section are here (login required):
* [http://udcapture.udel.edu/2014f/cisc220-010/ 010 (9:30 am lecture)]
* [http://udcapture.udel.edu/2014f/cisc220-011/ 011 (11 am lecture)]
-->	
|}

==Schedule==

''Note'': The blue squares in the "#" column below indicate Tuesdays.  Tan rows are lab days (Wednesdays).  All lectures (except YouTube posts) should be available on UDCapture
<br>
[https://www1.udel.edu/registrar/cal/calendars/2023-2024.pdf 2023-2024 UD academic calendar]
<br><br>

{| class="wikitable" style="text-align: center" border="1" cellpadding="5" 
!width="2%"|# 
!width="10%"|Date
!width="22%"|Topic 
!width="15%"|Notes
!width="32%"|Readings
!width="15%"|Links 
|-
|style="background:rgb(102, 204, 255)"|1
|Aug. 29
|Introduction 
|Big four topics on data structures and algorithms: abstraction, implementation, analysis, and applications
|Drozdek 1.1-1.3<br>
|<!--[http://nameless.cis.udel.edu/class_data/220_f2014/code/cplusplus_1.tar singledyn, multidyn, wordbyword, mutatefile]-->
|-
|2
|Aug. 31
|C++ review 
|C++ basics: differences with C, arrays, I/O, random numbers, new/delete, static vs. dynamic memory allocation
|[https://www.softwaretestinghelp.com/c-vs-cpp/ C vs. C++]<br>C++ for Java programmers cheat sheets: [http://www.horstmann.com/ccj2/ccjapp3.html], [http://www.cprogramming.com/java/c-and-c++-for-java-programmers.html]<br>
[http://www.cplusplus.com/doc/tutorial/ cplusplus.com tutorial: Basics, Program Structure, Compound Data Types]
|<!--[http://nameless.cis.udel.edu/class_data/220_f2014/code/cplusplus_2.tar intcell, intcellarray, big3]<br>-->
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Aug. 31/Sep. 1
|style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Lab1 LAB #1] 
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|style="background:rgb(102, 204, 255)"|3
|Sep. 5
|C++ review
|ADTs, classes, destructors, constructors, assignments
|Drozdek 1.4 (skip 1.4.5)<br>
[http://www.cplusplus.com/doc/tutorial/ cplusplus.com tutorial: Classes I & II, Special Members]
|[https://drive.google.com/file/d/1Yih9IhBmdcSlQo8PweUANbsoPozSQAh9/view?usp=sharing cplusplus_2a.tar] <!--[http://nameless.cis.udel.edu/class_data/220_f2014/code/cplusplus_3.tar functemplate], [http://nameless.cis.udel.edu/class_data/220_f2014/code/cplusplus_4.tar anythingcell, generalarray, STL_vector]-->
|-
|4
|Sep. 7
|C++ review 
|Function & class templates, STL
|Drozdek 1.7-1.8<br>
[http://www.cplusplus.com/doc/tutorial/ cplusplus.com tutorial: Classes II], [http://www.cplusplus.com/reference/stl STL reference]
|<!--[http://nameless.cis.udel.edu/class_data/220_f2014/code/mystring_final.tar mystring_final]-->[http://nameless.cis.udel.edu/class_data/220_f2014/code/template_test.tar template_test], [http://nameless.cis.udel.edu/class_data/220_f2014/code/anythingcell.tar anythingcell]
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Sep. 7/Sep. 8
|style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Lab2 LAB #2]
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|style="background:rgb(102, 204, 255)"|5
|Sep. 12<br>
''Register/add deadline''<br>
|Stacks
|ADT (including STL) and applications, including stacks for postfix expression evaluation
|Drozdek 4-4.1
|
|-
|6
|Sep. 14
|Stacks and queues
|Implementing stacks with linear arrays; queue ADT, applications, and linear array implementation  
|Drozdek 4.1, 4.2
|[http://nameless.cis.udel.edu/class_data/220_f2014/code/array_stack.tar array_stack], [http://nameless.cis.udel.edu/class_data/220_f2014/code/array_queue.tar array_queue] <!-- sll_stack-->
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Sep.14/Sep. 15
|style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Lab3 LAB #3]
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|style="background:rgb(102, 204, 255)"|7
|Sep. 19
|Queues, deques, and lists
|Circular arrays for queues, singly- and doubly-linked lists for stacks and queues
|Drozdek 3-3.2, 3.7, 3.8, 4.2, 4.4, 4.5
|[https://drive.google.com/file/d/1Pany4gsFBmGp41xOi_A1O_wHc7bg_hmo/view?usp=sharing sll_stack]
|-
|8
|Sep. 21
|Trees
|Terminology; representation in general case; pre- and post-order traversals; binary trees
|Drozdek 6-6.2, 6.4-6.4.2
|
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Sep.21/Sep. 22
|style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Lab4 LAB #4]
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|style="background:rgb(102, 204, 255)"|9
|Sep. 26
|Trees
|Binary trees for arithmetic expressions; in-order traversals; binary search trees
|Drozdek 6.3, 6.5-6.6 (skip 6.6.1), 6.12 (expression trees)
|<!--[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2014_Project1 Project #1]-->
|-
|
|Sep. 28
|style="background:rgb(255, 102, 0)"|NO LECTURE TODAY<br>''Instructor away''
|
|
|
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Sep.28/Sep. 29
|style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Lab5 LAB #5]
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|style="background:rgb(102, 204, 255)"|10
|Oct. 3
|Algorithm analysis
|Big-O notation and common complexity classes; analyzing code to obtain big-O estimates
|Drozdek 2-2.3, 2.5-2.6, 2.7
|
|-
|11
|Oct. 5
|Balanced binary trees
|AVL trees: definition, balance notation, rotations
|Drozdek 6.7-6.7.2 (skip 6.7.1) 
|[http://research.cs.queensu.ca/home/jstewart/applets/bst/bst-rotation.html Rotation applet]
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Oct. 6
|style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Lab6 LAB #6]
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|<!--[http://nameless.cis.udel.edu/class_data/220_f2014/solutions_lab5.png Lab #5 solutions to 2.11.7, 2.11.8, and 2.11.10]-->
|-
|style="background:rgb(102, 204, 255)"|12
|Oct. 10
|style="background:rgb(255, 102, 0)"|NO LECTURE TODAY<br>''Class cancelled''
|
|
|
|-
|13
|Oct. 12
|Balanced binary trees
|AVL trees: applying rotations to restore balance property
|Drozdek 6.7-6.7.2 (skip 6.7.1)
|UD Capture is audio only today :(
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Oct. 13
|style="background:rgb(255, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Lab7 LAB #7]
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|style="background:rgb(102, 204, 255)"|14
|Oct. 17
|Midterm review
|
|[https://docs.google.com/presentation/d/1UmeRYPvg_hUIg8SneK9lrYRK-c2QWFcPH9yBaiwIEx8/edit?usp=sharing Midterm review slides]<br>
[https://drive.google.com/file/d/1s0rUqxQ8dJLWLyo1HVcVsYOvo74Pv9wX/view?usp=sharing Post-C++ lecture notes]
|[http://nameless.cis.udel.edu/class_data/220_f2014/220_2010_midterm.pdf 2010 midterm] (ignore questions 2 and 6)
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Oct. 20
|style="background:rgb(255, 102, 0)"|NO LAB THIS WEEK
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|15
|Oct. 19
|MIDTERM
|
|
|
|-
|style="background:rgb(102, 204, 255)"|16
|Oct. 24<br>
''Withdraw deadline''
|Priority queues 
|ADT, heap implementation
|Drozdek 4.3, 4.6, 6.9
|[https://drive.google.com/file/d/1xjRvqCxN_CH-xOlaofwY6A4O0D38_es7/view?usp=sharing STL PQ example]
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Oct. 27
|style="background:rgb(255, 102, 0)"|<!--[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Lab7 LAB #7]-->NO LAB THIS WEEK
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|17
|Oct. 26
|Priority queues
|Finish heap details
|
|
|-
|style="background:rgb(102, 204, 255)"|18
|Oct. 31
|Disjoint sets
|Union-find algorithm
|Drozdek 8.4.1<br>
[http://en.wikipedia.org/wiki/Disjoint-set_data_structure Wikipedia entry], [http://courses.cs.washington.edu/courses/cse332/12su/slides/lecture15-mst-dsuf-handout.pdf UW slides] (first 5 pages of PDF)<br>
Optional: [https://www.cs.princeton.edu/~rs/AlgsDS07/01UnionFind.pdf Princeton slides]
|
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Nov. 3
|style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Lab8 LAB #8]
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|19
|Nov. 2
|Disjoint sets
|Smart union, path compression, maze generation application
|
|
|-
|style="background:rgb(102, 204, 255)"|20
|Nov. 7
|Compression
|Huffman coding, tries
|Drozdek 11-11.2 (skip 11.2.1)
|
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Nov. 10
|style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Lab9 LAB #9]
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|21
|Nov. 9
|Finish compression; maps
|
|Drozdek, 7.1.10
|[https://drive.google.com/file/d/14kkP7Nz1_dFFHNvMwGixrryrkgbk1AyK/view?usp=sharing STL map example]
|-
|style="background:rgb(102, 204, 255)"|22
|Nov. 14
|Hashing
|Hash function, probing (linear, quadratic, double hashing), chaining
|Drozdek 10-10.2.2
|
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Nov. 17
|style="background:rgb(255, 102, 0)"|NO IN-PERSON LAB THIS WEEK -- BUT [http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Lab10 LAB #10] ASSIGNED
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|23
|Nov. 16
|Hashing
|Deletions; applications to file integrity verification, password storage
|Drozdek 10.3<br>[http://unixwiz.net/techtips/iguide-crypto-hashes.html Illustrated Guide to Cryptographic Hashes]
|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2021_Project Project assigned]<!--''Project #2 due''-->
|-
|style="background:rgb(102, 204, 255)"|
|Nov. 21
|style="background:rgb(255, 102, 0)"|NO LECTURE TODAY<br>''Thanksgiving''
|
|
|
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Nov. 24
|style="background:rgb(255, 102, 0)"|NO LAB THIS WEEK
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|
|Nov. 23
|style="background:rgb(255, 102, 0)"|NO LECTURE TODAY<br>''Thanksgiving''
|
|
|
|-
|style="background:rgb(102, 204, 255)"|24
|Nov. 28
|Graphs 
|Terminology, applications, representations: adjacency matrix, adjacency lists
|Drozdek 8-8.1
|[https://docs.google.com/presentation/d/1V1_q89gF3kX1lLTVltJl4sH2u87tERpkh6X2C5aXQSs/edit?usp=sharing slides]
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Dec. 1
|style="background:rgb(255, 102, 0)"|NO LAB THIS WEEK
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|25
|Nov. 30
|Graphs
|Traversals: depth-first, breadth-first 
|Drozdek 8.2, 8.3 (stop after Dijkstra's)<br>
Optional: [http://www.redblobgames.com/pathfinding/a-star/introduction.html Path-finding tutorial] (stop at "Heuristic search")
|[https://docs.google.com/presentation/d/1Y3demwUDnWeAEpeIU23pdvSrfdo1sAtzRt_zrlVu_PI/edit?usp=sharing slides]
|-
|style="background:rgb(102, 204, 255)"|26
|Dec. 5
|Graphs
|Shortest path: Dijkstra's algorithm
|
|
|-
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|Dec. 8
|style="background:rgb(255, 102, 0)"|NO LAB THIS WEEK
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|style="background:rgb(245, 222, 179)"|
|-
|27
|Dec. 7
|Sorting (abbreviated)
|Insertion sort, mergesort
|Drozdek 9.1.1, 9.3.4<br>
Optional: [http://www.sorting-algorithms.com Sorting algorithms animated]
|
|-
|28
|
|Final review on YouTube
|
|[https://docs.google.com/presentation/d/1eTXi-o6tkSFXhBPzU0S_BFHX3J8b0raZf0iL40SDZaw/edit?usp=sharing Final review slides]<br>[https://drive.google.com/file/d/1visePCtxvwxFJv7Yd3ILeqFxyCEGII4Y/view?usp=sharing Post-midterm lecture notes]
|[https://youtu.be/7u_zbb8fT6E recording] (with solutions to 2010 final linked below)<br>[http://nameless.cis.udel.edu/class_data/220_f2014/cisc220_f2010_final.pdf 2010 final] (ignore Q4 and Q5, but see Q2 on [http://nameless.cis.udel.edu/class_data/220_f2014/220_2010_midterm.pdf 2010 midterm])
|-
|
|Dec. 12 -- this is past the end of classes
|Final project demos 
|
|
|''Project due''
|-
|style="background:rgb(102, 204, 255)"|
|Dec. 13-17
|FINAL EXAM
|Time and location???
|
|
|}