Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
ASSUME S, T R are stacks. A is an array [1..14] of char; THE INPUT IS "datastructures". The MAXSTACK VALUES FOR R, S ARE 5 AND For T is 7. ALL THREE STACKS WILL CONTAIN CHARACTER DATA. ASSUME ch is a character variable. Also ASSUME that there is NO SPACE in the input. ClearStack (S);ClearStack (T); ClearStack(R ); FORI = 1 to 14 READ(A[1]); END FOR; I = 1; While I < 15 IF NOT FULLSTACK(R) PUSH(R, A[]) ELSE IF NOT FULLSTACK(S) PUSH(S, A[1]); ENDIF; IF (A[I ] = "u" OR A[] = "r") and (Not FullStack(T)) PUSH(T, A[]); ENDIF; I = 1 + 1; EndWhile; While Not EmptyStack (R) Pop (R, ch); Write (ch); If Not Fullstack(T) Push (T, ch); Endif: EndWhile; While Not EmptyStack(T) Pop (T, ch); Write (ch); EndWhile; output tracing

ASSUME S, T R are stacks. A is an array [1..14] of char; THE INPUT IS "datastructures". The MAXSTACK VALUES FOR R, S ARE 5 AND For T is 7. ALL THREE STACKS WILL CONTAIN CHARACTER DATA. ASSUME ch is a character variable. Also ASSUME that there is NO SPACE in the input. ClearStack (S);ClearStack (T); ClearStack(R ); FORI = 1 to 14 READ(A[1]); END FOR; I = 1; While I < 15 IF NOT FULLSTACK(R) PUSH(R, A[]) ELSE IF NOT FULLSTACK(S) PUSH(S, A[1]); ENDIF; IF (A[I ] = "u" OR A[] = "r") and (Not FullStack(T)) PUSH(T, A[]); ENDIF; I = 1 + 1; EndWhile; While Not EmptyStack (R) Pop (R, ch); Write (ch); If Not Fullstack(T) Push (T, ch); Endif: EndWhile; While Not EmptyStack(T) Pop (T, ch); Write (ch); EndWhile; output tracing

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

Alert dont submit AI generated answer.

ASSUME S, T R are stacks. A is an array [1..14] of char; THE INPUT IS "datastructures". The MAXSTACK VALUES FOR R, S ARE 5 AND For T is 7. ALL THREE STACKS WILL CONTAIN CHARACTER DATA. ASSUME ch is a character variable. Also ASSUME that there is NO SPACE in the input. ClearStack(S); ClearStack (T); ClearStack (R ); FOR I = 1 to 14 READ(A[1]); END FOR; I = 1; While I < 15 IF NOT FULLSTACK(R) PUSH(R, A[I]) ELSE IF NOT FULLSTACK(S) PUSH(S, A[I]); ENDIF; IF (A[I "r") and (Not FullStack(T)) PUSH(T, A[1]); ENDIF; I = 1 + 1; EndWhile; While Not EmptyStack(R) Pop (R, ch); Write (ch); If Not Fullstack(T) Push (T, ch); Endif: EndWhile; While Not EmptyStack (T) Pop(T, ch); Write (ch); EndWhile; output tracing ] "u" OR A[!] =
Transcribed Image Text:ASSUME S, T R are stacks. A is an array [1..14] of char; THE INPUT IS "datastructures". The MAXSTACK VALUES FOR R, S ARE 5 AND For T is 7. ALL THREE STACKS WILL CONTAIN CHARACTER DATA. ASSUME ch is a character variable. Also ASSUME that there is NO SPACE in the input. ClearStack(S); ClearStack (T); ClearStack (R ); FOR I = 1 to 14 READ(A[1]); END FOR; I = 1; While I < 15 IF NOT FULLSTACK(R) PUSH(R, A[I]) ELSE IF NOT FULLSTACK(S) PUSH(S, A[I]); ENDIF; IF (A[I "r") and (Not FullStack(T)) PUSH(T, A[1]); ENDIF; I = 1 + 1; EndWhile; While Not EmptyStack(R) Pop (R, ch); Write (ch); If Not Fullstack(T) Push (T, ch); Endif: EndWhile; While Not EmptyStack (T) Pop(T, ch); Write (ch); EndWhile; output tracing ] "u" OR A[!] =
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Lists
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.
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