Latest notices:

NEC licence exam preparation, made clearer.Practice questions, syllabus guides, and timed mocks for Nepal engineers.New study resources are added regularly.

Login Sign up

Syllabus

NEC Computer · Practice

Chapters & sets

1. Basic Electrical and Electronics

Basic Electrical

Set 1106

Basic Electronics

Set 171 Set 233

2. Digital Logic and Microprocessor

Digital Logic

Set 150 Set 250 Set 350 Set 450 Set 550 Set 650 Set 749 Set 851 Set 950 Set 1050 Set 1150 Set 1232

Microprocessor

Set 150 Set 250 Set 350 Set 445 Set 550 Set 650 Set 720 Set 850 Set 969

3. Programming Language and Its Applications

Mixed chapter MCQs

Set 150 Set 249 Set 349 Set 451 Set 540

4. Computer Organization and Embedded System

Mixed chapter MCQs

Set 150 Set 249 Set 350 Set 450 Set 550 Set 650 Set 750 Set 849 Set 950 Set 1050 Set 1150

5. Concept of Computer Network and Network Security System

Basic Networking

Set 150 Set 253

Advanced Networking

Set 150 Set 250 Set 350 Set 450 Set 550 Set 655

6. Theory of Computation and Computer Graphics

Theory of Computation

Set 150 Set 250 Set 360

Computer Graphics

Set 150 Set 251 Set 350 Set 450 Set 550

7. Data Structures and Algorithm, Database System and Operating System

8. Software Engineering and Object-Oriented Analysis & Design

Mixed chapter MCQs

Set 150 Set 250 Set 350 Set 450 Set 550 Set 650 Set 750 Set 926

9. Artificial Intelligence and Neural Networks

Mixed chapter MCQs

Set 150 Set 317 Set 450 Set 550 Set 650 Set 750 Set 850 Set 932

10. Project Planning, Design and Implementation

Engineering Drawing

Set 150 Set 267

Engineering Economics

Set 168

Project Planning & Scheduling

Set 188

Project Mangement

Set 150

Engineering Professional Practice

Set 120

Engineering Regulatory Body

Set 130

MCQs ON DSA Set 2

50 questions

Question 1

What is the process of finding the location of a given item in a collection of items called?

A.
Discovering
B.
Finding
C.
Searching
D.
Mining

Question 2

50

What is the time complexity of quicksort?

A.
$O(n)$
B.
$O(\log n)$
C.
$O(n^2)$
D.
$O(n \log n)$

Question 3

What is quicksort also known as?

A.
Merge sort
B.
Tree sort
C.
Shell sort
D.
Partition and exchange sort

Question 4

What sorting method is good for alphabetizing a large list of names?

A.
Merge
B.
Heap
C.
Radix
D.
Bubble

Question 5

What is the total number of comparisons in a bubble sort?

A.
$O(n \log n)$
B.
$O(2n)$
C.
$O(n^2)$
D.
$O(n)$

Question 6

What form of access is used to add and remove nodes from a queue?

A.
LIFO, Last In First Out
B.
FIFO, First In First Out
C.
Both A and B
D.
None of these

Question 7

Enqueue is the process of ………..

A.
Removing data from queue
B.
Adding item into a queue
C.
Searching item in queue
D.
None of the above

Question 8

What is the term "push and pop" related to?

A.
Array
B.
Lists
C.
Stacks
D.
Trees

Question 9

What is an application of stack?

A.
Finding factorial
B.
Tower of Hanoi
C.
Infix to postfix
D.
All of the above

Question 10

What is the operation of processing each element in a list called?

A.
Sorting
B.
Merging
C.
Inserting
D.
Traversal

Question 11

What is the situation when in a linked list, START=NULL called?

A.
Underflow
B.
Overflow
C.
Houseful
D.
Saturated

Question 12

What are two-way lists?

A.
Grounded header list
B.
Circular header list
C.
Linked list with header and trail nodes
D.
List traversed in two directions

Question 13

What is the pointer associated with the availability list?

A.
FIRST
B.
AVAIL
C.
TOP
D.
REAR

Question 14

What data structure cannot store non-homogeneous data elements?

A.
Arrays
B.
Records
C.
Pointers
D.
Stacks

Question 15

What is a non-linear data structure?

A.
Stacks
B.
List
C.
Strings
D.
Trees

Question 16

What data structure is suitable for representing hierarchical relationships between elements?

A.
Dequeue
B.
Priority
C.
Tree
D.
Graph

Question 17

What data structure allows deletions at both ends of the list but only allows insertion at one end?

A.
Input restricted dequeue
B.
Output restricted queue
C.
Priority queues
D.
Stack

Question 18

What is the order of visiting nodes in a pre-order tree traversal?

A.
Root, Left, Right
B.
Left, Root, Right
C.
Right, Root, Left
D.
Left, Right, Root

Question 19

What is the order of visiting nodes in a post-order tree traversal?

A.
Root, Left, Right
B.
Left, Root, Right
C.
Right, Left, Root
D.
Left, Right, Root

Question 20

What is the order of visiting nodes in an in-order tree traversal?

A.
Root, Left, Right
B.
Left, Root, Right
C.
Right, Root, Left
D.
Left, Right, Root

Question 21

What is the average time complexity of searching for an element in a binary search tree?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 22

What is the worst-case time complexity of searching for an element in a binary search tree?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 23

What is the average time complexity of inserting an element into a binary search tree?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 24

In a linked list, what is the time complexity of inserting an element at the beginning of the list?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 25

What is the time complexity of deleting an element from the middle of a linked list?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 26

What is a circular linked list?

A.
A linked list where the last node points to the first node
B.
A linked list where the first node points to the last node
C.
A linked list where the last node points to the second node
D.
A linked list where the first node points to the second node

Question 27

What is a doubly linked list?

A.
A linked list where each node points to the next node
B.
A linked list where each node points to the previous node
C.
A linked list where each node points to the next and previous nodes
D.
A linked list where the first and last nodes are connected

Question 28

What is the advantage of using a doubly linked list over a singly linked list?

A.
A doubly linked list requires less memory
B.
A doubly linked list is faster for inserting and deleting elements
C.
A doubly linked list allows for traversal in both directions
D.
A doubly linked list has better cache performance

Question 29

What is the time complexity of reversing a linked list?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 30

What is the time complexity of finding an element in a binary tree?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 31

What is the time complexity of inserting an element in a binary tree?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 32

What is the time complexity of deleting an element in a binary tree?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 33

What is the time complexity of searching for the minimum element in a binary tree?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 34

What is the time complexity of searching for the maximum element in a binary tree?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 35

What is the time complexity of performing an in-order traversal of a binary tree?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 36

What is the time complexity of performing a pre-order traversal of a binary tree?

A.
$O(1)$
B.
$O(n)$
C.
$O(\log n)$
D.
$O(n \log n)$

Question 37

What is the advantage of using the array data structure among the following options?

A.
The entities of mixed type of data types can be easily stored
B.
Access to elements in the array is relatively easy
C.
The index number of the first element always starts from 1
D.
None of the above

Question 38

Which among the following is an application of the queue data structure?

A.
When a resource is shared among multiple users
B.
Load balancing
C.
Asynchronous data transfer
D.
All of the above

Question 39

Which type of data structure can be used to implement queues among the following options?

A.
Linked List
B.
Array
C.
Stack
D.
All of the above

Question 40

Which type of data structure allows for insertion and deletion from both ends?

A.
String
B.
Queue
C.
Stack
D.
Dequeue

Question 41

Which sorting algorithm is used to achieve the best time complexity in the worst-case scenario?

A.
Bubble sort
B.
Selection sort
C.
Quick sort
D.
Merge sort

Question 42

What term is used to describe the scenario when a user tries to remove an element from an empty stack?

A.
Underflow
B.
Empty collection
C.
Overflow
D.
Garbage Collection

Question 43

What is the maximum number of non-zero values that can exist in an adjacency matrix of a simple graph with

n

vertices?

A.
$\frac{n(n+1)}{2}$
B.
$\frac{n(n-1)}{2}$
C.
$n(n-1)$
D.
$n(n+1)$

Question 44

What is the time complexity of the selection sort algorithm in the best and worst cases?

A.
Best: $O(n^2)$ , Worst: $O(n)$
B.
Best: $O(n \log n)$ , Worst: $O(n^2)$
C.
Best: $O(n)$ , Worst: $O(n^2)$
D.
Best: $O(n^2)$ , Worst: $O(n^2)$

Question 45

What type of sorting algorithm is the bubble sort algorithm?

A.
Linear
B.
Non-linear
C.
Logarithmic
D.
Exponential

Question 46

What is the space complexity of the merge sort algorithm?

A.
$O(n)$
B.
$O(1)$
C.
$O(n \log n)$
D.
$O(n^2)$

Question 47

What is the time complexity of the quick sort algorithm in the average case?

A.
$O(n)$
B.
$O(n^2)$
C.
$O(n \log n)$
D.
$O(1)$

Question 48

Which sorting algorithm is used to sort linked lists?

A.
Insertion sort
B.
Quick sort
C.
Merge sort
D.
Bubble sort

Question 49

Which sorting algorithm is most efficient for small data sets?

A.
Quick sort
B.
Bubble sort
C.
Insertion sort
D.
Merge sort

Question 50

What is the time complexity of the insertion sort algorithm in the best case?

A.
$O(n^2)$
B.
$O(n \log n)$
C.
$O(n)$
D.
$O(1)$

Practice another set Take a test on this chapter →