dsa2/resources_for_review.html at main · uva-cs/dsa2 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml" lang="" xml:lang="">
<head>
  <meta charset="utf-8" />
  <meta name="generator" content="pandoc" />
  <meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=yes" />
  <title>DSA2: Resources for CS 3100</title>
  <style>
    code{white-space: pre-wrap;}
    span.smallcaps{font-variant: small-caps;}
    div.columns{display: flex; gap: min(4vw, 1.5em);}
    div.column{flex: auto; overflow-x: auto;}
    div.hanging-indent{margin-left: 1.5em; text-indent: -1.5em;}
    /* The extra [class] is a hack that increases specificity enough to
       override a similar rule in reveal.js */
    ul.task-list[class]{list-style: none;}
    ul.task-list li input[type="checkbox"] {
      font-size: inherit;
      width: 0.8em;
      margin: 0 0.8em 0.2em -1.6em;
      vertical-align: middle;
    }
    .display.math{display: block; text-align: center; margin: 0.5rem auto;}
  </style>
  <link rel="stylesheet" href="markdown.css" />
</head>
<body>
<header id="title-block-header">
<h1 class="title">DSA2: Resources for CS 3100</h1>
</header>
<h1 id="resources-for-cs-3100-data-structures-and-algorithms-2-dsa2">Resources for CS 3100: Data Structures and Algorithms 2 (DSA2)</h1>
<p>This course assumes knowledge of several topics from discrete math (CS2120 at UVA), two semesters of programming experience (through CS2100 at UVA), and data structures (also CS2100 at UVA). In particular, we assume knowledge of the following topics. Links to resources are provided:</p>
<ul>
<li>Logarithms and identities <a href="https://en.wikipedia.org/wiki/List_of_logarithmic_identities">Log rules</a></li>
<li>Sets <a href="https://www.cs.virginia.edu/~emo7bf/cs2120/s2023/sets.html">CS2120 Set Review</a></li>
<li>Functions <a href="https://www.cs.virginia.edu/~emo7bf/cs2120/s2023/files/mcs.pdf#section.4.3">Section 4.3 of the MCS textbook</a> and <a href="https://www.cs.virginia.edu/~emo7bf/cs2120/s2023/chap4.html#functions">CS2120 Function Notes</a></li>
<li>Proof Techniques <a href="https://www.cs.virginia.edu/~emo7bf/cs2120/s2023/techniques.html">CS2120 Proof Techniques</a></li>
<li>Direct Proofs <a href="https://www.cs.virginia.edu/~emo7bf/cs2120/s2023/direct.html">CS2120 Direct Proofs</a></li>
<li>Proof Styles, we’ll mostly be using “prose proofs” <a href="https://www.cs.virginia.edu/~emo7bf/cs2120/s2023/proofs.html">CS2120 Proof Style Guide</a></li>
<li>Logic and Notation <a href="https://www.cs.virginia.edu/~emo7bf/cs2120/s2023/glossary.html">CS2120 Glossary of Logical Terms</a></li>
<li>Recursion <a href="https://markfloryan.github.io/dsa1/slides/04-trees.html#/3/1">CS2100 Recursion</a>, <a href="https://deternitydx.github.io/uvacs4102/pdfs/31-recursion.pdf">CS2110 Recursion Part 1</a></li>
<li>Trees <a href="https://markfloryan.github.io/dsa1/slides/04-trees.html#/">CS2100 Trees</a></li>
<li>Lists <a href="https://markfloryan.github.io/dsa1/slides/02-lists.html#/">CS2100 Lists</a></li>
<li>Queues <a href="https://markfloryan.github.io/dsa1/slides/02-lists.html#/queues">CS2100 Queues</a></li>
<li>Stacks <a href="https://markfloryan.github.io/dsa1/slides/02-lists.html#/stacks">CS2100 Stacks</a></li>
<li>Priority Queues <a href="https://markfloryan.github.io/dsa1/slides/07-priorityqueues.html#/">CS2100 Priority Queues</a></li>
<li>Hash Tables <a href="https://markfloryan.github.io/dsa1/slides/06-hashing.html#/">CS2100 Hash Tables</a></li>
</ul>
<p>A good online textbook for Discrete Math Topics <a href="https://people.csail.mit.edu/meyer/mcs.pdf">Mathematics for Computer Science</a></p>
</body>
</html>