Computer Engineering — NEC Registration Examination Syllabus
1. Concept of Basic Electrical and Electronics Engineering
1.1 Basic Concept: Ohm’s law, electric voltage, current, power, and energy. Conducting and insulating materials. Series and parallel electric circuits. Star-delta and delta-star conversion. Kirchhoff’s law. Linear and non-linear circuits. Bilateral and unilateral circuits. Active and passive circuits.
1.2 Network Theorems: Superposition theorem, Thevenin’s theorem, Norton’s theorem, and maximum power transfer theorem. R-L, R-C, and R-L-C circuits. Resonance in AC series and parallel circuits. Active and reactive power.
1.3 Alternating Current Fundamentals: Principle of alternating voltage and current generation, equations, and waveforms. Average, peak, and RMS values. Three-phase systems.
1.4 Semiconductor Devices: Semiconductor diode and its characteristics. BJT configuration and biasing, small and large signal model. Working principles and applications of MOSFET and CMOS.
1.5 Signal Generator: Basic principles of waveform generators. Oscillators: RC, LC, and Crystal Oscillators.
1.6 Amplifiers: Classification of output stages: Class A, Class B, and Class AB stages. Biasing, power BJTs, transformer-coupled push-pull stages, tuned amplifiers, and op-amps.
2. Digital Logic and Microprocessor
2.1 Digital Logic: Number systems, logic levels, logic gates, Boolean algebra. Sum-of-products and product-of-sums methods. Truth tables and Karnaugh maps.
2.2 Combinational and Arithmetic Circuits: Multiplexers, demultiplexers, decoders, and encoders. Binary addition and subtraction. Operations on signed and unsigned binary numbers.
2.3 Sequential Logic Circuits: RS flip-flops, gated flip-flops, edge-triggered flip-flops, and master-slave flip-flops. Types of registers and applications of registers. Asynchronous and synchronous counters.
2.4 Microprocessor: Internal architecture and features. Assembly language programming.
2.5 Microprocessor System: Memory device classification and hierarchy. Interfacing I/O and memory parallel interfaces. Introduction to PPI, serial interfaces, synchronous/asynchronous transmission, and DMA controllers.
2.6 Interrupt Operations: Interrupts, interrupt service routines, and interrupt processing.
3. Programming Language and Its Applications
3.1 Introduction to C Programming: C Tokens, Operators; Formatted/Unformatted Input/Output; Control Statements, Looping; User-defined Functions, Recursive Functions; Array (1-D, 2-D, Multidimensional), and String Manipulations
3.2 Pointers, Structure, and Data Files in C Programming: Pointer Arithmetic, Pointer and Array; Passing Pointer to Function; Structure vs Union, Array of Structure; Passing Structure to Function, Structure and Pointer; Input/Output Operations on Files; Sequential and Random Access to File
3.3 C++ Language Constructs with Objects and Classes: Namespace, Function Overloading; Inline Functions, Default Argument; Pass/Return by Reference; Introduction to Class and Object, Access Specifiers; Objects and the Member Access; Defining Member Functions, Constructor and Its Type, Destructor; Dynamic Memory Allocation for Objects and Object Array; This Pointer, Static Data Member and Static Function; Constant Member Functions and Constant Objects; Friend Function and Friend Classes
3.4 Features of Object-Oriented Programming: Operator Overloading (Unary, Binary), Data Conversion; Inheritance (Single, Multiple, Multilevel, Hybrid, Multipath); Constructor/Destructor in Single/Multilevel Inheritances
3.5 Pure Virtual Function and File Handling: Virtual Function, Dynamic Binding; Defining, Opening, and Closing a File; Input/Output Operations on Files; Error Handling During Input/Output Operations; Stream Class Hierarchy for Console Input/Output; Unformatted Input/Output; Formatted Input/Output with ios Member Functions and Flags; Formatting with Manipulators
3.6 Generic Programming and Exception Handling: Function Template, Overloading Function Template; Class Template, Function Definition of Class Template; Standard Template Library (Containers, Algorithms, Iterators); Exception Handling Constructs (try, catch, throw); Multiple Exception Handling, Rethrowing Exception; Catching All Exceptions, Exception with Arguments; Exceptions Specification for Function; Handling Uncaught and Unexpected Exceptions
4. Computer Organization and Embedded System
4.1 Control and Central Processing Units: Control Memory, Addressing Sequencing; Computer Configuration, Microinstruction Format; Design of Control Unit, CPU Structure and Function; Arithmetic and Logic Unit; Instruction Formats, Addressing Modes; Data Transfer and Manipulation; RISC and CISC; Pipelining, Parallel Processing
4.2 Computer Arithmetic and Memory System: Arithmetic and Logical Operations; The Memory Hierarchy; Internal and External Memory; Cache Memory Principles; Elements of Cache Design: Cache Size, Mapping Function, Replacement Algorithm, Write Policy, Number of Caches, Memory Write Ability, and Storage Permanence; Composing Memory
4.3 Input-Output Organization and Multiprocessor: Peripheral Devices, I/O Modules; Input-output Interface; Modes of Transfer: Direct Memory Access; Characteristics of Multiprocessors; Interconnection Structure, Inter-Processor Communication and Synchronization
4.4 Hardware-Software Design Issues on Embedded System: Embedded Systems Overview; Classification of Embedded Systems; Custom Single-Purpose Processor Design; Optimizing Custom Single-Purpose Processors; Basic Architecture, Operation, and Programmer’s View; Development Environment; Application-Specific Instruction-Set Processors
4.5 Real-Time Operating and Control System: Operating System Basics: Task, Process, and Threads; Multiprocessing and Multitasking; Task Scheduling, Task Synchronization; Device Drivers; Open-loop and Close-loop Control System Overview, Control
4.6 Hardware Description Language and IC Technology: VHDL Overview; Overflow and Data Representation Using VHDL; Design of Combinational and Sequential Logic Using VHDL; Pipelining Using VHDL
5. Concept of Computer Network and Network Security System
5.1 Introduction to Computer Networks and Physical Layer: Networking Model, Protocols and Standards; OSI Model and TCP/IP Model; Networking Devices (Hubs, Bridges, Switches, and Routers); Transmission Media
5.2 Data Link Layer: Services, Error Detection and Corrections, Flow Control; Data Link Protocol; Multiple Access Protocols; LAN Addressing and ARP (Address Resolution Protocol); Ethernet, IEEE 802.3 (Ethernet), 802.4 (Token Bus), 802.5 (Token Ring), PPP (Point to Point Protocol); CSMA/CD; IEEE 802.3 Standard; Wireless LANs
5.3 Network Layer: Addressing (Internet Address, Classful Address), Subnetting; Routing Protocols (RIP, OSPF, BGP, Unicast and Multicast Routing Protocols); Routing Algorithms (Shortest Path Algorithm, Flooding, Distance Vector Routing, Link State Routing); Network Layer Protocols: ARP, RARP, IP, and ICMP; IPv6 (Packet Formats, Extension Headers, Transition from IPv4 to IPv6, Multicasting)
5.4 Transport Layer: The Transport Service, Transport Protocols; Port and Socket, Connection Establishment & Connection Release; Flow Control & Buffering, Multiplexing & De-multiplexing; Congestion Control Algorithm
5.5 Application Layer: Web (HTTP & HTTPS), File Transfer (FTP, PuTTY, Win SCP); Electronic Mail, DNS, P2P Applications; Socket Programming, Application Server Concept; Concept of Traffic Analyzer (MRTG, PRTG, SNMP, Packet Tracer, Wireshark)
5.6 Network Security: Types of Computer Security, Types of Security Attacks; Principles of Cryptography, RSA Algorithm; Digital Signatures, Securing E-mail (PGP); Securing TCP Connections (SSL), Network Layer Security (IPsec, VPN); Securing Wireless LANs (WEP), Firewalls
6. Theory of Computation and Computer Graphics
6.1 Introduction to Finite Automata: Introduction to Finite Automata and Finite State Machines; Equivalence of DFA and NDFA; Minimization of Finite State Machines; Regular Expressions; Equivalence of Regular Expression and Finite Automata; Pumping Lemma for Regular Language
6.2 Introduction to Context-Free Language: Introduction to Context-Free Grammar (CFG); Derivative Trees (Bottom-up and Top-down Approach, Leftmost and Rightmost Derivation); Language of a Grammar; Parse Tree and its Construction; Ambiguous Grammar; Chomsky Normal Form (CNF), Greibach Normal Form (GNF), Backus-Naur Form (BNF); Push Down Automata; Equivalence of Context-Free Language and PDA; Pumping Lemma for Context-Free Language; Properties of Context-Free Language
6.3 Turing Machine: Introduction to Turing Machines (TM); Notations of Turing Machine; Acceptance of a String by a Turing Machine; Turing Machine as a Language Recognizer; Turing Machine as a Computing Function; Turing Machine as an Enumerator of Strings of a Language; Turing Machine with Multiple Tracks; Turing Machine with Multiple Tapes; Non-Deterministic Turing Machines; Church-Turing Thesis; Universal Turing Machine for Encoding of Turing Machines; Computational Complexity, Time and Space Complexity of a Turing Machine; Intractability, Reducibility
6.4 Introduction to Computer Graphics: Overview of Computer Graphics; Graphics Hardware (Display Technology, Architecture of Raster-Scan Displays, Vector Displays, Display Processors, Output and Input Devices); Graphics Software and Software Standards
6.5 Two-Dimensional Transformation: Two-Dimensional Translation, Rotation, Scaling, Reflection, Shear Transformation; 2D Composite Transformation; 2D Viewing Pipeline; World to Screen Viewing Transformation and Clipping (Cohen-Sutherland Line Clipping, Liang-Barsky Line Clipping)
6.6 Three-Dimensional Transformation: Three-Dimensional Translation, Rotation, Scaling, Reflection, Shear Transformation; 3D Composite Transformation; 3D Viewing Pipeline; Projection Concepts (Orthographic, Parallel, Perspective Projection)
7. Data Structures and Algorithm, Database System and Operating System
7.1 Introduction to Data Structures, Lists, Linked Lists, and Trees: Data Types, Data Structures, and Abstract Data Types (ADT); Time and Space Complexity Analysis of Algorithms: Big-O, Omega, and Theta Notations; Linear Data Structures: Stack and Queue Implementation; Stack Applications: Infix to Postfix Conversion, Evaluation of Postfix Expressions; Array Implementation of Lists; Stack and Queues as Lists; Static List Structures, Static vs Dynamic List Structures; Dynamic Implementation of Linked List; Types of Linked Lists: Singly Linked List, Doubly Linked List, Circular Linked List; Basic Operations on Linked Lists: Creation, Insertion, Deletion of Nodes at Different Positions; Doubly Linked Lists and Their Applications; Tree: Binary Tree Operations: Search, Insertion, Deletion; Tree Traversals: Pre-order, In-order, Post-order; Height, Level, and Depth of a Tree; AVL Balanced Trees
7.2 Sorting, Searching, and Graphs: Types of Sorting: Internal and External Sorting; Insertion Sort, Selection Sort, Exchange Sort; Merge Sort, Radix Sort, Shell Sort, Heap Sort (as a Priority Queue); Big-O Notation and Efficiency of Sorting; Searching Techniques: Sequential Search, Binary Search, Tree Search; General Search Trees, Hashing: Hash Function and Hash Tables, Collision Resolution Techniques; Graph Concepts: Undirected and Directed Graphs; Graph Representation and Transitive Closure of Graph; Warshall’s Algorithm; Graph Traversal Techniques: Depth First Traversal, Breadth First Traversal; Topological Sorting: Depth First, Breadth First Topological Sorting; Minimum Spanning Trees: Prim’s, Kruskal’s, and Round-Robin Algorithms; Shortest-Path Algorithms: Greedy Algorithm, Dijkstra’s Algorithm
7.3 Introduction to Data Models, Normalization, and SQL: Data Abstraction and Data Independence; Schema and Instances; Entity-Relationship (E-R) Model: Strong and Weak Entity Sets, Attributes and Keys; E-R Diagram; Normalization: Different Normal Forms (1st, 2nd, 3rd, BCNF); Functional Dependencies, Integrity Constraints, and Domain Constraints; Relational Databases: Relations (Joined, Derived); DDL and DML Commands: Queries, Views, Assertions, Triggers; Relational Algebra and Query Optimization: Query Cost Estimation and Query Operations; Evaluation of Expressions and Query Decomposition
7.4 Transaction Processing, Concurrency Control, and Crash Recovery: ACID Properties; Concurrency in Databases: Concurrent Executions, Serializability; Lock-based Protocols, Deadlock Handling and Prevention; Failure Classification, Recovery, and Atomicity; Log-based Recovery
7.5 Introduction to Operating Systems and Process Management: Evolution of Operating Systems; Types and Components of Operating Systems: Operating System Structure and Services; Introduction to Processes: Process Description, States, Control; Threads and Process-Thread Relationships; Scheduling and Concurrency: Types of Scheduling, Principles of Concurrency; Critical Region, Race Condition, Mutual Exclusion; Semaphores, Mutex, Message Passing, Monitors; Classical Synchronization Problems
7.6 Memory Management, File Systems, and System Administration: Memory Management: Memory Addresses, Swapping, Free Memory Space Management; Virtual Memory Management, Demand Paging, Page Replacement Algorithms; File Systems: File, Directory, File Paths, File System Implementation; Impact of Allocation Policy on Fragmentation; File System Performance and Mapping File Blocks on the Disk Platter; System Administration Tasks: User Account Management, System Startup and Shutdown Procedures
8. Software Engineering and Object-Oriented Analysis & Design
8.1 Software Process and Requirements: Software Characteristics and Quality Attributes; Software Process Models: Agile Model, V-Model, Iterative Model, Prototype Model, Big Bang Model; Computer-Aided Software Engineering (CASE); Requirements Engineering: Functional and Non-Functional Requirements; User Requirements, System Requirements, Interface Specification; The Software Requirements Document; Requirements Elicitation, Analysis, Validation, and Management
8.2 Software Design: Design Process and Concepts: Design Mode, Design Heuristics; Architectural Design Decisions; System Organization: Modular Decomposition Styles, Control Styles; Reference Architectures, Multiprocessor Architecture; Client-Server Architectures, Distributed Object Architectures; Inter-Organizational Distributed Computing; Real-Time Software Design and Component-Based Software Engineering
8.3 Software Testing, Cost Estimation, Quality Management, and Configuration Management: Software Testing: Unit Testing, Integration Testing, System Testing, Component Testing, Acceptance Testing; Test Case Design, Test Automation; Metrics for Testing; Cost Estimation and Quality Management: Algorithmic Cost Modeling, Project Duration and Staffing; Software Quality Assurance (SQA); Formal Technical Reviews, Formal Approaches to SQA; Statistical Software Quality Assurance, Framework for Software Metrics; ISO Standards, CMMI, SQA Plan; Configuration Management: Change Management, Version and Release Management; CASE Tools for Configuration Management
8.4 Object-Oriented Fundamentals and Analysis: Defining Models and Requirement Process; Use Cases; Object-Oriented Development Cycle; Unified Modeling Language (UML); Building Conceptual Models: Adding Associations and Attributes; Representation of System Behavior
8.5 Object-Oriented Design: From Analysis to Design: Describing and Elaborating Use Cases; Collaboration Diagrams; Objects and Patterns; Determining Visibility; Class Diagrams
8.6 Object-Oriented Design Implementation: Programming and Development Process: Mapping Design to Code; Creating Class Definitions from Design Class Diagrams; Creating Methods from Collaboration Diagrams; Updating Class Definitions, Classes in Code; Exception and Error Handling
9. Artificial Intelligence and Neural Networks
9.1 Introduction to AI and Intelligent Agent: Concept of Artificial Intelligence (AI); AI Perspectives; History of AI and Applications; Foundations of AI; Introduction to Agents: Structure of Intelligent Agent; Properties of Intelligent Agents; PEAS Description of Agents; Types of Agents: Simple Reflexive, Model-Based, Goal-Based, Utility-Based; Environment Types: Deterministic, Stochastic, Static, Dynamic, Observable, Semi-observable, Single Agent, Multi-Agent
9.2 Problem Solving and Searching Techniques: Problem Formulation and State Space Search: Well-defined Problems, Constraint Satisfaction Problem; Uninformed Search Techniques: Depth First Search, Breadth First Search, Depth Limited Search, Iterative Deepening Search, Bidirectional Search; Informed Search: Greedy Best First Search, A* Search, Hill Climbing, Simulated Annealing; Game Playing and Adversarial Search: Mini-max Search, Alpha-Beta Pruning
9.3 Knowledge Representation: Knowledge Representation and Mappings: Approaches to Knowledge Representation; Issues in Knowledge Representation; Semantic Nets and Frames; Propositional Logic (PL): Syntax, Semantics, Formal Logic-Connectives, Tautology, Validity, Well-Formed Formula, Inference Using Resolution; Predicate Logic (FOPL): Syntax, Semantics, Quantification, Rules of Inference, Unification, Resolution Refutation System; Bayesian Networks: Bayes' Rule, Reasoning in Belief Networks
9.4 Expert Systems and Natural Language Processing: Expert Systems: Architecture of Expert Systems, Knowledge Acquisition, Declarative vs Procedural Knowledge, Development of Expert Systems; Natural Language Processing (NLP): Terminology, Natural Language Understanding and Generation, Steps of NLP; Applications and Challenges of NLP; Machine Vision and Robotics: Concepts, Stages of Machine Vision, Robotics
9.5 Machine Learning: Introduction to Machine Learning; Learning Concepts: Supervised, Unsupervised, and Reinforcement Learning; Types of Learning: Inductive Learning (Decision Tree), Statistical-Based Learning (Naive Bayes Model), Fuzzy Learning; Fuzzy Inference System and Methods; Genetic Algorithm: Genetic Algorithm Operators, Encoding, Selection Algorithms, Fitness Function, and Genetic Algorithm Parameters
9.6 Neural Networks: Biological vs. Artificial Neural Networks (ANN); McCulloch-Pitts Neuron and Mathematical Model of ANN; Activation Functions; Neural Network Architectures: Perceptron, Learning Rate, Gradient Descent, Delta Rule, Hebbian Learning; Adaline Network, Multilayer Perceptron Neural Networks, Backpropagation Algorithm, Hopfield Neural Network
10. Project Planning, Design and Implementation
10.1 Engineering Drawings and Its Concepts: Fundamentals of Standard Drawing Sheets; Dimensions, Scale, Line Diagram; Orthographic Projection; Isometric Projection/View; Pictorial Views and Sectional Drawing
10.2 Engineering Economics: Understanding Project Cash Flow; Discount Rate, Interest, and Time Value of Money; Basic Methodologies for Engineering Economics Analysis: Discounted Payback Period, NPV, IRR & MARR; Comparison of Alternatives; Depreciation System and Taxation System in Nepal
10.3 Project Planning and Scheduling: Project Classifications; Project Life Cycle Phases; Project Planning Process; Project Scheduling: Bar Chart, CPM, PERT; Resources Levelling and Smoothing; Monitoring/Evaluation/Controlling
10.4 Project Management: Information System; Project Risk Analysis and Management; Project Financing; Tender Process and Contract Management
10.5 Engineering Professional Practice: Environment and Society; Professional Ethics; Regulatory Environment; Contemporary Issues/Problems in Engineering; Occupational Health and Safety; Roles/Responsibilities of Nepal Engineers Association (NEA)
10.6 Engineering Regulatory Body: Nepal Engineering Council (Acts & Regulations)