|
|
(38 intermediate revisions by the same user not shown) |
Line 16: |
Line 16: |
| |valign="top"|'''URL''' | | |valign="top"|'''URL''' |
| | | | | |
− | http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2023 | + | http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2024 |
| |- | | |- |
| |valign="top"|'''TAs''' | | |valign="top"|'''TAs''' |
| | | | | |
− | * ??, E-mail: ??, Friday lab, office hours Tuesdays 4-5 pm in Smith 203 | + | * Yifan Zhang, E-mail: eyfzh@udel.edu, ?? lab, office hours ?? 4-5 pm in Smith 203 |
| * ??, E-mail: ??, Thursday lab, office hours Tuesdays 3-4 pm in Smith 203 | | * ??, E-mail: ??, Thursday lab, office hours Tuesdays 3-4 pm in Smith 203 |
| |- | | |- |
| |valign="top"|'''Schedule''' | | |valign="top"|'''Schedule''' |
| | | | | |
− | * Lectures: Tuesdays and Thursdays 9:35 am to 10:55 am in ?? <!-- [https://css-rdms1.win.udel.edu/maps/?find=NC36 GORE 219] --> | + | * Lectures: Tuesdays and Thursdays 9:35 am to 10:55 am in [https://css-rdms1.win.udel.edu/maps/?find=NC14 BROWN 116] |
− | * Labs: Thursdays 2:20 to 3:15 pm in [https://css-rdms1.win.udel.edu/maps/?find=NC15 CLB 046] and Fridays 3:00 to 3:55 pm in [https://css-rdms1.win.udel.edu/maps/?find=NE67 ISE 202]. In the schedule below note that there is NOT a lab every week | + | * Labs: Wednesdays 4:10 to 5:05 pm and 5:20 to 6:15 pm in [https://css-rdms1.win.udel.edu/maps/?find=NC14 BROWN 116] and Fridays 3:00 to 3:55 pm in [https://css-rdms1.win.udel.edu/maps/?find=NC14 BROWN 205]. In the schedule below note that there is NOT a lab every week |
| |- | | |- |
| |valign="top"|'''Grading''' | | |valign="top"|'''Grading''' |
Line 32: |
Line 32: |
| * 50% Labs (5% each). These are problem sets/smaller programming exercises which are assigned in lab most weeks and '''due by the beginning of class each Thursday before the next lab'''. All written answers must be in PDF form. Attendance at labs is expected if you have not yet submitted--this is your chance to ask questions face to face and get started early on the assignment | | * 50% Labs (5% each). These are problem sets/smaller programming exercises which are assigned in lab most weeks and '''due by the beginning of class each Thursday before the next lab'''. All written answers must be in PDF form. Attendance at labs is expected if you have not yet submitted--this is your chance to ask questions face to face and get started early on the assignment |
| * 20% Quizzes (5% each) | | * 20% Quizzes (5% each) |
− | * 15% Midterm (Oct. 19) | + | * 15% Midterm |
| * 15% Final (essentially a midterm for the second half of the course) | | * 15% Final (essentially a midterm for the second half of the course) |
| | | |
Line 100: |
Line 100: |
| * [http://udcapture.udel.edu/2014f/cisc220-011/ 011 (11 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 (Thursdays/Fridays). 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 in 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]
| |
− | |[https://www.w3schools.com/cpp/cpp_exercises.asp Basic C++ exercises with tutorial]
| |
− | <!--[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_F2023_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]<br>[https://www.w3resource.com/cpp-exercises/oop/index.php Simple C++ class creation exercises with solutions]<!--[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] (class templates section in particular), [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_F2023_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<br>[https://www.codestepbystep.com/ codestepbystep practice site] (registration required)
| |
− | |[https://drive.google.com/file/d/17Be8jYUeeNPfXuaX0Qh-QxI3LX2sbHCM/view?usp=sharing stl_test]
| |
− | |-
| |
− | |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_F2023_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; recursion
| |
− | |Drozdek 6-6.2, 6.4-6.4.2
| |
− | |[https://www.luschny.de/math/factorial/FastFactorialFunctions.htm More than you ever wanted to know about computing factorials]
| |
− | |-
| |
− | |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_F2023_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]-->
| |
− | |-
| |
− | |10
| |
− | |Sep. 28
| |
− | |Trees
| |
− | |Deletions, findMin(), findMax() in binary search trees; lab #5
| |
− | |
| |
− | |
| |
− | |-
| |
− | |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_F2023_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)"|11
| |
− | |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
| |
− | |
| |
− | |-
| |
− | |
| |
− | |Oct. 5
| |
− | |style="background:rgb(255, 102, 0)"|NO LECTURE TODAY<br>''Instructor at meeting''
| |
− | |
| |
− | |
| |
− | |
| |
− | |-
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|Oct. 5/Oct. 6
| |
− | |style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2023_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
| |
− | |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]
| |
− | |-
| |
− | |13
| |
− | |Oct. 12
| |
− | |Balanced binary trees, priority queues (PQ)
| |
− | |AVL trees: applying rotations to restore balance property; PQ ADT, comparison of implementation efficiencies
| |
− | |Drozdek 6.7-6.7.2 (skip 6.7.1); 4.3, 4.6 (PQs)
| |
− | |[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. 12/Oct. 13
| |
− | |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)"|
| |
− | |-
| |
− | |style="background:rgb(102, 204, 255)"|14
| |
− | |Oct. 17
| |
− | |Heap implementation of priority queues<br> (NOT on midterm -- see midterm review material in Links column)
| |
− | |Heap implementation details, complexity analysis
| |
− | |Drozdek 6.9<!--[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]-->
| |
− | |[https://docs.google.com/presentation/d/1UOvLfQdfQph2SnJLgsUXePnykJghGkMYVU37CW6H7Tw/edit?usp=sharing Midterm review slides]<br>[http://nameless.cis.udel.edu/class_data/220_f2014/220_2010_midterm.pdf 2010 midterm] (ignore questions 2 and 6), [https://www.youtube.com/watch?v=NNTO_U6HgrE UDCapture going over 2010 exam]<br>
| |
− | [https://drive.google.com/file/d/1zrrzlh3F43r8btG6NjewDq87muFvAPzn/view?usp=sharing 2021 midterm]
| |
− | |-
| |
− | |15
| |
− | |Oct. 19
| |
− | |MIDTERM
| |
− | |
| |
− | |
| |
− | |
| |
− | |-
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|Oct. 19/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)"|
| |
− | |-
| |
− | |style="background:rgb(102, 204, 255)"|16
| |
− | |Oct. 24<br>
| |
− | |Disjoint sets
| |
− | |Equivalence relations, classes; union-find algorithm
| |
− | |
| |
− | [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]-->
| |
− | |<!--[https://drive.google.com/file/d/1xjRvqCxN_CH-xOlaofwY6A4O0D38_es7/view?usp=sharing STL PQ example]-->
| |
− | |-
| |
− | |17
| |
− | |Oct. 26
| |
− | |Disjoint sets
| |
− | |Smart union, path compression, maze generation application
| |
− | |
| |
− | |
| |
− | |-
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|Oct. 26/Oct. 27
| |
− | |style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2023_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)"|18
| |
− | |Oct. 31
| |
− | |Compression
| |
− | |Huffman coding, tries
| |
− | |Drozdek 11-11.2 (skip 11.2.1)
| |
− | |
| |
− | |-
| |
− | |19
| |
− | |Nov. 2
| |
− | |Finish compression; maps
| |
− | |
| |
− | |Drozdek, 7.1.10
| |
− | |[https://drive.google.com/file/d/14kkP7Nz1_dFFHNvMwGixrryrkgbk1AyK/view?usp=sharing STL map example]
| |
− | |-
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|Nov. 2/Nov. 3
| |
− | |style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2023_Lab8 LAB #8]
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |-
| |
− | |style="background:rgb(102, 204, 255)"|20
| |
− | |Nov. 7
| |
− | |Graphs
| |
− | |Terminology, applications, representations: adjacency matrix, adjacency lists/sets
| |
− | |Drozdek 8-8.1
| |
− | |
| |
− | |-
| |
− | |21
| |
− | |Nov. 9
| |
− | |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/document/d/1J5Qv_r82AkWHVus5b53saw98tQzlVK8c12-F3CxtiGY/edit?usp=sharing BFS pseudocode]
| |
− | |-
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|Nov. 9/Nov. 10
| |
− | |style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2023_Lab9 LAB #9]
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |-
| |
− | |style="background:rgb(102, 204, 255)"|22
| |
− | |Nov. 14<br>''Withdraw deadline Nov. 13''
| |
− | |Graphs
| |
− | |Dijkstra's shortest path algorithm, Kruskal's minimum spanning tree algorithm
| |
− | |
| |
− | |[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2023_Project Project assigned]
| |
− | |-
| |
− | |
| |
− | |Nov. 16
| |
− | |style="background:rgb(255, 102, 0)"|NO LECTURE TODAY<br>''Instructor away''
| |
− | |
| |
− | |
| |
− | |<!--[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2023_Project Project assigned]--><!--''Project #2 due''-->
| |
− | |-
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|Nov. 16/Nov. 17
| |
− | |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)"|
| |
− | |-
| |
− | |style="background:rgb(102, 204, 255)"|
| |
− | |Nov. 21
| |
− | |style="background:rgb(255, 102, 0)"|NO LECTURE TODAY<br>''Thanksgiving break''
| |
− | |
| |
− | |
| |
− | |
| |
− | |-
| |
− | |
| |
− | |Nov. 23
| |
− | |style="background:rgb(255, 102, 0)"|NO LECTURE TODAY<br>''Thanksgiving break''
| |
− | |
| |
− | |
| |
− | |
| |
− | |-
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|Nov. 23/Nov. 24
| |
− | |style="background:rgb(255, 102, 0)"|NO LAB THIS WEEK<br>''Thanksgiving break''
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |-
| |
− | |style="background:rgb(102, 204, 255)"|23
| |
− | |Nov. 28
| |
− | |Hashing
| |
− | |Hash function, probing (linear, quadratic, double hashing), chaining
| |
− | |Drozdek 10-10.2.2<br>[https://cs.stackexchange.com/questions/11029/why-is-it-best-to-use-a-prime-number-as-a-mod-in-a-hashing-function Why choose a prime for hash table size?]
| |
− | |<!--[https://docs.google.com/presentation/d/1V1_q89gF3kX1lLTVltJl4sH2u87tERpkh6X2C5aXQSs/edit?usp=sharing slides]-->
| |
− | |-
| |
− | |24
| |
− | |Nov. 30
| |
− | |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]
| |
− | |<!--[https://docs.google.com/presentation/d/1Y3demwUDnWeAEpeIU23pdvSrfdo1sAtzRt_zrlVu_PI/edit?usp=sharing slides]-->
| |
− | |-
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|Nov. 30/Dec. 1
| |
− | |style="background:rgb(245, 222, 179)"|[http://nameless.cis.udel.edu/class_wiki/index.php/CISC220_F2023_Lab10 LAB #10]
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |-
| |
− | |style="background:rgb(102, 204, 255)"|25
| |
− | |Dec. 5
| |
− | |Sorting
| |
− | |Insertion sort, mergesort
| |
− | |Drozdek 9.1.1, 9.3.4<br>
| |
− | Optional: [http://www.sorting-algorithms.com Sorting algorithms animated]
| |
− | |
| |
− | |-
| |
− | |26
| |
− | |Dec. 7
| |
− | |Sorting
| |
− | |Actually less sorting
| |
− | |
| |
− | |
| |
− | |-
| |
− | |style="background:rgb(245, 222, 179)"|
| |
− | |style="background:rgb(245, 222, 179)"|Dec. 7/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)"|
| |
− | |-
| |
− | |
| |
− | |
| |
− | |Final review on YouTube
| |
− | |
| |
− | |<!--<br>[https://drive.google.com/file/d/1visePCtxvwxFJv7Yd3ILeqFxyCEGII4Y/view?usp=sharing Post-midterm lecture notes]-->
| |
− | |[https://docs.google.com/presentation/d/12Rtz_u6-lzD5NCi3toBN7D0VtZYnttR1WXC4tus14Q8/edit?usp=sharing Final review slides]<br>[https://youtu.be/7u_zbb8fT6E Review recording] -- start at 4:17 (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. 11-12
| |
− | |Final project demos
| |
− | |
| |
− | |
| |
− | |''Project due''
| |
− | |-
| |
− | |
| |
− | |Dec. 14<br>11:30 am - 1:30 pm
| |
− | |FINAL EXAM
| |
− | |Gore 219 (this room!)
| |
− | |
| |
− | |
| |
| |} | | |} |