15525

V Semester B.Sc. Examination, March/April 2023

(New) (CBCS 2019-20 Batch) COMPUTER SCIENCE
System Software and Operating Systems

Time: 3 Hours Max. Marks: 80

PART-A (10x2=20)

1. Answer any ten questions.

1) Define system software.

System software is a type of computer program that is designed to run a computer's
hardware and application programs. If we think of the computer system as a layered
model, the system software is the interface between the hardware and user
applications.

2) Mention the design of assembler.

The design of assembler in other words: Convert mnemonic
operation codes to their machine language equivalents. Convert
symbolic operands to their equivalent machine addresses. Decide
the proper instruction format Convert the data constants to internal
machine representations.
3) What is bucket sorting?
Bucket Sort is a sorting algorithm that divides the unsorted array elements into several
groups called buckets. Each bucket is then sorted by using any of the suitable sorting
algorithms or recursively applying the same bucket algorithm. Finally, the sorted buckets are
combined to form a final sorted array.
4) Define macro instructions.
A macro instruction is a source program statement that you
code to tell the assembler to process a particular macro definition.
The assembler generates a sequence of assembler language
statements for each occurrence of the same macro instruction.
5) What is dynamic loading?
Dynamic loading is the technique through which a computer program at runtime load a
library into memory, retrieve the variable and function addresses, executes the functions,
and unloads the program from memory. It is often used to implement software plugins.

6) Mention the specification of database format

Operation Table (OPTAB) and Symbol Table (SYMTAB).
7) Differentiate between client and server.

.Clients act as the front end, and servers remain at the back end.
Clients are in charge of delivering the user with data, whereas
servers are in charge of storing and managing the data.
8) What is a thread?
A thread is a basic unit of CPU utilization, consisting of a program
counter, a stack, and a set of registers, ( and a thread
ID. ) Traditional ( heavyweight ) processes have a single thread of
control - There is one program counter, and one sequence of
instructions that can be carried out at any given time.
9) What is an embedded system?
An embedded system is a combination of computer hardware and software designed for a
specific function. Embedded systems may also function within a larger system. The systems
can be programmable or have a fixed functionality.
10) Define priority scheduling.
Priority Scheduling is a process scheduling algorithm based
on priority where the scheduler selects tasks according to priority.
Thus, processes with higher priority execute first followed by
processes with lower priorities.
11) Define deadlocks.
A deadlock is a situation in which two computer programs sharing the same resource
are effectively preventing each other from accessing the resource, resulting in both
programs ceasing to function. The earliest computer operating systems ran only one
program at a time.
12) What is system model?

The systems model is a process-oriented representation that emphasizes the

influences, or flow, of information between modules. A systems model describes how
processes interact and what operations these processes perform, but it does not go
into details as to how these processes are implemented.

PART-B

Answer any six questions.

13) Explain simplified instructional computers with architecture.

SIC Machine Architecture/Components – 
1. Memory – 
2. Registers – 
3. Data Format – 
4.InstructionFormat – 
5. Instruction Set – 
6.InputandOutput – 
 14) What is searching? Explain linear and binary search with example.
 15) a) Explain the macro instructions.
A macro instruction is a request to the assembler program to
process a predefined sequence of instructions called a macro
definition. From this definition, the assembler generates machine
and assembler instructions, which it then processes as if they were
part of the original input in the source module.

b) Mention the features of macro facility.

A macro facility is an add-on piece of system software, a
convenience for the programmer, to facilitate production of multiple
lines of commonly occurring code via single macro calls embedded
in the programmer's assembly program.

16) What is loader? Explain types of loader.

loader is the part of an operating system that is responsible for loading programs and
libraries. It is one of the essential stages in the process of starting a program, as it places
programs into memory and prepares them for execution.

1) Compile and go loader

2) General loader scheme
3) Absolute loader
4) Direct linking loader
5) Relocating loader .
6) Dynamic linking loader

17) Explain different types of operating systems.

1) Batch Operating System 
2) Multi-processor Operating System  
3) Multiprogramming Operating System  
4) Distributed Operating System 
5) Time sharing Operating System 
6) Network Operating System  
7) Mobile Operating System  
8) Multi-tasking Operating System  
9) Client/Server Operating System  
10) Real-time Operating System  

1)
18) Write a note on:

a) Process Management.

The operating system is responsible for the following activities in connection

with Process ManagementeoForward Skip 10s

1. Scheduling processes and threads on the CPUs.

2. Creating and deleting both user and system processes.
3. Suspending and resuming processes.
4. Providing mechanisms for process synchronization.
5. Providing mechanisms for process communication.

b) Process Scheduling.

Operating system uses various schedulers for the process scheduling

described below.

1. Long term scheduler

2. Short term scheduler
3. Medium term scheduler

19) Explain multi level queue scheduling and multi level feedback queue scheduling.
Multilevel queue scheduling is a type of CPU scheduling algorithm
that divides the ready queue into multiple levels or tiers, each with a
different priority. Processes are then assigned to the appropriate
level based on their characteristics, such as their priority, memory
requirements, and CPU usage.

1. The processes available in the ready queue can be grouped together under different
processing requirements.
2. Each group of processes can have its own scheduling algorithm. For example, consider
the diagram shown above. The processes in Queue1 can use First Come First Serve
scheduling algorithm, Queue2 can use Shortest Job First Scheduling algorithm and
Queue3 can use the Round Robin scheduling algorithm.
 3. A process once assigned to a particular queue cannot change its queue till the process
ends. Suppose, a process P4 is assigned to Queue3 then it cannot migrate to any other
queue till the process P4 terminates.
4. It can be both preemptive or non-preemptive in nature. The implementer can select any
of the scheduling algorithms whether preemptive or non-preemptive and assign it to any
queue.

Advantages and Disadvantages of Multilevel Queue Scheduling

Advantages of Multilevel Queue Scheduling

1. The Multilevel Queue Scheduling algorithm has a low scheduling overhead.

2. Different scheduling methods can be applied to different processes.

Disadvantages of Multilevel Queue Scheduling

1. It is not flexible in nature.

Multilevel Feedback Queue Scheduling (MLFQ) CPU Scheduling is

like Multilevel Queue(MLQ) Scheduling  but in this process can move
between the queues. And thus, much more efficient than multilevel queue
scheduling. 
Characteristics of Multilevel Feedback Queue Scheduling:
 In a multilevel queue-scheduling  algorithm, processes are permanently
assigned to a queue on entry to the system, and processes are allowed to
move between queues. 
 As the processes are permanently assigned to the queue, this setup has
the advantage of low scheduling overhead,

Features of Multilevel Feedback Queue Scheduling (MLFQ) CPU

Scheduling:

Multiple queues: Similar to MLQ scheduling, MLFQ scheduling divides

processes into multiple queues based on their priority levels. However,
unlike MLQ scheduling, processes can move between queues based on their
behavior and needs.
Priorities adjusted dynamically: The priority of a process can be adjusted
dynamically based on its behavior, such as how much CPU time it has used
or how often it has been blocked. Higher-priority processes are given more
CPU time and lower-priority processes are given less.
Time-slicing: Each queue is assigned a time quantum or time slice, which
determines how much CPU time a process in that queue is allowed to use
before it is preempted and moved to a lower priority queue.
Feedback mechanism: MLFQ scheduling uses a feedback mechanism to
adjust the priority of a process based on its behavior over time. For example,
if a process in a lower-priority queue uses up its time slice, it may be moved
to a higher-priority queue to ensure it gets more CPU time.
Preemption: Preemption is allowed in MLFQ scheduling, meaning that a
higher-priority process can preempt a lower-priority process to ensure it gets
the CPU time it needs.
Advantages of Multilevel Feedback Queue Scheduling:
 It is more flexible.
 It allows different processes to move between different queues.
 It prevents starvation by moving a process that waits too long for the
lower priority queue to the higher priority queue.
Disadvantages of Multilevel Feedback Queue Scheduling:
 The selection of the best scheduler, it requires some other means to
select the values.
 It produces more CPU overheads.
 It is the most complex algorithm.
Multilevel feedback queue scheduling, however, allows a process to move
between queues. Multilevel Feedback Queue Scheduling (MLFQ) keeps
analyzing the behavior (time of execution) of processes and according to
which it changes its priority. 

20) Explain prevention and detection of deadlock.

Explain prevention
detection of deadlock.