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, November 18, 2013
Wednesday, November 13, 2013
SQL Commands Useful for PROGRAMMERS
ABORT -- abort the current transaction
ALTER DATABASE -- change a database
ALTER GROUP -- add users to a group or remove users from a group
ALTER TABLE -- change the definition of a table
ALTER TRIGGER -- change the definition of a trigger
ALTER USER -- change a database user account
ANALYZE -- collect statistics about a database
ALTER DATABASE -- change a database
ALTER GROUP -- add users to a group or remove users from a group
ALTER TABLE -- change the definition of a table
ALTER TRIGGER -- change the definition of a trigger
ALTER USER -- change a database user account
ANALYZE -- collect statistics about a database
Tuesday, November 12, 2013
Subscribe to:
Posts (Atom)