dsu c&c++ practical file diploma

DATA STRUCTURE USING C & C++

SUBMITTED TO: SUBMITTED BY:

LECT. ABHISHEK KUMAR MUSTKEEMADD.NO.:14S121

BRANCH: 5 CS.

DIGAMBER JAIN POLYTECHNIC BARAUT BAGHPAT

Admission no.:14S121

Page 1

INTRODUCTION OF DATA STRUCTURE:

Data structure is a particular way of organizing data in a computer so that it can be used

efficiently. Data structures can implement one or more particular abstract data types (ADT),

which specify the operations that can be performed on a data structure and the computational

complexity of those operations. In comparison, a data structure is a concrete implementation

of the specification provided by an ADT.

REQUIREMENT OF DSU C&C++ (TURBO C):

Hardware Requirement:

IBM-Intel Pentium 4 or above.

Minimum of 512 MB RAM.

One 1 GB Free Hard Disk.

Keyboard and Mouse.

A CD-ROM drive or USB port.

Software Requirement:

Operating system- Window 95 or higher. Turbo C & C++ or Dev-Cpp.


Page 2

Setup of Turbo C++:

Step 1:

Download Turbo C from “https://turboc.codeplex.com.”

Step 2:

Click setup.exe file.

Step 3:

Click next.


Page 3

Step 4:

Accept license agreement and click next.

Step 5:

Click install.


Page 4

Step 6:

Click finish.

Program 1: WAP in C to print “Hello World”.

#include<stdio.h>

#include<conio.h>

Void main()

{

printf(“Hello World”);getch();

}

Output:

Admission No.: 14S121

Program 2: Write a Program to Implement Linked List.

Code:

#include <stdio.h>#include <malloc.h>#include <stdlib.h>void main(){struct node

{intnum;struct node *ptr;

};typedefstruct node NODE;

NODE *head, *first, *temp = 0;int count = 0;int choice = 1;first = 0;while (choice)

{head = (NODE *)malloc(sizeof(NODE));printf("Enter the data item\n");scanf("%d", &head->num);if (first != 0)

{temp->ptr = head;temp = head;

}elsefirst = temp = head;}fflush(stdin);printf("Do you want to continue(Type 0 or 1)?\n");scanf("%d", &choice);

}temp->ptr = 0;

/* reset temp to the beginning */temp = first;printf("\n status of the linked list is\n");while (temp != 0)


{printf("%d=>", temp->num);count++;temp = temp ->ptr;

}printf("NULL\n");printf("No. of nodes in the list = %d\n", count);getch();}

Output:


Practical 3: Write a program to Implement stack operations Push & Pop.

Code:

#include <stdio.h>#include <stdlib.h>int stack[5];void push();int pop();void traverse();int is_empty();int top_element();int top = 0;int main(){int element, choice;for (;;)

{printf("Stack Operations.\n");printf("1. Insert into stack (Push operation).\n");printf("2. Delete from stack (Pop operation).\n");printf("3. Print top element of stack.\n");printf("4. Check if stack is empty.\n");printf("5. Traverse stack.\n");printf("6. Exit.\n");printf("Enter your choice.\n");scanf("%d",&choice);switch (choice)

{case 1:if (top == 5)printf("Error: Overflow\n\n");else {printf("Enter the value to insert.\n");scanf("%d", &element);push(element);

}break;case 2:if (top == 0)printf("Error: Underflow.\n\n");else {element = pop();printf("Element removed from stack is %d.\n", element);


}break;case 3:if (!is_empty()) {element = top_element();printf("Element at the top of stack is %d\n\n", element);

}elseprintf("Stack is empty.\n\n");break;case 4:if (is_empty())printf("Stack is empty.\n\n");elseprintf("Stack is not empty.\n\n");break;case 5:traverse();break;case 6:exit(0);

}}

}void push(int value) {stack[top] = value;top++;}int pop() {top--;return stack[top];}void traverse() {int d;

if (top == 0) {printf("Stack is empty.\n\n");return;

}printf("There are %d elements in stack.\n", top);for (d = top - 1; d >= 0; d--)printf("%d\n", stack[d]);printf("\n");}


intis_empty() {if (top == 0)return 1;elsereturn 0;}inttop_element() {return stack[top-1];getch();}

Output:


Practical 4: Write a Program to Implement Queue Operations Insertion &Deletion.

Code:

#include <stdio.h>

#include <stdlib.h>

#define QUEUESIZE 10

int queue[QUEUESIZE], f=0, r=-1;

// Check if queue is full

intqueuefull() {

if(r == QUEUESIZE - 1) {

return 1;

}

return 0;

}

// Check if the queue is empty

intqueueempty() {

if(f > r) {

return 1;

}

return 0;

}

// Show queue content

intqueueshow() {

inti;

if(queueempty()) {


printf(" \n The queue is empty\n");

} else {

printf("Start->");

for(i=f; i<=r; i++) {

printf("%d ", queue[i]);

}

printf("<-End");

}

return 0;

}

// Perform an insert operation.

intqueueinsert(intoneelement) {

if(queuefull()) {

printf("\n\n Overflow!!!!\n\n");

} else {

++r;

queue[r] = oneelement;

}

return 0;

}

// Perform a delete operation

intqueuedelete() {

intelem;

if(queueempty()) {

printf(" \n The queue is empty\n");

return(-1);

} else {


elem=queue[f];

f=f+1;

return(elem);

}

}

int main() {

int option, element;

charch;

do {

printf("\n Press 1-Insert, 2-Delete, 3-Show, 4-Exit\n");

printf("\n Your selection? ");

scanf("%d",&option);

switch(option) {

case 1:

printf("\n\nContent to be Inserted?");

scanf("%d",&element);

queueinsert(element);

break;

case 2:

element=queuedelete();

if( element != -1 ) {

printf("\n\nDeleted element (with content %d) \n",element);

}

break;

case 3:

printf("\n\nStatus of the queue\n\n");

queueshow();


break;

case 4:

printf("\n\n Ending the program \n\n");

break;

default:

printf("\n\nInvalid option, please retry! \n\n");

break;

}

} while(option != 4);

getch();

return 0;

}

Output:


Practical 5: Write a Program to Implement Insertion Sorting.

Code:

#include <stdio.h>

int main()

{

int n, array[1000], c, d, t;

printf("Enter number of elements\n");

scanf("%d", &n);

printf("Enter %d integers\n", n);

for (c = 0; c < n; c++) {

scanf("%d", &array[c]);

}

for (c = 1 ; c <= n - 1; c++) {

d = c;

while ( d > 0 && array[d] < array[d-1]) {

t = array[d];

array[d] = array[d-1];

array[d-1] = t;

d--;

}

}

printf("Sorted list in ascending order:\n");

for (c = 0; c <= n - 1; c++) {

printf("%d\n", array[c]);

}

getch();

return 0;

}


Output:


Practical 6:Write a Program to Implement Bubble Sorting.

Code:

#include <stdio.h>int main(){int array[100], n, c, d, swap;printf("Enter number of elements\n");scanf("%d", &n);printf("Enter %d integers\n", n);for (c = 0; c < n; c++)scanf("%d", &array[c]);for (c = 0 ; c < ( n - 1 ); c++){

for (d = 0 ; d < n - c - 1; d++){

if (array[d] > array[d+1]) /* For decreasing order use < */{

swap = array[d];array[d] = array[d+1];array[d+1] = swap;

}}

}printf("Sorted list in ascending order:\n");for ( c = 0 ; c < n ; c++ )printf("%d\n", array[c]);getch();return 0;}


Output:


Practical 7: Write a Program to Implement Quick Sorting.

Code:

#include<stdio.h>

#include<conio.h>

//quick Sort function to Sort Integer array list

void quicksort(int array[], intfirstIndex, intlastIndex)

{

//declaaring index variables

intpivotIndex, temp, index1, index2;

if(firstIndex<lastIndex)

{

//assigninh first element index as pivot element

pivotIndex = firstIndex;

index1 = firstIndex;

index2 = lastIndex;

//Sorting in Ascending order with quick sort

while(index1 < index2)

{

while(array[index1] <= array[pivotIndex] && index1 <lastIndex)

{

index1++;

}

while(array[index2]>array[pivotIndex])

{

index2--;

}

if(index1<index2)

{

//Swapping opertation


temp = array[index1];

array[index1] = array[index2];

array[index2] = temp;

}

}

//At the end of first iteration, swap pivot element with index2 element

temp = array[pivotIndex];

array[pivotIndex] = array[index2];

array[index2] = temp;

//Recursive call for quick sort, with partiontioning

quicksort(array, firstIndex, index2-1);

quicksort(array, index2+1, lastIndex);

}

}

int main()

{

//Declaring variables

int array[100],n,i;

//Number of elements in array form user input

printf("Enter the number of element you want to Sort : ");

scanf("%d",&n);

//code to ask to enter elements from user equal to n

printf("Enter Elements in the list : ");

for(i = 0; i< n; i++)

{

scanf("%d",&array[i]);

}

//calling quickSort function defined above

quicksort(array,0,n-1);


//print sorted array

printf("Sorted elements: ");

for(i=0;i<n;i++)

printf(" %d",array[i]);

getch();

return 0;

}

Output:


Practical 8: Write a Program to Implement Merge Sorting.

Code:

#include<stdio.h>

#define MAX 50

voidmergeSort(intarr[],intlow,intmid,int high);

void partition(intarr[],intlow,int high);

int main()

{

int merge[MAX],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]);

}

partition(merge,0,n-1);

printf("After merge sorting elements are: ");

for(i=0;i<n;i++){

printf("%d ",merge[i]);

}

return 0;

}

void partition(intarr[],intlow,int high){

int mid;

if(low<high){

mid=(low+high)/2;

partition(arr,low,mid);

partition(arr,mid+1,high);

mergeSort(arr,low,mid,high);


}

}

voidmergeSort(intarr[],intlow,intmid,int high){

inti,m,k,l,temp[MAX];

l=low;

i=low;

m=mid+1;

while((l<=mid)&&(m<=high)){

if(arr[l]<=arr[m]){

temp[i]=arr[l];

l++;

}

else{

temp[i]=arr[m];

m++;

}

i++;

}

if(l>mid){

for(k=m;k<=high;k++){

temp[i]=arr[k];

i++;

}

}

else{

for(k=l;k<=mid;k++){

temp[i]=arr[k];


i++;

}

}

for(k=low;k<=high;k++){

arr[k]=temp[k];

}

}

Output:


Practical 9:Write a Program to Implement Heap Sorting.

Code:

#include<stdio.h>#include<conio.h>void manage(int *, int);voidheapsort(int *, int, int);int main(){intarr[20];inti,j,size,tmp,k;printf("\n\t------- Heap sorting method -------\n\n");printf("Enter the number of elements to sort : ");scanf("%d",&size);for(i=1; i<=size; i++){printf("Enter %d element : ",i);scanf("%d",&arr[i]);manage(arr,i);}j=size;

for(i=1; i<=j; i++){tmp=arr[1];arr[1]=arr[size];arr[size]=tmp;size--;heapsort(arr,1,size);}printf("\n\t------- Heap sorted elements -------\n\n");size=j;for(i=1; i<=size; i++)printf("%d ",arr[i]);getch();return 0;}void manage(int *arr, inti){inttmp;tmp=arr[i];while((i>1)&&(arr[i/2]<tmp)){arr[i]=arr[i/2];


i=i/2;}arr[i]=tmp;}voidheapsort(int *arr, inti, int size){inttmp,j;tmp=arr[i];j=i*2;

while(j<=size){if((j<size)&&(arr[j]<arr[j+1]))j++;if(arr[j]<arr[j/2])break;arr[j/2]=arr[j];

j=j*2;}arr[j/2]=tmp;}

Output:

dsu c&c++ practical file diploma

Education