Skip to content

moocf/moocf.github.io

Folders and files

NameName
Last commit message
Last commit date

Latest commit

ย 

History

5 Commits
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 
ย 

Repository files navigation

A compilation of my educational resources.

There's more than what is listed here, for that you may visit the org.



In Java

Concurrent Data Structures

๐Ÿ“‹ Algorithms ๐Ÿ”’ Locks ๐Ÿ” Special
๐Ÿ“‹ dining-philosophers-problem ๐Ÿ“‹ sleeping-barber-problem ๐Ÿ“‹ bakery-algorithm
๐Ÿ“‹ dekker-algorithm ๐Ÿ“‹ peterson-algorithm โŒ
๐Ÿ”’ tas-lock ๐Ÿ”’ ttas-lock ๐Ÿ”’ backoff-lock
๐Ÿ”’ array-lock ๐Ÿ”’ clh-lock ๐Ÿ”’ mcs-lock
๐Ÿ” simple-reentrant-lock ๐Ÿ” simple-read-write-lock ๐Ÿ” fifo-read-write-lock
๐Ÿ” bathroom-lock ๐Ÿ” simple-semaphore ๐Ÿ” monitor-example


๐Ÿš‚ Queues ๐Ÿ“š Stacks ๐Ÿšฆ Sets
๐Ÿš‚ locked-queue ๐Ÿš‚ array-queue โŒ
๐Ÿ“š backoff-stack ๐Ÿ“š elimination-backoff-stack ๐Ÿ“š array-stack
๐Ÿšฆ coarse-set ๐Ÿšฆ fine-set ๐Ÿšฆ optimistic-set


๐Ÿงฎ Counting networks โค๏ธ Combining ๐Ÿฆ Misc
๐Ÿงฎ periodic-network ๐Ÿงฎ bitonic-network โŒ
โค๏ธ combining-tree โŒ โŒ
๐Ÿฆ savings-account โŒ โŒ


Projects

  • ๐Ÿ“ป k-compare-single-swap๏น• k-compare single-swap (KCSS) is an extension of CAS that enables atomically checking multiple addresses before making an update.
  • ๐Ÿ“ป bowling-alley: Bowling Alley Management System assignment in Software Engineering Course (original).


In Processing

๐Ÿ“บ Programs โŒ โŒ
๐Ÿ“บ sir_model ๐Ÿ“บ trigonometry_graphs ๐Ÿ“บ mosfet_sim
๐Ÿ“บ draw_learn ๐Ÿ“บ neuron_ball ๐Ÿ“บ fourier_transform
๐Ÿ“บ snake โŒ โŒ


In VHDL

๐Ÿ“บ MINE Examples ๐Ÿ’ฝ Logic gates โŒ
๐Ÿ“บ blink ๐Ÿ“บ button ๐Ÿ“บ first_component
๐Ÿ“บ multiple_components โŒ โŒ
๐Ÿ’ฝ gate_and ๐Ÿ’ฝ gate_or ๐Ÿ’ฝ gate_not
๐Ÿ’ฝ gate_nand ๐Ÿ’ฝ gate_nor ๐Ÿ’ฝ gate_xor
๐Ÿ’ฝ gate_xnor ๐Ÿ’ฝ gate_imply โŒ

Project

  • ๐Ÿ“ป cpu_basic๏น• Design of a pentium-like 32-bit CPU.


In Racket

๐Ÿงพ List ๐Ÿ““ S-List โžฐ Lambda
๐Ÿงพ length ๐Ÿงพ find-index ๐Ÿงพ set
๐Ÿงพ increment-first ๐Ÿงพ get ๐Ÿงพ get-informative
๐Ÿงพ number-elements ๐Ÿงพ cartesian-product ๐Ÿงพ any
๐Ÿงพ every ๐Ÿงพ map ๐Ÿงพ reduce
๐Ÿงพ filter ๐Ÿงพ reverse ๐Ÿงพ repeat-value
๐Ÿงพ append ๐Ÿงพ remove-first-value ๐Ÿงพ remove-value
๐Ÿงพ sort ๐Ÿงพ sort-by ๐Ÿงพ bubble-sort
๐Ÿงพ merge โŒ โŒ
๐Ÿ““ count-value ๐Ÿ““ reverse-pairs ๐Ÿ““ up
๐Ÿ““ down ๐Ÿ““ flatten ๐Ÿ““ replacex
๐Ÿ““ replace ๐Ÿ““ replace-inline ๐Ÿ““ replace-map
โžฐ occurs-free โŒ โŒ

Misc

  • ๐ŸŒฒ tree: Binary tree consists of nodes each with a number, and two child subtrees.
  • ๐Ÿ—ผ tower-of-hanoi: Can your solve the tower of hanoi (recursive vietnam) problem?

Assignments

  • ๐Ÿงพ lists-assignment: Functional Programming on Lists.
  • ๐ŸŒฒ trees-assignment: Functional Programming on Trees.
  • ๐Ÿงพ lists-quiz: Implementing operations on list using functional calls such as map, foldl, apply ...


Interpreters

โžฐ POPL โŒ โŒ
โžฐ arithmetic โžฐ arithmetic2 โžฐ lexical
โžฐ functional โžฐ recursive โžฐ stores


In CUDA

๐Ÿ“– CUDA By Example โŒ โŒ
๐Ÿ“– hello-world ๐Ÿ“– device-properties ๐Ÿ“– choose-device
๐Ÿ“– addition ๐Ÿ“– malloc-test ๐Ÿ“– dot-product
๐Ÿ“– vector-sum ๐Ÿ“– histogram ๐Ÿ“– matrix-multiplication


References



ORG

About

A compilation of my educational resources.

Resources

License

Stars

Watchers

Forks

Languages