Computer Engineering MCQ for NEC Licence and Lok Sewa: Free Mock Test

Computer Engineering MCQ: NEC Licence and Lok Sewa

162 questions with answers. Mock tests, practice by topic and progress tracking.

Chapter

Sub-section

Level

Number of questions

Question navigator:

Free practice by EngineeringNepal.com.np. Questions are written and checked by our team; always confirm the current exam format in the official notice.

Computer engineering MCQ: what this set covers

This question bank is for computer engineering graduates preparing for the Nepal Engineering Council (NEC) registration exam, Lok Sewa Aayog and provincial Public Service Commission computer engineer posts, and written IT tests at public bodies and banks. Every question has four options, a marked answer and a short explanation. Numerical questions, such as subnetting or cache timing, show the working step by step.

Our team writes and checks the questions. Questions based on past exam topics are reworded, not copied. Always confirm the format in the official notice for your exam.

How the NEC computer engineering licence exam works

The NEC syllabus for computer engineering (ACtE) has 10 chapters, each split into 6 sub-sections, giving 60 sub-sections in total. Chapter 10, Project planning, design and implementation, is common to all engineering branches. The model question sets NEC published in November 2025 contain 100 one-mark questions. Exams up to 2023 used 60 one-mark and 20 two-mark questions in 2 hours, with a pass mark of 50 percent. Always confirm the pattern in the notice for your session.

The NEC mock on this page is a timed two-hour paper that draws questions from every sub-section of all ten chapters. The Lok Sewa set is 50 questions with 20 percent negative marking. For the full chapter and sub-section list, read our NEC computer engineering syllabus (ACtE) post.

Chapters in this question bank

Concept of basic electrical and electronics engineering: circuit laws, network theorems, diodes, transistors and op-amps.
Digital logic and microprocessor: number systems, Boolean algebra, combinational and sequential circuits, 8085/8086 architecture, instructions and interrupts.
Programming language and its applications: C fundamentals, pointers, C++, object-oriented programming, templates and exception handling.
Computer organization and embedded systems: CPU design, instruction pipelines, cache and memory, I/O techniques, real-time operating systems and VHDL.
Computer networks and network security: OSI and TCP/IP models, IP addressing and subnetting, TCP and UDP, DNS and HTTP, and cryptography.
Theory of computation and computer graphics: finite automata, regular expressions, context-free grammars, Turing machines, line drawing algorithms and 2D/3D transformations.
Data structures, algorithms, databases and operating systems: lists, trees, graphs, sorting and complexity, SQL and normalization, scheduling, memory management and deadlock.
Software engineering and object-oriented analysis and design: SDLC models, testing, COCOMO estimation, UML diagrams and design patterns.
Artificial intelligence and neural networks: intelligent agents, search strategies, knowledge representation and logic, expert systems, machine learning and neural networks.
Project planning, design and implementation: practise this common chapter in engineering economics, planning and professional practice MCQ. The mock pulls chapter 10 questions from there.

How to use this page

Mock tests: take the timed NEC or Lok Sewa paper, then review every explanation.
Practice by topic: drill one chapter or sub-section, such as subnetting or SQL.
My progress: see your scores and weak chapters. Progress stays in this browser.

The bank grows over time and new questions appear automatically.

Study tips for computer engineers

Treat chapters 2, 4 and 5 as numerical chapters. Number systems, memory and cache timing, and IP addressing give many short calculations. For subnetting, know that a prefix of /n leaves 32 - n host bits and 2 to the power of those bits, minus 2, usable hosts, so a /26 gives 64 addresses and 62 usable hosts.
Learn the standard formulas by heart. Average memory access time is hit time plus miss rate times miss penalty. The 8086 physical address is segment times 16 plus offset, so segment 2000H with offset 0100H gives 20100H. Cyclomatic complexity is E - N + 2P.
Know the 8085 details that options are built on. Interrupt priority runs TRAP, RST 7.5, RST 6.5, RST 5.5, INTR, and only TRAP is non-maskable. Data transfer instructions such as MOV do not affect flags.
Memorise complexity results, including worst cases. Quick sort is O(n log n) on average but O(n squared) in the worst case; merge sort and heap sort are O(n log n) in all cases. Wrong options often quote the average case when the question asks for the worst.
Trace small C and C++ snippets on paper. Output questions test operator precedence, pre and post increment, integer division, pointer arithmetic and which function a virtual call resolves to.
Link theory of computation results to each other. Every NFA has an equivalent DFA, the pumping lemma is used to prove a language is not regular, and the halting problem is undecidable. For graphics, remember that DDA uses floating-point increments while Bresenham uses only integers.
Plan your time with negative marking in mind. With four options and 20 percent negative marking, a blind guess has a small positive expected score (0.25 - 0.75 x 0.2 = 0.1 of the question's marks), and ruling out one or two options raises it sharply. In the two-hour NEC paper, clear the quick theory questions first and return to long numericals.

Common mistakes in the computer engineering paper

Forgetting to subtract the network and broadcast addresses when counting usable hosts, or mixing up the subnet mask for /27 (255.255.255.224) and /28 (255.255.255.240).
Confusing TCP and UDP properties: TCP is connection-oriented with flow and congestion control, UDP is connectionless; DNS queries normally use UDP port 53 while HTTP runs over TCP.
Mixing up normal forms in database questions, for example calling a table 3NF when a non-key attribute depends on another non-key attribute.
Reversing memory and scheduling facts: Belady's anomaly applies to FIFO page replacement, not LRU or optimal, and SJF gives the minimum average waiting time but can starve long jobs.
Reading the COCOMO mode wrongly; basic COCOMO effort is a times KLOC to the power b, and the constants differ for organic, semi-detached and embedded projects.

Frequently asked questions

How many questions does the computer engineering bank have?

The bank starts with about 160 questions and grows every week.

Does it follow the latest NEC syllabus?

Yes. Questions are tagged to the 60 sub-sections of the current NEC ACtE syllabus.

Is it free?

Yes. All mock tests and topic practice are free, with no sign-up needed.

How does it relate to other branches?

Chapters 1 to 5 of the computer engineering syllabus are the same as in the NEC electronics and communication (AExE) syllabus, so practice in either bank helps for both. Chapter 10 is shared with every branch.