Computer Science ( D9) : XII - Paper –I

Introduction to Operating System

Scope of the Syllabus Probable
• Introduction, Services of OS, Overview of Windows 98, Windows NT and LINUX. •
Concepts related to information Management, File Systems, Device drivers and Terminal I/O,
• Concepts related to process Management: Process, Concepts of multiprogramming, context
switching, process states, priority, multitasking. • Concept related to Memory Management:
Memory map of single user computer system, partitions, fixed and variable partitions, paging,
segmentation and virtual memory. • GUI: GUI features such as windows, task list, drag,
resize, minimize, maximize, close. • Access & security aspects of OS: security threats,
attacks on security, computer worms & viruses.

Q1. What is Operating System? Explain the services provided by operating system.
Oct 04, 07 Mar 09, 20(3)
Operating System:
(1) Operating system is a layer between Hardware and Software.
(2) An operating system (OS) is a collection of software that manages computer hardware
resources and provides common services for computer programs.

Fig: Logical Architecture of a computer system.

(3) OS enables computer hardware to communicate and operate with the computer software.
It manages the computer's memory, processes, and all of its software and hardware.
Operating systems perform basic tasks, such as recognizing input from the keyboard, sending
output to the display screen, keeping track of files and directories on the disk, and controlling
peripheral devices such as disk drives and printers.
(4) Operating systems can be classified in terms interface. as follows: Character User
Interface (CUI): In which the user can interact with computer by passing predefined text
command only. Graphical User Interface: GUI is a type of user interface that allows users to
interact with Computer with images rather than text commands by using hand held devices
(like mouse etc.). (5) Operating systems can be classified in terms of processing capability as
follows:

P ag e |2
 Computer Science ( D9) : XII - Paper –I

Q2. Which are the three major areas in which the operating system divides its services.
Give example. OR What are the basic services provided by operating system?
Mar02,06,08,09,13(3) Oct04,07,14,15(3)

Main functions of Operating system: Operating system divides its services in the following
three main areas.
(a) Information Management (IM)
(b) Process Management (PM)
(c) Memory Management (MM)

Information Management (File Management): (1) Under Information Management,

Operating system provides services for naming, storing, retrieving, handing the information
in the computer memory. (2) The system services (or system calls) provided under
information management. (a) Create files/directories. (b) Open files/directories (c) Delete,
copy or close files (d) Change working directories. (e) Read data from file to buffer (f) Write
data from buffer to file. (g) Move file pointer etc.

Process Management: (1) A program in execution is known as process. (2) The process
management of operating system manages processes, enable processes to share information,
protect process resources and allocate system resources to processes. (3) Some of the system
services (or calls) provided under information management. (a) Read a process (b) Block a
process (c) Resume a process (d) Terminate a process (e) Suspend a process (f) Delay a
process (g) change the priority of the process (h) Generate a process.

Memory Management: (1) Every program (or process) must be loaded into main memory
before its execution. (2) To improve CPU utilization, multi-tasking operating system may
contain several processes in the memory. (3) The memory management of operating system
takes care of allocation and de-allocation of memory space to the various processes. (4) The
operating system keeps list of all free memory location. Operating system loads the program
into memory and modifies the list. (5) The system services (or system calls) in memory
management are: (a)To allocate a chunk of memory to a process. (b) To free chuck of
memory from a process.

Q3. What is meant by a system call? How it is used? How does an application program
(AP) use these calls during execution? Oct03, Mar06 (3)OR What is system Call? List
any two system calls for memory management, Process management and information
management. Mar15, Ju117 (4) OR Explain Services of Operating System with its
System Call. Oct 09 (3)

System call: System call provides the interface between a process and the operating system.
These calls are generally available as assembly language instructions. A system call is a way
for programs to interact with the operating system.
System calls in information management: (a) Create files/directories. (b) Open
files/directories (c) Delete, copy or close files d) Change working directories. (e) Read data
from file to buffer (f) Write data from buffer to file (g) Move file pointer etc.
System calls in process management: (a) Read a process (b) Block a process (c) Resume a
process (d) Terminate a process (e) Suspend a process (f) Delay a process (g) Change the
priority of the process (h) Generate a process.

P ag e |3
 Computer Science ( D9) : XII - Paper –I

System calls in memory management: (a) To allocate a chunk of memory to a process.(b)

To free chuck of memory from a process.
Application Program Interface (API) provides an interface between a process and
operating system to allow user-level processes to request services of the operating system.

Q4 Give features of windows 98 operating system. Mar15,20,0ct04 13 Jul17(4)

Features of windows 98 operating system are as follows.
Single User, Multitasking OS: (l) Windows 98 is a single user, multitasking operating system. (2) User may run
more than program at a time. (3) The monitor's screen can be partitioned into multiple windows and the progress
of different program can be viewed on different windows.

Internet based operating system:(1) Windows 98 can be easily connected to Internet. (2)
Microsoft introduced many internet based programs such as Internet Explorer 4.01, outlook Express and
Windows address book to work fast. (3) The Internet conference can also be arranged.

Improved Hardware Support: (1) Windows 98 introduced with improved hardware support and it is perfectly
integrated with operating system. (2) This makes it smother and easier to install USB (Universal Serial Bus),
AGP (Accelerated Graphic port), DVD (Digital Versatile Disk) etc.

System File Checker: Windows 98 introduced 'System File Checker', which scan and repair corrupt or missing
files.
FAT 32 File system: (1) Windows 98 supports FAT-32 File system of previous version of Windows 95. (2) It
helps to upgrade the disk storage efficiency.

Q5. Explain any four features of WINDOWS-NT OS. [Mar11,16,17(3),Oct06,11,12,13,Jul

17(4)]

Features of Windows NT: Following are the main features of Windows NT.
(1)Multiuser, Multitasking and Multithreading OS: Windows NT is a multiuser,
multitasking and multi-threading Operating system.
(2) NTFS File System: Windows NT introduced default file system NTFS (New Technology
File System), which is capable of recovering from disk errors automatically, support large
sized hard disk, provide security like permission and encryption.
(3) Windows NT is a 32-bit Operating system.
(4) Hardware Abstraction Layer: This feature enables Windows NT to run regardless of
the hardware platform.
(5) Remotely Access: This feature allows user to log on the system remotely.
(6)Systematic multiprocessing in Windows NT allows it to schedule various tasks on any
CPU in a multiprocessor system.
(7) Interface: It has features like 'Start' button, Taskbar, Explorer, Network Neighborhood,
and Briefcase etc.

P ag e |4
 Computer Science ( D9) : XII - Paper –I

Q6. What are components of LINUX operating system? Explain three features of
LINUX.Mar 04(3)

Introduction to Linux OS: (1) Linux is a popular version of Unix Operating system. (2) In
1991, Linus Torvalds' released the Linux kernel as free, open-source software. (3) Open
source means that the code is fully visible, can be modified and redistributed.
Components of Linux OS: Primarily, Linux Operating System has the following three
components.
Kernel: Kernel is the core part of Linux. Kernel consists of various modules and it interacts
directly with the underlying hardware. Kernel provides the required abstraction to hide low
level hardware details to system or application program.
System Library: System libraries consist of special functions using which applications
access features of kernel, and which implements most of the functionalities of OS.

System Utilities: System Utility programs are responsible for doing specialized, individual
level tasks. These Utilities has all the OS capability enhancement software including
language compiler, text editor, text processing programs, and a wide variety of utility and
tools.

Q7. List any six features of LINUX Operating System. OR State features of LINUX
operating system. Mar14,0ct09, 3,14(3)

Features of Linux Operating System: Following are some of the important features of Linux
OS. (1) Multi-User: Linux is Multi-User Operating system. Multiple users can access system
resources such as memory, I/O devices etc. at same time.
(2) Multiprogramming: Linux is Multiprogramming operating system. Multiple
applications or utilities can run at same time.
(3) Open Source: Linux kernel as free, open-source code. Linux is free to use. Linux is open
source and its source code is freely available.
(4) Security: Linux provides user security using authentication features like password
protection, controlled access to specific files, encryption of data etc.
(5) Graphical User Interface: Linux have packages which can be installed to make whole
OS graphics based as Windows.

P ag e |5
 Computer Science ( D9) : XII - Paper –I

(6) Application Support: Linux has its own software repository from where users can
download and install thousands of applications just by issuing a command in Linux Terminal
or Shell.
(7) Windows application Support: Linux can also run Windows application if needed.

Q8. What is file system? List and explain types of file systems used in OS.Mar 15, 18 (3)

File Management System in OS:

(1) A file is collection of specific information stored in the memory of computer system.(2)
File management is the process of manipulating files in computer system such as creating,
modifying and deleting the files. (3) File management is one of the basic and important
features of an operating system. (4) All the files with different extensions are managed by
operating system. (5) Files are maps on to physical devices such as tapes or disks. (6) There
are two types of file systems: (a) Tape-based system: It is sequential store device. In these
systems, files are stored on to reels of physical tapes. Tapes are used for transportation of day
from one computer to another. It is simple by inefficient. (b) Disk-based system: It uses disk
to store data, it is random store device. Each disk is divided into tracks and each track is
divided into number of sectors. Number of tracks and size of sectors are variables. It varies
from one drive to another.
(7) The general hierarchy of the storage in an operating system is as follows. (8) The root
directory is present at the highest level in the hierarchical structure. It includes all the
subdirectories in which the files are stored. Subdirectory is a directory present inside another
directory in the file storage system.

Q9. Explain file system related to Information Management with file operations
only.Mar04,.07(4)
Operations of file: (1) An operating system provides a set of operations to deal with files and
their contents. These operations are known as file operations.
(2) Different operating systems provides different file operations, some are common.
Create: It is used to create a new file. When the file is created, there must be sufficient
memory space for the file and an entry must be made for the file within the directory.
Delete: The file can be deleted if no longer needed. It is known as deleting a file. To delete a
file mean, searching the file name within the directory entry and releasing the memory
location and other details of the file from directory entry.
Open: For reading and writing from an existing file, a file must be opened before using it.
This operation is known as opening a file.
Close: When we close the opened file, this is known as closing a file. After completion of all
the operations on file, the file must be closed.
Read: Accessing the data from an existing file is known as reading a file. Before reading a
file must be opened. Read operation is used to read the stored data from the file.
Write: Storing data to the file is known as writing a file. Before writing operation, a file must
be opened. Writing operation is used to store the data to the file.
Append: Adding new data at the end of an existing file is known as appending a file. Before
append operation, a file must be opened. Appending operation is used to add the data at the
end of an existing file.
Rename: To change the name of the file to new name, it is known as renaming a file.
Copy: When we create another copy of an existing file it is known as copying a file.

P ag e |6
 Computer Science ( D9) : XII - Paper –I

Q10. Explain the following terms in case of Magnetic Disk. (i) Track and Sector (ii) Seek
Time (iii) Transmission Time (iv) Latency/Rotational
Time.Mar06,09,10,0ct03,06,Ju117(4)
(i) Track and Sectors:
1) Magnetic disk surface is divided into number of
concentric circles called tracks. The number of tracks
varies depending on the disk type. 2) A track is further
divided into smaller areas called sectors. A sector is a
smallest unit of information which can be read from or
written to the disk. 3) The disk address is comprised of the
sector number, track number, and surface number.
(ii) Seek Time: The time required to position the read/write
called the seek time.

(iii)Transmission Time: The time required for activate

Read/Write head for appropriate surface and read data is
called as transmission time.
(iv) Latency time/Rotational delay: The time required
to spin the desired sector under the head is called the
latency time. It is also known as rotational delay.

Q11. Define the term "Device Driver". Mar10,Ju118

Device Driver:1) The computer program which controls a particular device is called device
driver. 2) Device driver, simply known as driver is also called as hardware deriver. 3) Device
drivers are required to operate the device correctly connected to the computer. It enables the
operating system to interact with hardware devices. 4) Device driver for the particular devices
changes one operating system to another. 5) It is essential that a computer have the correct
device drivers for all its parts to keep the system running efficiently.

Q12. What is VDU? Explain Dumb Terminal and Intelligent Terminal. OR Define the
term "Terminal I/O" Oct07,09(4),Mar18(3) Mar 10, Jul 8

VDU (Video display Unit) or Terminal I/O: (1) A screen usually associated with a keyboard
and together they form a video display unit (VDU) also known as video display terminal
(VDT) or terminal I/O. (2) It can be used as both as input and an output device. (3) There are
two types of terminal I/O hardware. (a) Dumb Terminal (b) Intelligent Terminal
(a) Dumb Terminal: (1) A dumb terminal consists of limited amount of memory and a
microprocessor on which small programs can be run. It performs basic input/output
operations. (2) A dumb terminal does not process on input character.
(b) Intelligent Terminal: (1) Intelligent terminal consists of more memory, a powerful
hardware and software as compared to dumb terminal. (2) It can carry out some process on
input characters, it can also process independently.

P ag e |7
 Computer Science ( D9) : XII - Paper –I

Q13. What is Video RAM? Explain use of Attribute Byte and Data Byte of Video RAM
with example. Mar08 13,0ct11,13,Jul16(4)

Video RAM-(VRAM):
1) The terminal hardware itself has a memory known as video RAM. 2) Generally, an
alphanumeric screen displays a character matrix of 25 lines by 80 characters. (ie. 25 x 80 =
2000 characters). 3) Video RAM contains characters which are currently displayed on the
screen by the video controller using display electronics. 4) Video RAM consist of 2000 data-
bytes preceded by 2000 corresponding attributes bytes as shown in the figure.
Attribute Data Attribute Data
Byte 0 Byte 0 Byte 1 Byte 0

Attribute Data
Byte 1999 Byte 1999

(5) VRAM contains contiguous block of memory, and every two bytes for each character.
The first byte indicate "Data-Byte" and second is known as "Attribute-Byte". (6) All 2000
characters are stored in extended 8-bit ASCII code in the video RAM. These are known as
"Data-Byte".(7) There is one "Attribute Byte" for each data-byte. The attribute byte shows
whether the character to be displayed is Bold, Italic, Underlined, blinking, inverse etc.

Q14. Why Video Terminal is called Memory Mapped? Explain difference of

Alphanumeric (CharacterOriented) & Graphic (Bit Oriented) memory Mapped Video
Terminals. Oct08,10,Jul 16(4)
Type of memory mapped I/O terminals:
There are two types of memory mapped I/O terminals (a) Alphanumeric (Character Oriented)
memory mapped terminal (b) Graphic (Bit Oriented) memory mapped terminal
Alphanumeric (Character Oriented) memory mapped terminal:
(1) The I/O terminal with video RAM which maps only characters to be displayed on the
screen is known as Alphanumeric (Character Oriented) memory mapped I/O terminal. (2)
Generally, an alphanumeric screen displays a character matrix of 25 lines by 80 characters.
(ie. 25 x 80 = 2000 characters). (3) The output to be displayed on the screen is stored in a
special block of memory known as Video RAM (VRAM), which stores ASCII values of the
characters currently displayed on the screen. (4) VRAM contains contiguous block of
memory, and every two bytes are for each character. First byte indicates "Data-Byte" and
second is known as "Attribute-Byte".
Graphic (Bit Oriented) memory mapped terminal: (1) The I/O terminal with video RAM
which maps pixels (i.e. bit) to be displayed on the screen is known as graphic (Bit Oriented)
memory mapped I/O terminal. (2) A bit map defines a display space and the color for each
pixel (or bit) in the display space. For bit oriented color graphics terminals each pixel requires
24 or 32-bits. (3) Bit map terminal requires considerable amount of video RAM.

P ag e |8
 Computer Science ( D9) : XII - Paper –I

Q15. Why keyboard is referred as memory map terminal? Explain the multiple
memories involved in the input-output operations between the keyboard and screen.Mar
05(4)

Keyboard as memory map terminal: (1) When you type, the keyboard analyzes what
characters to send to the computer. It maintains these characters in its memory buffer and
then sends the data. (2) For moving any data in or out of the video RAM, ordinary load or
store instructions are sufficient. So, keyboard is referred as memory map terminal. (3)
Following are memories are involved in I/O Operation between keyboard and screen. (a)
Internal memory of Keyboard: When a character is keyed in, the 8—bit extended ASCII
value is stored temporarily in keyboards memory. (b) Video RAM: The ASCII code for the
character is moved in the VRAM at the corresponding position with appropriate
coordinates.(c) Operating system buffer: The operating system has two separate buffers for
input and output operations. (d) I/O area of application program: The stored data of operating
system buffer is flushed out the I/0 area of the application program which wants that data.

Q16. What is Process? Explain running, ready and blocked process_ states of Process
Management. [Mar-12,13,14,18,Oct04,05,12(4)]

Process: (1) The program in execution is known as Process. It is also known as job. When
the program is loaded in main memory, then it became process. (2) In multiuser or
multitasking operating system, multiple processes are executed from different programs at a
time. The process management of such OS keeps track of all running processes, schedules
them and dispatches them one by one.

Process Management: (1) A program in execution is known as process. (2) The process
management of operating system manages processes, enable processes to share information,
protect process resources and allocate system resources to processes. (3) Some of the system
services (or calls) provided under information management.
(a) Read a process (b) Block a process (c) Resume a process (d) Terminate a process (e)
Suspend a process (f) Delay a process (g) Change the priority of the process (h) Generate a
process.

Ready State: (1) A process will be in ready state after it is loaded into the main memory and
is ready for execution. In ready state, the process waits for its execution by the processor. (2)
In multiprogramming environment, many processes may be present in the ready state. (3) A
ready queue is used in computer scheduling to contain all the processes, which are in ready
states. The process in this state is
waiting to be assigned to a processor.

Running State: New Job completed (I)

CPU (Processor) can execute only one
process Job is allocated to CPU at a
time. A process moves form ready state
to running state after it is assigned the
CPU for execution. (2) In multitasking
operating system, multiple processes can be in waiting state or in ready state but there will be
only one process that will be in running state.

P ag e |9
 Computer Science ( D9) : XII - Paper –I

Block State: (1) A process moves from running state to block state if it requires some
blocked resource during its execution. (2) After the resource becomes available, the process
moves to the ready state again. (3) The blocked process cannot be directly scheduled even if
CPU is free.

Q17. What is Context Switching? Explain context switching at a process level in

Multiprogramming System with example. OR Explain context switching between two
processes A and B with diagram. OR Explain the process of Multiprogramming in
Process Management with an example. OR What is Multiprogramming and context
switching in Process Management of OS?[Mar 09,16(4), Oct 10,11(4) 15(3), Jul 16(4)]

Multi-programming system:
(1) The system in which two or more programs (or jobs) are loaded in main memory and
ready to execute is known as multiprogramming system. (2) Only the running program can
execute its instruction at a time on CPU, while all the others are waiting for their turn. (3) It
increases utilization of CPU. CPU always has a program to be executed. (4) When a running
program is waiting for input output operation, OS allocates a CPU to another ready program,
instead of allowing the CPU to be idle.
Context Switching: (1) In multiprogramming system, if the running process is waiting for an
event such as I/0 operations, CPU executes another process and vice versa. (2) It increases
utilization of CPU. CPU always has a program to be executed. (3) The time required by the
CPU to switch from one process to another is known as context switching. (4) In other words,
the lose in time in turning the attention of CPU from one process to another is known as
context switching. Consider the following figure

(5) Consider the two processes "A" and "B", they are ready to execute and require CPU time
for execution.
// Process A // Process B
#include<iostream.h> #include<iostream.h>
void main() void main()
{ inta,b,c; { inta,b,c;
a= 10; a= 10;
b = 20; b = 20;
c=a+b; c=a*b;
cout<< "sum="<< c; cout<< "product="<< c;
} }
(6) Let CPU time is given to process A, which is having some instruction for I/O event, and
then OS halts the execution of process A and gives CPU time to process B to execute. Hence
the context switching is the time taken by the CPU to turn attention from process A to
process B. (7) During context switching, CPU doesn't do anything and remain Idle.

P a g e | 10
 Computer Science ( D9) : XII - Paper –I

Q18. Explain following terms in case of Process Scheduling:i) Turn-around Time ii)
Waiting Time iii) Terminal Response Time iv) Event Response Time.Mar 05,18,
Oct08,09(4)

(1) Turnaround Time: The time duration between the submission of a job to a computer
system for processing and the completion of the job is known as Turnaround time.
(2) Waiting Time: The time which a newly admitted job spends waiting in the waiting queue
for the operating system to allocate resources to it before its execution is known as Waiting
Time.
(3) Terminal Response Time: The time interval from the time of submission of a job to the
system for processing to the time the first response for the job is produced by the system is
known as Terminal response time.
(4) Event Response Time: The time to respond with an event in the real-time system is
known as Event Response Time.

Q19 With reference to process management, explain the terms. (i) External Priority (ii)
Purchase Priority (iii) Internal Priority (iv) Time Slice[Mar06,08,10,11,16,17,19,0ct10(4)]

Priority of process: (1) Priority is a policy by which the ready processes can be arranged in
a queue to dispatch for execution. (2) Concept of priority is used to decide which process gets
the CPU first for execution. (3) The process priority can be of following types. (i) External
Priority (ii) Purchase Priority (iii) Internal Priority (iv) Time Slice
(i) External Priority: (1) The priority which is decided by the user externally at the
time of initiating the process is known as External Priority. (2) If user does not
specify any external priority, the OS uses default priority.
(ii) Internal Priority: (1) The priority decided by the scheduling algorithm of OS is
known as internal priority. (2) The following scheduling algorithms are used for
internal priority decision. (a) Shortest Job First (SJF) (b) First come First Serve
(FCFS) (c) Round Robin algorithm (d) Early Deadline First (EDF) algorithm etc.
(iii) Purchase Priority: (1) If a process is charged to give higher priority, it is known
as purchase priority. (2) It prevents each user from firing his job at the highest
priority. (3) OS keeps track of the time used by each process and the priority at
which it was used.
(iv) Time Slice: (1) In Time Sharing System, each process has given a time span to
run its task irrespective of its important. This time span is known as Time Slice,
Time Slot, or Quantum. (2) In each time slice the processes get the CPU attention
turn by turn. (3) If the time slice is over, the process is sent back to the ready
queue for its next turn.

Q20. Explain the term Multi-tasking with suitable example. OR Explain time sharing
related to process management of operating system. ORExplain multiuser and time
sharing operating systems. Oct03,13(4), Mar 15,(3),20(3)

Multitasking Operating system: (1) The system that works with more than one program or
task simultaneously is known a! Multi-Tasking Operating System. (2) Generally it is time
sharing system. Each process has given a time slice to execute task and then the chance is
given to another process and so on and loop will be continued. (3) It uses different scheduling

P a g e | 11
 Computer Science ( D9) : XII - Paper –I

algorithms to schedule the process to be executed. (4) Degree of Multiprogramming: The

maximum number of processes that a single-processor system can handle efficiently is known
as degree of multiprogramming.
Time Sharing System: (1) In Time Sharing System, each process has given a time span to
run its task irrespective of its important. This time span is known as Time Slice, Time Slot, or
Quantum. (2) In each time slice the processes get the CPU attention turn by turn. (3) A time
slice is typically of 10 to 100 milliseconds.

Example of Process management in Multitasking using Time Sharing:

(1) In Time sharing system, the new process will add to the tail of the ready queue and the
completed process is removed from the head of queue. (2) Consider the three processes A, B
and C are present in the ready queue.

(3) CPU selects a process "A" for execution from ready queue, and set a timer. After
completion of time slice, the process "A" will be removed. If the process "A" is not finished it
will add in the tail of the queue and CPU selects process "B". In this way, the process is
going on.

(4) The Ongoing queue is managed like circular queue. Multi-User Operating system: (1)
Multi-User OS allows two or more users to run programs at the same time.(2) Some
operating systems permit hundreds or even thousands of concurrent users. (3) The Multiuser
operation system can be multitasking OS or multiprocessing OS. (4) In Multi-user, Multi-
tasking OS, Multiple tasks can be performed by OS at a time. (5) It generally uses time
sharing system to divide the CPU time among the users.

Q21. Explain in short the three main functions to be carried out by

MemoryManagement. State any two types of Contiguous Real Memory Management
Systems. OR What functions are performed by memory management of operating
system? State any four memory management system. OR What functions are
performed by Memory Management of OS? Mar13,14(3), 17(3), 19, Oct06,07(4),13(4)

Main function of Memory Management: The main functions performed by the memory
management module are as follows. (1) To Keep track of all memory locations free o' r
allocated and if allocate, to which process and how much memory is allocated. (2) To decide
memory allocation policy i.e. which process should get how much memory and where. (3) To
allocate memory to process when they need it and de-allocate when they are done. (4) To use
various techniques and algorithms to allocate and de-allocate memory locations.
The following are memory management system.
(i) Contiguous, Real Memory Management System
(a) Single contiguous (b) Fixed contiguous (c) Variable partitioned
(ii) Non-Contiguous, Real Memory Management System (a) Paging (b) Segmentation (c)
Combined (Paging & Segmentation)

P a g e | 12
 Computer Science ( D9) : XII - Paper –I

(iii) Non-Contiguous, Virtual Memory Management system (a) Virtual Memory

Q22. Explain memory map of single user operating system. Explain single contiguous
and fixed partitioned memory management systems with a suitable memory mapping
diagram. Mar 04,05,11,20(3),0ct10(4)

Single User Contiguous allocation (Uni-programming Memory model):

(1) System in which only one job is processed by the system at a time and all the system
resources are exclusively available for the job, it is known as uni-programming
system. (2) In uni-programming system, only one job can reside in the memory at a
time, the next job will be loaded only after completion of previous job. (3) The
operating system like MS-DOS is a single user OS. (4) The memory map of such
operating systems consists of program to be executed i.e. Process, free memory
available and operating system area. 5) In single user contiguous memory allocation,
when system is started the command interpreter is invoked. 6) The program to be
executed is loaded in the main memory by the OS, and assigns as much memory as
needed to the processor. And then the command interpret executes the program. (7)
Other program is loaded only when the current program completes it's all the
operations. The system memory and other resource are fully dedicated to the current
program. (8)If the program is terminated, it is
removed from memory. (9) This memory
management scheme is simple and easy to
implement but the utilization of main memory
resources is poor. The memory space, other than
occupied by the process, remains unused during
execution of the process.

Figure: Single User Contiguous Amory allocation

Q23. What is Partitioning? Explain fixed and variable

partitioning. OR Explain fixed partitioning and
variable partitioning in memory management of OS.
Mar 08,09,Oct 05 Jul 17(4), 18(4)

Partitioning:(1) In multiprogramming, multiple processes from multiple users should be

loaded in main memory simultaneously for execution. (2) In certain operating system, the
main memory is divided into multiple sections to allow multiple programs to be loaded in
memory. These sections are called partitions. (3) Basically, there are two types of partitions.
(a) Fixed partitions (b) Variable Partitions
(4) In fixed partitions, partitions may be of same sizes or of different sizes. (5) In variable
partitions, the partitions are not of fixed sizes.

Fixed Partitions: (1) In partitioning, when the main memory of the system is divided into
multiple parts, with fixed sizes, it is known as fixed partitioning and these parts are known as
fixed partitions or static partitions. (2) The sizes of the partitions may be same or different but
they are fixed.

Variable Partitions: (1)In variable partitioning number of partitions and their sizes are
variables. (2) Variable partitions are not decided at the time of system generation. The

P a g e | 13
 Computer Science ( D9) : XII - Paper –I

partitions are created at run-time therefore it is also known as Dynamic partitioning. (3) The
number, sizes and locations of the partitions are varied dynamically as process are loaded and
terminated.
Q24. State various steps involved in allocation of a partition in case of fixed partition
memory management. Mar06,07,17,0ct03,10,12(4)
Fixed Partitions (Static Partitions):
(1) In partitioning, when the main memory of the system is divided into multiple parts. with
fixed sizes, it is known as fixed partitioning and these parts are known as fixed partitions or
static partitions. (2) The sizes of the partitions may be same or different but they are fixed. (3)
The partitions, in fixed partitioning, are decided at the time of system generation. (4) In fixed
partitions, the maximum number of processes that can be loaded in main memory is fixed. ie.
degree of multiprogramming is bounded by the number of partitions. (5) If the system has n-
number of partitions, then only n-processes can be loaded in the memory simultaneously.

(6) Each partition will contain exactly one process. User cannot load more task than the
number of partitions available. The process gets the chance to entry into main memory as
soon as the partition with appropriate size is free. After completion of execution and
termination of a process the particular partition will be de-allocated. The partition will be
allocated to the next process. The fixed partition memory management schemes suffer from
internal fragmentation

Q25. Explain paged memory management system with a suitable Page Map Table
(PMT). Mar 10, Oct 04, 08, 15, Jul 16(4)

Paging: (1) If the physical memory of the computer is divided into small-size memory blocks
called page frame, and the program to be loaded in memory is also divided into same size
blocks called pages, then this scheme is known as paging. (2) Paging permits memory of a
program to be non-contiguous which allows a program to be allocated physical memory
wherever available. (3) The physical memory is partitioned into fixed-sized small blocks
called page frame. (4) Similarly the program to be loaded is also divided into same size
blocks called pages.(5) Then these pages of the programs are loaded into page frame of
physical memory. 16) The pages of the program can be loaded into non-contiguous memory
blocks. (7) The page map Table (PMT) contains logical page number of the program and
allocated page frame to those pages. The page number is used as an index into PMT.

P a g e | 14
 Computer Science ( D9) : XII - Paper –I

(8) The page size is defined by the hardware at the time of system generation. It is typically
power of 2.

Q26. Explain Segmentation with example. Oct04,Mar11(4)

Segmentation: (1) The computer program can be divided into logical parts. Each part is
called segment. (2) The segments of the program can be of different sizes. All of which are
loaded into memory at run time, though not necessarily contiguously. (3) Each segment has
its own index and length (or size). (4) There is no simple relationship between logical
addresses and physical address in segmentation. Information about logical and physical
address of segments are stored in a special table called Segment Table. (5) Each program can
be considered to be consisting of different segments such as code, data, stack etc. Each of
these can be further divided into new segments. (6) The segment Table maps two
dimensional logical address into one dimensional physical address. Each segment table
consists of Base address of each segments and limits (length of the segments). Consider the
following example.

(7) In main memory, we only store the segments of the process. Process segment table is used
to keep the record of segments, its size, and its memory address.
(8) The basic difference between paging and segmentation is that a page is always of fixed
size block whereas a segment is of variable sizes.
(9) The size of the pages in paging is predefined while the sizes of segments are decided by
the user.

Q27. Explain Internal and External Fragmentation in memory management of OS.

Mar20(3)

P a g e | 15
 Computer Science ( D9) : XII - Paper –I

External Fragmentation: (1) A situation when enough total free memory space exists to
satisfy the memory need of a process, but still the process cannot be loaded because the
available free memory is not contiguous, it is known as External Fragmentation. (2)
Generally the problem of external fragmentation occurs in portioned memory management
system. (3) Example: Fixed partition memory, variable partition memory etc.
Internal Fragmentation: (1) A situation when a process is allocated more memory than its
actual memory requirement is known as Internal Fragmentation. (2) The additional memory
allocated to the process remains unutilized because it is neither used by the process nor it can
be allocated to any other process for use. (3) Example: Paging, segmentation etc.

Q28. What is Virtual Memory? Explain any three terms related to virtual memory. OR
Explain the following concept of Virtual Memory: (1) Page Fault (2) Demand paging (3)
Page Replacement Policy(4) Locality of Reference (5) Working Set (6) Dirty Page (7)
Dirty bit. Mar 04, 15, 16(4)

Virtual Memory: (1) Virtual Memory Management allows the portion of the hard disk to be
considered as a part of the main memory. This portion of hard disk is known as virtual
memory. (2) It allows the program to be loaded to start execution even though there is no
sufficient memory to load entire program. (3) It also allows the program to be loaded which
is larger than the actual physical memory size of the computer. (4) It also allows having
memory protection, because each virtual address is translated to a physical address. (5) There
are two most common methods of implementation of virtual memory; paging and
segmentation. (6) Following are the concept related to virtual memory management.

(1) Page Fault:[Oct06,07,14, Mar11(1)]

(a) Using virtual memory we can load few pages of the program to start its execution and
when a program attempts to access a page that is not currently in the physical memory, a page
fault occurs. (b) At this stage, the operating system must bring the required page into the
memory before the execution of that instruction can restart. (c) Most page faults are handled
without any problems. However, an invalid page fault may cause a program to crash.
(2) Demand Paging: [Oct14(1)]
(a) The process of loading the page into memory on demand whenever page fault occurs is
known as Demand paging. (b) Demand paging is a scheme similar to that paging scheme with
an additional facility of swapping in of pages of a process as and when they are needed
during the execution of process, rather than loading all the pages.
3) Page Replacement Policy:[Oct06,07, Mar 11(1)]
(1) When there is a page fault, the referenced page must be loaded in the memory. (2) If the
memory is already full and there is no place for the demanded page, the OS has to replace the
demanded page with the page already resides in the memory. (3) OS uses different algorithm
to decide which page has to be replaced, this is known as page replacement policy.
4) Locality of Reference: [Oct07]
(a) Locality of reference is one of the basic principles behind virtual memory. (b) From the
behavior of the page, it provides some basis of forecast whether a page is likely to be
referenced in the near future or not. (c) It helps to decide whether the page should be thrown
out from the main memory or not to make space for the new page.
5) Working set: [Oct06,07,14, Mar11(1)]
(a) The number of pages among the loaded pages of main memory, which are actively
referenced at any time is known as working set. (b) Working set helps OS to decide which
page can be replaced on demand paging.

P a g e | 16
 Computer Science ( D9) : XII - Paper –I

6) Dirty Page/ Dirty bit:[Oct06,14,Mar11(1)]

(a) If the page is modified after it is loaded in main memory, it is known as dirty page. (b)
The operating system maintains one bit for each physical page frame to denote whether a
page has become dirty or not. This bit is called dirty bit.

Q29. What is GUI? Explain in brief any two features of GUI. OR Explain any six basic
GUI features.OR What is GUI? State any four advantages of GUI. Oct03, 06(3), 07 Mar
05(3),12,Jul 17(3)

GUI (Graphical User Interface): (1) GUI stands for Graphical User
Interface. (2) GUI is a type of user interface that allows users to interact with
Computer with images or icons rather than text commands. (3) GUI objects
include icons, cursors and buttons. (4) It allows the use of hand held device
such as mouse etc. (5) Windows is GUI based operating system.
Advantages of GUI: (1) The textual commands are replaced by graphics. (2)
User does not need to remember difficult text commands. (3) GUI is much
easier to learn and easier to use. (4) User can run several programs at a time.
(5) Data can be share from one program to another program. (6) Person with
no computer knowledge can perform basic operation using GUI.
Features of GUI: (1) Icons: Text command is replaced by graphical icons. (2)
Pointing Device: Hand held devices (e.g. mouse) can be used with GUI that
which is not possible with character user interface (CUI). (3) Windows: GUI allows the use
of programs or application as Windows. (4) Menus: GUI includes menus which allow users
to select command using menu items. (5) Drag and Drop: 'Cut and Paste', Drag and drop
operations can be easily done in GUI. (6) Attractive: GUI is attractive and pleasing to the
eyes. (7) Interactive Objects: Objects of GUI change color, size or visibility when the user
interacts with them. (8) Single Click: Users can use single click to select a particular process.
(9) Double Click: Users can double click to start and application.

Q30. What is GUI? Explain any two essential components of GUI. OR Define GUI.
Explain Menu Bar and Scroll Bar.
OR Explain the function of menu bar and scroll bar components of GUI.
OR Explain three components of MS Windows. 1) Menu Bar 2) Title Bar 3) Scroll Bar
4) Task Bar5) Minimize Button 6) Maximize Button 7) Close Button [Mar 07,18) Oct 08]

GUI (Graphical User Interface): (1) GUI stands for Graphical User Interface. (2) GUI is a
type of user interface that allows users to interact with Computer with images or icons rather
than text commands.

P a g e | 17
 Computer Science ( D9) : XII - Paper –I

Essential Components of GUI: Some of the essential components of GUI are as follows.
1) Menu Bar 5) Minimize Button Menu Bar:
2) Title Bar 6) Maximize Button
3) Scroll Bar 4) Task Bar 7) Close Button

Menu Bar: (1) Menu bar is one of the most essential components of windows. (2) Menu bar
contains labels for different menus. Essential functions of the program are categorized in
Menus as options. (3) Some commonly menus are File, Edit, View, Window, Help etc

Title Bar: (1) Title bar is small strip which appears at the top of the window. (2) Title bar
displays the title of window and includes control box (min, max, close button).

Scroll Bar: (1) Generally there are two scroll bars, horizontal scroll bar and vertical scroll
bar. (2) Scroll bar is used to scroll the window are vertically and horizontally. (3) Scroll bar
contains slider box, which allows to working are to be positioned on screen.

Taskbar: (1) Generally, a Taskbar shows the running program and all the opened programs.
(2) Taskbar is a strip located at the bottom edge of the screen. (3) Generally it contains a start
button in Windows OS.

Minimize Button: It is one button control box of window.It allows a window to be

minimized.

Maximize Button: It is one button control box of window. It allows a window to be

maximized.

Close Button: It is one button of control box of window. It allows a window to be closed.

Q31. Explain in brief the following programs of MS-Windows. (i) Program Manager (ii)
File Manager (iii) Control Panel Mar 03,07,09,13(3)

Program Manager: (1) Program manager has all the executable files of every application
and program. (2) It starts executing along with MS-Windows. (3) Program manage is the

P a g e | 18
 Computer Science ( D9) : XII - Paper –I

main window of MS Windows 3.x. (4) Basically it allows users to select and run program on
operating system. (5) Program manager is still available in all versions of MS windows e.g.
Windows 95,98 NT, 2000 or XP.
File Manager: (1) File Manager Window enables you to display and manage you files and
folders. (2) It allows user to traverse through the file system and change drives. (3) It also
allows searching, copy and pasting, moving, creating or deleting files and folders. (4) It
allows application to be started directly by double clicking on it.
Control Panel: (1) Control panel is used to view and change system settings. (2) It is used to
add or remove hardware and software. (3) It is used to change display setting of applications,
such as background, border color/width, cursor size and shape etc. (4) It includes controlling
user accounts, changing accessibility options and N/W setting. (5) It is used to configure
printers and other ports on the PC.

Q32 Define Security. Explain the different elements of security. OR. Explain the
following elements of data security. (i) Confidentiality (ii) Integrity (iii) Availability Mar
05, 18 Oct 04,06,08,12,10(3),15(3)

Security: (1) Security -refers to providing a protection to the program and data stored in
memory. (2) Security is a protection from unauthorized access to the system resources such
as memory and other devices, (3) In multiuser operating system, the concept of security is
very important. (4) The system which provides access to information to only properly
authorized user or processes. (5) There are following three main elements of security:
Confidentiality: (1) Confidentiality is permitting approved users to access all confidential
information. (2) It ensures that information is not accessed in an unauthorized manner. (3) It
is generally related to the read operation.
Integrity: (1) It ensures that the information is not modified or deleted by an unauthorized
manner. (2) It is generally related to write operation.
Availability: (1) Availability ensures timely and reliable access to information. (2) In other
words, information is available to authorized users at right time.

Q33. Explain in brief any three ways by which a system can be attacked, and
Penetrated. Mar10,0ct05,09,Ju116,18(3)

Attacked on System:The secured system can be attacked and penetrated by the following
ways
(1) Authentication: Unauthorized user can be penetrated in the secure system by stealing
password, by guessing password using trial and error method, etc.
(2) Browsing: One can browse the system file with access controls, to get the information,
after which, unprotected data file could be read or modified.
(3) Line Tapping: To access the confidential data, special equipment’s are used to tap into a
communication line.
(4) Waste recovery: Wastage or damage hard disk can be recovered to access confidential
data. Some technique can also be used to recover passwords.
(5) Rough Software: Rough software such as viruses or worms can be used to attack the
system.
(6) Trap doors: Trap doors provide secretes methods of gaining access to an application or
operating system. Trap doors are also known as back doors.

P a g e | 19
 Computer Science ( D9) : XII - Paper –I

Q34. What is Computer Worm? Explain its Modes of Operation.

[Mar03,13,Oct08,10,13(3)]
Computer Worm: (1) A computer worm is a malware that spreads copies of itself from
computer to computer. (2) Computer Worm is a complete program by itself (3) Its does not
need to attach itself to other program in order cause damage. (4) A computer worm can
potentially bring the entire network to a grinding halt.
How computer worms work: (1) Usually a computer worm does not harm other programs
or data. (2) It spreads and consumes large resources such as transmission capacity or disk
drive.(3) Worm access 'mailing list' of computer over a network, and sends a copy of it to all
reachable computers. (4) There are two types of worms; intelligent worm and dumb worm.
(5) Intelligent worm does not send a copy to the node where its copy is already exists. While
dumb worm transfers its copy to the node where one copy of its already exists. (6) Worms
can also steal data, install a backdoor, and allow hackers to gain control over system setting.
Save guard against worms: (1) Always update your system with available updated by the
authorized company. (2) Always be cautious to open emails from unknown senders, which
contains attachments. (3) Use internet security software.

Q35. What is Computer Virus? State various types of viruses and the basis on which
they are classified. [Mar02,05,06,07,10,11,17,20,0ct07,15,]u117]
Computer Virus:
(1) Virus is a piece of computer code designed intentionally to infect other program. (2)
Virus is not a complete program by itself. It requires a host program to execute. (3) It is
malware attached to another program, which can replicate and spread after an initial
execution on target system. (4) It causes direct harm to the system. It can infect programs and
data. (5) There are following types of viruses based on where and what do they affect. (i)
boot sector virus (ii) Memory resident virus (iii) File specific virus (iv) Command processor
virus (v) General purpose virus

Q36. What is a Virus? Write any three infecting methods of Virus. OR What is
Computer Virus? State any four methods by which a virus can affect other programs.
[Mar02,05,06,07,10,11,17,20,0ct07,15,Ju117]

Computer Virus:
(1) Virus is a piece of computer code designed intentionally to infect other programs. (2)
Virus is not a complete program by itself. It requires a host program to execute. (3) It is
malware attached to another program, which can replicate and spread after initial execution
on target system. (4) It causes direct harm to the system. It can infect programs and data.

Infecting Methods of Virus:

(1) Append: In this method viral code is appended itself at the last of unaffected program.
(2) Insert: In this method viral code is inserted itself to the unaffected program.
(3) Replace: In this method viral code replaces existing code from the original program by its
code to affect the original program.
(4) Delete: In this method viral code deletes some exiting code from the original program.
(5) Redirect: In this method viral code changes the normal flow of execution of original
program to execute some other task.

P a g e | 20
 Computer Science ( D9) : XII - Paper –I

Q37. Discuss virus detection, removal and prevention philosophies OR Explain the
function of the following Antivirus Programs: i) Virus Detection ii) Virus Removal iii)
Virus Prevention

Function of Antivirus Program: Following functions are performed by antivirus program.

(A) Virus detection: (1) Always use antivirus program, which detects the bit patter of known
viruses. (2) Anti-virus program scans and detects the integrity of the binary file. (3) Some
programs reside in the memory and continuously monitor memory and I/O operations against
virus.
(B) Virus removal: (1) It is very difficult to construct a generalized antivirus, because the
new viruses are created coming out constantly. (2) But, the bit pattern of the known viruses
can be predicted. (3) The antivirus programs searches for the particular bit pattern and if
found suspicious, antivirus removes them.
(C) Virus prevention: (1) The best way to protect the system from antivirus is prevention.
(2) Following are some precautions that can be taken to prevent the system from viruses. (a)
Always buy official and legal copies of software from reliable sources. (b) Backup of
important data should be frequently taken. (c) Always run monitor program which helps in
detection of virus. (d) Scan before opening files and attachments of mail with antivirus
program.

Q38. Distinguish between Worm and Virus. Mar-04 09,12,14,15,Jul18(3)

Worm Virus
1) Computer Worm is a complete program by Computer Virus is not a complete program
itself. by itself.
2) It does not need to attach itself to other It requires a host program to execute.
program in order cause damage.
3) A computer worm is a malware that Virus is a piece of computer code designed
spreads copies of itself from computer to intentionally to infect other program.
computer.
4) A computer worm can potentially bring It can corrupt programs and data.
the entire network to a grinding It causes
direct harm to the system.
5) Types of worms (a) Intelligent (b) Dumb Types of Virus (a) Boot Sector Virus (b)
Worms Memory resident virus (c) File Specific virus

P a g e | 21
 Computer Science ( D9) : XII - Paper –I

Q1. Fill in the Blanks:

1)____________ is not an operating system.
(i) DOS (ii) UNIX (iii) C++ (iv)Linux
2) __________ is an operating system.
(i) C++ (ii) C (iii) VB (iv)Linux
3) _________is an Operating System
(i) VBSCRIPT (ii) UNIX (iii) C (iv) Basic
4) Data is instantly updated, in case of operating system.____operating system
(i) Batch Processing (ii) Multi Programming (iii) Multi User (iv) Real Time
5) _________are the operating system programs.
(i) Application programs (ii) Users programs (iii) Process Management Programs
(iv) Antivirus Program
6) __________are not operating system programs. [Oct10]
(i) Process Management Programs (ii) Memory Management Programs iii) (iii) information
Management Programs iv) Antivirus Program
7) ______________is a free software.
(i) UNIX (ii) DOS iii) LINUX (iv) WINDOWS
8) L INUX i s _ __ ____ type of software.
(i) Public (ii) Free iii) Shareware (iv) Licensed
9) L INUX i s _ __ ____ software.
(i) Public Domain (ii) Free iii) Paid (iv) private
10) Windows NT is______________________ operating system. [Oct03
(i) Multiuser (ii) Multitasking (iii) Multithreading (iv) All of the above
11) In Information Management _________service is provided by operating system.
(i) Change the priority of process (ii) to allocate a chunk of memory to process
(iii) Open a file (for read, write or both) (iv) Wait for a child process to terminate
12) The time required to move R/W head to the particular track is called [ M a r 0 5 -
(i) Latency time (ii) Seek time (iii) Waiting time (iv) Response time
13) A program under execution, which competes for CPU time and other resources is rl__
(i) Process (ii) Multi-programming (iii) Context Switching (iv) None of these.
14) Terminate a Process is the system call available in__________ Management.
(i) process (ii) Memory (iii) Information iv) File
15) Scheduling Policy is the term related to__________Management in OS.
(i) Device ii) Information (iii) Process iv) Memory
16) _________is given to each process so that a process does not use the CPU indefinitely
(i) Context Switching (ii) Time Slice(iii) Token Time
17) Turning attention of CPU from one process to another is called_____________________
(i) Reference(ii) Context Switch (iii) Process Scheduling (iv) Multiprogramming
18) The time lost in turning the attention of processor from one process to another is
called as _________
(i) Circuit switching (ii) Band width (iii) Context switching iv) Packet switching
19) Context Switching is a term related to____________ Management.
(i) Process(ii) Memory iii) Information (iv) Device
20) ___________is not a process state in OS.

P a g e | 22
 Computer Science ( D9) : XII - Paper –I

(i) Ready(ii) Running iii) Exited (iv) Blocked

21) In memory management system, where the part of the process image is in the main
memory and the other part is on the disk, is known as____________
(i) Segmented Memory Management System (ii) single Contiguous Memory Management
system(iii) Virtual Memory Management System (iv) Combined Memory Management
System
22) If the page size of 1 MB Memory is 1 KB, then the number of higher order bits of the
address bus used to denote page number is
(i) 10 (ii) 11 (iii) 12 (iv) 9
23) If the page size for 1 MB is 2 KB then the number of higher order bit of the address bus
used to denote the page number is
(i) 11 (ii) 10 (iii) 9 (iv) 8
24) If the page of 4MB Memory is 1KB, then the number of higher order bits of the address
bus used for page number is
(i) 11 (ii) 21 iii) 12 (iv). 22
25) If the page size for 2 MB memory is 2 KB then the number of higher order bits on
address bus used to denote page number is
(i) 11 (ii) 10 (iii) 9 (iv) 8
26) __________spread more rapidly but causes less damage to computer networks
(i) Virus (ii) Worms (iii) Files (iv) Data

P a g e | 23