Coding and Algorithms

Search This Blog

Optimal page replacement Algorithm

on October 27, 2013

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Program:-

output:- click here....

program written by Akash Arun Jha

os

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Comments

to create a Rainbow using java Graphics (fillArc)

Program: import java .awt .*; import java .applet .*; public class Rainbow extends Applet { public void paint (Graphics g) { int x = 10 ; int y = 10 ; int w = getWidth () - 20 ; int h = getHeight () - 20 ; g .setColor (Color.RED); g .fillArc (x, y, w, h, 0 , 180 ); y += h / 7 ; g .setColor (Color.ORANGE); g .fillArc (x, y, w, h, 0 , 180 ); y += h / 7 ; g .setColor (Color.YELLOW); g .fillArc (x, y, w, h, 0 , 180 ); y += h / 7 ; g .setColor (Color.GREEN); g .fillArc (x, y, w, h, 0 , 180 ); y += h / 7 ; g .setColor (Color.BLUE); g .fillArc (x, y, w, h, 0 , 180 ); y += h / 7 ; g .setColor (new Color( 75 , 0 , 130 )); g .fillArc (x, y, w, h, 0 , 180 ); y += h / 7 ; g .setColor (new Color( 128 , 0 , 128 )); g .fillArc (x, y, w, h, 0 , 180 ); } } output:- This code defines an applet

To draw A smiley in Graphics with openGL (in C)

To draw A smiley in Graphics with openGL #include <GL/glut .h > // Include the GLUT library void init () { glClearColor ( 1.0 , 1.0 , 1.0 , 1.0 ); // Set the background color to white } void display () { glClear (GL_COLOR_BUFFER_BIT); // Clear the screen // Draw the face glColor3f ( 1.0 , 1.0 , 0.0 ); // Set the color to yellow glBegin (GL_POLYGON); glVertex2f ( 0.0 , 0.0 ); glVertex2f ( 0.0 , 0.5 ); glVertex2f ( 0.5 , 0.5 ); glVertex2f ( 0.5 , 0.0 ); glEnd (); // Draw the left eye glColor3f ( 0.0 , 0.0 , 0.0 ); // Set the color to black glPointSize ( 10.0 ); // Set the point size to 10 pixels glBegin (GL_POINTS); glVertex2f ( 0.15 , 0.25 ); glEnd (); // Draw the right eye glBegin (GL_POINTS); glVertex2f ( 0.35 , 0.25 ); glEnd (); // Draw the mouth glColor3f ( 1.0 , 0.0 , 0.0 ); // Set the color to red glLineWidth ( 2.0 ); // Set the line width to 2 pixels

Round Robin Scheduling Algorithm (with arrival time)

C program for solving round-robin (with arrival time) The round-robin (RR) the scheduling algorithm is designed especially for time-sharing systems . It is similar to FCFS scheduling, but pre-preemption is added to switch between processes. A small unit of time, called a time quantum or time slice , is defined. A time quantum is generally from 10 to 100 milliseconds. The ready queue is treated as a circular queue . or It is one of the oldest, simplest, and fairest and most widely used scheduling algorithms, designed especially for time-sharing systems. A small unit of time, called time-slice or quantum , is defined. All runnable processes are kept in a circular queue. The CPU scheduler goes around this queue, allocating the CPU to each process for a time interval of one quantum. New processes are added to the tail of the queue. CPU : Central Processing Unit Program: #include <stdio.h> void main

Powered by Blogger

Anupam Bhaglania