Use python to implement circular array. Using the three properties: o array Array object, initialized capacity front_index-int, index where you dequeue back_index-int, index where you enqueue o implement the queue interface using a circular array Don't add or use other properties other than the three above. Wrap-around: set index back to 0 after the limit has been exceeded. Implement size, enqueue (), dequeue (). front () Size property - compute using front_index and back_index Must have two cases: Case 1: front_index <= back_index (normal) Case 2: back_index < front_index (wrap-around) enqueue(item): front (): add item to the next available array cell update back_index: wrap-around if exceeds index limit Before array becomes full (one empty slot left), create a bigger array with 2x capacity (note: don't use expand) Copy current queue items to bigger array (make sure you keep the same queue order) Case 1: front_index < back_index (normal) Case 2: back_index < front_index (wrap-around) Update array, front_index, back_index properties Make a bigger array before it is full, because back_index always needs to refer to a blank index for enqueue dequeue (): If empty, raise Exception ('Empty queue: cannot dequeue') Remove and return the front item Update front_index; wrap-around if exceeds index limit If array becomes empty, reset front_index = back_index = 0 If empty, raise Exception ('Empty queue: no front') Return the front item
Use python to implement circular array. Using the three properties: o array Array object, initialized capacity front_index-int, index where you dequeue back_index-int, index where you enqueue o implement the queue interface using a circular array Don't add or use other properties other than the three above. Wrap-around: set index back to 0 after the limit has been exceeded. Implement size, enqueue (), dequeue (). front () Size property - compute using front_index and back_index Must have two cases: Case 1: front_index <= back_index (normal) Case 2: back_index < front_index (wrap-around) enqueue(item): front (): add item to the next available array cell update back_index: wrap-around if exceeds index limit Before array becomes full (one empty slot left), create a bigger array with 2x capacity (note: don't use expand) Copy current queue items to bigger array (make sure you keep the same queue order) Case 1: front_index < back_index (normal) Case 2: back_index < front_index (wrap-around) Update array, front_index, back_index properties Make a bigger array before it is full, because back_index always needs to refer to a blank index for enqueue dequeue (): If empty, raise Exception ('Empty queue: cannot dequeue') Remove and return the front item Update front_index; wrap-around if exceeds index limit If array becomes empty, reset front_index = back_index = 0 If empty, raise Exception ('Empty queue: no front') Return the front item
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
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
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
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education