0PP
Your ultimate resource for mastering Computer Science. This curated collection of questions is sourced from real interviews to help you prepare effectively.
Bit Manipulation techniques (AND, OR, XOR, bit-shifting)
the difference between TCP and UDP
Dijkstra's Algorithm for shortest paths
Runtime (Dynamic) Polymorphism vs Compile-time (Static) Polymorphism
how to solve the Fibonacci sequence problem using Dynamic Programming
Abstract Classes vs. Interfaces
the concept of Virtual Memory
Recursion and Backtracking as a problem-solving pattern
Min-Heap vs. Max-Heap properties
the Breadth-First Search (BFS) algorithm
Reversing a Linked List (iteratively and recursively)
the difference between a Process and a Thread
the 7 Layers of the OSI Model
ACID Properties in Transactions
Tree Traversal algorithms (In-order, Pre-order, Post-order)
Bit Manipulation techniques (AND, OR, XOR, bit-shifting)
the difference between TCP and UDP
Dijkstra's Algorithm for shortest paths
Runtime (Dynamic) Polymorphism vs Compile-time (Static) Polymorphism
how to solve the Fibonacci sequence problem using Dynamic Programming
Abstract Classes vs. Interfaces
the concept of Virtual Memory
Recursion and Backtracking as a problem-solving pattern
Min-Heap vs. Max-Heap properties
the Breadth-First Search (BFS) algorithm
Reversing a Linked List (iteratively and recursively)
the difference between a Process and a Thread
the 7 Layers of the OSI Model
ACID Properties in Transactions
Tree Traversal algorithms (In-order, Pre-order, Post-order)