100+ Free CPE II Practice Questions

Pass your CPN Computer Professional Examination Level II exam on the first try — instant access, no signup required.

✓ No registration✓ No credit card✓ No hidden fees✓ Start practicing immediately

~60% Pass Rate

100+ Questions

100% Free

Loading practice questions...

Same family resources

Explore More Computer Professionals Registration Council of Nigeria (CPN)

Continue into nearby exams from the same family. Each card keeps practice questions, study guides, flashcards, videos, and articles in one place.

2026 Statistics

Key Facts: CPE II Exam

100

Total Questions

CPN CPE Syllabus

3 hours

Exam Time Limit

CPN Examination Rules

₦37,700+

Total Registration Fee

CPN official portal

Syllabus Modules

CPE Level II Syllabus

50%

Passing Mark

CPN Examination Council

CBT

Exam Format

Computer Professionals Council

The CPN CPE Level II exam features 100 questions, a 3-hour limit, and costs between ₦37,700 and ₦47,700. It is a key step to becoming a chartered IT professional in Nigeria, assessing systems programming, data structures, DBMS, NOS, digital electronics, and systems analysis and design.

Sample CPE II Practice Questions

Try these sample questions to test your CPE II exam readiness. Each question includes a detailed explanation. Start the interactive quiz above for the full 100+ question experience with AI tutoring.

1In systems programming, what is the primary difference between a pass-1 assembler and a pass-2 assembler?

A.Pass-1 defines symbols and builds the symbol table, while pass-2 generates machine code.

B.Pass-1 resolves forward references, while pass-2 defines external references.

C.Pass-1 parses high-level language tokens, while pass-2 performs code optimization.

D.Pass-1 allocates memory segments, while pass-2 loads the object file into RAM.

Explanation: A two-pass assembler divides the task of translating assembly to machine code into two phases. The first pass (pass-1) scans the source code to identify labels and symbols, assigning them memory addresses and storing them in a symbol table. The second pass (pass-2) reads the source code again and uses the symbol table to translate mnemonic opcodes and symbolic operands into binary machine instructions and generate the object program.

2Which of the following is a primary function of a linkage editor (linker) in a system compilation environment?

A.Translating assembly language code directly into binary machine instructions.

B.Combining multiple object files and resolving external references into a single executable module.

C.Allocating memory space in RAM and loading the binary program for immediate execution.

D.Converting source code into intermediate representations and optimizing loop branches.

Explanation: The linkage editor, or linker, takes one or more object files generated by a compiler or assembler, along with system libraries, and merges them into a single, cohesive executable file. Its core tasks include relocation (allocating relative addresses to code segments) and resolution (binding symbolic references between different modules, such as function calls or variable definitions).

3What is the role of a relocation register in a dynamic loading and memory management scheme?

A.To hold the physical address of the page table root in virtual memory configurations.

B.To store the size of the logical address space and raise exceptions on out-of-bounds access.

C.To hold the base physical address of the process, which is added to every logical address at execution time.

D.To map file system directory descriptors to internal kernel stream structures.

Explanation: A relocation register (often called a base register) is a hardware register that stores the base physical memory address of the currently running process. Every logical address generated by the CPU is dynamically mapped to a physical address by adding the value of the relocation register. This allows processes to be loaded into any arbitrary region of physical memory without modifying the internal logical references of the compiled binary.

4During the compilation process, which phase is responsible for checking that the structure of the token sequence conforms to the grammar rules of the programming language?

A.Lexical Analysis

B.Syntax Analysis (Parsing)

C.Semantic Analysis

D.Code Optimization

Explanation: Syntax Analysis, or parsing, takes the flat sequence of tokens generated by the lexical analyzer and verifies if they form valid grammatical expressions according to the language's context-free grammar. It constructs a parse tree (or abstract syntax tree) that models the hierarchical structure of the program statements. If the tokens violate the language's grammatical rules, the parser reports syntax errors.

5Which of the following loader schemes leaves the task of address allocation and reference resolution until the program is loaded into memory for execution?

A.Absolute Loader

B.Direct-Linking Loader (Relocating Loader)

C.Linkage Editor

D.Bootstrap Loader

Explanation: A relocating loader (or direct-linking loader) performs relocation and linking at load time. The object program contains relocation bits and modification records that instruct the loader which instruction addresses need to be updated based on where the process is actually loaded in physical memory. This allows object files to be relocated to different starting addresses dynamically.

6What is a major advantage of using dynamic linking libraries (DLLs / Shared Libraries) over static libraries?

A.Dynamic linking reduces the CPU overhead during library function calls.

B.Shared libraries decrease the size of the executable file and save physical RAM by sharing code pages.

C.Dynamic linking guarantees that the program will run even if the target library file is deleted.

D.Shared libraries eliminate the need for virtual-to-physical address translation.

Explanation: Dynamic linking allows multiple programs to share a single copy of a library on disk and in memory. Instead of copying library code into every executable (static linking), the loader maps the library code pages into the virtual memory spaces of active processes, which reduces disk usage and saves physical memory. Additionally, library updates can be deployed without recompiling the applications that depend on them.

7Which of the following assembly language concepts describes a single instruction symbol that is expanded into multiple assembly language instructions during assembling?

A.Directive (Pseudo-instruction)

B.Macro

C.Subroutine (Procedure)

D.Interrupt Vector

Explanation: A macro is a sequence of instructions that is defined once and can be invoked using a single mnemonic symbol. During the assembly process, the assembler's macro processor replaces each macro invocation with its corresponding body of instructions (macro expansion). Unlike subroutines, macros do not involve execution runtime jumps (like CALL/RET); instead, they simply expand the source code inline.

8Which table is created and maintained by a lexical analyzer to store identifiers and their associated attributes?

A.Parse Table

B.Symbol Table

C.Activation Record

D.Page Directory

Explanation: The symbol table is a central data structure used by compilers and assemblers to keep track of identifiers (variables, functions, classes, labels) and their properties (type, scope, memory offset, value). While the lexical analyzer inserts new identifiers into the symbol table, subsequent compiler phases (syntax analysis, semantic analysis, code generation) continuously query and update it.

9What is the purpose of the 'Relocation Bit' included in the object code format of a relocating assembler?

A.To signal if an instruction contains a memory address that must be modified when loaded into RAM.

B.To represent the parity bit used to verify binary code integrity.

C.To specify whether a subroutine should be executed in kernel mode or user mode.

D.To identify the start address of the execution entry point.

Explanation: Relocation bits are flags added to instructions in the object code by the assembler. They tell the relocating loader whether a particular address field in an instruction refers to a relocatable address (which must be adjusted by adding the base loading address of the program) or an absolute address (which must remain unchanged). This mechanism enables code relocation at load time.

10In compilation, which optimization technique involves replacing a slow, high-level operation with an equivalent faster, lower-level operation?

A.Dead-code Elimination

B.Strength Reduction

C.Loop Unrolling

D.Constant Folding

Explanation: Strength reduction is a compiler optimization technique that replaces mathematically expensive operations with cheaper ones. For example, replacing a multiplication operation ($x * 2$) with an addition ($x + x$) or a bitwise left shift ($x << 1$), or replacing exponentiation with iterative multiplication. This improves execution speed without altering the output.

About the CPE II Exam

The CPN Computer Professional Examination Level II (CPE II) is an intermediate professional certification for computer and IT professionals in Nigeria. It validates advanced competency equivalent to an HND/BSc academic degree in key IT disciplines, including Systems Programming, Data Structures and Algorithms, Database Management Systems, Network Operating Systems, Digital Electronics, and Systems Analysis and Design. Passing this exam qualifies candidates for advanced grades of CPN membership.

Assessment

100 multiple-choice questions

Time Limit

3 hours

Passing Score

50%

Exam Fee

₦37,700 - ₦47,700 (Computer Professionals (Registration Council of Nigeria) (CPN))

CPE II Exam Content Outline

15%

Systems Programming

Assembly language, memory layout, system calls, utility programs, linkers, loaders, macro-processors, and compiler phases.

20%

Data Structures and Algorithms

Complexity (Big O), lists, stacks, queues, trees (BST, AVL), graphs, searching/sorting algorithms, and space-time trade-offs.

15%

Database Management Systems

Entity-Relationship (ER) model, SQL (DDL, DML), 1NF/2NF/3NF/BCNF normalization, transaction ACID properties, and indexing.

15%

Network Operating Systems

Kernel architecture, process synchronization, deadlock handling, networking models (OSI/TCP-IP), socket programming, and directory services.

15%

Digital Electronics

Karnaugh maps, multiplexers, decoders, latches, flip-flops (SR, JK, D, T), registers, counters, and micro-operation execution.

20%

Systems Analysis and Design

SDLC (Waterfall, Agile), feasibility types, data flow diagrams (DFD), UML diagrams, object-oriented design, and testing types.

How to Pass the CPE II Exam

What You Need to Know

Passing score: 50%
Assessment: 100 multiple-choice questions
Time limit: 3 hours
Exam fee: ₦37,700 - ₦47,700

Keys to Passing

Complete 500+ practice questions
Score 80%+ consistently before scheduling
Focus on highest-weighted sections
Use our AI tutor for tough concepts

CPE II Study Tips from Top Performers

1Practice drawing Karnaugh maps and simplifying boolean expressions for Digital Electronics.

2Understand standard SQL operations (joins, subqueries, group by) and normalization up to BCNF for DBMS.

3Be comfortable tracing code and analyzing standard algorithms (e.g., binary search, quicksort, merge sort) and their Big O complexities.

4Study low-level memory allocation, segment registers, and the differences between pass-1 and pass-2 macro assemblers in Systems Programming.

5Revise SDLC models, requirements gathering methods, and how to read/construct UML class and sequence diagrams for Systems Analysis and Design.

6Review OS process scheduling algorithms (Round Robin, SRTF) and synchronization problems (Bounded Buffer, Dining Philosophers).

Frequently Asked Questions

What is the CPN CPE Level II certification?

The Computer Professional Examination Level II (CPE II) is a professional certification conducted by the Computer Professionals (Registration Council of Nigeria). It measures intermediate and advanced technical knowledge across software, hardware, networking, and system design, serving as a pathway to chartered IT status in Nigeria.

Who is eligible to write the CPN CPE II exam?

Eligibility requires a Credit pass in the CPE I exam or a relevant degree or Higher Diploma (HND) in Computer Science, Information Technology, or related disciplines from a CPN-accredited institution.

What subjects are tested in CPN CPE Level II?

The exam tests six core areas: Systems Programming, Data Structures and Algorithms, Database Management Systems, Network Operating Systems, Digital Electronics, and Systems Analysis and Design.

How much does the CPN CPE Level II exam cost in Nigeria?

The total cost ranges from approximately ₦37,700 to ₦47,700, which includes registration, exam form fees, and course/subject fees paid through exams.cpnreg.ng via Remita.

What is the passing mark for the CPN CPE exams?

The general passing requirement is 50% in each subject module. Candidates must pass all core subject modules to be awarded the CPE Level II Certificate.

100+ Free CPE II Practice Questions

Explore More Computer Professionals Registration Council of Nigeria (CPN)

CPN Computer Foundation Examination (CFE) (Nigeria)

CPN Computer Literacy Examination (Nigeria)

CPN Computer Professional Examination Level I (CPE I) (Nigeria)

CPN Computer Professional Examination Level III (CPE III) (Nigeria)

CPN CPE — Computer Engineering (CEN) Track (Nigeria)

CPN CPE — Computer Information Systems (CIS) Track (Nigeria)