tag:blogger.com,1999:blog-83221695891491326802024-11-01T17:58:02.011+05:30BitsToGatherKnowledge Brought TogetherAnonymoushttp://www.blogger.com/profile/15016838884085859727noreply@blogger.comBlogger88125tag:blogger.com,1999:blog-8322169589149132680.post-60800588153126983332013-06-29T12:49:00.002+05:302013-06-29T12:51:28.778+05:30CPU Scheduling Algorithm : Shortest Remaining Time [Version 2] C++
Hi guys, after the the first version of C implementation of CPU Scheduling Algorithm Shortest Remaining Time by my friend, here I present another version of it in C++, which is also a much shorter program than previous one..
#include<iostream.h>
#include<conio.h>
class pro
{
public:
int id;
int burstTime;
float Anonymoushttp://www.blogger.com/profile/15016838884085859727noreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-70387159724417491022012-09-16T14:05:00.001+05:302012-09-16T14:23:54.423+05:303D Cube using HTML5 CSS3
3D Cube using HTML5/Pure CSS3 No JavaScript
View Demo : 3D Cube using HTML5 and CSS3 no JavaScript
Hello friends, here's nice and simple tutorial on how to build a 3D cube using HTML5/CSS3 with NO JavaScript coding.
As we know HTML5 is a new web emerging technology which featuresAnonymoushttp://www.blogger.com/profile/15016838884085859727noreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-4883436796776673202012-01-24T19:05:00.002+05:302012-01-24T19:19:14.490+05:30Image File Formats....(brief)
This is a small attempt to introduce some of the many image formats...
Image file
formats
Images!!!...there are many...
Image file formats are standardized
means of organizing and storing digital images. Image files are composed of
pixels, vector (geometric) data, or a combination of the two. Whatever the
format, the files are rasterized to pixels when displayed on most graphic
Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-56925410985173577622012-01-22T20:19:00.001+05:302012-02-11T18:25:26.301+05:30C implementation of FCFS, SJF, ROUND ROBIN
#include<stdio.h>
typedef struct process
{int id;
int wait;
int burst;
};
struct process pro[10];
struct process temp[20];
table(struct process pro[],int nop);
gantt(struct process pro[],int nop);
int getdata();
incwait(int tempburst,int id);
init();
int nop;
main()
{
struct process tmppro;
int choice,quantum;
int i,j,x,z,ret;
int ans,rrwt;
float rrawt,rratrt,fcfsawt,fcfsatrt,sjfatrt,Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-80343087989044346012011-12-28T15:54:00.000+05:302012-01-05T18:25:15.495+05:30Android 4.0 Platform Highlights
Simple, beautiful, beyond smart
Android 4.0 builds on the things people love most about Android — easy multitasking, rich notifications, customizable home screens, resizable widgets, and deep interactivity — and adds powerful new ways of communicating and sharing.
Refined, evolved UI
UI
Refined animations and feedback throughout the system make interactions engaging and Anonymoushttp://www.blogger.com/profile/15016838884085859727noreply@blogger.com2tag:blogger.com,1999:blog-8322169589149132680.post-17259490582615743082011-08-14T18:52:00.001+05:302011-08-14T19:09:21.633+05:30SRS structure for Web Site/Application
Chapter 1SRS Document for . . . . . . . . .
1. Introduction
1.1.Purpose/Problem Definition :
1.2.Scope of the Project :
1.3.References :
2. Overall Description
2.1.Product perspective :
2.2.Product Functions :
2.2.1. Customer Module :
2.2.2. Administrative Module :
2.3.User Classes and Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-48558686506873334292011-08-14T18:43:00.004+05:302011-08-14T19:06:08.868+05:30SRS structure for Software Application
This is the basic structure of an SRS - Software Requirement Specification. The below given points are to be highlighted in detail in a SRS document, though explaining every point is not compulsory, it is recommended that they are mentioned.
Introduction
1.1 Purpose Of This Document
1.2 Scope Of This Document
1.3 Overview
&Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-43353748111060476482011-06-16T18:49:00.001+05:302011-12-31T11:20:09.713+05:30Privacy PolicyUnknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-30746729355681065242011-05-06T13:06:00.002+05:302011-05-06T13:18:59.959+05:30Step1: Creating Classes for UML Diagrams with their attributes and operations(return type and parameters)
Creating Classes Creating Classes is the very important step in creating UML diagrams. This is because it exponentially reduces the time you would require to model your diagrams. Study your problem statement and analyze it thoroughly. Identify the Classes . . .
There are 4 ways of identifying classes:
1. Noun Phrase Method
&Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-28936058916930828732011-05-05T10:30:00.001+05:302011-05-05T10:30:54.833+05:30Starting with UML Diagrams
The Unified Modeling Language (UML) is used to specify, visualize, modify, construct and document the artifacts of an object-oriented software-intensive system under development. UML offers a standard way to visualize a system's architectural blueprints, including elements such as:
1. Activities2. Actors3. Business Processes4. Database Schemas5. (Logical) Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-61429516047704127712011-05-05T10:20:00.000+05:302011-05-05T10:20:08.809+05:30Starting with Rational Rose
Starting with Rational Rose.
Working with Rational Rose could be more fun if you know the basics right. Rational Rose is a software that provides many features other than just UML modeling. It helps to control the versions, generate code from your UML diagrams, and assign specific users to specific diagrams.Descriptions and definitions of various features of Rational Rose is what you would Unknownnoreply@blogger.com1tag:blogger.com,1999:blog-8322169589149132680.post-17746165043315362632011-04-16T11:06:00.002+05:302011-04-16T11:06:47.364+05:30Binary Tree Array
import java.util.Scanner;
class NodeBT{ int info; boolean used;}
public class BinaryTreeArray{
NodeBT node[]=new NodeBT[20];
void MakeTree(int val) { node[0]=new NodeBT(); node[0].info=val; &Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-87452216248767330312011-04-16T11:05:00.002+05:302011-04-16T11:05:53.882+05:30Binary Tree with Traversels– InOrder, PreOrder, PostOrder – (Recursive& Non-Recursive)
import java.util.Scanner;import java.util.Stack;
public class Node{ int info; Node next,prev; Node left,right;}
public class BinaryTree{ Node Insert(int val) { Node t=new Node(); t.info=val; &Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-66189081386622447332011-04-16T11:03:00.003+05:302011-04-16T11:03:45.510+05:30Circular Queue
import java.util.*;public class CircularQueue{ int front,rear,size=5; int a[]=new int[size];
CircularQueue() { front=rear=size-1; }
void Insert(int n) { Ins: &Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-13063147230546936232011-04-16T11:03:00.000+05:302011-04-16T11:03:01.068+05:30Merging two Link List
import java.util.Scanner;import java.util.Stack;public class MergeList{ public static void main(String[] args) { Scanner in = new Scanner(System.in); SingleLL s1=new SingleLL(); SingleLL s2=new SingleLL();  Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-19761972384865979652011-04-16T11:00:00.000+05:302011-04-16T11:00:16.015+05:30Double Link List with Operations - Add in Beginning, Add at End, Del at Beg, Del at End, Del any Element, Display, Search
import java.util.Scanner;
public class Node{ int info; Node next,prev; Node left,right;}
public class DoubleLL{ Node start=new Node(); Node end=new Node(); Node curr=new Node(); int num; DoubleLL() { &Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-46827706991134348512011-04-16T10:58:00.000+05:302011-04-16T10:58:27.126+05:30Single Link-List with Operations - Add in Beginning, Add at End, Del at Beg, Del at End, Del any Element, Display, Search
import java.util.Scanner;public class SingleLL{ Node start=new Node(); Node end=new Node(); Node curr=new Node(); int num;
SingleLL() { start=null; end=null; numUnknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-87818276613277109972011-04-16T10:54:00.000+05:302011-04-16T10:54:13.055+05:30Stack Operations – Push, Pop & Display for Characters
import java.io.IOException;import java.util.Scanner;public class Stack_Char{ char arr[]; int top; Stack_Char() { arr=new char[30]; top=-1; }
void Push(char val) {&Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-87571383369788850762011-04-16T10:52:00.001+05:302011-04-16T10:55:19.050+05:30Stack Operations – Push, Pop & Display for Numbers
import java.util.Scanner;public class Stack_Num{ double arr[]; int top; void Push(double val) { if(top==9) System.out.println("Stack OVerflow"); else &Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-55358634789809086632011-04-16T10:50:00.000+05:302011-04-16T10:50:12.697+05:30Link List with Queue
import java.util.Scanner;
public class Node{ int info; Node next,prev; Node left,right;}
public class QueueLL{ Node start=new Node(); Node end=new Node(); Node curr=new Node(); int ch,num; Object obj=new Object();
QueueLL() &Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-9594090945081288912011-04-16T10:49:00.000+05:302011-04-16T10:49:26.906+05:30Link-List with Stack
import java.util.Scanner;public class StackLL{ Node start=new Node(); Node top=new Node(); Node curr=new Node(); int ch,num;
StackLL() { num=0; start=null; top=Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-8001715665601720452011-04-16T10:46:00.000+05:302011-04-16T10:46:01.742+05:30Depth First Search with Stack
import java.util.Scanner;class Stack{ int stk[]=new int[10]; int top; Stack() { top=-1; } void Push (int item) { if (top==9) &Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-3845534009631248482011-04-16T10:44:00.000+05:302011-04-16T10:44:55.317+05:30Breadth First Search with Queue
import java.io.*;import java.util.Scanner;class Queue{ int items[]=new int[10]; int front,rear; Queue() { front=0; rear=-1; }
void Insert(int e) { &Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-75188102292805707812011-04-15T18:30:00.002+05:302011-04-15T18:30:25.501+05:30Sequential Search 2
import java.io.*;class seqsearch{ public static void main(String args[]) throws IOException { searching x=new searching(); DataInputStream in=new DataInputStream(System.in); int n=10,key=0; Unknownnoreply@blogger.com0tag:blogger.com,1999:blog-8322169589149132680.post-28630095822242651082011-04-15T18:29:00.002+05:302011-04-15T18:29:28.727+05:30Sequential Search 1
import java.io.*;import java.util.*;class seqsearch{public static void main(String arg[]){ int a[]=new int[50]; boolean flag=false; DataInputStream in=new DataInputStream(System.in);try{ &Unknownnoreply@blogger.com0