1. Go through the study materials
2. Perform your task
3. Give feedback on today's topic !
--Best of Luck !
Take your time to go through the tutorial.
It is an official blog. This is your responsibility to make the contents worth-reading to others and take care of your Institute's glory !
Best wishes.
* ** 1. Make a team of two and grade your partner's assignment out of 5.
2. Give your review comment while grading.
3. Now select one of your neighboring groups and repeat steps 1 and 2 for any one member of that group. The remaining member's work will be reviewed and graded by your partner.
Questions to solve: 1. What do you get from the video?
2. Code, Compile and run your first program with the help of the tutorial video
2. Perform your task
3. Give feedback on today's topic !
--Best of Luck !
1. Go through the study materials
Tutorial: https://www.youtube.com/watch?v=cMmkPM_Gj8cTake your time to go through the tutorial.
2. Perform your task
Submit your assignment here.It is an official blog. This is your responsibility to make the contents worth-reading to others and take care of your Institute's glory !
Best wishes.
* ** 1. Make a team of two and grade your partner's assignment out of 5.
2. Give your review comment while grading.
3. Now select one of your neighboring groups and repeat steps 1 and 2 for any one member of that group. The remaining member's work will be reviewed and graded by your partner.
Questions to solve: 1. What do you get from the video?
2. Code, Compile and run your first program with the help of the tutorial video
This video is about push and pop function in stack implemented using array.
ReplyDeleteThe Stack work in the principle of LIFO i.e. Last In Fist Out.
Before Inserting any element (push) we have to check the overflow condition.
For example:
Let the stack is having 5 elements (static allocation) stack[5],
If the value of overflow = 5, then elements cannot be inserted.
Similarly.
For deleting elements (pop) we have to check underflow condition,
i.e. if underflow < 0, then elements cannot be deleted.
This comment has been removed by the author.
Delete4/5
Deletebandana say right but tutorial is all about puss function .I give bandana 4 grade out of 5.
Delete4/5
DeleteIn this video tutorial describe push function in stack by using array.
ReplyDeletebefore trying to insert a element into stack we check stack is full or not.
by using top element we check stack is full or not ,but when stack is full we print a message that stack is full.
for example :
let the size of stack is 10 elements.if we insert the value of top is 11 then elements cannot be inserted .if element is less than the max size then we insert the elements .
After that we go to main function and call the push function to insert elements into stack
This comment has been removed by the author.
Delete4/5
DeleteFirst the compiler will check for main() function, then it will check whether array is overflow or underflow.
DeleteThe tutorial was all about "Stack using PUSH Function".
ReplyDeleteStacks basically deals with LIFO structure; i.e Last In First Out.
The push function is used to insert elements into the Stack.
Elements inserted were of type "int".
Before inserting a element if we to check the Overflow Condition; i.e if top==Max-1.(where Max can be predefined)
After elements are inserted, the top is incremented; i.e top=top+1.
The function used for pushing elements:
void push(int element)
if (top==Max-1)
{
printf("Stack Overflow")
return;
}
top=top+1;
Stack[top]=element;
4\5
DeleteIn this video describing about stack using push function. Basically stack work in LIFO( last in first out. ). In this i understand that .........
ReplyDeleteLet the stack is having 5 elements stack[5],
If the value of overflow = 5, then elements cannot be inserted.
if insert value then using function..... top=top-1
and similarly ,
when the value of under flow <0, then element cannot be deleted.
if delete value then using function..... top=top+1.
4\5
ReplyDeleteThis comment has been removed by the author.
ReplyDelete