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 thefollowing procedures to do the lists? Here, TOP is the top pointer of L_S, andFRONT and REAR are the front and rear of L_Q. What are your observationsregarding the functionality of the two procedures?procedureWHAT_IS_COOKING1 (TOP, FRONT,REAR)TEMP, TEMP1, TEMP2 and /* TEMP, TEMP1,aretemporary TEMP3areTEMP3variables */TEMP1= FRONT;TEMP2TOP;while (TEMP1# Nil ANDTEMP2 Nil) doTEMP3 = DATA (FRONT);DATA (FRONT) = DATA (TOP) ;DATA (TOP) = TEMP3;TEMP1= LINK (TEMP1);PREVIOUS = TEMP2;TEMP2 LINK (TEMP2);endwhileTEMPTOP;TOP FRONT ;=FRONT TEMP;REAR = PREVIOUS;end WHAT_IS_COOKING 1procedureWHAT_IS_COOKING2 (TOP,FRONT, REAR)=variables*/TEMP = TOP;while (LINK (TEMP) # Nil)doTEMP = LINK (TEMP);endwhileTEMP1= TOP;TEMP;TEMP2 andtemporaryREARTOP FRONT ;FRONT=TEMP1;end WHAT_IS_COOKING2

Given procedure: procedureWHAT_IS_COOKING1(TOP, FRONT,REAR)/* TEMP, TEMP1, TEMP2 andTEMP3 are…

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

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

See similar textbooks

Similar questions

using c++ concepts of data structure Make a doubly linked list, take n inputs. Print it.Now, swap any two nodes (picked by the user), and print the list again. The node will be pickedon the basis of their value.Note: You have to swap the Node, by managing the links between them. NOT JUST THEVALUE INSDE THEM.
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, temporary TEMP3 are 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 are variables*/ TEMP2 and temporary TEMP = TOP; while (LINK (TEMP) # Nil) do TEMP = LINK (TEMP); endwhile TEMP1= TOP; REAR = TEMP; TOP = FRONT ; FRONT = TEMP1; end WHAT_IS_COOKING2
Write a code for a simple text editor/Nodepad. Use fully connected linked list, with four pointers next,prev,up and down. Note: Use linkedlist DSA C++ and also file handling. Please complete the requirements. I asked this question multiplie times before. I don't want incorrect answer this time.
Consider the following functions are called for an integer queue in order. What will be the final state of the queue after these operations?CreateQueue(Q);Enqueue(9, Q);Enqueue(1, Q);Dequeue(&x, Q);Enqueue(4, Q);ClearQueue(Q);Enqueue(1, Q);QueueGetFront(&x, Q);Enqueue(7, Q);Dequeue(&x, Q);Enqueue(9, Q);Enqueue(2, Q);Dequeue(&x, Q);Enqueue(3,Q);
write a C++ Program Your task is to develop a program for a hospital where they need help to calculate and maintainthe number of patients, their disease, and their allotted room numbers. You will use a SinglyLinkedList to store record of a patient such as patient name, patient CNIC, patient disease, admitdate and patient allotted room number.Suppose if a patient has been recovered then, you will need to delete his Node from the list (Useall methods of deletion Start, Middle, and End). The system will use a special function named asDichargePatient() that will take patient CNIC as parameter, remove node of the patient, and returnsuccess status of the operation.Whenever a new patient is arrived at the hospital for admitting in a room. The system will useanother function AdmitPatient() that takes patient’s information, checks the availability of a room(assume that hospital only have 20 rooms and only one patient per room is allowed). If multiplerooms are available, then always allocate…
Is it possible to implement a sorted linked list with a DLL? What advantage a DLL implementation may have over a singly linked list? Use a specific example or application to support your argument.
As a student who is currently doing CMPG22, you have been asked to analyse, model and design a LinkedList System that will be used to perform some manipulations on the data list by high school students and their instructors. The list will be given to the system as input and the user will perform some actions on the data as follows: 1. Return the first element in the list, 2. return the last element in the list, 3. remove the head and return the object stored in the removed node, 4. add a new element to the front of the list, 5. add a new element to the end of the list, 6. delete the first item in the list with the SAME VALUE, 7. determine whether a specific object is present (according to value), 8. receives a second linked list as a parameter and will return a third list containing all the elements of the parameter list which are not present in the calling list and lastly, 9. receive the second linked list as a parameter, and return a new linked list consisting of both the parameter…
Using C++ . Create a queue using a linked list as your container and use a class. The system must have enqueue and dequeue operations and functions such as, isfull() and isempty(). Make sure it has an input and 10 data will be accepted.
Write the code to delete a node in the middle of a list implemented as a linked list with the dummy node (see Exercise 3). Compare your answer with the answer to Exercise 3. Are they the same? What do you conclude? Does the dummy node simplify the operation on the list? How?
Write a menu-driven program to create an unrolled linked list and retrieve,insert and delete an element from it. You may take liberties with the operationswhile implementing them.
Write a C++ program to create a linked list using structures. The size of the linked list will be dependent on the user. Insert the numbers in the linked list till the linked list reaches the size. Create a menu and perform the following function on that linked list. Traversal: To traverse all the nodes one after another. Insertion: To add a node at the given position. Deletion: To delete a node. Searching: To search an element(s) by value. Updating: To update a node.
The regular queue is a FIFO structure, meaning that you can only enqueue at the rear and dequeue at the front. Suppose that the dequeue operation can also be performed at the rear (so you can remove and return the last element on the queue), which of the following describes the correct and efficient way of using a linked list to implement this queue? OUsing a singly linked list with a reference to the head only, the dequeue method traverses it, stops at the last node and removes it. O Using a singly linked list with a reference to the head only, the dequeue method traverses it, stops at the second to last node and removes the last node. O Using a singly linked list with references that point to the first and the last nodes respectively, the dequeue method removes the last node via the corresponding reference. OUsing a doubly linked list with references that point to the first and the last nodes respectively, the dequeue method can remove the last node via the corresponding reference. O…