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 3

50 questions

Question 1

What type of sorting algorithm is the radix sort algorithm?

A.
Non-comparison based
B.
Comparison based
C.
Logarithmic
D.
Exponential

Question 2

50

Which sorting algorithm is used to sort arrays in place?

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

Question 3

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

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

Question 4

The time complexity of Insertion Sort is:

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

Question 5

The time complexity of Merge Sort is:

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

Question 6

The time complexity of Quick Sort is:

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

Question 7

The time complexity of Heap Sort is:

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

Question 8

The time complexity of Bubble Sort is:

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

Question 9

Which sorting algorithm is used to sort linked lists?

A.
Insertion Sort
B.
Merge Sort
C.
Quick Sort
D.
Heap Sort

Question 10

Which sorting algorithm is used for sorting large data sets?

A.
Insertion Sort
B.
Merge Sort
C.
Quick Sort
D.
Heap Sort

Question 11

Which sorting algorithm is used for sorting arrays with random order?

A.
Insertion Sort
B.
Merge Sort
C.
Quick Sort
D.
Heap Sort

Question 12

Which sorting algorithm is used for sorting arrays with sorted or nearly sorted data?

A.
Insertion Sort
B.
Merge Sort
C.
Quick Sort
D.
Heap Sort

Question 13

Which sorting algorithm is used for sorting arrays with a large number of elements?

A.
Insertion Sort
B.
Merge Sort
C.
Quick Sort
D.
Heap Sort

Question 14

Which of the following sorting algorithms is considered to be the fastest for small data sets?

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

Question 15

Which of the following sorting algorithms is a divide-and-conquer algorithm?

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

Question 16

Which of the following sorting algorithms has the best average case time complexity?

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

Question 17

Which of the following sorting algorithms has a worst case time complexity of

O(n^2)

?

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

Question 18

Which of the following sorting algorithms is an in-place sorting algorithm?

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

Question 19

Which of the following sorting algorithms has the best space complexity?

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

Question 20

Which of the following sorting algorithms is suitable for sorting linked lists?

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

Question 21

Which of the following sorting algorithms is used for sorting data in a specialized manner like sorting data in a particular range or sorting data by a specific field?

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

Question 22

What is the time complexity of linear search?

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

Question 23

What is the time complexity of binary search?

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

Question 24

What is the main advantage of using binary search over linear search?

A.
More efficient in large data sets
B.
Can be used only on sorted data sets
C.
Can only be used on unsorted data sets
D.
Not as efficient as linear search in small data sets

Question 25

What is the basic idea behind linear search?

A.
To search for an element by comparing it with every element in the data set
B.
To search for an element by dividing the data set into two parts and comparing the target element with the middle element
C.
To search for an element by comparing it with the first and last elements of the data set
D.
To search for an element by comparing it with the last element of the data set

Question 26

What is the basic idea behind binary search?

A.
To search for an element by comparing it with every element in the data set
B.
To search for an element by dividing the data set into two parts and comparing the target element with the middle element
C.
To search for an element by comparing it with the first and last elements of the data set
D.
To search for an element by comparing it with the last element of the data set

Question 27

What is the best case time complexity of binary search?

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

Question 28

What is the worst case time complexity of binary search?

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

Question 29

What type of data set is required to perform binary search?

A.
Unsorted data set
B.
Sorted data set
C.
Randomly ordered data set
D.
Any type of data set

Question 30

What is the main disadvantage of using linear search over binary search?

A.
More efficient in large data sets
B.
Can be used only on sorted data sets
C.
Not as efficient as binary search in large data sets
D.
Can only be used on unsorted data sets

Question 31

Which of the following is faster, linear search or binary search?

A.
Linear search
B.
Binary search
C.
Both are equally fast
D.
It depends on the size of the data set

Question 32

What is the purpose of a hash function in a hash table?

A.
To convert a key into an index for the table
B.
To sort the elements in the table
C.
To compare elements in the table
D.
To store the elements in the table

Question 33

What is a hash table in computer science?

A.
A data structure that stores elements in a sorted manner
B.
A data structure that stores elements in a random order
C.
A data structure that stores elements using a key-value pair
D.
A data structure that stores elements using an array

Question 34

What is collision resolution in hash tables?

A.
The process of adding elements to a hash table
B.
The process of removing elements from a hash table
C.
The process of resolving conflicts when two keys hash to the same index
D.
The process of searching for a specific element in a hash table

Question 35

What are some common collision resolution techniques in hash tables?

A.
Linear probing
B.
Binary search
C.
Chaining
D.
All of the above

Question 36

What is the time complexity of searching in a hash table using chaining?

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

Question 37

What is the main purpose of a hash function in a hash table?

A.
To sort the elements in the table
B.
To find the index of an element in the table
C.
To compare the elements in the table
D.
To store the elements in the table

Question 38

What is the most common way to resolve collisions in a hash table?

A.
Chaining
B.
Open Addressing
C.
Binary Search
D.
Linear Search

Question 39

What is the time complexity of searching an element in a hash table using the hash function?

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

Question 40

What is the main advantage of using a hash table over a traditional array for storing elements?

A.
Faster access time
B.
Better sorting
C.
More memory efficient
D.
Better searching

Question 41

What is the purpose of a collision resolution technique in a hash table?

A.
To ensure that each element is stored at a unique index in the table
B.
To sort the elements in the table
C.
To compare the elements in the table
D.
To store the elements in the table

Question 42

What is the main objective of a minimum spanning tree algorithm?

A.
To find the shortest path between two vertices
B.
To find the minimum weight of a tree that connects all vertices
C.
To find the longest path between two vertices
D.
To find the maximum weight of a tree that connects all vertices

Question 43

What is the time complexity of Prim's algorithm for finding a minimum spanning tree?

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

Question 44

What is the time complexity of Kruskal's algorithm for finding a minimum spanning tree?

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

Question 45

What is the difference between Prim's and Kruskal's algorithm for finding a minimum spanning tree?

A.
Prim's algorithm starts with a single vertex and adds vertices to the tree while Kruskal's algorithm starts with all vertices and adds edges to the tree.
B.
Prim's algorithm starts with all vertices and adds edges to the tree while Kruskal's algorithm starts with a single vertex and adds vertices to the tree.
C.
Both algorithms start with a single vertex and add edges to the tree.
D.
Both algorithms start with all vertices and add vertices to the tree.

Question 46

What is the Round-Robin algorithm used for?

A.
To find the minimum spanning tree
B.
To schedule processes in a computer system
C.
To sort a list of elements
D.
To find the longest path between two vertices

Question 47

What is the main advantage of using a minimum spanning tree algorithm?

A.
To find the shortest path between two vertices
B.
To find the minimum weight of a tree that connects all vertices
C.
To find the longest path between two vertices
D.
To find the maximum weight of a tree that connects all vertices

Question 48

What is the use of a Round-Robin algorithm in a computer system?

A.
To find the minimum spanning tree
B.
To schedule processes in a computer system
C.
To sort a list of elements
D.
To find the longest path between two vertices

Question 49

What is the main disadvantage of using a Kruskal's algorithm compared to Prim's algorithm for finding a minimum spanning tree?

A.
Kruskal's algorithm is less efficient than Prim's algorithm
B.
Kruskal's algorithm is more difficult to implement than Prim's algorithm
C.
Kruskal's algorithm is less reliable than Prim's algorithm
D.
Kruskal's algorithm is less accurate than Prim's algorithm

Question 50

What is the use of a hash function in a hash table data structure?

A.
To generate a unique key for each element in the table
B.
To sort the elements in the table
C.
To find the shortest path between two vertices
D.
To find the longest path between two vertices

Practice another set Take a test on this chapter →