Official Syllabus & Preparation Blueprint

Computer Engineering License Exam

Comprehensive chapter breakdown, official curriculum topics, and high-yield practice questions for the Nepal Engineering Council (NEC) Computer Engineering license exam.

Exam Duration120 Mins

Total Questions80 MCQs

Total Marks100 Marks

Pass Threshold50% (50 Marks)

Discipline Overview & Council Guidelines

The NEC Computer Engineering licensure examination evaluates candidates on foundational computing sciences, hardware architecture, software lifecycle development, networks, systems, and professional ethics under the Nepal Engineering Council Act 2055. The test contains 80 objective multiple-choice questions totaling 100 marks.

Official Chapter Breakdown & Weightage

Basic Electrical and Electronics Engineering

10 Marks

Fundamental DC and AC circuit laws, semiconductor physics, diodes, bipolar junction transistors, and operational amplifiers.

Ohm's Law, Kirchhoff's Laws (KCL & KVL), Thevenin's and Norton's Theorems

AC Fundamentals: Peak, RMS, Average values, and Three-Phase systems

Semiconductor diodes, Zener diodes, Rectifiers and Voltage regulators

Bipolar Junction Transistors (BJT) biasing and Amplifiers

Operational Amplifiers (Op-Amps) and basic signal conditioning circuits

Digital Logic and Microprocessor

10 Marks

Boolean algebra, combinational and sequential circuit design, 8085/8086 microprocessor architectures, and instruction sets.

Number systems, Boolean algebra, Karnaugh Maps (K-maps)

Combinational circuits: Multiplexers, Decoders, Adders, Subtractors

Sequential circuits: Flip-Flops (SR, JK, D, T), Counters, and Shift Registers

8085 Microprocessor architecture, bus organization, and pin configuration

Instruction sets, addressing modes, interrupts, and timing diagrams

Programming Language and Applications

10 Marks

Structured programming principles in C, Object-Oriented paradigms in C++, memory management, pointers, and file operations.

Data types, control structures, loops, and conditional branching

Functions, recursion, parameter passing (by value vs by reference)

Pointers, dynamic memory allocation (malloc, calloc, free)

OOP principles: Classes, Objects, Inheritance, Polymorphism, and Encapsulation

Templates, exception handling, and file stream input/output

Computer Organization and Embedded Systems

10 Marks

CPU architecture, pipelining, memory hierarchy, cache mapping, embedded microcontrollers, and interface protocols.

Von Neumann vs Harvard architectures, register transfer logic

Instruction pipeline hazards (data, structural, control hazards)

Memory hierarchy: Cache memory, direct vs associative mapping, virtual memory

Microcontrollers (8051, AVR, ARM), GPIO, timers, and interrupts

Serial communication protocols: UART, SPI, and I2C

Computer Networks and Network Security

10 Marks

OSI and TCP/IP protocol stacks, subnetting, routing algorithms, transport layer protocols, and cryptography principles.

OSI 7-layer reference model and TCP/IP protocol suite comparison

IPv4 and IPv6 addressing, CIDR, VLSM subnetting calculations

Routing algorithms: Distance Vector (RIP), Link State (OSPF), BGP

TCP three-way handshake, flow control, congestion control vs UDP

Symmetric vs Asymmetric cryptography (AES, RSA), Firewalls, and SSL/TLS

Theory of Computation and Computer Graphics

10 Marks

Automata theory, regular expressions, context-free grammars, Turing machines, 2D/3D transformations, and rendering algorithms.

DFA, NFA, Regular expressions, and Pumping Lemma

Context-Free Grammars (CFG) and Pushdown Automata (PDA)

Turing Machines and decidability

Line drawing algorithms: DDA and Bresenham's algorithm

2D/3D geometric transformations: Translation, Rotation, Scaling, and Shearing

Data Structures, Database, and Operating Systems

10 Marks

Linear and non-linear data structures, relational database normalization, indexing, CPU scheduling, and process synchronization.

Arrays, Linked Lists, Stacks, Queues, Binary Trees, and Graphs

Searching and sorting algorithms (QuickSort, MergeSort, Binary Search)

Relational Algebra, SQL queries, and Normalization (1NF, 2NF, 3NF, BCNF)

Process scheduling algorithms: FCFS, SJF, Round Robin, Priority Scheduling

Deadlock conditions, prevention, avoidance (Banker's Algorithm), and detection

Software Engineering and OOAD

10 Marks

Software development life cycle models, Agile methodologies, UML diagramming, design patterns, and software testing.

SDLC Models: Waterfall, Spiral, V-Model, and Agile Scrum framework

Requirement engineering: Functional vs Non-functional requirements

Unified Modeling Language (UML): Class diagrams, Use Case diagrams, Sequence diagrams

Design Patterns: Creational, Structural, and Behavioral patterns

Software testing methodologies: White-box, Black-box, Unit, and Integration testing

Artificial Intelligence and Neural Networks

10 Marks

Heuristic search strategies, knowledge representation, propositional logic, supervised machine learning, and artificial neural networks.

Search algorithms: BFS, DFS, A* search, and Heuristic functions

Adversarial search: Minimax algorithm and Alpha-Beta pruning

Propositional logic, First-Order Predicate Logic (FOPL), and resolution

Supervised vs Unsupervised learning, linear regression, classification

Perceptron model, Multi-Layer Perceptron (MLP), Backpropagation algorithm

Project Planning, Design, and Ethics

10 Marks

Project management techniques (CPM/PERT), procurement bylaws, engineering liability, and the Nepal Engineering Council Act 2055.

Project lifecycle, feasibility analysis, and cost-benefit analysis

Network scheduling: Critical Path Method (CPM) and PERT analysis

Public Procurement Act of Nepal and tendering procedures

Nepal Engineering Council Act 2055 and code of professional ethics

Professional liability, occupational health, safety, and dispute resolution

Download Full Syllabus PDF →

Sample Model Questions & Step-by-Step Solutions

Practice representative questions modeled after actual council examination standards.

Sample Question 1

In the 8085 microprocessor, how many machine cycles are executed for the 'MVI A, 32H' instruction?

A.1 Machine Cycle

B.2 Machine Cycles

C.3 Machine Cycles

D.4 Machine Cycles

Correct Answer: 2 Machine Cycles

Explanation: The instruction 'MVI A, 32H' takes 2 machine cycles (7 T-states total): 1 Opcode Fetch machine cycle (4 T-states) to decode the instruction, and 1 Memory Read machine cycle (3 T-states) to read the immediate operand 32H from memory.

Sample Question 2

Which normal form eliminates partial functional dependency on the primary key in relational database design?

A.First Normal Form (1NF)

B.Second Normal Form (2NF)

C.Third Normal Form (3NF)

D.Boyce-Codd Normal Form (BCNF)

Correct Answer: Second Normal Form (2NF)

Explanation: A relation is in 2NF if it is already in 1NF and every non-prime attribute is fully functionally dependent on the primary key, meaning partial dependencies on any candidate key are completely eliminated.

Sample Question 3

What is the time complexity of the Dijkstra shortest path algorithm when implemented with a min-priority queue (binary heap)?

A.O(V²)

B.O(V + E)

C.O((V + E) log V)

D.O(E log V)

Correct Answer: O((V + E) log V)

Explanation: Using a binary heap, extracting the minimum takes O(log V) per vertex (O(V log V) total), and edge relaxation updates take O(log V) per edge (O(E log V) total), yielding O((V + E) log V).

Sample Question 4

Under the Nepal Engineering Council Act 2055, which of the following is considered a primary violation of the professional code of ethics?

A.Charging consultation fees approved by standard norms

B.Signing off on designs without thorough technical verification

C.Applying for patents on novel inventions

D.Attending continuing professional development seminars

Correct Answer: Signing off on designs without thorough technical verification

Explanation: The NEC Code of Ethics strictly mandates that registered engineers only endorse, stamp, or sign engineering documents that they have personally supervised, thoroughly audited, or verified for safety and regulatory compliance.

Frequently Asked Questions (Computer Engineering)

What is the examination pattern for Computer Engineering in the NEC license exam?

The exam is a 2-hour Computer-Based Test (CBT) consisting of 80 multiple-choice questions (60 1-mark questions and 20 2-mark questions) totaling 100 marks. The passing threshold is 50 marks (50%), and there is no negative marking.

Are questions in the NEC exam purely theoretical or numerical?

The 1-mark questions are predominantly conceptual and theoretical (definitions, architectural pinouts, protocol layers). The 2-mark questions test analytical problems, such as subnetting calculations, K-map simplifications, pipeline cycle computations, and algorithm complexities.

How important is Chapter 10 (Ethics and Project Planning)?

Chapter 10 carries 10 marks and appears in every discipline. It covers CPM/PERT network diagrams, contract management, and Nepal Engineering Council bylaws. Mastering these concepts is essential for reaching the 50-mark pass threshold.