Given a linked stack L_S and a linked queue L_Q with equal length, what do the following procedures to do the lists? Here, TOP is the top pointer of L_S, and FRONT and REAR are the front and rear of L_Q. What are your observations regarding the functionality of the two procedures? procedure procedure WHAT_IS_COOKING1 (TOP, FRONT, WHAT_IS_COOKING2 (TOP, FRONT, REAR) REAR) /* TEMP3 TEMP, TEMP1, TEMP2 and /* TEMP, TEMP1, TEMP2 and are temporary TEMP3 are temporary variables */ TEMP1= FRONT; TEMP2 = TOP; while (TEMP1# Nil AND TEMP2 Nil) do TEMP3 = DATA (FRONT); DATA (FRONT) = DATA (TOP); DATA (TOP) = TEMP3; TEMP1 = LINK (TEMP1); PREVIOUS = TEMP2; TEMP2 = LINK (TEMP2); endwhile TEMP = TOP; TOP = FRONT ; FRONT = TEMP; REAR = PREVIOUS; end WHAT IS COOKING 1 variables*/ TEMP = TOP; while (LINK (TEMP)# Nil) do TEMP LINK (TEMP); endwhile TEMP1= TOP; REAR = TEMP; TOP = FRONT; FRONT = TEMP1; end WHAT_IS_COOKING2

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
icon
Related questions
Question
100%

A minor mistake in answer lead to downvote so only attend if you know exect answer.

Given a linked stack L_S and a linked queue L_Q with equal length, what do the
following procedures to do the lists? Here, TOP is the top pointer of L_S, and
FRONT and REAR are the front and rear of L_Q. What are your observations
regarding the functionality of the two procedures?
procedure
WHAT_IS_COOKING1 (TOP, FRONT,
REAR)
TEMP, TEMP1, TEMP2 and /* TEMP, TEMP1,
are
temporary TEMP3
are
TEMP3
variables */
TEMP1= FRONT;
TEMP2
TOP;
while (TEMP1# Nil AND
TEMP2 Nil) do
TEMP3 = DATA (FRONT);
DATA (FRONT) = DATA (TOP) ;
DATA (TOP) = TEMP3;
TEMP1= LINK (TEMP1);
PREVIOUS = TEMP2;
TEMP2 LINK (TEMP2);
endwhile
TEMP
TOP;
TOP FRONT ;
=
FRONT TEMP;
REAR = PREVIOUS;
end WHAT_IS_COOKING 1
procedure
WHAT_IS_COOKING2 (TOP,
FRONT, REAR)
=
variables*/
TEMP = TOP;
while (LINK (TEMP) # Nil)
do
TEMP = LINK (TEMP);
endwhile
TEMP1= TOP;
TEMP;
TEMP2 and
temporary
REAR
TOP FRONT ;
FRONT
=
TEMP1;
end WHAT_IS_COOKING2
Transcribed Image Text:Given a linked stack L_S and a linked queue L_Q with equal length, what do the following procedures to do the lists? Here, TOP is the top pointer of L_S, and FRONT and REAR are the front and rear of L_Q. What are your observations regarding the functionality of the two procedures? procedure WHAT_IS_COOKING1 (TOP, FRONT, REAR) TEMP, TEMP1, TEMP2 and /* TEMP, TEMP1, are temporary TEMP3 are TEMP3 variables */ TEMP1= FRONT; TEMP2 TOP; while (TEMP1# Nil AND TEMP2 Nil) do TEMP3 = DATA (FRONT); DATA (FRONT) = DATA (TOP) ; DATA (TOP) = TEMP3; TEMP1= LINK (TEMP1); PREVIOUS = TEMP2; TEMP2 LINK (TEMP2); endwhile TEMP TOP; TOP FRONT ; = FRONT TEMP; REAR = PREVIOUS; end WHAT_IS_COOKING 1 procedure WHAT_IS_COOKING2 (TOP, FRONT, REAR) = variables*/ TEMP = TOP; while (LINK (TEMP) # Nil) do TEMP = LINK (TEMP); endwhile TEMP1= TOP; TEMP; TEMP2 and temporary REAR TOP FRONT ; FRONT = TEMP1; end WHAT_IS_COOKING2
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Concept of Threads
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