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

Operating System Set 8

50 questions

Question 1

Which of the following capabilities is required for a system program to execute more than one program at a time?

A.
Word processing
B.
Virtual memory
C.
Compiling
D.
Multitasking

Question 2

50

A critical region is:

A.
A program segment that has not been proved bug-free
B.
A program segment that often causes unexpected system crashes
C.
A program segment where shared resources are accessed
D.
One which is enclosed by a pair of P and V operations on semaphores

Question 3

Which of the following addressing modes facilitates access to an operand whose location is defined relative to the beginning of the data structure in which it appears?

A.
Ascending
B.
Index
C.
Sorting
D.
Indirect

Question 4

The register or main memory location which contains the effective address of the operand is known as:

A.
Pointer
B.
Special location
C.
Indexed register
D.
Scratch pad

Question 5

System programs such as compilers are designed so that they are:

A.
Re-entrant
B.
Serially usable
C.
Non-reusable
D.
Recursive

Question 6

Special software to create a job queue is called a:

A.
Drive
B.
Interpreter
C.
Spooler
D.
Linkage editor

Question 7

The most common security failure is:

A.
Carelessness by users
B.
Depending on passwords
C.
Too much emphasis on preventing physical access
D.
Insufficient technology used to prevent breaches

Question 8

A public key encryption system:

A.
Allows anyone to decode the transmission
B.
Allows only the correct sender to decode the data
C.
Allows only the correct receiver to decode the data
D.
Does not encode the data before transmitting it

Question 9

Supervisor state is:

A.
Never used
B.
Entered by programs when they enter the processor
C.
Required to perform any I/O
D.
Only allowed to the operating system

Question 10

A high paging rate:

A.
May cause a high I/O rate
B.
Keeps the system running well
C.
Is a symptom of too much processor activity
D.
Always creates a slow system

Question 11

Round robin scheduling is essentially the preemptive version of:

A.
FIFO
B.
FILO
C.
FCFS
D.
Longest time first

Question 12

If the number of bits in the virtual address of a program is 12 and the page size is 0.5 KB, the number of pages in the virtual address space is:

A.
16
B.
32
C.
64
D.
128

Question 13

In which of the storage placement strategies is a program placed in the largest available hole in the main memory?

A.
Best fit
B.
Worst fit
C.
First fit
D.
Buddy

Question 14

For how many processes which are sharing common data does Dekker’s algorithm implement mutual exclusion?

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

Question 15

A disk scheduling algorithm in an operating system causes the disk arm to move back and forth across the disk surface in order to service all requests in its path. This is a:

A.
First come first served
B.
Scan
C.
Shortest Seek Time First (SSTF)
D.
FIFO

Question 16

Round-robin scheduling:

A.
Allows interactive tasks quicker access to the processor
B.
Is quite complex to implement
C.
Gives each task the same chance at the processor
D.
Allows processor-bound tasks more time in the processor

Question 17

Inter-process communication:

A.
Is required for all processes
B.
Is usually done via disk drives
C.
Is never necessary
D.
Allows processes to synchronize activity

Question 18

Fork is:

A.
The dispatching of a task
B.
The creation of a new job
C.
The creation of a new process
D.
Increasing the priority of a task

Question 19

A process is another name for:

A.
A job
B.
Paging
C.
A task
D.
The operating system dispatcher

Question 20

Relocation bits used by relocating loader are specified (generated by):

A.
Relocating loader itself
B.
Assembler or translator
C.
Linker
D.
Macro processor

Question 21

Device independence:

A.
Allows the computer to run without I/O devices
B.
Makes all devices look the same to the operating system
C.
Allows programs to be written more easily
D.
Allows tape drives to be substituted for disk drives

Question 22

User-Friendly Systems are:

A.
Required for object-oriented programming
B.
Easy to develop
C.
Common among traditional mainframe operating systems
D.
Becoming more common

Question 23

Disk scheduling includes deciding:

A.
Which disk should be accessed next
B.
The order in which disk access requests must be serviced
C.
The physical location of the file
D.
The logical location of the file

Question 24

Which of the following translator programs convert assembly language program to object program?

A.
Assembler
B.
Macro processor
C.
Compiler
D.
Linker

Question 25

Data encryption:

A.
Is mostly used by public networks
B.
Is mostly used by financial networks
C.
Cannot be used by private installations
D.
Is not necessary, since data cannot be intercepted

Question 26

Seeks analysis:

A.
Is used for analyzing paging problems
B.
Is used for analyzing device busy problems
C.
Is used for analyzing control-unit busy problems
D.
Is only shown on real-time displays

Question 27

Swapping:

A.
Works best with many small partitions
B.
Allows many programs to use memory simultaneously
C.
Allows each program in turn to use the memory
D.
Does not work with overlaying

Question 28

Feedback queue:

A.
Are very easy to implement
B.
Dispatch tasks according to execution characteristics
C.
Are used to favor real-time tasks
D.
Require manual intervention to implement properly

Question 29

A file organization component of a VSAM file is:

A.
Relative record data set
B.
Entry sequential data set
C.
Keyed sequential data set
D.
All of the above

Question 30

The file structure that redefines its first record at a basic of zero uses the term:

A.
Relative organization
B.
Dynamic reallocation
C.
Key fielding
D.
Hashing

Question 31

File record length:

A.
Should always be fixed
B.
Should always be variable
C.
Depends upon the size of the file
D.
Should be chosen to match the data characteristics

Question 32

An incremental backup:

A.
Should be done each month
B.
Uses more tapes
C.
Saves all files
D.
Saves only files that have recently changed

Question 33

A partitioned data set is most used for:

A.
Program or source library
B.
Storing backup information
C.
Storing program data
D.
Storing ISAM file

Question 34

System generation:

A.
Is always quite simple
B.
Is always very difficult
C.
Varies in difficulty between systems
D.
Requires extensive tools to be understandable

Question 35

Object code:

A.
Is ready to execute
B.
Is the output of compilers, but not assemblers
C.
Must be “loaded” before execution
D.
Must be rewritten before execution

Question 36

Virtual memory is:

A.
Simple to implement
B.
Used in all major commercial operating systems
C.
Less efficient in utilization of memory
D.
Useful when fast I/O devices are not available

Question 37

System maintenance:

A.
Is usually not necessary
B.
Is necessary on all systems, regardless of how good
C.
Is not required if the system is well written
D.
Always requires several programs

Question 38

Which of the following statements is not true?

A.
Time sharing is an example of multiprogramming
B.
JCL is used only to communicate between systems programmers
C.
A batch file contains a series of operating system commands
D.
The primary function of operating systems is to make the computer hardware easily usable

Question 39

What scheduling algorithm allows processes that are logically runnable to be temporarily suspended?

A.
Preemptive scheduling
B.
FIFO
C.
Non-preemptive scheduling
D.
FCFS

Question 40

The term ‘polling’ in a computer means a process by which a computer system:

A.
Detects/corrects errors
B.
Multiplexes the inputs and updates the memory accordingly
C.
Decides the correct alternative by analyzing several ones
D.
Inquiries to see if a terminal has any transaction to send

Question 41

In a magnetic disk, data is recorded in a set of concentric tracks which are subdivided into:

A.
Periods
B.
Zones
C.
Sectors
D.
Groups

Question 42

Which of the following is true for machine language?

A.
Repeated execution of program segments
B.
Depicting flow of data in a system
C.
A sequence of instructions which, when followed properly, solves a problem
D.
The language which communicates with the computer using only the binary digits 1 and 0

Question 43

The LRU algorithm:

A.
Pages out pages that have been used recently
B.
Pages out pages that have not been used recently
C.
Pages out pages that have been least used recently
D.
Pages out the first page in a given area

Question 44

A linker:

A.
Creates a load module
B.
Is not necessary with variable partitions
C.
Must be run after the loader
D.
Is not needed with a good compiler

Question 45

Global locks:

A.
Synchronize access to local resources
B.
Synchronize access to global resources
C.
Are used to avoid local locks
D.
Prevent access to global resources

Question 46

The dynamic allocation of storage areas with VSAM files is accomplished by:

A.
Hashing
B.
Overflow areas
C.
Control splits
D.
Relative recording

Question 47

Which of the following refers to associative memory?

A.
The address of the data is generated by the CPU
B.
The address of the data is supplied by the user
C.
There is no need for an address, i.e., the data is used as an address
D.
The data are accessed sequentially

Question 48

Link encryption:

A.
Is more secure than end-to-end encryption
B.
Is less secure than end-to-end encryption
C.
Cannot be used in a public network
D.
Is used only to debug

Question 49

Which of the following is a characteristic of an operating system?

A.
Resource management
B.
Memory management
C.
Error recovery
D.
All of the above

Question 50

Files can have:

A.
Read access
B.
Write access
C.
Copy access
D.
All of the above

Practice another set Take a test on this chapter →