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 6

61 questions

Question 1

What is the correct postfix notation for the infix expression

"3 + 4 * 2 / (1 - 5) \wedge 2 \wedge 3"

50

?

A.
$3 4 2 * 1 5 - 2 3 \wedge / +$
B.
$3 4 2 * 1 5 - 3 2 \wedge / +$
C.
$3 4 2 * 1 5 - 2 \wedge 3 \wedge / +$
D.
$3 4 2 * 1 5 - 2 3 \wedge / +$

Question 2

Which notation is the most commonly used by humans to express arithmetic expressions?

A.
Postfix notation
B.
Infix notation
C.
Prefix notation
D.
All notations are equally popular

Question 3

Which notation is the easiest to parse and evaluate using a stack-based algorithm?

A.
Postfix notation
B.
Infix notation
C.
Prefix notation
D.
All notations can be parsed and evaluated equally easily

Question 4

Which notation is the easiest to convert to machine code or assembly language?

A.
Postfix notation
B.
Infix notation
C.
Prefix notation
D.
All notations can be easily converted to machine code or assembly language

Question 5

What is the advantage of using prefix or postfix notation over infix notation?

A.
Prefix and postfix notation can eliminate the need for parentheses
B.
Prefix and postfix notation are more human-readable
C.
Prefix and postfix notation are more compact than infix notation
D.
Prefix and postfix notation are more intuitive than infix notation

Question 6

Which of the following is NOT an application of stacks?

A.
Implementing undo-redo functionality in text editors
B.
Evaluating arithmetic expressions
C.
Implementing backtracking algorithms
D.
Storing data in a hash table

Question 7

What is the application of a stack in implementing a web browser's back button?

A.
The URLs of the visited web pages are pushed onto a stack
B.
The URLs of the visited web pages are popped off a stack
C.
The URLs of the visited web pages are stored in a queue
D.
The URLs of the visited web pages are stored in a hash table

Question 8

Which data structure can be used to implement a stack?

A.
Array
B.
Linked list
C.
Both array and linked list
D.
Neither array nor linked list

Question 9

What is the application of a stack in evaluating arithmetic expressions?

A.
The operands are pushed onto the stack, and the operators are evaluated in order
B.
The operators are pushed onto the stack, and the operands are evaluated in order
C.
The operands and operators are both pushed onto the stack in random order
D.
The operands and operators are stored in separate stacks

Question 10

What is the application of a stack in implementing function calls in programming languages?

A.
The return address and parameters of a function call are pushed onto the stack, and the function is executed
B.
The function itself is pushed onto the stack, and the return address and parameters are evaluated in order
C.
The parameters of a function call are pushed onto the stack, and the function is executed without using a return address
D.
The return address and parameters of a function call are stored in a queue

Question 11

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 12

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 13

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 14

What are some common collision resolution techniques in hash tables?

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

Question 15

What is linear probing in hash tables?

A.
A technique that resolves collisions by searching through the table sequentially
B.
A technique that resolves collisions by dividing the table into smaller sections
C.
A technique that resolves collisions by using a linked list to store elements at the same index
D.
A technique that resolves collisions by using binary search to find the correct index

Question 16

What is chaining in hash tables?

A.
A technique that resolves collisions by searching through the table sequentially
B.
A technique that resolves collisions by dividing the table into smaller sections
C.
A technique that resolves collisions by using a linked list to store elements at the same index
D.
A technique that resolves collisions by using binary search to find the correct index

Question 17

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 18

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 19

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 20

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 21

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 22

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 23

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 24

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 25

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 26

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 27

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 28

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 29

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 30

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 31

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

Question 32

What is the main idea behind the greedy algorithm for solving the shortest path problem?

A.
To find the shortest path by visiting all nodes in the graph
B.
To find the shortest path by selecting the closest node at each step
C.
To find the shortest path by selecting the most distant node at each step
D.
To find the shortest path by using dynamic programming

Question 33

What is the time complexity of Dijkstra's algorithm for finding the shortest path in a graph?

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

Question 34

What is the difference between Dijkstra's algorithm and Bellman-Ford algorithm for finding the shortest path in a graph?

A.
Dijkstra's algorithm is faster than Bellman-Ford algorithm
B.
Bellman-Ford algorithm can handle negative weight edges while Dijkstra's algorithm cannot
C.
Dijkstra's algorithm is simpler than Bellman-Ford algorithm
D.
Bellman-Ford algorithm is more efficient than Dijkstra's algorithm

Question 35

What is the use of the relaxation step in Dijkstra's algorithm for finding the shortest path?

A.
To update the distance of each node from the source node
B.
To find the shortest path between two nodes
C.
To keep track of the visited nodes
D.
To find the minimum distance between two nodes

Question 36

Can Dijkstra's algorithm be used to find the shortest path in a graph with negative weight edges?

A.
Yes, it can be used
B.
No, it cannot be used

Question 37

What is the main difference between greedy algorithm and dynamic programming for solving the shortest path problem?

A.
Greedy algorithm gives the optimal solution while dynamic programming gives the suboptimal solution
B.
Dynamic programming gives the optimal solution while greedy algorithm gives the suboptimal solution
C.
Both greedy algorithm and dynamic programming give the optimal solution
D.
Both greedy algorithm and dynamic programming give the suboptimal solution

Question 38

What is the use of the priority queue in Dijkstra's algorithm for finding the shortest path?

A.
To keep track of the visited nodes
B.
To find the shortest path between two nodes
C.
To update the distance of each node from the source node
D.
To find the node with the minimum distance from the source node

Question 39

Which of the following statements is true about undirected graphs?

A.
The edges in an undirected graph have a direction.
B.
The edges in an undirected graph have no direction.
C.
The edges in an undirected graph are always weighted.
D.
An undirected graph cannot have cycles.

Question 40

Which of the following data structures is commonly used to represent a graph?

A.
Linked list
B.
Queue
C.
Stack
D.
Array

Question 41

Which of the following is the best algorithm to find the transitive closure of a graph?

A.
Dijkstra's algorithm
B.
Bellman-Ford algorithm
C.
Warshall's algorithm
D.
Prim's algorithm

Question 42

Which of the following algorithms is used to find the shortest path in a weighted graph?

A.
Depth-first search
B.
Breadth-first search
C.
Dijkstra's algorithm
D.
Kruskal's algorithm

Question 43

What is the time complexity of Warshall's algorithm?

A.
$O(V + E)$
B.
$O(V^2)$
C.
$O(E^2)$
D.
$O(E \log V)$

Question 44

Which traversal algorithm is used to traverse a graph starting from a particular vertex and exploring as far as possible along each branch before backtracking?

A.
Depth-first traversal
B.
Breadth-first traversal
C.
Topological sorting
D.
Kruskal's algorithm

Question 45

Which traversal algorithm is used to traverse a graph by exploring all the vertices at the same level before moving on to the next level?

A.
Depth-first traversal
B.
Breadth-first traversal
C.
Topological sorting
D.
Kruskal's algorithm

Question 46

What is the time complexity of Breadth-first traversal of a graph?

A.
$O(V + E)$
B.
$O(V^2)$
C.
$O(E^2)$
D.
$O(E \log V)$

Question 47

Which of the following algorithms can be used to find a topological ordering of a directed acyclic graph (DAG)?

A.
Depth-first traversal
B.
Breadth-first traversal
C.
Topological sorting (DFS)
D.
Topological sorting (BFS)

Question 48

Which of the following is true about a DAG?

A.
It can have cycles.
B.
It can have multiple sources.
C.
It can have multiple sinks.
D.
It can be disconnected.

Question 49

Which of the following is used to determine whether a graph is acyclic or not?

A.
Depth-first traversal
B.
Breadth-first traversal
C.
Topological sorting (DFS)
D.
Topological sorting (BFS)

Question 50

What is the time complexity of Depth-first traversal of a graph?

A.
$O(V + E)$
B.
$O(V^2)$
C.
$O(E^2)$
D.
$O(E \log V)$

Question 51

Which of the following algorithms is used to find the minimum spanning tree of a graph?

A.
Depth-first traversal
B.
Breadth-first traversal
C.
Dijkstra's algorithm
D.
Kruskal's algorithm

Question 52

Which of the following is not a sorting algorithm?

A.
Bubble sort
B.
Heap sort
C.
Quick sort
D.
Binary search

Question 53

Which of the following data structures is used to implement heap sort?

A.
Stack
B.
Queue
C.
Heap
D.
Linked list

Question 54

What is the worst-case time complexity of heap sort?

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

Question 55

Which of the following is not a step in heap sort?

A.
Building a heap
B.
Sorting the heap
C.
Swapping the first and last elements
D.
Inserting elements into the heap

Question 56

What is the space complexity of heap sort?

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

Question 57

What is the minimum number of elements that can be sorted using heap sort?

A.
0
B.
1
C.
2
D.
3

Question 58

Which of the following is not a property of a heap?

A.
It is a complete binary tree.
B.
The root is always the maximum or minimum element.
C.
The left child is always greater than the right child.
D.
The height of the tree is $\log(n)$ .

Question 59

What is the time complexity of building a heap?

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

Question 60

Which of the following is not a type of heap?

A.
Binary heap
B.
Fibonacci heap
C.
Ternary heap
D.
Quad heap

Question 61

Which of the following is a disadvantage of heap sort?

A.
It is not an in-place algorithm.
B.
It cannot handle duplicate elements.
C.
It has a worst-case time complexity of $O(n^2)$ .
D.
It is not stable.

Practice another set Take a test on this chapter →