# Popular C Codes

## Shortest Job First (SJF)

* Description C Language: This is a sample code to implement the Shortest Job First Algorithm, Operating System Source Code #include<conio.h>
void main()
{ int n,i,j,a[10],b[10],temp;
float sum,avg_w ...*

*Aug 22, 2008*

## Hello World using Pointer

* Description
This a simple code show how to make Hello World application in C with and without using pointers.
Source Code
/* Simple Version......... */
#include
int main()
{
printf( ...*

*Jul 29, 2008*

## B Tree

* Description Program of insertion and deletion in B tree...In data structures, a B-tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. Unlike self-balancing binary se ...*

*Jan 1, 2009*

## Breath First Search(BFS) and Depth First Search (DFS)

* Description THIS CODE IS SIMPLE BUT NOT EASY TO WRITE SO PLEASE BEFORE RUNNING THE PROGRAM SEE THE CODE AND THEN RUN IF YOU DO'NT UNDERSTAND THEN SUMMIT QUERRY IN email address dwarikachandra@gmail.com Source Code <pre name="code" cl ...*

*Jan 6, 2009*

## Interconversion of Number System

* Description It is a program for conversion of Number System viz. Binary to Decimal,Decimal to Binary,Decimal to Octal, Decimal to Hexadecimal,Octal to Decimal,Octal to Binary,Binary to Octal,Binary to Hexadecimal, Hexadecimal to Binary, Hexadec ...*

*Sep 4, 2008*

## Insertion in AVL Tree

* Description Program for insertion in AVL tree...n Data Structure, an AVL tree is a self-balancing binary search tree, and it is the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node diff ...*

*Jan 1, 2009*

## Regular Falsi (Method of false position) for finding roots of equation

* Description it is method to find root
as an example equation x^3-2x-5 is taken Source Code #include<stdio.h>
#include<conio.h>
#include<math.h>
float f(float x);
void main() ...*

*Dec 28, 2008*

## Additive Cipher

* Description This program Encrypts the given Text and Substitutes its Letters by some other ones. Source Code /* rot13 algorithm. Very Simple and Interesting */
#include<stdio.h>
#define ROT 13
...*

*Sep 4, 2008*

## Insertion Sort

* Description The insertion sort works just like its name suggests - it inserts each item into its proper place in the final list. The simplest implementation of this requires two list structures - the source list and the list into which sorted i ...*

*Aug 20, 2008*

## First Come First Serve (FCFS)

* Description operating system Source Code #include<conio.h>
void main()
{ int a[10],i,j,n;
float sum,avg_wait,avg_tat,k;
clrscr();
printf("\nEnter the no of processes=");
scanf("%d ...*

*Aug 22, 2008*