Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix some typos / latex leftovers #32

Merged
merged 5 commits into from
Jun 6, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion .vitepress/config.mts
Original file line number Diff line number Diff line change
Expand Up @@ -91,7 +91,7 @@ export default withMermaid(
{ text: '6. Text Justification', link: '/exams/justify/' },
{ text: '7. Photographing Skyscrapers', link: '/exams/photo-skyscraper/' },
{ text: '8. Non-deterministic Finite Automata', link: '/exams/finite-automata/' },
{ text: '9. Least Common Anchestor', link: '/exams/least-common-ancestor/' },
{ text: '9. Least Common Ancestor', link: '/exams/least-common-ancestor/' },
{ text: '10. Building Trees', link: '/exams/building-trees/' },
{ text: '11. Square Code', link: '/exams/square-code/' },
{ text: '12. Rock, Paper, Scissors', link: '/exams/rock-paper-scissors/' },
Expand Down
2 changes: 1 addition & 1 deletion exams/finite-automata/index.md
Original file line number Diff line number Diff line change
Expand Up @@ -73,7 +73,7 @@ To that end, implement the function
```haskell
accepts :: (Eq a, Eq b) => Automaton a b -> [b] -> Bool
```
which takes and automaton and a list of symbols that represents the word, and returns \texttt{True}
which takes and automaton and a list of symbols that represents the word, and returns **True**
iff the word is accepted. Notice, `a` and `b` are instances of `Eq`. The function is used as
follows.
```haskell
Expand Down
4 changes: 2 additions & 2 deletions exams/least-common-ancestor/index.md
Original file line number Diff line number Diff line change
Expand Up @@ -35,7 +35,7 @@ $7$ and $7$ is $7$.
In Racket, implement a function `(common-ancestor x y tree)` that takes
two nodes `x`, `y` and a binary tree `tree`, and returns the least common-ancestor
of `x` and `y` in `tree`. If `x` or `y` does not belong to `tree`,
the function returns \Verb|#f|.
the function returns `#f`.

To represent binary trees in Racket, use the following structures:
```scheme
Expand Down Expand Up @@ -66,7 +66,7 @@ Your file should be called `ancestor.rkt` and should export the `find-path` and
(struct-out node)
(struct-out leaf))

(struct node (val kids) #:transparent)
(struct node (val left right) #:transparent)
(struct leaf (val) #:transparent)

(define (find-path x tree)
Expand Down
2 changes: 1 addition & 1 deletion exams/photo-skyscraper/index.md
Original file line number Diff line number Diff line change
Expand Up @@ -34,7 +34,7 @@ visible.

In Racket, write a function `(best-view city)` that outputs the direction with the most roofs
visible, along with the number of roofs visible from that direction. The direction should be one of
four symbols: `'N`, `'S`, `'E`, and `'N`. The result should be a pair of the format
four symbols: `'N`, `'S`, `'E`, and `'W`. The result should be a pair of the format
`'(direction . number)`.

```scheme
Expand Down