Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
2. a) Show the status of a QUEUE and a Priority QUEUE (Data in Descending Order) for the following operations, where both QUEUES are implemented by an array of size, m=3. Here, Enqueue and Dequeue mean insert and delete respectively, and x=last two digits of your student id+2, y=x+3, z=x+y and p=y+z. last two digits student id = 85 Enqueue(z), Enqueue(p), Dequeue(), Enqueue(y), Dequeue()

2. a) Show the status of a QUEUE and a Priority QUEUE (Data in Descending Order) for the following operations, where both QUEUES are implemented by an array of size, m=3. Here, Enqueue and Dequeue mean insert and delete respectively, and x=last two digits of your student id+2, y=x+3, z=x+y and p=y+z. last two digits student id = 85 Enqueue(z), Enqueue(p), Dequeue(), Enqueue(y), Dequeue()

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
2. a) Show the status of a QUEUE and a Priority QUEUE (Data in Descending Order) for the following operations, where both QUEUES are implemented by an array of size, m=3. Here, Enqueue and Dequeue mean insert and delete respectively, and x=last two digits of your student id+2, y=x+3, z=x+y and p=y+z. last two digits student id Enqueue(z), Enqueue(p), Dequeue(), Enqueue(y), Dequeue() b) Draw a complete binary tree and then build the min-heap tree from the following data, where x= last two digits of your student id+100, y=x+30, and z=x+y. Finally, sort the data in descending order using the heapsort algorithm. last two digits student id = 85 10 x 20 8 y z c) Two disjoint sets {y, p, z, x} and {r, t} are given, where maximum one of a set is the representative of that set. Determine UNION(Find(x), Find(t)). How can you check x and y are in the same set using Find operation? Here, x=last two digits of your student id+2, y=x+3, Z=x+y, p=y+z, r=x+2, t=900. last two digits student id = 85
Transcribed Image Text:2. a) Show the status of a QUEUE and a Priority QUEUE (Data in Descending Order) for the following operations, where both QUEUES are implemented by an array of size, m=3. Here, Enqueue and Dequeue mean insert and delete respectively, and x=last two digits of your student id+2, y=x+3, z=x+y and p=y+z. last two digits student id Enqueue(z), Enqueue(p), Dequeue(), Enqueue(y), Dequeue() b) Draw a complete binary tree and then build the min-heap tree from the following data, where x= last two digits of your student id+100, y=x+30, and z=x+y. Finally, sort the data in descending order using the heapsort algorithm. last two digits student id = 85 10 x 20 8 y z c) Two disjoint sets {y, p, z, x} and {r, t} are given, where maximum one of a set is the representative of that set. Determine UNION(Find(x), Find(t)). How can you check x and y are in the same set using Find operation? Here, x=last two digits of your student id+2, y=x+3, Z=x+y, p=y+z, r=x+2, t=900. last two digits student id = 85
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

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.
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