Electrical and Computer: Computer Engineering PE

Big O notation focuses on the dominant term for large inputs. Drop constants and lower-order terms. For PE software questions, recognize that O(n log n) is optimal for comparison-based sorting, O(n²) indicates nested loops, and O(log n) suggests divide-and-conquer or tree operations.

This identity appears frequently in digital logic simplification problems. Remember that A + A'B always simplifies to A + B. Look for opportunities to apply this before using K-maps or other methods, as it can dramatically reduce circuit complexity.

Cache hit rate is fundamental to computer performance analysis. Remember it's always between 0 and 1 (or 0% to 100%). Higher hit rates dramatically improve system performance. Often appears in computer architecture problems involving memory hierarchy optimization.

This equation represents only dynamic (switching) power, not static leakage power. On the PE exam, look for problems involving digital circuit power budgets, battery life calculations, or thermal design. Remember that capacitance includes both gate and interconnect capacitances.

CPI is fundamental to processor performance analysis. Remember that lower CPI means better performance. Often given as percentages of instruction mix rather than absolute counts - convert percentages to instruction counts first. Watch for questions combining CPI with clock frequency to find execution time.