Queues Practice Assignments
Overview
Linear structures (for example, lists, stacks and queues) are common in everyday life and prevelant through programs, including operating systems.
Submission Instructions
Submit each of the following practice assignments at codePost.io.
To register for a free codePost account, please follow these instructions.
Watch this short video for a demonstration of submitting an assignment and reviewing the results:
Note, currently, feedback is not visible in Safari.
Practice Assignments
Array-Based Queues
Write Java code in a new driver class that uses an array-based queue to complete the following:- Request the maximum size of the queue
- Perform the following operations and display a representation of the queue after each operation (in part by calling toString()):
- enqueue( 1 )
- enqueue( 2 )
- dequeue( )
- enqueue( 3 )
- dequeue( )
- dequeue( )
- With another queue, perform the following operations and display a representation of the queue after each operation (in part by calling toString()):
- enqueue( 's' )
- enqueue( 't' )
- enqueue( 'r' )
- enqueue( 'e' )
- enqueue( 's' )
- enqueue( 's' )
- enqueue( 'e' )
- enqueue( 'd' )
- dequeue( )
- dequeue( )
- dequeue( )
- dequeue( )
- dequeue( )
- dequeue( )
- dequeue( )
- dequeue( )
- enqueue( '!' )
- enqueue( '?' )
- enqueue( '@' )
- dequeue( )
- dequeue( )
- dequeue( )
Use the Queue interface and the AQueue class for this assignment. Also, add a toString method into the AQueue class that returns a sequence representation of the queue. Do not change the interface and you do not need to make any other adjustments to the class. Note, you do not need to upload Queue.java.
Example
Note, user input is in bold face blue and underlined text is required for test cases.Please enter the maximum size for the first queue: 10 You entered 10 AQueue (1 element): Index 1 Front 1 Rear AQueue (2 elements): Index 1 2 Front 1 2 Rear AQueue (1 element): Index 2 Front 2 Rear AQueue (2 elements): Index 2 3 Front 2 3 Rear AQueue (1 element): Index 3 Front 3 Rear AQueue (0 elements): Index Front Rear Please enter the maximum size for the second queue: 10 You entered 10 AQueue (1 element): Index 1 Front s Rear AQueue (2 elements): Index 1 2 Front s t Rear AQueue (3 elements): Index 1 2 3 Front s t r Rear AQueue (4 elements): Index 1 2 3 4 Front s t r e Rear AQueue (5 elements): Index 1 2 3 4 5 Front s t r e s Rear AQueue (6 elements): Index 1 2 3 4 5 6 Front s t r e s s Rear AQueue (7 elements): Index 1 2 3 4 5 6 7 Front s t r e s s e Rear AQueue (8 elements): Index 1 2 3 4 5 6 7 8 Front s t r e s s e d Rear AQueue (7 elements): Index 2 3 4 5 6 7 8 Front t r e s s e d Rear AQueue (6 elements): Index 3 4 5 6 7 8 Front r e s s e d Rear AQueue (5 elements): Index 4 5 6 7 8 Front e s s e d Rear AQueue (4 elements): Index 5 6 7 8 Front s s e d Rear AQueue (3 elements): Index 6 7 8 Front s e d Rear AQueue (2 elements): Index 7 8 Front e d Rear AQueue (1 element): Index 8 Front d Rear AQueue (0 elements): Index Front Rear AQueue (1 element): Index 9 Front ! Rear AQueue (2 elements): Index 9 10 Front ! ? Rear AQueue (3 elements): Index 9 10 0 Front ! ? @ Rear AQueue (2 elements): Index 10 0 Front ? @ Rear AQueue (1 element): Index 0 Front @ Rear AQueue (0 elements): Index Front Rear
Note, because we are treating the array as a circular array, any time we add to a circular array index, we need to do circular increment.
Linked Queues
Write Java code in a new driver class that uses an linked queue to complete the following:- Perform the following operations and display a representation of the queue after each operation (in part by calling toString()):
- enqueue( 1 )
- enqueue( 2 )
- dequeue( )
- enqueue( 3 )
- dequeue( )
- dequeue( )
- With another queue, perform the following operations and display a representation of the queue after each operation (in part by calling toString()):
- enqueue( 's' )
- enqueue( 't' )
- enqueue( 'r' )
- enqueue( 'e' )
- enqueue( 's' )
- enqueue( 's' )
- enqueue( 'e' )
- enqueue( 'd' )
- dequeue( )
- dequeue( )
- dequeue( )
- dequeue( )
- dequeue( )
- dequeue( )
- dequeue( )
- dequeue( )
- enqueue( '!' )
- enqueue( '?' )
- enqueue( '@' )
- dequeue( )
- dequeue( )
- dequeue( )
Use the Queue interface, Link class and the LQueue class for this assignment. Also, add a toString method into the LQueue class that returns a sequence representation of the queue. Do not change the interface and you do not need to make any other adjustments to the class. Note, you do not need to upload Queue.java, nor Link.java.
Example
Note, user input is in bold face blue and underlined text is required for test cases.LQueue (1 element): Front -> 1 <- Rear LQueue (2 elements): Front -> 1 -> 2 <- Rear LQueue (1 element): Front -> 2 <- Rear LQueue (2 elements): Front -> 2 -> 3 <- Rear LQueue (1 element): Front -> 3 <- Rear LQueue (0 elements): Front <- Rear LQueue (1 element): Front -> s <- Rear LQueue (2 elements): Front -> s -> t <- Rear LQueue (3 elements): Front -> s -> t -> r <- Rear LQueue (4 elements): Front -> s -> t -> r -> e <- Rear LQueue (5 elements): Front -> s -> t -> r -> e -> s <- Rear LQueue (6 elements): Front -> s -> t -> r -> e -> s -> s <- Rear LQueue (7 elements): Front -> s -> t -> r -> e -> s -> s -> e <- Rear LQueue (8 elements): Front -> s -> t -> r -> e -> s -> s -> e -> d <- Rear LQueue (7 elements): Front -> t -> r -> e -> s -> s -> e -> d <- Rear LQueue (6 elements): Front -> r -> e -> s -> s -> e -> d <- Rear LQueue (5 elements): Front -> e -> s -> s -> e -> d <- Rear LQueue (4 elements): Front -> s -> s -> e -> d <- Rear LQueue (3 elements): Front -> s -> e -> d <- Rear LQueue (2 elements): Front -> e -> d <- Rear LQueue (1 element): Front -> d <- Rear LQueue (0 elements): Front <- Rear LQueue (1 element): Front -> ! <- Rear LQueue (2 elements): Front -> ! -> ? <- Rear LQueue (3 elements): Front -> ! -> ? -> @ <- Rear LQueue (2 elements): Front -> ? -> @ <- Rear LQueue (1 element): Front -> @ <- Rear LQueue (0 elements): Front <- Rear