Yahoo Web Search

Search results

1. Top results related to define stack and its operations

   • Define an array in C outside main and assign its size inside main

     Top Answer

     Answered Nov 06, 2011 · 3 votes

     You can't with a true array. You can do it with a pointer:

     int *p;-int main(int argc, char *argv[]){ size_t x; if (argc < 2) return; size_t x = strtoul(argv[1], NULL, 10); p = malloc(x * sizeof *p); return 0;}

     Check all answers on Stack Overflow

     1/5

   • Define a Maven plugin configuration in a parent pom and conditionate its activation in children pom

     Top Answer

     Answered Aug 11, 2021 · 0 votes

     The configuration using <skip> could be of use here in the child POM's:

     <configuration> <skip>true</skip> </configuration>-

     Check all answers on Stack Overflow

     2/5

   • stack empty() and stack size() in C++ STL

     Stacks are a type of container adaptors with LIFO(Last In First Out) type of working, where a new element is added at one end and (top) an element is removed from that end only.

     stack::empty()empty() function is used to check if the stack container is empty or not. Syntax :

     Parameters :

     Returns :

     stackname.empty()Parameters :No parameters are passed.Returns :True, if stack is emptyFalse, Otherwise

     Examples:

     Input : mystack mystack.empty();Output : True Input : mystack = 1, 2, 3Output : False

     Errors and Exceptions 1. Shows error if parameter is passed 2. Shows no exception throw guarantee. 

     CPP

     // CPP program to illustrate// Implementation of empty() function#include <iostream>#include <stack>using namespace std; int main(){    stack<int> mystack;    mystack.push(1);     // Stack becomes 1     if (mystack.empty()) {        cout << "True";    }    else {        cout << "False";    }    return 0;}

     Output:

     False

     Application : Given a stack of integers, find the sum of the all the integers.

     Input : 1, 8, 3, 6, 2Output: 20

     Algorithm 1. Check if the stack is empty, if not add the top element to a variable initialised as 0,...

     Check all answers on Geeksforgeeks

     3/5

   • stack operations using switch case

     Top Answer

     Answered Feb 10, 2023 · 0 votes

     • It's not standard C to define functions within another function ( main()) aka "nested function".
     • pop() returns an undefined value if the stack is empty. I changed it to return -1 but really you want to add the ability to tell caller of errors like this.
     • You need a block {} when introducing variables in a switch statement.
     • (not fixed) Avoid global variables and instead pass values to the functions that need them (functional style). Usually, you then group related data ( stk and top) into a struct.
     • (not fixed) By convention constants, like max, should be upper case.

     #include <stdio.h>#define max 20int stk[max];int top=-1;int isFull() { return top==max-1;}int isEmpty() { return top==-1;}void push(int item) { if(isFull()) { printf("Stack Overflow\n"); return; } stk[top++]=item;}int pop() { if(isEmpty()) { printf("Stack Underflow\n"); return -1; } return stk[top--];}void peep() { if(isEmpty()) { printf("Stack Underflow\n"); return; } printf("Topmost Element of the stack is %d",stk[top]);}void display() { if(isEmpty()) { printf("Stack Underflow\n"); return; } for(int i=top; i>=0; i--) printf("%d ", stk[i]);}int main() { int ch; do { printf( "....Stack Operations....\n" "Press 1 for Push\n" "Press 2 for pop\n" "Press 3 for peep\n" "Press 4 for display\n" "Enter your choice \n" ); scanf("%d",&ch); switch(ch) { case 1: { printf("Enter the item :- \n"); int item; scanf("%d", &item); push(item); break; } case 2: printf("The popped element is %d\n", pop()); break; case 3: peep(); break; case 4: display(); break; default: printf("Invalid Choice\n"); } } while(ch>=1 && ch<=5);}

     Check all answers on Stack Overflow

     4/5

   • Basics of Computer and its Operations

     Introduction :

     A computer is an electronic device that can receive, store, process, and output data. It is a machine that can perform a variety of tasks and operations, ranging from simple calculations to complex simulations and artificial intelligence.

     Computers consist of hardware components such as the central processing unit (CPU), memory, storage devices, input/output devices, and peripherals, as well as software components such as the operating system and applications.

     The history of computers can be traced back to the 19th century when mechanical devices such as the Analytical Engine and tabulating machines were developed. However, modern computers as we know them today were developed in the mid-20th century with the invention of the transistor and the development of integrated circuits.

     Today, computers are widely used in various industries such as education, finance, healthcare, and entertainment, and they have revolutionized the way we live, work, and communicate. They have also given rise to a new era of technology such as the internet, cloud computing, and mobile devices, which have further transformed our daily lives.

     Computer is a device that transforms data into meaningful information. It processes the...

     Check all answers on Geeksforgeeks

     5/5

   Show moreShow less

2. www.geeksforgeeks.org › introduction-to-stack-dataWhat is Stack? A Complete Tutorial - GeeksforGeeks

   www.geeksforgeeks.org › introduction-to-stack-data

   • Cached

   May 9, 2024 · Stack is a linear data structure that follows LIFO (Last In First Out) Principle , so the last element inserted is the first to be popped out. In this article, we will cover all the basics of Stack, Operations on Stack, its implementation, advantages, disadvantages which will help you solve all the problems based on Stack.

3. afteracademy.com › blog › stack-and-its-basic-operationsStack and its basic Operations - AfterAcademy

   afteracademy.com › blog › stack-and-its-basic-operations

   • Cached

   Dec 26, 2019 · Push operation refers to inserting an element in the stack. Since there’s only one position at which the new element can be inserted — Top of the stack, the new element is inserted at the top of the stack. POP Operation. Pop operation refers to the removal of an element. Again, since we only have access to the element at the top of the ...

4. People also ask

   What is a stack?

   • A Complete Tutorial Stack is a linear data structure that follows LIFO (Last In First Out) Principle , so the last element inserted is the first to be popped out. In this article, we will cover all the basics of Stack, Operations on Stack, its implementation, advantages, disadvantages which will help you solve all the problems based on Stack.

   What is Stack? A Complete Tutorial - GeeksforGeeks

   www.geeksforgeeks.org/introduction-to-stack-data-structure-and-algorithm-tutorials/

   See all results for this question

   What are stack operations?

   • Stack operations are usually performed for initialization, usage and, de-initialization of the stack ADT. The most fundamental operations in the stack ADT include: push (), pop (), peek (), isFull (), isEmpty (). These are all built-in operations to carry out data manipulation and to check the status of the stack.

   Stack Data Structure - Online Tutorials Library

   www.tutorialspoint.com/data_structures_algorithms/stack_algorithm.htm

   See all results for this question

   How does a stack work?

   • A stack is a linear data structure that follows the Last-In-First-Out (LIFO) principle. It behaves like a stack of plates, where the last plate added is the first one to be removed. Think of it this way: Pushing an element onto the stack is like adding a new plate on top. Popping an element removes the top plate from the stack.

   Stack Data Structure - GeeksforGeeks

   www.geeksforgeeks.org/stack-data-structure/

   See all results for this question

   What is stack in Java?

   • Stack is a linear data structure that follows LIFO (Last In First Out) Principle , so the last element inserted is the first to be popped out. In this article, we will cover all the basics of Stack, Operations on Stack, its implementation, advantages, disadvantages which will help you solve all the problems based on Stack. What is Stack?

   What is Stack? A Complete Tutorial - GeeksforGeeks

   www.geeksforgeeks.org/introduction-to-stack-data-structure-and-algorithm-tutorials/

   See all results for this question

5. www.tutorialspoint.com › data_structures_algorithmsStack Data Structure - Online Tutorials Library

   www.tutorialspoint.com › data_structures_algorithms

   • Cached

   Basic Operations on Stacks. Stack operations are usually performed for initialization, usage and, de-initialization of the stack ADT. The most fundamental operations in the stack ADT include: push (), pop (), peek (), isFull (), isEmpty (). These are all built-in operations to carry out data manipulation and to check the status of the stack.

   Code sample

   begin procedure push: stack, data

     if stack is full

     return null

     endif

     top ? top + 1...

   See more on tutorialspoint

6. www.programiz.com › dsa › stackStack Data Structure and Implementation in Python, Java and C/C++

   www.programiz.com › dsa › stack

   • Cached

   A stack is a useful data structure in programming. It is just like a pile of plates kept on top of each other. In this tutorial, you will understand the working of Stack and it's implementations in Python, Java, C, and C++.

7. www.knowledgehut.com › blog › web-developmentWhat is Stack Data Structure? Types, Operations, Implementation

   www.knowledgehut.com › blog › web-development

   • Cached

   Apr 19, 2024 · Definition: A stack is a linear data structure that operates on the Last In, First Out (LIFO) principle, which means that the last element added to the stack is the first to be deleted/removed. Operations: It has two main operations: push, that adds an element to the very top of the stack, and pop, which removes/deletes the top element.