Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Consider the following statements:     stackType stack;     int x;          Suppose that the input is: 14 45 34 23 10 5 -999          Show what is output by the following segment of code:     stack.push(5);          cin >> x;          while (x != -999)     {         if (x % 2 == 0)             {                 if (!stack.isFullStack())                 stack.push(x);             }         else             cout << "x = " << x << endl;                  cin >> x;     }          cout << "Stack Elements: ";          while (!stack.isEmptyStack())     {         cout << " " << stack.top();         stack.pop();     }          cout << endl;

Consider the following statements:     stackType stack;     int x;          Suppose that the input is: 14 45 34 23 10 5 -999          Show what is output by the following segment of code:     stack.push(5);          cin >> x;          while (x != -999)     {         if (x % 2 == 0)             {                 if (!stack.isFullStack())                 stack.push(x);             }         else             cout << "x = " << x << endl;                  cin >> x;     }          cout << "Stack Elements: ";          while (!stack.isEmptyStack())     {         cout << " " << stack.top();         stack.pop();     }          cout << endl;

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Consider the following statements:

    stackType<int> stack;

    int x;
    
    Suppose that the input is: 14 45 34 23 10 5 -999
    
    Show what is output by the following segment of code:

    stack.push(5);
    
    cin >> x;
    
    while (x != -999)
    {
        if (x % 2 == 0)
            {
                if (!stack.isFullStack())
                stack.push(x);
            }
        else
            cout << "x = " << x << endl;
        
        cin >> x;
    }
    
    cout << "Stack Elements: ";
    
    while (!stack.isEmptyStack())
    {
        cout << " " << stack.top();
        stack.pop();
    }
    
    cout << endl;

 

Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Stack
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS