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