Time complexity of sorting algorithms Selection Sort – Youtube Link From the beginning of an array, it finds minimum element in ...
Category etc
P vs. NP
NP – Complete A problem p in NP is NP-complete if every other problem in NP can be transformed (or reduced) into p in polynomial time. It ...
Euclid’s Algorithm
Euclid’s(Euclidean) Algorithm Algorithm to find GCD of two large numbers GCD(N1, N2), suppose that N1 is larger than N2 N1 = N2 * q1 + r1 ...
FDMA, TDMA, and CDMA
FDMA (Frequency Division Multiple Access) Vary frequencies for each user. If number of users increases, it becomes complicated. TDMA (Time ...
Bandwidth and Frequency
Bandwidth (bps – bits per second) Amount of data that can be transmitted in per unit time. Difference between highest frequency and lowest ...
Latency vs. Jitter
Latency Amount of time it takes for a packet to travel from point A to point B(or round-trip). ex) Data Latency: time between a query and the ...
Useful Git tips
Apply .gitignore on already pushed repository Disconnect local repository from remote Reset to specific commit Remove all ...
vi Find & Replace
Range [%] All lines in the file. [1,30] line 1 to 30 [5,$] line 5 to last line Pattern This can be plain text and also regular expression. ...
Useful Websites
CS university rankings by publications http://csrankings.org/ Regular Expression http://www.rexegg.com/regex-quickstart.html Tmux Tmux Cheatsheet ...
[ ssh ] Public key vs. Private key
If you generate key with the command ssh–keygen -t rsa, you will get two types of key. Public key is for encrypting and private key is for ...