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 1

50 questions

Question 1

What is the difference between a primitive data type and an abstract data type in programming?

A.
Primitive data types are basic and cannot be changed, while abstract data types can be modified.
B.
Primitive data types are simple, while abstract data types are complex.
C.
Primitive data types are defined by the programming language, while abstract data types are defined by the programmer.
D.
Primitive data types are stored in memory, while abstract data types are stored on disk.

50

Question 2

Which of the following is a linear data structure?

A.
Graph
B.
Queue
C.
Tree
D.
Hash Table

Question 3

In the big O notation,

O(1)

represents:

A.
A constant time algorithm
B.
A linear time algorithm
C.
A logarithmic time algorithm
D.
An exponential time algorithm

Question 4

What does big O notation represent in algorithm analysis?

A.
The worst-case time complexity of an algorithm
B.
The best-case time complexity of an algorithm
C.
The average time complexity of an algorithm
D.
The exact time complexity of an algorithm

Question 5

What does a big O notation of

O(n)

indicate about an algorithm?

A.
The algorithm takes a constant amount of time regardless of the size of the input.
B.
The algorithm takes a linear amount of time proportional to the size of the input.
C.
The algorithm takes a logarithmic amount of time relative to the size of the input.
D.
The algorithm takes an exponential amount of time based on the size of the input.

Question 6

What is the big O notation for a binary search algorithm?

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

Question 7

Which of the following algorithms has a big O notation of

O(n^2)

?

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

Question 8

What does big O notation tell us about the efficiency of an algorithm?

A.
It gives us an exact measurement of the time complexity of an algorithm.
B.
It gives us an approximation of the time complexity of an algorithm, taking into account the worst-case scenario.
C.
It gives us an estimate of the space complexity of an algorithm.
D.
It gives us a comparison of the time complexity of different algorithms.

Question 9

What is a linear data structure?

A.
A data structure that stores data in a sequential manner
B.
A data structure that stores data in a hierarchical manner
C.
A data structure that stores data randomly
D.
A data structure that stores data in a circular manner

Question 10

Which of the following is an example of a linear data structure?

A.
Tree
B.
Stack
C.
Graph
D.
Hash Table

Question 11

What is the difference between a stack and a queue in terms of data storage and retrieval?

A.
A stack stores and retrieves data in a first-in, first-out (FIFO) manner, while a queue stores and retrieves data in a last-in, first-out (LIFO) manner.
B.
A stack stores and retrieves data in a last-in, first-out (LIFO) manner, while a queue stores and retrieves data in a first-in, first-out (FIFO) manner.
C.
A stack stores and retrieves data randomly, while a queue stores and retrieves data in a sequential manner.
D.
A stack stores and retrieves data in a hierarchical manner, while a queue stores and retrieves data in a circular manner.

Question 12

What is the time complexity of inserting or deleting an element from the beginning of a singly linked list?

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

Question 13

What is the time complexity of inserting or deleting an element from the end of a linked list?

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

Question 14

What is a data structure?

A.
A collection of related data values
B.
A collection of algorithms
C.
A way of organizing and storing data in a computer so that it can be accessed and manipulated efficiently
D.
A way of organizing and storing data in a database

Question 15

What are the two main types of data structures?

A.
Linear and non-linear
B.
Hierarchical and non-hierarchical
C.
Primitive and non-primitive
D.
Structured and unstructured

Question 16

What is an array in data structures?

A.
A collection of data elements stored in a sequential manner
B.
A collection of data elements stored in a random manner
C.
A collection of data elements stored in a hierarchical manner
D.
A collection of data elements stored in a circular manner

Question 17

What is a linked list in data structures?

A.
A collection of data elements stored in a sequential manner
B.
A collection of data elements stored in a random manner
C.
A collection of data elements stored in a hierarchical manner
D.
A linked list consists of nodes where each node contains a data field and a reference (link) to the next node in the list

Question 18

What is a stack in data structures?

A.
A collection of data elements stored in a sequential manner
B.
A collection of data elements stored in a random manner
C.
A collection of data elements stored in a hierarchical manner
D.
A collection of data elements stored in a last-in, first-out (LIFO) manner

Question 19

Which of the following is/are the application of stack?

A.
Backtracking
B.
Evaluation of arithmetic expression
C.
Function calls
D.
All of the above

Question 20

What is the time complexity of pushing an element onto a stack?

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

Question 21

What is the time complexity of popping an element from a stack?

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

Question 22

What is the use of a stack in computer science?

A.
To store and retrieve data in a first-in, first-out (FIFO) manner
B.
To store and retrieve data in a last-in, first-out (LIFO) manner
C.
To store and retrieve data randomly
D.
To store and retrieve data in a circular manner

Question 23

What is an example of a problem that can be solved using a stack?

A.
Sorting a list of numbers
B.
Finding the shortest path between two points
C.
Balancing parentheses in a mathematical expression
D.
Searching for a specific element in a list

Question 24

What is the difference between a stack and a queue?

A.
A stack stores and retrieves data in a last-in, first-out (LIFO) manner, while a queue stores and retrieves data in a first-in, first-out (FIFO) manner.
B.
A stack stores and retrieves data randomly, while a queue stores and retrieves data in a sequential manner.
C.
A stack is a linear data structure, while a queue is a non-linear data structure.
D.
A stack is a dynamic data structure, while a queue is a static data structure.

Question 25

What is the advantage of using a stack over other data structures to solve certain problems?

A.
Stacks are more efficient in terms of time and space complexity.
B.
Stacks are easier to implement and use than other data structures.
C.
Stacks allow for efficient retrieval of data in a last-in, first-out (LIFO) manner, making them well-suited for certain problems.
D.
Stacks provide better performance in terms of memory usage compared to other data structures.

Question 26

What is a stack overflow error in computer programming?

A.
An error that occurs when a stack exceeds its maximum size.
B.
An error that occurs when a stack is not properly initialized.
C.
An error that occurs when a stack is not properly deallocated.
D.
An error that occurs when a stack is not properly aligned in memory.

Question 27

What is the difference between a stack and a heap in computer programming?

A.
A stack stores data in a last-in, first-out (LIFO) manner, while a heap stores data in a random manner.
B.
A stack is a static data structure, while a heap is a dynamic data structure.
C.
A stack is used for short-term storage of data, while a heap is used for long-term storage of data.
D.
A stack is used for program execution, while a heap is used for memory allocation.

Question 28

What is a stack frame in computer programming?

A.
A unit of memory that stores data for a single function call in a stack.
B.
A unit of memory that stores data for a single data structure in a stack.
C.
A unit of memory that stores data for multiple function calls in a stack.
D.
A unit of memory that stores data for multiple data structures in a stack.

Question 29

What is the push operation in a stack data structure?

A.
An operation to remove an element from the top of the stack
B.
An operation to add an element to the bottom of the stack
C.
An operation to add an element to the top of the stack
D.
An operation to remove an element from the bottom of the stack

Question 30

What is the pop operation in a stack data structure?

A.
An operation to remove an element from the top of the stack
B.
An operation to add an element to the bottom of the stack
C.
An operation to add an element to the top of the stack
D.
An operation to remove an element from the bottom of the stack

Question 31

What is stack overflow in a stack data structure?

A.
An error that occurs when a stack exceeds its maximum size
B.
An error that occurs when a stack is not properly initialized
C.
An error that occurs when a stack is not properly deallocated
D.
An error that occurs when a stack is not properly aligned in memory

Question 32

What is stack underflow in a stack data structure?

A.
An error that occurs when a stack is empty and an attempt is made to remove an element from it
B.
An error that occurs when a stack is full and an attempt is made to add an element to it
C.
An error that occurs when a stack is improperly aligned in memory
D.
An error that occurs when a stack is not properly initialized

Question 33

What is a queue in data structures?

A.
Sequential collection with insertion at one end and deletion at the other end
B.
Random collection
C.
Hierarchical collection
D.
Circular collection with pointers

Question 34

What is the time complexity of inserting an element into a queue?

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

Question 35

What is the time complexity of removing an element from a queue?

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

Question 36

What is the use of a queue in computer science?

A.
To store and retrieve data in a last-in, first-out (LIFO) manner
B.
To store and retrieve data in a first-in, first-out (FIFO) manner
C.
To store and retrieve data randomly
D.
To store and retrieve data in a circular manner

Question 37

What is an example of a problem that can be solved using a queue?

A.
Sorting a list of numbers
B.
Breadth-first search in a graph
C.
Balancing parentheses in a mathematical expression
D.
Searching for a specific element in a list

Question 38

What is the minimum number of fields in each node of a doubly linked list?

A.
2
B.
3
C.
4
D.
None of the above

Question 39

What is a graph referred to as when all vertices have equal degree?

A.
Complete graph
B.
Regular graph
C.
Multi graph
D.
Simple graph

Question 40

What is a vertex with in-degree zero in a directed graph called?

A.
Root vertex
B.
Isolated vertex
C.
Sink
D.
Articulation point

Question 41

What conditions must a graph meet to be considered a tree?

A.
It must be a directed graph
B.
It must contain no cycles
C.
It must be planar
D.
It must be completely connected

Question 42

Where are the elements of a linked list stored?

A.
In a structure
B.
In an array
C.
Anywhere the computer has space for them
D.
In contiguous memory locations

Question 43

What data structure would be best suited for implementing a parentheses checker program?

A.
List
B.
Queue
C.
Stack
D.
Any of the above

Question 44

What data structure is required to perform level-order traversal on a binary tree?

A.
Hash table
B.
Queue
C.
Binary search tree
D.
Stack

Question 45

What data structure is required to convert an arithmetic expression in infix to its equivalent postfix notation?

A.
Queue
B.
Linked list
C.
Binary search tree
D.
None of above

Question 46

What type of binary tree has all levels except the last filled with the maximum number of nodes and all nodes in the last level having only one child, which is its left child?

A.
Threaded tree
B.
Complete binary tree
C.
M-way search tree
D.
Full binary tree

Question 47

What data structure is most appropriate for implementing quick sort iteratively?

A.
Deque
B.
Queue
C.
Stack
D.
Priority queue

Question 48

What is the number of edges in a complete graph of

n

vertices?

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

Question 49

What is the space complexity of bubble sort?

A.
$O(1)$
B.
$O(n^2)$
C.
$O(2)$
D.
None of the above

Question 50

What are two trees called if they have the same structure and node content?

A.
Synonyms trees
B.
Joint trees
C.
Equivalent trees
D.
Similar trees

Practice another set Take a test on this chapter →