Create pseudo code for the given three queue methods


Assignment: Lists, Stacks, And Queues

Length: 2 pseudo codes

Data Structures Using Java document shell

Use Microsoft Word

The task this week is to complete the following 2 structures using a linked list:

Stack

Queue

Assume the occurrence of a linked list node is represented by the object "Node" and its "Data" and "NextRef" attributes.

Part 1: Assume a "Head" node exists with the NextRef attribute pointing to the first node in the stack or being null if the stack is empty. Create pseudo code for the following 3 stack methods, showing the logic tied to the inverted list. Include a summary of these actions.

push( item )

pop( )

display( )

Part 2: Assume "Front" and "Rear" nodes exist with the "NextRef" attributes pointing to the first and last nodes of the queue or being null if the queue is empty. Create pseudo code for the following 3 queue methods, showing the logic tied to the inverted list. Include a summary of these actions.

enqueue( item )

dequeue( )

display( )

Pseudo code implemented for both the stack and queue methods

Documented pseudo code.

The response should include a reference list. Double-space, using Times New Roman 12 pnt font, one-inch margins, and APA style of writing and citations.

Request for Solution File

Ask an Expert for Answer!!
Management Information Sys: Create pseudo code for the given three queue methods
Reference No:- TGS02128133

Expected delivery within 24 Hours