Data File Structure Programs
Array
Two dimensional Array Lifts in multi-store buildingQueue
Queue using array Queue using link list Circular queue-array Circular queue-link list Priority queue De-queue Input restricted deque Output restricted dequeStack
Stack using array Stack using link listLink Lists
Link list using struct pointer Insert in link list Delete in link list Concatenate link list Reverse link list Add node recursion Count list recursion Compare list recursion Copy list recursion Singly link list Circular link list Circular link list - struct ptr. Merge link list Doubly link list Doubly link list - struct ptr. Circular doubly link list Circular doubly link list - struct ptr.Tree
Binary search tree-array Duplicate name in BST-binary Srch. treeSorting
Sort link list Sort words using array Sort words using pointer Sort numbers Sort num using array Sort on date,name,salary Sorting using struct on multi keys Sorting using pointers Insert in sorted list Selection Sort Insertion sort Quick sort Bubble sort of numbers Bubble sort of strings Bubble sort on date Bubble sort - struct Heap sort Merge Sort Binary tree sorting External sorting Merge sorted arraySearch Programs
Linear search on sorted list Linear search on unsorted listRecursion
Factorial recursion Fibonacci recursion Reverse string recursion
#include <stdio.h>
#include <conio.h>
#include <string.h>
void main(){
int i,n;
char name[15][20];
void namesort(char name[15][20], int);
clrscr();
printf(\"How many names u want to enter : \");
scanf(\"%d\",&n);
printf(\"\\n\\n****Enter Input Data****\\n\");
for(i=0;i<n;i++){
flushall();
printf(\"Enter a name : \");
gets(name[i]);
}
namesort(name,n);
printf(\"\\n\\n\\n******After Sorting******\\n\");
for(i=0;i<n;i++)
printf(\"%s\\n\",name[i]);
getch();
}
void namesort(char name[15][20],int n){
int i,j;
char *temp;
for(i=0;i<n;i++){
for(j=0;j<n-1;j++){
if(strcmp(name[j],name[j+1])>0){
strcpy(temp,name[j]);
strcpy(name[j],name[j+1]);
strcpy(name[j+1],temp);
}
}
}
}
-
Program to calculate roots of 3 numbers using root1 = (-b + sqrt(discriminant))/(2.0*a) and root2 = (-b - sqrt(discriminant))/(2.0*a) formula
-
GUASS JORDEN ELIMINATION METHOD
-
Program to print multiplication tables using do while loop
-
Vehicle parking program
-
ILLUSTRATION OF WORKING OF auto VARIABLES
-
ILLUSTRATION OF fseek & ftell FUNCTIONS
-
Program to print triangle in opposite pattern
-
Program to read PC Type from BIOS Data Area and display it
-
Program to do multiplication of two given numbers
-
HANDLING OF FILES WITH MIXED DATA TYPES (fscanf and fprinf)
-
Program to transpose a sparse matrix
-
Program to add two numbers
-
PROGRAM FOR SECANT METHOD OF PARTICULAR EQUATION IS log(x)-cos(x)
-
To show the use of stack in function calls
-
Program to find ascii value of entered text or word for each character
-
FUNCTION TABULATED AT EQUAL INTERVAL USING FORWARD DIFFERENCE BETWEEN TABLE VALUE
-
Program of maintaining employee detail
-
Program of string variable
-
ADAM-BASHFORTH METHOD
-
Program to print pyramid of numbers as shown in description
Didn't find what you were looking for? Find more on
Program to sort words
