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 10

101 questions

Question 1

The function(s) of the file system is (are):

A.
To provide complete file naming freedom to the users and to permit controlled sharing of files
B.
To provide for long and short-term storage of files with appropriate economic tradeoffs
C.
To provide security against loss of information due to system failure
D.
All of the above

50

Question 2

Moving a process from main memory to disk is called:

A.
Scheduling
B.
Swapping
C.
Caching
D.
Spooling

Question 3

In order to allow only one process to enter its critical section, binary semaphores are initialized to:

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

Question 4

The state transition initiated by the user process itself in an operating system is:

A.
Block
B.
Wake up
C.
Dispatch
D.
Timer run out

Question 5

Which of the following terms refers to the degree to which data in a database system are accurate and correct?

A.
Data security
B.
Data independence
C.
Data validity
D.
Data integrity

Question 6

The total time to prepare a disk drive mechanism for a block of data to be read from it is:

A.
Latency
B.
Latency plus transmission time
C.
Latency plus seek time
D.
Latency plus seek time plus transmission time

Question 7

The paging rate:

A.
Should never be greater than 100 per second
B.
Is greater for large programs
C.
Is the number of I/O interrupts each second
D.
Increases as the number of page faults increases

Question 8

Thrashing:

A.
Is a natural consequence of virtual memory systems
B.
Can always be avoided by swapping
C.
Always occurs on large computers
D.
Can be caused by poor paging algorithms

Question 9

The computational technique used to compute the disk storage address of individual records is called:

A.
Bubble memory
B.
Dynamic reallocation
C.
Key fielding
D.
Hashing

Question 10

Capacity planning:

A.
Requires detailed system performance information
B.
Is independent of the operating system
C.
Does not depend on the monitoring tools available
D.
Is not needed in small installations

Question 11

In a multiprogramming system, a set of processes is deadlocked if each process in the set is waiting for an event to occur that can be initiated only by another process in the set. Which of the following is not one of the four conditions that are necessary for deadlock to occur?

A.
Non-preemption
B.
Partial assignment of resources
C.
Process suspension
D.
Circular wait

Question 12

Belady's anomaly occurs in:

A.
Optimal replacement
B.
LRU
C.
FIFO
D.
Both in FIFO and LRU

Question 13

The CPU, after receiving an interrupt from an I/O device:

A.
Halts for a predetermined time
B.
Hands over control of the address bus and data bus to the interrupting device
C.
Branches off to the interrupt service routine immediately
D.
Branches off to the interrupt service routine after completion of the current instruction

Question 14

Which of the following is not a characteristic of a daisy chaining priority control scheme?

A.
Priority is programmable
B.
It is relatively easy to add more devices to the chain
C.
The failure of one device may affect other devices on the chain
D.
The number of control lines is independent of the number of devices on the chain

Question 15

An example of a system development program is:

A.
Operating system
B.
Database management systems
C.
Performance monitors
D.
Language translators

Question 16

Which of the following is not a part of the operating system?

A.
Supervisor
B.
Job-control program
C.
Performance monitor
D.
Input/output control program

Question 17

If special forms are needed for printing the output, the programmer specifies these through:

A.
JCL
B.
Utility programs
C.
IPL
D.
Load modules

Question 18

Which of the following is not an advantage of multiprogramming?

A.
Increased throughput
B.
Shorter response time
C.
Decreased operating system overhead
D.
Ability to assign priorities to jobs

Question 19

The problem of thrashing is affected significantly by:

A.
Program structure
B.
Primary-storage size
C.
Program size
D.
None of the above

Question 20

Logical extension of multiprogramming of operating system is:

A.
Time sharing
B.
Single programming
C.
Multi-tasking
D.
Both (A) and (B)

Question 21

Under multiprogramming, turnaround time for short jobs is usually...... and that for long jobs is slightly......

A.
Lengthened; shortened
B.
Shortened; shortened
C.
Shortened; lengthened
D.
Shortened; unchanged

Question 22

Remote computing service involves the use of time-sharing and......

A.
Multiprocessing
B.
Batch processing
C.
Interactive processing
D.
Real-time processing

Question 23

Under which circumstances the scheduling scheme is non-preemptive:

A.
When a process switches from running to waiting state, when a process terminates
B.
When a process switches from waiting to the ready state
C.
When a process switches from waiting to the ready state
D.
Both (A) and (B)

Question 24

Under which circumstances the scheduling scheme is preemptive:

A.
When a process switches from running to waiting state
B.
When a process switches from running to the ready state
C.
When a process switches from waiting to the ready state
D.
Both (B) and (C)

Question 25

......gives control of the CPU to the process selected by the short-term scheduler.

A.
Long-term scheduler
B.
Dispatcher
C.
Medium-term scheduler
D.
None of the above

Question 26

Which of the following are the functions of the dispatcher?

A.
Swapping
B.
Jumping to the proper location in the user program to restart that program
C.
Scheduling
D.
All of the above

Question 27

Which of the following are CPU scheduling criteria?

A.
CPU utilization
B.
Dispatcher latency
C.
Waiting time
D.
Both (A) and (B)

Question 28

Which of the following is true for the algorithms for allocating regions of contiguous memory?

A.
First-fit
B.
Best-fit
C.
Next-fit
D.
All of the above

Question 29

The first-fit algorithm for allocating regions of contiguous memory does......

A.
Scan memory region list from start for first fit
B.
Scan memory region list from point of last allocation to next
C.
Tends to leave small unusable regions, and slower due to requirement of searching the entire list
D.
There is no such algorithm

Question 30

The best-fit algorithm for allocating regions of contiguous memory does......

A.
Scan memory regions from start for first fit
B.
Pick the closest free region in the entire list
C.
There is no such algorithm
D.
Find the worst fit in the entire list

Question 31

Which of the following are scheduling algorithms:

A.
First come first serve
B.
Priority scheduling
C.
Shortest job first
D.
All of the above

Question 32

Routine is not loaded until it is called. All routines are kept on disk in a reloadable load format. The main program is loaded into memory & is executed. This type of loading is called ______.

A.
Static loading
B.
Dynamic linking
C.
Dynamic loading
D.
Overlays

Question 33

Which of the following is crucial time while accessing data on the disk?

A.
Seek time
B.
Transmission time
C.
Rotational time
D.
Waiting time

Question 34

The host repeatedly checks if the controller is busy until it is not. It is in a loop that status register’s busy bit becomes clear. This is called ______ and a mechanism for the hardware controller to notify the CPU that it is ready is called ______.

A.
Interrupt and Polling
B.
Polling and Interrupt
C.
Polling and Spooling
D.
Deadlock and Starvation

Question 35

Unix Operating System is an ______.

A.
Time Sharing Operating System
B.
Multi-tasking Operating System
C.
Multi-User Operating Systems
D.
All of the Above

Question 36

Which of the following memory allocation scheme suffers from External fragmentation?

A.
Segmentation
B.
Swapping
C.
Pure demand paging
D.
Paging

Question 37

Information about a process is maintained in a ______.

A.
Stack
B.
Process Control Block
C.
Translation Look aside Buffer
D.
Program Control Block

Question 38

Distributed OS works on the ______ principle.

A.
File Foundation
B.
Multi system image
C.
Single system images
D.
Networking image

Question 39

The problem of fragmentation arises in ______.

A.
Static storage allocation
B.
Stack allocation storage
C.
Stack allocation with dynamic binding
D.
Heap allocation

Question 40

Which file system does DOS typically use?

A.
FAT16
B.
NTFS
C.
FAT32
D.
WNFS

Question 41

The program is known as ______ which interacts with the inner part of called kernel.

A.
Compiler
B.
Protocol
C.
Device Driver
D.
Shell

Question 42

The time taken by the disk arm to locate the specific address of a sector for getting information is called ______.

A.
Rotational Latency
B.
Search Time
C.
Seek Time
D.
Response Time

Question 43

Which file system does Windows 95 typically use?

A.
FAT16
B.
NTFS
C.
FAT32
D.
LMFS

Question 44

Identify the odd thing in the services of operating system.

A.
Accounting
B.
Error detection and correction
C.
Protections
D.
Deadlock handling

Question 45

Cryptography technique is used in ______.

A.
Polling
B.
Protection
C.
Job Scheduling
D.
File Management

Question 46

Which of the following is not an advantage of multiprogramming?

A.
Increased throughput
B.
Shorter response times
C.
Decreased operating system overhead
D.
Ability to assign priorities to jobs

Question 47

In ______ OS, the response time is very critical.

A.
Multitasking
B.
Online
C.
Batch
D.
Real-time

Question 48

An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ______.

A.
FCFS scheduling algorithm
B.
Round robin scheduling algorithm
C.
Shortest job-first scheduling algorithm
D.
None of the above

Question 49

Real-time systems are ______.

A.
Primarily used on mainframe computers
B.
Used for monitoring events as they occur
C.
Used for program development
D.
Used for real-time interactive users

Question 50

Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?

A.
Time-sharing
B.
Preemptive scheduling
C.
Spooling
D.
Multiprogramming

Question 51

Inter-process communication can be done through ______.

A.
Mail
B.
System calls
C.
Messages
D.
Traps

Question 52

In Priority Scheduling, a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of starvation (low priority processes may never execute) is resolved by ______.

A.
Terminating the process
B.
Mutual Exclusion
C.
Aging
D.
Semaphore

Question 53

CPU performance is measured through ______.

A.
Throughput
B.
Flops
C.
MHz
D.
None of the above

Question 54

PCB = ______.

A.
Program Control Block
B.
Process Communication Block
C.
Process Control Block
D.
None of the above

Question 55

Software is a program that directs the overall operation of the computer, facilitates its use, and interacts with the user. What are the different types of this software?

A.
Operating system
B.
Utilities
C.
Language Compiler
D.
All of the above

Question 56

A ______ is software that manages the time of a microprocessor to ensure that all time-critical events are processed as efficiently as possible. This software allows the system activities to be divided into multiple independent elements called tasks.

A.
Kernel
B.
Processor
C.
Shells
D.
Device Driver

Question 57

The primary job of the operating system of a computer is to ______.

A.
Command Resources
B.
Provide Utilities
C.
Manage Resources
D.
Be user-friendly

Question 58

With the round-robin CPU scheduling in a time-shared system ______.

A.
Using very large time slices degenerates into the first-come-first-served algorithm
B.
Using extremely small time slices improves performance
C.
Using extremely small time slices degenerates into the last-in-first-out algorithm
D.
Using medium-sized time slices leads to the shortest request time first algorithm

Question 59

Which of the following is a criterion to evaluate a scheduling algorithm?

A.
CPU Utilization: Keep CPU utilization as high as possible
B.
Throughput: Number of processes completed per unit time
C.
Waiting Time: Amount of time spent ready to run but not running
D.
All of the above

Question 60

Which of the following is contained in Process Control Block (PCB)?

A.
Process Number
B.
Memory Limits
C.
List of Open Files
D.
All of the Above

Question 61

Supercomputers typically employ ______.

A.
Real-time Operating system
B.
Desktop OS
C.
Multiprocessors OS
D.
None of the above

Question 62

Round-robin scheduling is essentially ______ the preemptive version of ______.

A.
FIFO
B.
Shortest remaining
C.
Shortest job first
D.
Longest time first

Question 63

A page fault occurs.

A.
When the page is not in the memory
B.
When the page is in the memory
C.
When the process enters the blocked state
D.
When the process is in the ready state

Question 64

Which of the following will determine your choice of systems software for your computer?

A.
Is the applications software you want to use compatible with it?
B.
Is it expensive?
C.
Is it compatible with your hardware?
D.
Both (A) and (C)

Question 65

Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements: wait(S); wait(Q); —; signal(S); signal(Q) and wait(Q); wait(S); —; signal(Q); signal(S); respectively. The above situation depicts a ______.

A.
Semaphore
B.
Signal
C.
Deadlock
D.
Interrupt

Question 66

What is a shell?

A.
It is a hardware component
B.
It is a part in compiler
C.
It is a command interpreter
D.
It is a tool in CPU scheduling

Question 67

Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called ______.

A.
Static loading
B.
Dynamic linking
C.
Dynamic loading
D.
Overlays

Question 68

In the blocked state:

A.
The processes waiting for I/O are found
B.
The process which is running is found
C.
The processes waiting for the processor are found
D.
None of the above

Question 69

What is the memory from 1K - 640K called?

A.
Extended Memory
B.
Low Memory
C.
Normal Memory
D.
Conventional Memory

Question 70

The process related to process control, file management, device management, information about system and communication that is requested by any higher-level language can be performed by ______.

A.
Editors
B.
System Call
C.
Compilers
D.
Caching

Question 71

If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67.

A.
310
B.
315
C.
324
D.
321

Question 72

Multiprogramming systems ______.

A.
Are easier to develop than single programming systems
B.
Execute each job faster
C.
Execute more jobs in the same time
D.
Are used only on large mainframe computers

Question 73

Which is not the state of the process?

A.
Blocked
B.
Ready
C.
Running
D.
Privileged

Question 74

The solution to the Critical Section Problem is: Mutual Exclusion, Progress, and Bounded Waiting.

A.
The statement is false
B.
The statement is contradictory
C.
The statement is true
D.
None of the above

Question 75

The problem of thrashing is affected significantly by ______.

A.
Program structure
B.
Primary storage size
C.
Program size
D.
None of the above

Question 76

The state of a process after it encounters an I/O instruction is ______.

A.
Ready
B.
Idle
C.
Blocked/Waiting
D.
Running

Question 77

The number of processes completed per unit time is known as ______.

A.
Output
B.
Efficiency
C.
Throughput
D.
Capacity

Question 78

______ is the situation in which a process is waiting on another process, which is also waiting on another process ... which is waiting on the first process. None of the processes involved in this circular wait are making progress.

A.
Deadlock
B.
Dormant
C.
Starvation
D.
None of the above

Question 79

Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?

A.
Time-sharing
B.
Preemptive scheduling
C.
Spooling
D.
Multiprogramming

Question 80

The mechanism that brings a page into memory only when it is needed is called ______.

A.
Segmentation
B.
Demand Paging
C.
Fragmentation
D.
Page Replacement

Question 81

Switching the CPU to another Process requires saving the state of the old process and loading the new process state. This is called as ______.

A.
Process Blocking
B.
Time Sharing
C.
Context Switch
D.
None of the above

Question 82

Which directory implementation is used in most Operating Systems?

A.
Single level directory structure
B.
Tree directory structure
C.
Two level directory structure
D.
Acyclic directory structures

Question 83

The Banker’s algorithm is used:

A.
To prevent deadlock in operating systems
B.
To detect deadlock in operating systems
C.
To rectify a deadlocked state
D.
None of the above

Question 84

A thread:

A.
Is a lightweight process where the context switching is low
B.
Is a lightweight process where the context switching is high
C.
Is used to speed up paging
D.
None of the above

Question 85

______ is a high-level abstraction over Semaphore.

A.
Shared memory
B.
Monitor
C.
Message passing
D.
Mutual exclusion

Question 86

A tree-structured file directory system ______.

A.
Allows easy storage and retrieval of file names
B.
Is a much-debated unnecessary feature
C.
Is not essential when we have millions of files
D.
None of the above

Question 87

Translator for low-level programming language were termed as:

A.
Assembler
B.
Linker
C.
Compiler
D.
Loader

Question 88

Analysis which determines the meaning of a statement once its grammatical structure becomes known is termed as:

A.
Semantic analysis
B.
Regular analysis
C.
Syntax analysis
D.
General analysis

Question 89

Load address for the first word of the program is called:

A.
Linker address origin
B.
Phase library
C.
Load address origin
D.
Absolute library

Question 90

Symbolic names can be associated with:

A.
Information
B.
Operand
C.
Data or instruction
D.
Mnemonic operation

Question 91

The translator which performs macro expansion is called a:

A.
Macro processor
B.
Micro pre-processor
C.
Macro pre-processor
D.
Assembler

Question 92

Shell is the exclusive feature of:

A.
UNIX
B.
System software
C.
DOS
D.
Application software

Question 93

A program in execution is called:

A.
Process
B.
Procedure
C.
Instruction
D.
Function

Question 94

Interval between the time of submission and completion of the job is called:

A.
Waiting time
B.
Throughput
C.
Turnaround time
D.
Response time

Question 95

A scheduler which selects processes from secondary storage device is called:

A.
Short-term scheduler
B.
Medium-term scheduler
C.
Long-term scheduler
D.
Process scheduler

Question 96

The scheduling in which CPU is allocated to the process with the least CPU-burst time is called:

A.
Priority Scheduling
B.
Round Robin Scheduling
C.
Shortest job-first Scheduling
D.
Multilevel Queue Scheduling

Question 97

The term ‘page traffic’ describes:

A.
Number of pages in memory at a given instant
B.
Number of papers required to be brought in at a given page request
C.
The movement of pages in and out of memory
D.
Number of pages of executing programs loaded in memory

Question 98

The “turn-around” time of a user job is the:

A.
Time since its submission to the time its results become available
B.
Time duration for which the CPU is allotted to the job
C.
Total time taken to execute the job
D.
Time taken for the job to move from assembly phase to completion phase

Question 99

Which of the following can be used as a criterion for classification of data structures used in language processing?

A.
Nature of a data structure
B.
Lifetime of a data structure
C.
Purpose of a data structure
D.
All of the above

Question 100

Memory utilization factor shall be computed as follows:

A.
Memory in use/allocated memory
B.
Memory in use/total memory connected
C.
Memory allocated/free existing memory
D.
Memory committed/total memory available

Question 101

Memory utilization factor shall be computed as follows:

A.
Memory in use/allocated memory
B.
Memory in use/total memory connected
C.
Memory allocated/free existing memory
D.
Memory committed/total memory available

Practice another set Take a test on this chapter →