Posts tagged Self Study

Sorting Algorithms

Time complexity of sorting algorithms   Selection Sort – Youtube Link From the beginning of an array, it finds minimum element in ...

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 ...

Shells

Shell is a program taking commands from a keyboard and giving them to operating system. Below are three popular shells on Linux. bash Bourne ...

Virtual Consoles

Virtual Consoles enable multi-user logins on a single machine. For example, you can login with your account and also as a root.   By ...

Down Call vs. Up Call

Down Call User code(unprivileged) enters to kernel with trap(interrupt). Up Call Kernel(privileged) enters to user code with IPC(Interprocess ...