Computer Science methods
- How to evaluate a postfix expression with a stack
Evaluate postfix expressions in Reverse Polish Notation systematically using a stack data structure in linear time.
- How to reverse a linked list
Learn how to reverse a singly linked list in-place using iterative pointer manipulation in time complexity O(n).
- How to insert into a binary search tree
A precise procedure for inserting a new node into a binary search tree while maintaining the binary search tree property.
- How to simplify a Boolean expression with a Karnaugh map
Minimize Boolean expressions using Karnaugh maps by grouping adjacent 1s to find the simplest sum-of-products form.
- How to convert a decimal number to binary and hexadecimal
A step-by-step method for converting base-10 decimal numbers into base-2 binary and base-16 hexadecimal using repeated division.
- How to perform binary search on a sorted array
Learn how to perform binary search on a sorted array to find a target element in O(log n) time.
- How to trace a recursive function by hand
Learn how to manually trace a recursive function using a call stack diagram to systematically track variables, state, and return values.
- How to find the Big O of a nested loop
Determine the Big O time complexity of nested loops by calculating and multiplying their individual iteration counts.