Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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

C++ Programming: From Problem Analysis to Program Design
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...
See similar textbooks
icon
Related questions
Question
Use python to implement circular array. Using the three properties: o implement the queue interface using a circular array . . array Array object, initialized capacity front_index-int, index where you dequeue back_index-int, index where you enqueue 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
Transcribed Image Text:Use python to implement circular array. Using the three properties: o implement the queue interface using a circular array . . array Array object, initialized capacity front_index-int, index where you dequeue back_index-int, index where you enqueue 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
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Arrays
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
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS