Data Structure

Choose the Application

• Stack

• Queue

• List ADT

• List

#include <stdio.h>

int main()

{

int arr[] = {1,2,3,4,5};

printf("arr [0] is %d", arr[0]);

// arr[10] is out of bound

printf("arr[10] is %d", arr[10]);

return 0;

}

• Error

• arr [0] is 1

• arr[10] is -1786647872

• arr [0] is 1

  arr[10] is -1786647872

#include <stdio.h>

int main()

{

int arr[] = {1,2,3,4,5};

printf("arr [0] is %d",arr[0]);

printf("arr[10] is %d",arr[10]);

// allocation memory to out of bound

// element

arr[10] = 11;

printf("arr[10] is %d",arr[10]);

return 0;

}

• Segmentation Fault (SIGSEGV)

• Output will be displayed

• Compiler Error

• None of the above

Predict the ourput:

printf("Enter the value to insert\n");

scanf("%d", &value);

for (c = n - 1; c >= position - 1; c--)

array[c+1] = array[c];//Moving to Next Position

array[position-1] = value;//Array Index

printf("Resultant array is\n");

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

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

return 0;

• insert an element in an Array

• delete an element in an Array

• insert an element in the middle

• delete an element in the middle

scanf("%d", &position);

if(position >= n+1)

printf("\n\nDeletion not possible\n\n");

else

// updating the locations with next elements

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

array[c] = array[c+1];

printf("\n\nResultant array is: ");

/*

the array size gets reduced by 1

after deletion of the element

*/

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

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

printf("\n\n\t\t\tCoding is Fun !\n\n\n");

• Delete an Element from Array

• Insert an Element from Array

• Insert an Element from Array in the middle

• Delete an Element from Array in the middle

{

if(p!=0)

{

int elt,flag=0;

printf("Enter the element to search in the List");

scanf("%d",&elt);

for(int i=0;i<p;i++)

{

if(L[i]==elt)

{

printf("The %d is available at %d ", elt, i);

flag=1;

}

}

if(flag==0)

{

printf("Element not found in the list");

}

}

else

{

printf("The List is empty");

}

}

• Insert the Element

• Delete the Element

• Find the Element

• Insert the Element at Last

if(isStackFull())

printf("Unable to %d as the Stack Is Full\n",val);

else

{

//increment top by 1

++top;

arr[top]=val;

}

• PUSH

• POP

• Middle element

• none of the these

struct node

{

int data;

---------------------------------

};

• struct node *next

• node *next;

• struct *next;

• struct *node *next;

Disadvantage of Array

• Insertion

• Deletion

• Static Memory Management

• None of the Above

Function to create memory in C

• Free

• Create

• Malloc

• insert