archive ·a collection of random notes and other stuff

Algorithms II7

Amortized Analysis
Fibonacci Heaps
Maximum Flow
Push Relabel
Applications of Maximum Flow
General Max-Matching
Stable Matching

Algorithms I4

Asymptotic Bounds
Solving Recurrences
Algorithmic Paradigms
Graph Algorithms

Switching Circuits Laboratory9

Building CMOS Gates and simple circuits
Realising gate-level circuits from truth tables
Designing combinational circuits with clock and counter
Designing combinational using functional blocks
Design of a 4-bit adder/subtractor
Design of flip flops
Design of shift registers
Design of counters
Design of complete systems

Automata Theory3

Unrestricted Grammars
Problems on TMs, UGs
Problems on Undecidability

Programming Paradigms for Computation1

Solving Some Problems

Miscellaneous2

Probability Ramblings
CS229 PSets and Notes

Switching Circuits Laboratory

Building CMOS Gates and simple circuits

open_in_newOpen PDF