The goal of CS2043 is to introduce you to the UNIX/Linux “command line” and its accompanying tools. When done with this class you should feel comfortable navigating any UNIX shell prompt, installing UNIX/Linux systems and understanding any shell script that you may encounter down the road. We’ll cover basic commands through script writing and visit some of the more common tools used today!
run sh <(curl -sL https://raw.githubusercontent.com/ocaml/opam/master/shell/install.sh) and install opam at /usr/bin (Caution: install it under this directory to ensure you can also access opam at user’s directory)
Say you’ve put
book.pdfin./source/books/, then put something like[Download my book!](/books/book.pdf)anywhere in the article and it will create the link for you.
Cited From hexo
From Lecture: Hard problems and undecidability
Polynomial algorithms: $O(n^k)$ for some k ($k\leq4$)
From Lecture: Heaps and priority queues
1 | interface PriorityQueue<E> { |
I have java 11 installed on my computer. JavaFx was not bundled with Java 11 so I have to first download it from here and put it at the same directory as Java jdk. But VScode still gives me the error “The import javafx cannot be resolved”. This was resolved after I ran Java: Clean the Java Language Server workspace, though I have no idea how VSCode magically found the directory of JavaFx.
From Lecture: Dijkstra’s shortest path algorithm
dist == infinitydist < infinity, in queuedist < infinity, not in queueFrom Recitation: Euler paths, planar graphs, and Hamiltonian paths
We have an edge e=(v,child), where v is always grey
Tree edge:
1 | if (child.color==white) |
From Lecture: Graph traversals
It is a general model of many graph traversal algorithms.
Invariant: there is no black->white edge
