Scribd
Upload
21 views4 pages

Os File

The document discusses hardware and software requirements for different operating systems like Windows 10, Windows XP, UNIX and Linux. It also includes a C program code to simulate the CPU scheduling algorithm First Come First Serve (FCFS).

Uploaded by

21it029
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views4 pages

Os File

The document discusses hardware and software requirements for different operating systems like Windows 10, Windows XP, UNIX and Linux. It also includes a C program code to simulate the CPU scheduling algorithm First Come First Serve (FCFS).

Uploaded by

21it029
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

JSS Academy of Technical Educa on, Noida Opera ng Systems Lab (KCS-451)

EXPERIMENT 1:

AIM: Study of hardware and so ware requirements of different opera ng systems (UNIX, LINUX,
WINDOWS XP, WINDOWS 10.

Hardware Requirements:

Opera ng Windows 10 WINDOWS XP UNIX OS LINUX


System
/Hardware
Processor 1 GHz or faster Pen um 233 IBM 604e 32-bit Intel-
processor or MHz processor or processor with a compa ble
System on a faster (300 MHz clock speed of processor
Chip (SoC) is recommended) 375 MHz or running at 2 GHz
faster or greater

RAM 1 GB for 32-bit or At least 64 MB of 1 GB 512 MB RAM


2 GB for 64-bit RAM (128 MB is
recommended)

Hard Disk 16 GB for 32-bit At least 1.5 GB of 250MB available Disk space: 2.5
OS or 20 GB for available space hard drive space GB for Pipeline
Space
64-bit OS on the hard disk Pilot server plus
component
CD-ROM or DVD-
ROM drive A DVD-ROM drive

Graphics card DirectX 9 or later Sound card TCP/IP network


with WDDM 1.0 interface
driver GTX 900 series A persistent
Internet ---
connection.

Display 800 x 6009 with Video adapter A suitable


WDDM driver and monitor with monitor for the
Super VGA (800 x opera ng system
600) or higher --- with a screen size
resolu on of at least
1024x768

B2 (IT-2) SHIVANSH GUPTA 2100910130102


JSS Academy of Technical Educa on, Noida Opera ng Systems Lab (KCS-451)

So ware Requirements:

1. WINDOWS 10:

Cortana is only currently available on Windows 10, Microsoft account is required for
some features, Miracast, Movies & TV, Secure boot, Skype, Snap, Speech
recognition, Client Hyper-V.

2. Windows XP:
Wi-Fi networking user interface, partial Bluetooth support, Third-party firewall and antivirus
software, Automatic Updates users.

3. UNIX:
Unix was originally written in assembly language, but was soon rewritten in C, a high-level
programming language, ARPANET, printing languages (PostScript, ODF), and at the
application layer of the Internet protocols, e.g., FTP, SMTP, HTTP, SOAP, and SIP.

4. LINUX:

libc6- C Standard shared library

OpenSSL- OpenSSL Libraries; Secure Network Communications Protocol


PAM- Pluggable Authentication Modules

Supported versions

CentOS 7, Oracle Linux 7 and 8, SLES 15, openSUSE Leap 15t, Rocky 8, Alma 8, Red Hat
Enterprise Linux (RHEL) Server 8 and 9

B2 (IT-2) SHIVANSH GUPTA 2100910130102


JSS Academy of Technical Educa on, Noida Opera ng Systems Lab (KCS-451)

EXPERIMENT 2:

AIM: To write a C program to simulate the CPU scheduling algorithm First Come First Serve (FCFS)

SOURCE CODE:

#include <stdio.h>

void findWai ngTime(int processes[], int n, int bt[], int wt[])

wt[0] = 0;

for (int i = 1; i < n; i++)

wt[i] = bt[i - 1] + wt[i - 1];

void findTurnAroundTime(int processes[], int n, int bt[], int wt[], int tat[])

for (int i = 0; i < n; i++)

tat[i] = bt[i] + wt[i];

void findavgTime(int processes[], int n, int bt[])

int wt[n], tat[n], total_wt = 0, total_tat = 0;

findWai ngTime(processes, n, bt, wt);

findTurnAroundTime(processes, n, bt, wt, tat);

prin ("Processes Burst_ me Wai ng_ me Turn_around_ me\n");

for (int i = 0; i < n; i++)

total_wt = total_wt + wt[i];

total_tat = total_tat + tat[i];

B2 (IT-2) SHIVANSH GUPTA 2100910130102


JSS Academy of Technical Educa on, Noida Opera ng Systems Lab (KCS-451)

prin (" \t%d\t", (i + 1));

prin (" %d\t ", bt[i]);

prin (" %d\t ", wt[i]);

prin (" %d\n ", tat[i]);

int s = (float)total_wt / (float)n;

int t = (float)total_tat / (float)n;

prin ("Average wai ng me = %d", s);

prin ("\n");

prin ("Average turn around me = %d ", t);

int main()

int processes[] = {1, 2, 3, 4, 5};

int n = sizeof processes / sizeof processes[0];

int burst_ me[] = {5, 8, 10, 6, 7};

findavgTime(processes, n, burst_ me);

return 0;

OUTPUT:

Processes Burst_ me Wai ng_ me Turn_around_ me

1 5 0 5

2 8 5 13

3 10 13 23

4 6 23 29

5 7 29 36

Average wai ng me = 14

Average turn around me = 21

B2 (IT-2) SHIVANSH GUPTA 2100910130102

You might also like