Skip to main content

Defination of the essential properties of operating systems


Define the essential properties of the following types of operating sys-tems:

  1.  Batch
  2.  Interactive
  3.  Time sharing
  4.  Real time
  5.  Network
  6.  Parallel
  7.  Distributed
  8.  Clustered
  9.  Handheld


ANSWERS:


a. Batch processing:- 

Jobs with similar needs are batched together and run through the computer as a group by an operator or automatic job sequencer. Performance is increased by attempting to keep CPU and I/O devices busy at all times through buffering, off-line operation, spooling, and multi-programming. Batch is good for executing large jobs that need little interaction; it can be submitted and picked up later.


b. Interactive System:- 

This system is composed of many short transactions where the results of the next transaction may be unpredictable.
Response time needs to be short (seconds) since the user submits and waits for the result.

c. Time sharing:- 

This systems uses CPU scheduling and multipro-gramming to provide economical interactive use of a system. The CPU switches rapidly from one user to another. Instead of having
a job defined by spooled card images, each program reads its next control card from the terminal, and output is normally printed immediately to the screen.



d. Real time operating system:- 

Often used in a dedicated application, this system reads information from sensors and must respond within a fixed amount of time to ensure correct performance.


e. Network:- 

Provides operating system features across a network such as file sharing.

f. SMP (Symmetric multiprocessing):- 

Used in systems where there are multiple CPU’s each running the same copy of the operating system.Communication takes place across the system bus.


g. Distributed systems:- 

This system distributes computation among several physical processors. The processors do not share memory or a clock. Instead, each processor has its own local memory. They
communicate with each other through various communication lines, such as a high-speed bus or local area network.


h. Clustered system:-  

A clustered system combines multiple computers into a single system to perform computational task distributed across the cluster.


i. Handheld System:- 

A small computer system that performs simple tasks such as calendars, email, and web browsing. Handheld systems differ from traditional desktop systems with smaller memory and
display screens and slower processors.



If you need any more definitions regarding computer systems. Fell free to comment


Also Read : 

1)  Principles of Server Virtualization

2) Top Ten Data Storage Tools

3) Implement a simple calculator (detailed comments on JAVA code)

4) What is a Livelock scenario in java?

5) What is Disk scheduling algorithm in java ( code Example) 

6) What is a Deadlock situation in Java? What are the minimum requirements for a Deadlock situation in a program in Java? How can we prevent a Deadlock in Java?

7) Recursion-maze problem - Rat in the Maze - Game

8) What are features ,  Advantages and disadvantages of Javascript?

9) C program to read a file and display its contents along with line numbers before each line.

10) C++ program to find LCM and HCF of given 3 numbers


11)  What is cloud computing technology and what are the concepts, principles, applications, and prospects for cloud computing technology?

12) What are the basic characteristics of enterprise cloud computing, and what are the main stages in the construction process?

13) 20 best practices for database design

14) Best practices for DB2 database index design

Comments

Popular posts from this blog

What is a Fair lock in multithreading?

  Photo by  João Jesus  from  Pexels In Java, there is a class ReentrantLock that is used for implementing Fair lock. This class accepts optional parameter fairness.  When fairness is set to true, the RenentrantLock will give access to the longest waiting thread.  The most popular use of Fair lock is in avoiding thread starvation.  Since longest waiting threads are always given priority in case of contention, no thread can starve.  The downside of Fair lock is the low throughput of the program.  Since low priority or slow threads are getting locks multiple times, it leads to slower execution of a program. The only exception to a Fair lock is tryLock() method of ReentrantLock.  This method does not honor the value of the fairness parameter.