Showing posts with label DFS. Show all posts
Showing posts with label DFS. Show all posts
Thursday, November 21, 2013
SelectionSort C Program (DFS)
#include<stdio.h>
#include<conio.h>
int main()
{
int s,i,j,temp,a[20];
printf("Enter total elements: ");
scanf("%d",&s);
#include<conio.h>
int main()
{
int s,i,j,temp,a[20];
printf("Enter total elements: ");
scanf("%d",&s);
Labels:
BCA Semester-3,
C-Programs,
DFS
HeapSort C Program (DFS)
#include<stdio.h>
#include<conio.h>
void build_Heap(int [],int);
void HeapSort(int H[],int n);
int main()
{
int arr[10],n,i;
printf("Enter the total number of array elements: ");
scanf("%d",&n);
#include<conio.h>
void build_Heap(int [],int);
void HeapSort(int H[],int n);
int main()
{
int arr[10],n,i;
printf("Enter the total number of array elements: ");
scanf("%d",&n);
Labels:
BCA Semester-3,
C-Programs,
DFS
InsertionSort C Program (DFS)
#include<stdio.h>
#include<conio.h>
int main()
{
int i,j,s,temp,a[20];
printf("Enter total elements: ");
scanf("%d",&s);
#include<conio.h>
int main()
{
int i,j,s,temp,a[20];
printf("Enter total elements: ");
scanf("%d",&s);
Labels:
BCA Semester-3,
C-Programs,
DFS
QuickSort C Program (DFS)
#include<stdio.h>
#include<conio.h>
void quicksort(int [10],int,int);
int main()
{
int x[20],size,i;
printf("Enter size of the array: ");
scanf("%d",&size);
#include<conio.h>
void quicksort(int [10],int,int);
int main()
{
int x[20],size,i;
printf("Enter size of the array: ");
scanf("%d",&size);
Labels:
BCA Semester-3,
C-Programs,
DFS
BubbleSort C Program (DFS)
#include<stdio.h>
#include<conio.h>
int main(){
int s,temp,i,j,a[20];
printf("Enter total numbers of elements: ");
scanf("%d",&s);
printf("Enter %d elements: ",s);
for(i=0;i<s;i++)
scanf("%d",&a[i]);
#include<conio.h>
int main(){
int s,temp,i,j,a[20];
printf("Enter total numbers of elements: ");
scanf("%d",&s);
printf("Enter %d elements: ",s);
for(i=0;i<s;i++)
scanf("%d",&a[i]);
Labels:
BCA Semester-3,
C-Programs,
DFS
MergeSort C Program (DFS)
#include<stdio.h>
#include<conio.h>
void mergeSort(int arr[],int low,int mid,int high);
void partition(int arr[],int low,int high);
int main(){
int merge[10],i,n;
printf("Enter the total number of elements: ");
scanf("%d",&n);
printf("Enter the elements which to be sort: ");
for(i=0;i<n;i++){
scanf("%d",&merge[i]);
}
#include<conio.h>
void mergeSort(int arr[],int low,int mid,int high);
void partition(int arr[],int low,int high);
int main(){
int merge[10],i,n;
printf("Enter the total number of elements: ");
scanf("%d",&n);
printf("Enter the elements which to be sort: ");
for(i=0;i<n;i++){
scanf("%d",&merge[i]);
}
Labels:
BCA Semester-3,
C-Programs,
DFS
Monday, October 28, 2013
Sunday, September 15, 2013
Deque Algorithm for Curcular Queue using Array
If(Front
== U)
next = L
Else
next = Front + 1
EndIf
Item
= NULL
Labels:
DFS
Enque Algorithm for Curcular Queue using Array
If(Rear
== U)
next = L
Else
next = Rear + 1
EndIf
If(next
== Front)
print “Queue is Full.
Labels:
BCA Semester-3,
DFS
Monday, August 26, 2013
Friday, August 23, 2013
How to write Simple Stack Program using Linked List
#include<conio.h>
#include<stdio.h>
#include<stdio.h>
void PUSH();
void PEEP();
void POP();
void PEEP();
void POP();
struct node{
int data;
struct node *link;
struct node *link;
}*head,*top=NULL,*newx,*item;
Labels:
BCA Semester-3,
C-Programs,
DFS
Wednesday, August 21, 2013
How to write Simple Stack Program in C
#include<conio.h>
#include<stdio.h>
#include<stdio.h>
void PUSH();
void PEEP();
int POP();
void PEEP();
int POP();
int top=-1,item,a[10];
void main()
{
{
int i;
clrscr();
clrscr();
for(i=0;i<12;i++)
{
{
printf("\nEnter No: ");
scanf("%d",&item);
scanf("%d",&item);
Labels:
BCA Semester-3,
C-Programs,
DFS
Thursday, August 8, 2013
Download DFS all PPTs Files till Unit Test 1
Hello Friends I have uploaded all DFS Material including all the PPTs Files till we have learned so far. So Download this zip file and extract it you will get total 6 files.
Labels:
BCA Semester-3,
DFS,
PPTs
Sunday, July 28, 2013
Simple Insert Single Link List Program in C Language
#include<stdio.h>
#include<conio.h>
struct node
{
int data;
struct node *link;
};
struct node *header,*ptr,*newx,*temp;
#include<conio.h>
struct node
{
int data;
struct node *link;
};
struct node *header,*ptr,*newx,*temp;
Labels:
BCA Semester-3,
C-Programs,
DFS
Friday, July 12, 2013
DFS(lab) Book Library Application Codding (273 Lines)
Hello Friends, I have created application which ma'am was given in our lab test. So, its still not in full version you can modify in this codding with your own functions. Execute it ....
/*Create one Book Library application which have Library Functions. A program must be perform on given functions
1. Search Student
2. Search Book
3. Issue Book
4. Manipulate
*/
2. Search Book
3. Issue Book
4. Manipulate
*/
#include<stdio.h>
#include<conio.h>
#include <stdlib.h> //<--- This header file used for exit(0); function
#include<conio.h>
#include <stdlib.h> //<--- This header file used for exit(0); function
Labels:
BCA Semester-3,
C-Programs,
DFS
Saturday, June 29, 2013
Download DFS PPT Material's Files
Hello, SY-BCA Students. Download this Data File Structure Material. Here is 4 files. If download link not working just comment below
Download below listed Files
Labels:
BCA Semester-3,
DFS,
PPTs
Subscribe to:
Posts (Atom)


