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 3

17 questions

Question 1

______ is similar to Hill climbing searching but with revising or backtracking.

A.
Depth first search
B.
Breadth first search
C.
Best first search
D.
Binary Search

Question 2

50

The best first search uses the concept of a ______ and heuristic search.

A.
Circular queue
B.
Linear queue
C.
Priority queue
D.
Stack

Question 3

______ is the time and ______ is the space complexity of Best first search. Where b= branching factor and d= depth.

A.
$O(b^{d-1})$ , $O(b^{d-1})$
B.
$O(b^{d+1})$ , $O(b^{d+1})$
C.
$O(b^{d-1})$ , $O(b^{d+1})$
D.
$O(bd^2)$ , $O(bd)$

Question 4

Greedy best first search evaluates nodes by using only ______

A.
Linear function
B.
Non-linear function
C.
Friend function
D.
Heuristic function

Question 5

Why greedy best first search is not complete?

A.
Because it can override the heuristic function
B.
Because it can traverse to outer loop
C.
Because it can get stuck in loop
D.
None of the above

Question 6

______ is the time and ______ is the space complexity of Greedy Best first search.

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

Question 7

The main idea of A\* searching is to a ______

A.
Do not expand expensive path
B.
Expand expensive path
C.
All path cost are same in searching
D.
None of above

Question 8

Evaluation function is ______ for A\* searching, where, g(n) - cost so far to reach n h(n) - estimated cost to goal from n f(n) - estimated total cost of path through n to goal.

A.
$f(n) = g(n) / h(n)$
B.
$f(n) = g(n) - h(n)$
C.
$f(n) = g(n) + h(n)$
D.
$f(n) = g(n) \times h(n)$

Question 9

A\* search uses an ______ heuristic; that is, h(n) < h\*(n) where h\*(n) is the true cost from ‘n’.

A.
Non- admissible
B.
Admissible
C.
Anchoring
D.
Constant

Question 10

When should A\* searching terminate?

A.
After we enqueue a goal
B.
After we dequeue a goal
C.
No enqueue and dequeue
D.
None of above

Question 11

A\* search theorem states that:

A.
If h(n) is not admissible, A\* using TREE-SEARCH is optimal.
B.
If h(n) is admissible, A\* using TREE-SEARCH is optimal.
C.
If h(n) is admissible, A\* using TREE-SEARCH is not optimal.
D.
If h(n) is not admissible, A\* using TREE-SEARCH is also not optimal.

Question 12

______ is the time and ______ is the space complexity of A\* Search. Where b= branching factor and d= depth

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

Question 13

A\* is an admissible algorithm that ______ optimal solution.

A.
Does not guarantee
B.
Guarantee
C.
Partially guarantee
D.
None of above

Question 14

The main application of A\* Search Algorithm is: Path/ Routing problems can be solved by using A\* Searching algorithm.

A.
True
B.
False
C.
Partially True
D.
None of above

Question 15

A\* using Tree search is optimal if heuristic is ______.

A.
Constant
B.
Admissible
C.
Anchoring
D.
Representative

Question 16

A\* using Graph search is optimal if heuristic is ______.

A.
Constant
B.
Admissible
C.
Representative
D.
Anchoring

Question 17

______ is sometimes called greedy local search because it grabs a good neighbor state without thinking ahead about where to go next.

A.
Mini Max
B.
Alpha beta pruning
C.
Hill Climbing
D.
BFS

Practice another set Take a test on this chapter →