Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Class notes

Data Structure and Algorithm

Rating
-
Sold
-
Pages
2
Uploaded on
19-03-2023
Written in
2022/2023

I am going to talk about various operations performed on arrays in data structure on 1d arrays specifically. I have already discussed the fundamentals of arrays what is need of Faerie array declaration in acid ization of array memory representation of air in the previous video so if you check out that video then I 'll provide you the link in the description box you can check out there. We are going to write down the code for this. something like this I have already discussed in the previous video this concept and detail fine. I 'm going to ask from the user what elements the user wants in the area how to populate the area at runtime. We will just write header files and all I think you can write that thing. Ask from the user that how many data the user want to insert in this area what is the actual size of the array this is the maximum size fine. If user will give something some input that is some integer value then obviously that value should be stored in memory and how values to be stored using variable so you have to declare one another variable. We will discuss how data is to be inserted in the air at specific position. If you get how data can be inserted at a specific position then you can easily modify the code for inserting the data at the beginning and at the end of theory fine so now we will see how to. We are using one more variable that is i so you have to declare this variable. There is no upper bound checking concept of areas in areas in C like this if you take hair in a is equal to 50 fine. Memory man is it has has allocated to how many bytes two hundred bytes for storing 50 elements. If you enter the size 51 or you can say 60 then user can insert 60 values also but that is not actually correct. We all we want all the previous element as well as we want some extra element that you want to insert so you can not do directly this so another approach is what you can shift these elements to the right side. From variable to start the loop we are going to start from here from the last element of there you can say from size minus 1. of bounds checking of arrays in c so programmer has to write down the code itself for the checking of the boundaries in c. programmer must write down a for loop for the swapping of arrays. Programmer writes down code that checks the boundaries of an array in c code. Just write down a for loop in for loop you will start from 0 to the size fine and you simply write printf percentage D and a of I and these all values would be printed this is how we are going to insert the data at specific position fine. After inserting this number array size becomes what 6 so now size becomes size plus plus plus right now finally you will print this area how you can print it. How you will insert simply you just enter the data you want to insert simply. No need to ask the position no need to do this swapping and all fine simply will write a off here here means you can say that size a of size size size is 5 5 so here also you can insert at 6th position that is also fine but after size plus 1 you can not insert.

Show more Read less
Institution
Course

Content preview

#include<stdio.h>
#include<conio.h>
int stack[100],choice,n,top,x,i;
void push(void);
void pop(void);
void display(void);
int main()
{
//clrscr();
top=-1;
printf("\n Enter the size of STACK[MAX=100]:");
scanf("%d",&n);
printf("\n\t STACK OPERATIONS USING ARRAY");
printf("\n\t 1.PUSH\n\t 2.POP\n\t 3.DISPLAY\n\t 4.EXIT");
do
{
printf("\n Enter the Choice:");
scanf("%d",&choice);
switch(choice)
{
case 1:
{
push();
break;
}
case 2:
{
pop();
break;
}
case 3:
{
display();
break;
}
case 4:
{
break;
}
default:
{
printf ("\n\t Please Enter a Valid Choice(1/2/3/4)");
}
}
}
while(choice!=4);
return 0;
}
void push()
{
if(top>=n-1)
{
printf("\n\tSTACK is over flow");
}
else
{
printf(" Enter a value to be pushed:");
scanf("%d",&x);
top++;

Written for

Institution
Course

Document information

Uploaded on
March 19, 2023
Number of pages
2
Written in
2022/2023
Type
Class notes
Professor(s)
Nil
Contains
All classes

Subjects

$11.99
Get access to the full document:

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Get to know the seller
Seller avatar
abhisekpaul20020

Get to know the seller

Seller avatar
abhisekpaul20020 Haldia Institute of Technology
Follow You need to be logged in order to follow users or courses
Sold
-
Member since
3 year
Number of followers
0
Documents
10
Last sold
-

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Recently viewed by you

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions