The PE Electrical and Computer: Computer Engineering exam provides one searchable reference document on the exam computer: the NCEES PE Computer Engineering Reference Handbook. Unlike the PE Power exam, which gives you six additional industry codes, the PE Computer Engineering exam relies entirely on this single handbook. That simplicity is a double-edged sword—fewer documents to juggle, but you need to know the handbook inside and out. Engineers who can jump to the right section and find a formula in under 30 seconds will finish with time to spare. Those who scroll aimlessly through an unfamiliar handbook will run out of time long before they run out of ability. This guide covers every major section of the handbook, gives you concrete search strategies by topic, and explains which formulas to memorize versus look up.
PE Computer Engineering Exam – Reference Materials at a Glance
- 1 searchable reference – the NCEES PE Computer Engineering Reference Handbook (no external codes or standards)
- On-screen calculator only – no physical calculators allowed; you use the calculator built into the exam software
- 85 questions in a 9.5-hour appointment (8.5 hours of testing time plus breaks)
- No outside materials – no printed notes, no personal references, no phone
- Searchable PDF interface with section navigation and Ctrl+F keyword search within sections
- Covers 12 topic areas: circuit analysis, electronics, signal processing, control systems, communications, electromagnetics, digital systems, computer networks, computer architecture, software engineering, embedded systems, and cybersecurity
PE Computer Engineering Practice-Map Reference Lanes
These lanes come from shipped PE Computer Engineering practice rows mapped back to the in-app quick reference sections. Use them as first stops after a missed problem: open the listed section, rehearse the subsection language, then rework the problem without looking at the solution. For PE reference materials, this intentionally uses section/subsection guidance instead of page numbers because supplied handbooks, standards, and editions can vary.
Highest-use reference sections in our current map: Computer Architecture, Digital Systems, Software Engineering, Computer Networks, Systems Software.
| Practice topic | First section to open | Subsections to rehearse | Mapped rows |
|---|---|---|---|
| Computer Networks and Cybersecurity | Computer Networks | IP Addressing and Subnetting; OSI and TCP/IP Model; Encryption | 103 mapped practice rows |
| Computer Architecture | Computer Architecture | Cache Memory; Memory Hierarchy and Virtual Memory; Pipelining | 88 mapped practice rows |
| Digital Devices | Digital Systems | Combinational Logic; Sequential Logic; Finite-State Machines | 58 mapped practice rows |
| Systems Software | Systems Software | Scheduling and Synchronization; Concurrency and Deadlock; Memory Management | 57 mapped practice rows |
| Application Development | Application Development | Algorithms and Data Structures; Algorithm Complexity; Software Metrics and Reliability | 54 mapped practice rows |
| Quality Processes | Software Engineering | Testing; Software Testing; Software Metrics and Reliability | 51 mapped practice rows |
Coverage note: 507 of 507 shipped PE Computer Engineering rows have a reference lane in this map (358 section/subsection matches, 149 section-only matches, 0 unmatched). Treat this as a study navigation aid, not an official NCEES reference list.
Email me the PE Computer Engineering reference lanes
Get the same section/subsection map in your inbox, plus a quick practice link. This stays section-based for PE references and codes; it does not promise fixed page numbers for supplied handbooks or external standards.
What Reference Materials Does NCEES Provide for the PE Computer Engineering Exam?
NCEES provides a single digital reference document: the PE Computer Engineering Reference Handbook. It is a searchable PDF accessible on the Pearson VUE exam computer. You cannot bring any outside materials—no printed notes, no additional textbooks, no code standards. Everything you need to look up must come from this one handbook.
This is a significant difference from the PE Power exam, where candidates receive six additional industry codes (NEC, NESC, NFPA 70E, etc.). On the PE Computer Engineering exam, you do not receive the National Electrical Code, IEEE standards, or any other external documents. The handbook is self-contained: it includes all formulas, tables, constants, and reference data that NCEES considers necessary for the exam.
The on-screen calculator is another important detail. Unlike other PE exams that allow an approved physical calculator (such as the TI-36X Pro), the PE Computer Engineering exam uses only the calculator built into the exam software. This means you cannot rely on stored programs, equation solvers, or multi-step calculation features from a physical calculator. Practice using a basic on-screen calculator before exam day so the interface does not slow you down.
How Does the Searchable PDF Viewer Work?
The PE Computer Engineering exam runs on a Pearson VUE computer with a built-in PDF viewer for the reference handbook. Understanding its mechanics before exam day prevents frustration and wasted time.
Section-by-section navigation. The handbook is organized into sections corresponding to topic areas. A sidebar or table of contents panel lets you select a section to open. The viewer loads one section at a time—you cannot scroll through the entire handbook as a single continuous document. This means you need to know which section contains the information you want before you start searching.
Ctrl+F search within sections. Once you have a section open, press Ctrl+F to search for keywords within that section. The search highlights matches and lets you cycle through results. However, the search only works within the currently open section. If you search for “Routh-Hurwitz” but you have the Signal Processing section open instead of Control Systems, you will get zero results.
Use the tutorial period wisely. Before the exam clock starts, you get a brief tutorial on the exam interface. Use this time to open the reference handbook, scan its table of contents, and mentally bookmark the sections you expect to reference most. Knowing the section order and approximate page counts for each topic will save time during the actual exam.
Practical implications. Your lookup speed depends entirely on knowing the handbook’s structure. The two-step process—navigate to the right section, then search within it—rewards candidates who have studied with the handbook and know where each topic lives. Candidates who see the handbook for the first time on exam day will waste minutes on every lookup.
Key Sections of the PE Computer Engineering Reference Handbook by Topic
The handbook covers the 12 topic areas tested on the PE Computer Engineering exam. Here is what to expect in each section and how to find what you need quickly.
Circuit Analysis
This section contains network theorems (Thevenin, Norton, superposition), Kirchhoff’s voltage and current laws, AC and DC circuit formulas, impedance calculations, frequency response, and resonance equations. Search terms: “Thevenin,” “impedance,” “resonant frequency,” “transfer function,” “phasor.” This is one of the most referenced sections because circuit analysis underlies many other topics.
Electronics
Covers transistor models (BJT and MOSFET small-signal parameters), op-amp configurations (inverting, non-inverting, differential, summing), diode equations, and amplifier gain formulas. Search terms: “MOSFET,” “BJT,” “op-amp,” “transconductance,” “gain bandwidth product.” Know whether the question asks about small-signal or large-signal behavior—this determines which model parameters to look up.
Signal Processing
Contains Fourier transform pairs, Laplace transform tables, z-transform tables, filter design equations (Butterworth, Chebyshev), sampling theorem, and convolution properties. Search terms: “Laplace,” “z-transform,” “Fourier,” “Butterworth,” “Nyquist,” “sampling.” The transform tables are some of the most valuable pages in the handbook—you will reference them repeatedly.
Control Systems
Includes block diagram reduction rules, Mason’s gain formula, Routh-Hurwitz stability criterion, root locus construction rules, Bode plot relationships, Nyquist stability criterion, state-space representations, and steady-state error formulas. Search terms: “Routh,” “root locus,” “Bode,” “steady-state error,” “state space,” “Mason.” Control systems questions almost always require a reference lookup for the specific criterion or rule being tested.
Communications
Covers modulation formulas (AM, FM, PM bandwidth and power), Shannon channel capacity, signal-to-noise ratio, bit error rate for common modulation schemes, and link budget calculations. Search terms: “Shannon,” “channel capacity,” “modulation index,” “bit error rate,” “Carson’s rule,” “link budget.”
Electromagnetics
Contains Maxwell’s equations in differential and integral form, transmission line equations (characteristic impedance, reflection coefficient, VSWR), Smith chart usage, skin depth, and antenna parameters. Search terms: “Maxwell,” “transmission line,” “characteristic impedance,” “reflection coefficient,” “VSWR,” “skin depth.”
Digital Systems
Includes Boolean algebra identities, Karnaugh map procedures, flip-flop characteristic tables (SR, JK, D, T), state machine design, number systems and conversions, and logic gate truth tables. Search terms: “Boolean,” “Karnaugh,” “flip-flop,” “state machine,” “truth table.” The flip-flop characteristic tables are especially useful—memorizing all four types under pressure is error-prone, so verify against the handbook.
Computer Networks
Covers the OSI and TCP/IP protocol layer models, IP addressing and subnetting, routing fundamentals, error detection (CRC, checksums), and network performance metrics (throughput, latency, utilization). Search terms: “OSI,” “subnet,” “TCP,” “routing,” “CRC,” “throughput.”
Computer Architecture
Contains CPU performance metrics (CPI, MIPS, Amdahl’s law, speedup), cache design equations (hit rate, miss penalty, average memory access time), pipeline performance, and memory hierarchy concepts. Search terms: “Amdahl,” “cache,” “hit rate,” “pipeline,” “CPI,” “speedup.”
Software Engineering
Includes algorithmic complexity notation (Big-O), software development lifecycle models, testing methodologies (unit, integration, system, acceptance), UML diagram types, and software metrics. Search terms: “Big-O,” “complexity,” “testing,” “lifecycle,” “UML.” This section tends to be more conceptual, but the complexity tables are useful reference material.
Embedded Systems
Covers interrupt handling priorities and mechanisms, timing analysis, real-time scheduling (rate monotonic, earliest deadline first), I/O interfaces, and bus protocols. Search terms: “interrupt,” “real-time,” “scheduling,” “rate monotonic,” “bus protocol,” “timing.”
Cybersecurity
Contains encryption algorithm descriptions (AES, RSA, DES), hash function properties (SHA, MD5), public key infrastructure concepts, authentication protocols, and common vulnerability classifications. Search terms: “AES,” “RSA,” “hash,” “encryption,” “authentication,” “public key.”
Quick Navigation Cheat Sheet
Memorize which section to open for each question type. When a question asks about any of these topics, you should be able to open the correct handbook section within seconds:
- Thevenin/Norton equivalent? → Circuit Analysis
- Op-amp gain or transistor model? → Electronics
- Laplace or z-transform pair? → Signal Processing
- Stability criterion or root locus? → Control Systems
- Modulation bandwidth or channel capacity? → Communications
- Transmission line or Maxwell’s equations? → Electromagnetics
- Boolean algebra or flip-flop table? → Digital Systems
- Subnetting or protocol layers? → Computer Networks
- Cache hit rate or Amdahl’s law? → Computer Architecture
- Big-O complexity or testing methods? → Software Engineering
- Interrupt priority or real-time scheduling? → Embedded Systems
- Encryption algorithm or hash function? → Cybersecurity
Search Strategies for Each Topic Area
Effective searching means choosing the right keywords. Here are field-tested strategies for the most common question types across the 12 PE Computer Engineering topic areas.
Circuit Analysis. When a question gives you a circuit and asks for voltage, current, or power, first identify the method: is it a simple Ohm’s law problem, a network theorem problem, or a frequency-domain problem? For Thevenin/Norton problems, search “Thevenin” directly. For resonance, search “resonant” or “quality factor.” For AC impedance, search the specific component type: “capacitive reactance” or “inductive reactance.”
Signal Processing. Transform table lookups are the most common reason to open this section. If you need a Laplace transform pair, search the function name: “unit step,” “exponential,” “ramp,” or “sinusoidal.” For filter design, search the filter type: “Butterworth” or “Chebyshev.” For sampling questions, search “Nyquist” or “sampling theorem.”
Control Systems. Most control questions tell you what method to use. If the question mentions stability, search “Routh” for the Routh-Hurwitz array or “Nyquist” for the Nyquist criterion. For root locus, search “root locus rules” to find the construction guidelines. For steady-state error, search “error constant” or “system type.”
Digital Systems. For Boolean simplification, search “Boolean” to find the identities table. For sequential circuits, search the specific flip-flop type: “JK flip-flop” or “D flip-flop.” For number conversions, search “binary” or “hexadecimal.”
Computer Architecture. Performance questions almost always use a specific metric. Search “Amdahl” for speedup problems, “average memory access” for cache problems, or “CPI” for instruction throughput calculations. These terms are distinctive enough to produce clean search results.
Electromagnetics. Transmission line problems are the most common EM questions. Search “characteristic impedance” for lossless line equations, “reflection coefficient” for mismatch calculations, or “VSWR” for standing wave problems. For field theory, search “Maxwell” to find all four equations.
Which Formulas Should You Memorize vs. Look Up?
The handbook contains most formulas you will need, but looking up every single formula is too slow. The goal is to memorize formulas you will use repeatedly and save lookup time for less common references.
Memorize vs. Look Up
Memorize these – you will use them on many questions:
- Ohm’s law and power: \(V = IR\), \(P = IV\), \(P = I^{2}R\), \(P = V^{2}/R\)
- Kirchhoff’s laws: \(\sum V = 0\) (KVL), \(\sum I = 0\) (KCL)
- Impedance: \(Z_C = \dfrac{1}{j\omega C}\), \(Z_L = j\omega L\), \(Z_R = R\)
- Resonant frequency: \(f_0 = \dfrac{1}{2\pi\sqrt{LC}}\)
- Op-amp gain (inverting): \(A_v = -\dfrac{R_f}{R_i}\), (non-inverting): \(A_v = 1 + \dfrac{R_f}{R_i}\)
- Boolean identities: De Morgan’s, complement, absorption
- Shannon capacity: \(C = B\log_{2}(1 + \text{SNR})\)
- Amdahl’s law: \(S = \dfrac{1}{(1-f) + f/n}\)
- Sampling theorem: \(f_s \geq 2f_{max}\)
- Voltage divider: \(V_{out} = V_{in} \cdot \dfrac{R_2}{R_1 + R_2}\)
Look these up – they are too specific to memorize reliably:
- Laplace and z-transform pair tables (dozens of entries)
- Routh-Hurwitz array construction rules and special cases
- Root locus construction rules (angle of departure, breakaway points)
- Specific transistor small-signal model parameters
- Butterworth and Chebyshev filter order equations
- Transmission line equations for lossy lines
- Bit error rate formulas for specific modulation schemes
- Encryption algorithm details (key sizes, block sizes, round counts)
- Rate monotonic and earliest deadline first scheduling criteria
- OSI layer details and protocol assignments
The dividing line is frequency of use. If you will apply a formula on 10 or more questions, memorize it. If it appears on one or two questions per exam, know where to find it and look it up when needed.
Key PE Computer Engineering Formulas – Quick Reference
These are the core computer engineering formulas that appear most frequently on the PE Computer Engineering exam. Having them committed to memory means you can solve problems immediately without opening the handbook.
Circuit Analysis:
\[V = IR \qquad Z = R + jX \qquad f_0 = \frac{1}{2\pi\sqrt{LC}} \qquad Q = \frac{f_0}{BW}\]Op-Amp Configurations:
\[A_{inv} = -\frac{R_f}{R_i} \qquad A_{non} = 1 + \frac{R_f}{R_i} \qquad \text{GBW} = A_v \cdot f_{3dB}\]Signal Processing:
\[f_s \geq 2f_{max} \qquad X(f) = \int_{-\infty}^{\infty} x(t)\,e^{-j2\pi ft}\,dt\]Control Systems:
\[T(s) = \frac{G(s)}{1 + G(s)H(s)} \qquad e_{ss} = \lim_{s \to 0} \frac{sR(s)}{1 + G(s)H(s)}\]Communications:
\[C = B\log_2(1 + \text{SNR}) \qquad BW_{FM} \approx 2(\Delta f + f_m)\]Electromagnetics:
\[Z_0 = \sqrt{\frac{L}{C}} \qquad \Gamma = \frac{Z_L - Z_0}{Z_L + Z_0} \qquad \text{VSWR} = \frac{1 + |\Gamma|}{1 - |\Gamma|}\]Computer Architecture:
\[S = \frac{1}{(1-f) + f/n} \qquad T_{avg} = t_{hit} + m \cdot t_{penalty}\]Digital Systems:
\[\overline{A \cdot B} = \overline{A} + \overline{B} \qquad \overline{A + B} = \overline{A} \cdot \overline{B}\]Time Management with Reference Navigation
With 85 questions in 8.5 hours of testing time, you have an average of 6 minutes per question. That sounds generous, but complex calculation problems can consume 10 to 15 minutes, which means you need to solve straightforward problems in 3 to 4 minutes to stay on pace. Every unnecessary reference lookup eats into that margin.
First pass: answer what you know. Go through all 85 questions on your first pass, answering every question you can solve without opening the handbook. Problems that require only memorized formulas or conceptual knowledge should take 2 to 4 minutes each. Flag anything that requires a lookup and move on.
Second pass: targeted lookups. Return to flagged questions grouped by topic. If you have five questions that all need the Signal Processing section, open that section once and work through all five before moving to the next topic. Batching your lookups by handbook section eliminates the overhead of navigating to a new section for every question.
Know when to skip. If you have spent more than two minutes searching for a formula and have not found it, flag the question and move on. One missed question costs less than the three or four questions you could have answered in the same time. Return to skipped questions only after you have attempted everything else.
Practice realistic lookup timing. During your preparation, time your reference lookups. Your target is under 30 seconds for any formula or table value. If you consistently need more than a minute to find something, you do not know the handbook structure well enough. Spend dedicated time studying the table of contents and section organization.
Avoid These Reference Search Mistakes
- Opening the wrong section. Searching for “transfer function” in Digital Systems when it lives in Control Systems wastes time and produces zero results. Identify the topic area before you open a section.
- Searching for overly generic terms. Searching “equation” or “formula” will match dozens of results. Use specific terms: “Routh” instead of “stability,” “Amdahl” instead of “speedup,” “Carson” instead of “bandwidth.”
- Not practicing with the handbook before exam day. Download the free NCEES PE Computer Engineering Reference Handbook from ncees.org and practice finding formulas under time pressure. Seeing the handbook for the first time during the exam is a guaranteed time sink.
- Spending too long on a single lookup. If you cannot find a formula within two minutes, flag the question and move on. You can always return later. Do not let one difficult lookup derail your pacing for the entire exam.
- Forgetting the on-screen calculator limitations. The exam calculator is basic. Plan your calculation approach before punching numbers. Write intermediate results on your scratch material to avoid re-entering long expressions.
How to Practice Before Exam Day
- Download the NCEES PE Computer Engineering Reference Handbook. It is available as a free PDF from ncees.org. Open it in a PDF reader and practice finding specific formulas by topic. Time yourself: pick a formula at random and try to locate it in under 30 seconds.
- Study the table of contents until you can recite the section order from memory. Knowing that Control Systems comes after Signal Processing, or that Computer Architecture follows Computer Networks, lets you jump to the right section without reading the table of contents during the exam.
- Do timed formula lookups. Write a list of 30 common formulas across all 12 topics. Shuffle the list and time yourself finding each one in the handbook. Track your times and repeat until you consistently finish each lookup in under 30 seconds.
- Practice with the on-screen calculator. The Pearson VUE calculator is simpler than a physical scientific calculator. Practice multi-step calculations using only a basic calculator to build comfort with the interface and identify where you need to write intermediate results on scratch paper.
- Take full-length practice exams using only the handbook. Do not use textbooks, online searches, or personal notes. Restrict yourself to the NCEES handbook and a basic calculator. This builds realistic lookup habits and exposes gaps in your reference navigation before they cost you on the real exam.
The single biggest improvement most candidates can make is dedicating two weeks to deliberate reference navigation practice. Engineers who can find any formula in under 30 seconds have an enormous time advantage over those who need two or three minutes per lookup. Over 85 questions, that difference adds up to an hour or more of recovered testing time.
Frequently Asked Questions
What reference materials are provided on the PE Computer Engineering exam?
NCEES provides the PE Computer Engineering Reference Handbook as a searchable PDF on the exam computer. Unlike the PE Power exam, there are no additional industry codes or external standards. The handbook contains all formulas, tables, and reference data you are allowed to use during the exam.
Can you use Ctrl+F to search the PE Computer Engineering reference handbook during the exam?
Yes. The exam PDF viewer supports Ctrl+F searching within the section you currently have open. You navigate to the correct section first, then use the search function within it. Learning effective search keywords for each topic area is essential for fast lookups.
What are the most important sections of the PE Computer Engineering reference handbook?
The most frequently referenced sections cover circuit analysis (network theorems, AC/DC formulas), signal processing (transform tables, filter equations), control systems (Routh-Hurwitz, root locus rules), digital systems (Boolean algebra, flip-flop tables), and electronics (transistor models, op-amp configurations). These five areas account for the majority of reference lookups during the exam.
Should I memorize formulas or rely on the PE Computer Engineering reference handbook?
Memorize high-frequency formulas you will use on many questions: Ohm’s law, Kirchhoff’s laws, basic filter equations, Boolean algebra identities, and common transform pairs. Look up less common formulas like specific Laplace transform pairs, detailed transistor model parameters, transmission line equations, and protocol-specific details. The goal is to minimize reference lookups to under 30 seconds each.
How is the PE Computer Engineering exam different from PE Power in terms of reference materials?
The PE Computer Engineering exam provides only the NCEES PE Computer Engineering Reference Handbook. Unlike the PE Power exam, which includes six additional industry codes (NEC, NESC, NFPA 70E, etc.), the PE Computer Engineering exam has a single reference document. This means less time switching between documents but more emphasis on knowing the handbook’s internal structure thoroughly.
PE Computer Engineering Study Guide • FE Handbook Navigation Guide • ✅ Exam Day Checklist • FE vs PE Exam
Disclaimer: This guide is an independent educational resource and is not affiliated with, endorsed by, or sponsored by NCEES. The “PE” exam and “NCEES” are trademarks of the National Council of Examiners for Engineering and Surveying. Exam specifications, reference documents, and editions are subject to change; always refer to the official NCEES website for the most current information.
Ready to Start Practicing?
Build your reference navigation skills with realistic PE Computer Engineering practice questions. Our question bank covers all 12 exam topics with detailed explanations, so you can practice the formulas and concepts you will face on exam day.