9 results
CS-501 · Unit 3
Binary Search Tree (BST) Properties
A Binary Search Tree is a tree where every node stores one value and has at most two children.
CS-501 · Unit 3
Dynamic Programming Fundamentals
Dynamic Programming means: solve a problem once, write the answer down, and reuse it instead of computing it again.
CS-501 · Unit 1
Asymptotic Notation & Growth of Functions
Asymptotic notation is a way to describe how slow or fast an algorithm gets as the input grows.
CS-501 · Unit 2
Divide and Conquer Strategy
Break the problem into smaller pieces, solve each piece, then join the answers together.
CS-503 · Unit 1
DFA and NFA
A finite automaton is a simple machine with states. It reads input one symbol at a time and moves between states.
CS-503 · Unit 2
Context Free Grammars & Parse Trees
A grammar is a set of rules that generate strings of a language.
CS-502 · Unit 3
Paging & Page Replacement
Memory is split into equal blocks called frames, and programs into equal blocks called pages.
CS-502 · Unit 4
Deadlock Conditions & Banker's Algorithm
A deadlock happens when processes wait for each other forever and nobody can move.
CS-504 · Unit 2
Functional Dependency & Normal Forms
Normalization organises tables so the same fact is not stored twice.