Lists, Stacks and Queues
Week 1: Assignment Details
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( )
Week 1 Deliverables:
- Pseudo code implemented for both the stack and queue methods
- Documented pseudo code
- Add the completed pseudo code and discussion to the Key Assignment template Section 1: Lists, Stacks, and Queues.
- Name the document “IT265_
_IP1.doc.”
"You need a similar assignment done from scratch? Our qualified writers will help you with a guaranteed AI-free & plagiarism-free A+ quality paper, Confidentiality, Timely delivery & Livechat/phone Support.
Discount Code: CIPD30
Click ORDER NOW..
