ACtE

Computer Engineering

10 chapters, 100 questions for 100 marks in 120 minutes. how the exam works

read the free notes →
  1. chapter 1 · AExE01 · 10 questions · 10 marks

    Concept of Basic Electrical and Electronics Engineering

    1. AExE0101
      Basic concept

      Ohm´s law, electric voltage current, power and energy, conducting and insulating materials. Series and parallel electric circuits, start-delta and delta-star conversion, Kirchhoff’s law, linear and non-linear circuit, bilateral and unilateral circuits, active and passive circuits.

    2. AExE0102
      Network theorems

      concept of superposition theorem, Thevenin`s theorem, Norton`s theorem, maximum power transfer theorem. R-L, R-C, R-L-C circuits, resonance in AC series and parallel circuit, active and reactive power.

    3. AExE0103
      Alternating current fundamentals

      Principle of generation of alternating voltages and currents and their equations and waveforms, average, peak and rms values, three phase system.

    4. AExE0104
      Semiconductor devices

      Semiconductor diode and its characteristics, BJT Configuration and biasing, small and large signal model, working principle and application of MOSFET and CMOS.

    5. AExE0105
      Signal generator

      Basic Principles of Oscillator, RC, LC and Crystal Oscillators Circuits. Waveform generators.

    6. AExE0106
      Amplifiers

      Classification of Output Stages, Class A Output Stage, Class B Output Stage, Class AB Output Stage, Biasing the Class AB Stage, Power BJTs, Transformer-Coupled Push-Pull Stages, and Tuned Amplifiers, op-amps.

  2. chapter 2 · AExE02 · 10 questions · 10 marks

    Digital Logic and Microprocessor

    1. AExE0201
      Digital logic

      Number Systems, Logic Levels, Logic Gates, Boolean algebra, Sum-of-Products Method, Product-of-Sums Method, Truth Table to Karnaugh Map.

    2. AExE0202
      Combinational and arithmetic circuits

      Multiplexetures, Demultiplexetures, Decoder, Encoder, Binary Addition, Binary Subtraction, operation on Unsigned and Signed Binary Numbers.

    3. AExE0203
      Sequential logic circuit

      RS Flip-Flops, Gated Flip-Flops, Edge Triggered Flip-Flops, Mater- Slave Flip-Flops. Types of Registers, Applications of Shift Registers, Asynchronous Counters, Synchronous Counters.

    4. AExE0204
      Microprocessor

      Internal Architecture and Features of microprocessor, Assembly Language Programming.

    5. AExE0205
      Microprocessor system

      Memory Device Classification and Hierarchy, Interfacing I/O and Memory Parallel Interface. Introduction to Programmable Peripheral Interface (PPI), Serial Interface, Synchronous and Asynchronous Transmission, Serial Interface Standards. Introduction to Direct Memory Access (DMA) and DMA Controllers.

    6. AExE0206
      Interrupt operations

      Interrupt, Interrupt Service Routine, and Interrupt Processing.

  3. chapter 3 · ACtE03 · 10 questions · 10 marks

    Programming Language and Its Applications

    1. ACtE0301
      Introduction to C programming

      C Tokens, Operators, Formatted/Unformatted Input/output, Control Statements, Looping, User-defined functions, Recursive functions, Array (1-D, 2-D, Multi- dimensional), and String manipulations.

    2. ACtE0302
      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, and Sequential and Random Access to File.

    3. ACtE0303
      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 Function, Constructor and its type, and 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.

    4. ACtE0304
      Features of object-oriented programming

      Operator overloading (unary, binary), data conversion, Inheritance (single, multiple, multilevel, hybrid, multipath), constructor/destructor in single/multilevel inheritances.

    5. ACtE0305
      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.

    6. ACtE0306
      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. chapter 4 · ACtE04 · 10 questions · 10 marks

    Computer Organization and Embedded System

    1. ACtE0401
      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.

    2. ACtE0402
      Computer arithmetic and memory system

      Arithmetic and Logical operation, 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.

    3. ACtE0403
      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. ACtE0404
      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.

    5. ACtE0405
      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.

    6. ACtE0406
      Hardware descripts language and IC technology

      VHDL Overview, Overflow and data representation using VHDL. Design of combinational and sequential logic using VHDL. Pipelining using VHDL.

  5. chapter 5 · ACtE05 · 10 questions · 10 marks

    Concept of Computer Network and Network Security System

    1. ACtE0501
      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) and Transmission media.

    2. ACtE0502
      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), CSMA/CD, Wireless LANs, PPP (Point to Point Protocol), Wide area protocols.

    3. ACtE0503
      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) Routing Protocols (ARP, RARP, IP, ICMP), and IPv6 (Packet formats, Extension headers, Transition from IPv4 to IPv6, and Multicasting).

    4. ACtE0504
      Transport layer

      The transport service, Transport protocols, Port and Socket, Connection establishment & Connection release, Flow control & buffering, Multiplexing & de-multiplexing, Congestion control algorithm.

    5. ACtE0505
      Application layer

      Web (HTTP & HTTPS), File Transfer (FTP, PuTTY, Win SCP), Electronic Mail, DNS, P2P Applications, Socket Programming, Application server concept, and Concept of traffic analyzer (MRTG, PRTG, SNMP, Packet tracer, Wireshark).

    6. ACtE0506
      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. chapter 6 · ACtE06 · 10 questions · 10 marks

    Theory of Computation and Computer Graphics

    1. ACtE0601
      Introduction to finite automata

      Introduction to Finite Automata and Finite State Machine, Equivalence of DFA and NDFA, Minimization of Finite State Machines, Regular Expressions, Equivalence of Regular Expression and Finite Automata, Pumping lemma for regular language.

    2. ACtE0602
      Introduction to context free language

      Introduction to Context Free Grammar (CFG), Derivative trees (Bottom-up and Top-down approach, Leftmost and Rightmost, 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, and Properties of context free Language.

    3. ACtE0603
      Turing machine

      Introduction to Turing Machines (TM), Notations of Turing Machine, Acceptance of a string by a Turing Machines, Turing Machine as a Language Recognizer, Turing Machine as a Computing Function, Turing Machine as a enumerator of stings of a language, Turing Machine with Multiple Tracks, Turing Machine with Multiple Tapes, Non-Deterministic Turing Machines, Curch Turing Thesis, Universal Turing Machine for encoding of Turing Machine, Computational Complexity, Time and Space complexity of A Turing Machine, Intractability, Reducibility.

    4. ACtE0604
      Introduction of computer graphics

      Overview of Computer Graphics, Graphics Hardware (Display Technology, Architecture of Raster-Scan Displays, Vector Displays, Display Processors, output device and Input Devices), Graphics Software and Software standards.

    5. ACtE0605
      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. ACtE0606
      Three-dimensional transformation

      Three-dimensional translation, rotation, scaling, reflection, shear transformation, 3D composite transformation, 3D viewing pipeline, projection concepts (Orthographic, parallel, perspective projection).

  7. chapter 7 · ACtE07 · 10 questions · 10 marks

    Data Structures and Algorithm, Database System and Operating System

    1. ACtE0701
      Introduction to data structure, list, linked lists and trees

      data types, data structures and abstract data types; time and space analysis of algorithms (Big oh, omega and theta notations), Linear data structure (Stack and queue implementation); Stack application: infix to postfix conversion, and evaluation of postfix expression, Array implementation of lists; Stack and Queues as list; and Static list structure, Static and dynamic list structure; Dynamic implementation of linked list; Types of Linked list: Singly Linked list, Doubly Linked list, and Circular Linked list; Basic operations on Linked list: creation of linked list, insertion of node in different positions, and deletion of nodes from different positions; Doubly linked lists and its applications, Concept of Tree, Operation in Binary tree, Tree search, insertion/deletions in Binary Tree, Tree traversals (pre-order, post-order and in-order), Height, level and depth of a tree, AVL balanced trees.

    2. ACtE0702
      Sorting, searching, and graphs

      types of sorting: internal and external; Insertion and selection sort; Exchange sort; Merge and Redix sort; Shell sort; Heap sort as a priority queue; Big ‘O’ notation and Efficiency of sorting; Search technique; Sequential search, Binary search and Tree search; General search tree; Hashing: Hash function and hash tables, and Collision resolution technique, Undirected and Directed Graphs, Representation of Graph, Transitive closure of graph, Warshall’s algorithm, Depth First Traversal and Breadth First Traversal of Graph, Topological sorting (Depth first, Breadth first topological sorting), Minimum spanning trees ( Prim’s, Kruskal’s and Round- Robin algorithms), Shortest-path algorithm (Greedy algorithm, and Dijkstra’s Algorithm).

    3. ACtE0703
      Introduction to data models, normalization, and SQL

      Data Abstraction and Data Independence, Schema and Instances, E-R Model, Strong and Weak Entity Sets, Attributes and Keys, and E-R Diagram, Different Normal Forms (1st, 2nd, 3rd, BCNF), Functional Dependencies, Integrity Constraints and Domain Constraints, Relations (Joined, Derived), Queries under DDL and DML Commands, Views, Assertions and Triggering, Relational Algebra, Query Cost Estimation, Query Operations, Evaluation of Expressions, Query Optimization, and Query Decomposition.

    4. ACtE0704
      Transaction processing, concurrency control and crash recovery

      ACID properties, Concurrent Executions, Serializability Concept, Lock based Protocols, Deadlock handling and Prevention, Failure Classification, Recovery and Atomicity, and Log-based Recovery.

    5. ACtE0705
      Introduction to Operating System and process management

      Evolution of Operating System, Type of Operating System, Operating System Components, Operating System Structure, Operating System Services, Introduction to Process, Process description, Process states, Process control, Threads, Processes and Threads, and Types of scheduling, Principles of Concurrency, Critical Region, Race Condition, Mutual Exclusion, Semaphores and Mutex, Message Passing, Monitors, and Classical Problems of Synchronization.

    6. ACtE0706
      Memory management, file systems and system administration

      Memory address, Swapping and Managing Free Memory Space, Virtual Memory Management, Demand Paging, Performance, and Page Replacement Algorithms, introduction to File, Directory and File Paths, File System Implementation, Impact of Allocation Policy on Fragmentation, Mapping File Blocks on The Disk Platter, File System Performance, Administration Tasks, User Account Management, Start and Shutdown Procedures.

  8. chapter 8 · ACtE08 · 10 questions · 10 marks

    Software Engineering and Object-Oriented Analysis & Design

    1. ACtE0801
      Software process and requirements

      Software characteristics, Software quality attributes, Software process model (Agile Model, V-Model, Iterative Model, Prototype Model, and Big Bang Model), Computer-aided software engineering, Functional and non –functional requirements, User requirements, System requirement, Interface specification, The software requirements documents, Requirement’s elicitation and analysis, and Requirement’s validation and management.

    2. ACtE0802
      Software design

      Design process, Design Concepts, Design Mode, Design Heuristic, 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.

    3. ACtE0803
      Software testing, cost estimation, quality management, and configuration management

      Unit Testing, Integration testing, System testing, Component testing, Acceptance Testing, Test case design, Test automation, Metrics for testing, Algorithmic cost modeling, Project duration and staffing, Software quality assurance, Formal technical reviews, Formal approaches to SQA, Statistical software quality assurance, A framework for software metrics, Matrices for analysis and design model, ISO standards, CMMI, SQA plan, Configuration management planning, Change management, Version and release management, and CASE tools for configuration management.

    4. ACtE0804
      Object-oriented fundamentals and analysis

      Defining Models, Requirement Process, Use Cases, Object Oriented Development Cycle, Unified Modeling Language, Building Conceptual Model, Adding Associations and Attributes, and Representation of System Behavior.

    5. ACtE0805
      Object-oriented design

      Analysis to Design, Describing and Elaborating Use Cases, Collaboration Diagram, Objects and Patterns, Determining Visibility, and Class Diagram.

    6. ACtE0806
      Object-oriented design implementation

      Programming and Development Process, Mapping Design to Code, Creating Class Definitions, from Design Class Diagrams, Creating Methods from Collaboration Diagram, Updating Class Definitions, Classes in Code, and Exception and Error Handling.

  9. chapter 9 · ACtE09 · 10 questions · 10 marks

    Artificial Intelligence and Neural Networks

    1. ACtE0901
      Introduction to AI and intelligent agent

      Concept of Artificial Intelligence, AI Perspectives, History of AI, Applications of AI, Foundations of AI, Introduction of agents, Structure of Intelligent agent, Properties of Intelligent Agents, PEAS description of Agents, Types of Agents: Simple Reflexive, Model Based, Goal Based, Utility Based; and Environment Types: Deterministic, Stochastic, Static, Dynamic, Observable, Semi-observable, Single Agent, Multi Agent.

    2. ACtE0902
      Problem solving and searching techniques

      Definition, Problem as a state space search, Problem formulation, 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, Adversarial search techniques, Mini-max Search, and Alpha- Beta Pruning.

    3. ACtE0903
      Knowledge representation

      Knowledge representations and Mappings, Approaches to Knowledge Representation, Issues in Knowledge Representation, Semantic Nets, 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), Bayes' Rule and its use, Bayesian Networks, and Reasoning in Belief Networks.

    4. ACtE0904
      Expert system and natural language processing

      Expert Systems, Architecture of an expert system, Knowledge acquisition, Declarative knowledge vs Procedural knowledge, Development of Expert Systems, Natural Language Processing Terminology, Natural Language Understanding and Natural Language Generation, Steps of Natural Language Processing, Applications of NLP, NLP Challenges, Machine Vision Concepts, Machine Vision Stages, and Robotics.

    5. ACtE0905
      Machine learning

      Introduction to Machine Learning, Concepts of Learning, Supervised, Unsupervised and Reinforcement Learning, Inductive learning (Decision Tree), Statistical-based Learning (Naive Bayes Model), Fuzzy learning, Fuzzy Inferences System, Fuzzy Inference Methods, Genetic Algorithm (Genetic Algorithm Operators, Genetic Algorithm Encoding, Selection Algorithms, Fitness function, and Genetic Algorithm Parameters).

    6. ACtE0906
      Neural networks

      Biological Neural Networks Vs. Artificial Neural Networks (ANN), McCulloch- Pitts Neuron, Mathematical Model of ANN, Activation functions, Architectures of Neural Networks, The Perceptron, The Learning Rate, Gradient Descent, The Delta Rule, Hebbian learning, Adaline network, Multilayer Perceptron Neural Networks, Backpropagation Algorithm, Hopfield Neural Network.

  10. chapter 10 · AALL10 · 10 questions · 10 marks

    Project Planning, Design and Implementation

    1. AALL1001
      Engineering drawings and its concepts

      Fundamentals of standard drawing sheets, dimensions, scale, line diagram, orthographic projection, isometric projection/view, pictorial views, and sectional drawing.

    2. AALL1002
      Engineering Economics

      understanding of 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.

    3. AALL1003
      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.

    4. AALL1004
      Project management

      Information system; project risk analysis and management; project financing, tender and its process, and contract management.

    5. AALL1005
      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).

    6. AALL1006
      Engineering Regulatory Body

      Nepal Engineering Council (Acts & Regulations). (AALL1006) Full Course Available on PANA ACADEMY 9851420233 / 9851342670 / 9808100083 panaacademy.com.

always check the latest syllabus on the official Nepal Engineering Council website (nec.gov.np).

prepare for ACtE, chapter by chapter.

a free account adds practice questions for every topic above, mock tests in the real exam pattern and a study plan up to your exam day.

create free account →