NEC Computer Engineering License Exam Syllabus: Chapter-Wise Guide

Mastering the Nepal Engineering Council (NEC) licensing examination begins with an intimate understanding of the official Computer Engineering syllabus (ACtE).

The examination covers 10 chapters that synthesize fundamental electrical engineering, hardware architectures, software engineering principles, and professional practices.

This guide provides an authoritative structural breakdown, detailing the Group mark distributions, chapter scope, and direct learning resources for each subject area.

[!TIP] Self-Revision Companion: Looking for an actionable topic-by-topic self-assessment checklist with formula reminders and priority tiers? Explore our dedicated companion guide: NEC Computer Engineering Syllabus: Chapter-Wise Revision Checklist.

---

1. Official Syllabus Structure & Marks Distribution

The Nepal Engineering Council categorizes the 10 examination chapters into three distinct thematic groups totaling 100 objective marks:

---

2. Group A: Fundamental Engineering (Chapters 1 & 2)

Group A assesses core electrical, electronics, and digital fundamentals that underpin all modern computing systems.

Chapter 1: Basic Electrical and Electronics Engineering

• Circuit Analysis: Ohm’s law, Kirchhoff’s laws (KCL/KVL), Mesh and Nodal analysis, Thevenin and Norton theorems.
• AC Circuits: Sinusoidal waveforms, impedance, power factor, resonance in RLC circuits.
• Semiconductor Devices: PN junctions, Zener diodes, BJTs, MOSFETs, and operational amplifiers.
• Direct Resource: Study concise formulas in Fast Track Chapter 1 and solve Chapter 1 Practice Questions.

Chapter 2: Digital Logic and Microprocessors

• Combinational Circuits: Boolean algebra, Karnaugh maps (K-maps), multiplexers, decoders, and arithmetic units.
• Sequential Circuits: Latches, flip-flops (SR, JK, D, T), counters, and shift registers.
• Microprocessor Architecture: 8085 and 8086 architectures, instruction sets, addressing modes, and bus structures.
• Direct Resource: Study concise formulas in Fast Track Chapter 2 and solve Chapter 2 Practice Questions.

---

3. Group B: Core Computing & Software (Chapters 3 to 9)

Group B carries the highest concentration of questions and covers technical computer engineering specializations.

Chapter 3: Object-Oriented Programming (C++) & Data Structures

• OOP Principles: Classes, objects, inheritance, polymorphism, encapsulation, and virtual functions.
• Linear Data Structures: Arrays, linked lists, stacks, and queues with time/space complexity analysis.
• Non-Linear Data Structures: Binary trees, AVL trees, B-trees, heaps, and graph traversals (BFS, DFS).
• Direct Resource: Study concise formulas in Fast Track Chapter 3 and solve Chapter 3 Practice Questions.

Chapter 4: Computer Architecture and Organization

• Processor Design: Instruction formats, ALU design, control unit (hardwired vs microprogrammed).
• Memory Hierarchy: Cache memory mapping (direct, associative, set-associative), virtual memory, TLB.
• Pipelining: Pipeline hazards (structural, data, control), branch prediction, superscalar processing.
• Direct Resource: Study concise formulas in Fast Track Chapter 4 and solve Chapter 4 Practice Questions.

Chapter 5: Operating Systems & System Programming

• Process Management: CPU scheduling algorithms (FCFS, SJF, Round Robin, Priority), context switching.
• Deadlocks: Conditions for deadlock, prevention, avoidance (Banker's Algorithm), and recovery.
• Memory Management: Paging, segmentation, page replacement algorithms (FIFO, LRU, Optimal).
• Direct Resource: Study concise formulas in Fast Track Chapter 5 and solve Chapter 5 Practice Questions.

Chapter 6: Database Management Systems (DBMS)

• Data Models & SQL: ER diagrams, relational model, SQL queries, joins, views, and aggregate functions.
• Normalization: Functional dependencies, 1NF, 2NF, 3NF, BCNF.
• Transaction Processing: ACID properties, serializability, two-phase locking (2PL), recovery techniques.
• Direct Resource: Study concise formulas in Fast Track Chapter 6 and solve Chapter 6 Practice Questions.

Chapter 7: Computer Networks & Network Security

• Protocols & Layers: OSI model vs TCP/IP model, data link protocols (CSMA/CD, Ethernet), IPv4/IPv6 addressing and subnetting.
• Routing: Distance vector, link state (OSPF, RIP, BGP).
• Security: Public/private key cryptography, RSA, AES, firewalls, SSL/TLS, and common attacks.
• Direct Resource: Study concise formulas in Fast Track Chapter 7 and solve Chapter 7 Practice Questions.

Chapter 8: Software Engineering & Object-Oriented Analysis

• Process Models: Waterfall, Spiral, Agile (Scrum), and V-Model.
• Requirements & Design: UML diagrams (use case, class, sequence, activity), design patterns.
• Testing: Black box vs white box testing, unit testing, integration testing, regression testing.
• Direct Resource: Study concise formulas in Fast Track Chapter 8 and solve Chapter 8 Practice Questions.

Chapter 9: Artificial Intelligence & Neural Networks

• Search Techniques: Breadth-first, depth-first, A* search, heuristic evaluation.
• Machine Learning & Neural Nets: Perceptrons, multi-layer networks, backpropagation, activation functions.
• Direct Resource: Study concise formulas in Fast Track Chapter 9 and solve Chapter 9 Practice Questions.

---

4. Group C: Management & Ethics (Chapter 10)

Chapter 10: Project Management, Engineering Economics & Professional Ethics

• Project Planning: Work Breakdown Structure (WBS), Gantt charts, CPM and PERT network scheduling (critical path identification, float calculation).
• Engineering Economics: Present worth, future worth, rate of return, depreciation methods, cost-benefit analysis.
• Procurement & Ethics: Public Procurement Act (PPA) concepts, contract types, NEC code of ethics, and engineer liability.
• Direct Resource: Study concise formulas in Fast Track Chapter 10 and solve Chapter 10 Practice Questions.

---

5. Next Steps for Preparation

Review the full syllabus outline on our Official Syllabus Page, or jump straight into a simulated 100-Question Mock Test to evaluate your current baseline.