Logo

Go on. Explore!

lvl 0 • 0 xp

lvl 1

HomeMarketDecksInterests
Code

Code

memorize.aimemorize.ai (lvl 286)
Star 0%
Star 0%
Star 0%
Star 0%
Star 0%
(0)
(0)
(0)
11 cards
()
Section 1

Preview this deck

newNode.SetNext(lastNode.getNext()); lastNode.setNext(newNode)l lastNode=newNode;

Front

1 / 11

Programming
Star 0%
Star 0%
Star 0%
Star 0%
Star 0%

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Active users

0

All-time users

0

Favorites

0

Last updated

6 years ago

Date created

Mar 1, 2020

Cards (11)

Section 1

(11 cards)

newNode.SetNext(lastNode.getNext()); lastNode.setNext(newNode)l lastNode=newNode;

Front

Referenced-based Queue Enqueue(non-empty queue)

Back

back = (back+1) % MAX_QUEUE; items[back]= newItem; ++count; What type of method is this and what is it doing?

Front

Circular Array Inserting into the queue(if not full)

Back

newNode.setNext(newNode); lastNode=newNode;

Front

Reference-based Queue (empty queue)

Back

if(!isEmpty()){ Node temp= front; front=front.getNext(); if(front==null) // was one element queue rear= null; return temp.getItem(); } else

Front

Linked List Dequeue (two external references)

Back

Public Object dequeue () throws QueueException { if (!isEmpty()){ Object remove= items[0]; for ( int i =1; i <= rear; i++) item[i-1]=items[i]; rear= rear-1; return remove; } else throw new queueExpection what type of strategy is this?

Front

Array-Based: Naive

Back

lastNode.getNext();

Front

Circular Linked list (one external reference)

Back

if (front == rear){ front=0; rear=0; return null; } front = (front +1) % MAX_QUEUE; remove =item[front]; return remove;

Front

Circular Array Dequeue

Back

rear=(rear+1) % MAX_QUEUE; if (front==rear) rear=(rear+MAX_queue-1) % MAX_QUEUE; item[rear]= new item;

Front

Circular Array Enqueue

Back

firstNode=last.getNext(); lastNode.setNext(firstNode.getNext());

Front

Referenced-Based Dequeue

Back

front = (front+1) % MAX_QUEUE; --Count What type of method is this and what is it doing?

Front

Circular Array Deleting from the queue (if not empty)

Back

node temp= new Node(newItem,null); if(front==null) // insert into empty queue front=temp; else rear.setNext(temp); rear=temp;

Front

Linearly Linked List Enqueue( two external References)

Back