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

Mixed chapter MCQs Set 4

50 questions

Question 1

Main features of hill climbing algorithm is ______.

A.
Generate and test variant
B.
No back tracking
C.
Greedy approach
D.
All of the above

Question 2

50

______ is the problem in Hill climbing searching.

A.
Local Maximum
B.
Plateau
C.
Ridges
D.
All of mentioned above

Question 3

In ______ we escape local maxima by allowing some "bad" moves but gradually decrease their frequency.

A.
Hill Climbing
B.
Simulated Annealing
C.
Mini max
D.
Alpha beta pruning

Question 4

Simulated Annealing is ______ optimization technique.

A.
Local
B.
Global
C.
Both Local and Global
D.
None of above

Question 5

Simulated Annealing is a ______ algorithm, the algorithm does not use any information gathered during the search.

A.
Memory equipped
B.
Memory less
C.
Processor equipped
D.
None of above

Question 6

The process of annealing can be simulated with the metropolis algorithm which is based on ______ techniques.

A.
Closed form solution
B.
Monte-Carlo simulation
C.
Numerical Transformation Method
D.
Proposed Method

Question 7

Adversarial Search uses ______ environment

A.
Collective
B.
Competitive
C.
Cooperative
D.
Both Collective and Cooperative

Question 8

General game involves ______ agents

A.
Multi
B.
Single
C.
Only single and multi
D.
Neither single nor multi

Question 9

______ search methods only consider how close the agent is to the goal state.

A.
Multi-agent
B.
Single-agent
C.
Both single and multi-agent
D.
None of above

Question 10

In ______ games, decisions of both agents have to be taken into account: a decision made by one agent will affect the resulting search space that the other agent would need to explore.

A.
Single player
B.
Two-player
C.
No Player
D.
Both Single and Two player

Question 11

To formalize a two-player game as a search problem an agent can be called ______ and the opponent can be called ______.

A.
MINI, MAX
B.
MAX, MIN
C.
MIN, MIN
D.
MAX, MAX

Question 12

MINI MAX Algorithm is perfect for deterministic and is a ______ game.

A.
Single player (Computer)
B.
Two-player (Computer and User)
C.
Single player (User)
D.
None of above

Question 13

Free cell, 8-puzzle, Rubrik’s cube is an example of ______.

A.
Deterministic Multi player
B.
Deterministic Single player
C.
Non-Deterministic single player
D.
Non-deterministic multi player

Question 14

Tic-tac-toe, Chess, Checker is a example of ______.

A.
Deterministic Multi player
B.
Deterministic Single player
C.
Non-Deterministic single player
D.
Non-deterministic multi player

Question 15

In ______ game, one player maximize result, another player minimize result.

A.
Zero-player
B.
One-player
C.
Two-player
D.
Thee-player

Question 16

______ is the time and ______ is the space complexity of MINI MAX Algorithm.

A.
$O(b^m)$ , $O(bm)$
B.
$O(b^{m+1})$ , $O(bm)$
C.
$O(b^m)$ , $O(b^m)$
D.
$O(bm)$ , $O(b^m)$

Question 17

The minimax algorithm performs a complete ______ exploration of the game tree.

A.
Breadth-first
B.
Depth-first
C.
Best-first
D.
None of above

Question 18

Is MINI MAX Search complete if tree is finite?

A.
May be
B.
No
C.
Yes
D.
Rather not say

Question 19

For making decision of win/lose, we apply ______ algorithm on game tree.

A.
Greedy search Algorithm
B.
Hill Climbing Algorithm
C.
Mini Max Algorithm
D.
BFS/DFS Algorithm

Question 20

In Alpha-Beta Pruning Algorithm, Pruning ______ the final result.

A.
Might affect
B.
Does not affect
C.
Affect
D.
Sometime affects, sometime doesn’t affect

Question 21

Why it is called Alpha-Beta? α is the value of the best ______ choice found so far at any choice point along the path for max.

A.
Lowest value
B.
Average value
C.
Highest value
D.
Infinite value

Question 22

______ is a modified version of the Mini Max Algorithm.

A.
Hill climbing
B.
Alpha beta pruning
C.
BFS
D.
DFS

Question 23

To ______ depth does the alpha-beta pruning can be applied.

A.
12 states
B.
5 States
C.
1 States
D.
Any depth

Question 24

In alpha-beta pruning, the initial value of alpha is ______ and beta is ______.

A.
Negative Infinity, Positive Infinity
B.
-1, +1
C.
Positive Infinity, Negative Infinity
D.
+1, -1

Question 25

The main condition which required for alpha-beta pruning is?

A.
alpha>=beta
B.
alpha=beta
C.
alpha<=bet
D.
alpha!=beta

Question 26

The 2 types of move ordering in Alpha-Beta Pruning are ______ and ______.

A.
Best ordering, Ideal Ordering
B.
Worst ordering, Ideal Ordering
C.
Best ordering, Random Ordering
D.
Worst ordering, Random Ordering

Question 27

In Alpha-Beta pruning, With "perfect ordering," time complexity = ______.

A.
$O(b^{m/2})$
B.
$O(b^{m+1/2})$
C.
$O(b^m)$
D.
$O(bm)$

Question 28

Identify the type of knowledge in Artificial Intelligence.

A.
Procedural and Declarative Knowledge
B.
Meta Knowledge
C.
Structural and Heuristic Knowledge
D.
All of above

Question 29

______ Knowledge is also known as Imperative Knowledge.

A.
Procedural
B.
Meta
C.
Structural
D.
Heuristic

Question 30

______ is non procedural, independent of targets and problem solving.

A.
Procedural Knowledge
B.
Declarative Knowledge
C.
Meta Knowledge
D.
Structural Knowledge

Question 31

______ is a knowledge about knowledge and how to gain them.

A.
Procedural Knowledge
B.
Declarative Knowledge
C.
Meta Knowledge
D.
Structural Knowledge

Question 32

______ represents a knowledge of some experts in a field or subject.

A.
Procedural Knowledge
B.
Declarative Knowledge
C.
Heuristic Knowledge
D.
Structural Knowledge

Question 33

______ talks about what relationship exists between concept/objects.

A.
Procedural Knowledge
B.
Declarative Knowledge
C.
Heuristic Knowledge
D.
Structural Knowledge

Question 34

Knowledge Representation and Reasoning represents information from the real world for a computer to understand and then utilize this knowledge to solve ______.

A.
Simplest real-life problems
B.
Complex real-life problems
C.
Neither simplest nor complex problems
D.
None of above

Question 35

Different kinds of knowledge that need to be represented in AI are ______.

A.
Object, Events, Performance, Facts
B.
Knowledge base
C.
Meta knowledge
D.
All of above

Question 36

______ is the technique of knowledge representation in AI

A.
Logical Representation
B.
Semantic Network and Frame Representation
C.
Production Rules
D.
All of above

Question 37

______ is a language with some definite rules which deal with propositions & has no ambiguity in representation.

A.
Semantic Network representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 38

In order to give information to agent and get info without errors in communication, we use ______ technique of knowledge representation.

A.
Semantic Network representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 39

______ work as an alternative of predicate logic for knowledge representation.

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 40

______ knowledge representation consists of pairs

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 41

______ is a knowledge representation technique where knowledge is represented as a set of objects and their attributes.

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 42

______ is a knowledge representation technique where knowledge is represented as a graph of nodes and links.

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 43

______ is a knowledge representation technique where knowledge is represented as a set of rules.

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 44

______ is a knowledge representation technique where knowledge is represented as a set of logical statements.

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 45

______ is a knowledge representation technique where knowledge is represented as a set of frames.

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 46

______ is a knowledge representation technique where knowledge is represented as a set of if-then rules.

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 47

______ is a knowledge representation technique where knowledge is represented as a set of nodes and links.

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 48

______ is a knowledge representation technique where knowledge is represented as a set of logical statements.

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 49

______ is a knowledge representation technique where knowledge is represented as a set of frames.

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Question 50

______ is a knowledge representation technique where knowledge is represented as a set of if-then rules.

A.
Semantic Network Representation
B.
Logical Representation
C.
Frame Representation
D.
Production Rules

Practice another set Take a test on this chapter →