I85PREP
⌘ K
NEC Computer Engineering study materials
NEC Computer Engineering study resources

NEC Computer Engineering: Computer Engineering

NEC Computer Engineering · Work through your exam, one topic at a time.

All guide sections

Computer Engineering

Domain scope

NEC Computer Engineering questions target the consolidated core of the discipline because no official domain breakdown is published in the source. Expect fundamentals crossing hardware and software: digital logic and number systems, computer organization and architecture, data structures and algorithms, operating systems, databases, computer networks, and software engineering. The exam tests precise application of rules, not vendor-specific recall.

Core rules and concepts

  • Digital logic: use Boolean identities and K-maps to minimize; an n-bit two's complement range is -2^(n-1) to 2^(n-1)-1. Overflow occurs when same-sign operands produce an opposite-sign result.
  • Architecture: distinguish latency from throughput. Cache performance depends on locality, hit rate, hit time, and miss penalty. Pipelining improves throughput, not single-instruction latency; hazards are structural, data, or control.
  • OS: deadlock requires mutual exclusion, hold-and-wait, no preemption, and circular wait. Virtual memory maps virtual pages to physical frames through page tables; TLB misses add translation cost.
  • Networks: TCP gives a reliable, ordered byte stream with congestion control; UDP is connectionless and message-oriented. Know ARP, DNS, and CIDR roles.
  • Databases: normalize to remove update anomalies; 3NF removes transitive dependencies on non-key attributes.
  • Algorithms: state time and space complexity, and justify greedy versus dynamic programming by optimal substructure and overlapping subproblems.

Worked example

A CPU has a 1-cycle L1 hit, 5% L1 miss rate, 10-cycle L2 hit, 20% L2 miss rate, and 100-cycle memory penalty. AMAT = L1 hit time + L1 miss rate × (L2 hit time + L2 miss rate × memory penalty) = 1 + 0.05 × (10 + 0.20 × 100) = 1 + 0.05 × 30 = 2.5 cycles. Only L1 misses reach L2, and only L2 misses reach memory.

Traps

Do not confuse throughput with latency or ignore sign bits in two's complement. TCP does not preserve message boundaries. In normalization, do not stop at 2NF if transitive dependencies remain. In complexity, do not drop the base without stating it.