DSA · Theory

Find out the person who got the ticket last problem in queue

Theory

588/810

Find out the person who got the ticket last problem in queue

Find out the person who got the ticket last problem in queue is a DSA topic. In plain words you use it for print jobs in a lab printer. Don’t start with a slogan — start with that picture.

Smallest example: enqueue / dequeue FIFO. Type it, run it, and say what you see. If you can do that from memory, you know Find out the person who got the ticket last problem in queue.

From the example next to this theory — Find out the person who got the ticket last problem in queue — queue is FIFO.

Trap — confusing front and rear. Fix that before you talk about advanced DSA.

Viva: what is Find out the person who got the ticket last problem in queue? Then show enqueue / dequeue FIFO. Then name the trap.

Diagram

  front → [A][B][C] ← rear
  out ↑         ↑ in
       FIFO

Exam tip

What is Find out the person who got the ticket last problem in queue? Show this: enqueue / dequeue FIFO. Trap: confusing front and rear.

Example

from collections import deque

q = deque()
q.append(10)      # enqueue
q.append(20)
print(q.popleft())  # 10
print(list(q))

Find out the person who got the ticket last problem in queue — queue is FIFO. deque.popleft() is O(1).

Short notes

DefFind out the person who got the ticket last problem in queue — print jobs in a lab printer.
Ruleenqueue / dequeue FIFO
Trapconfusing front and rear
Usea lab printer

DSA · Theory

Find out the person who got the ticket last problem in queue

← All stacks

Theory

588/810

Find out the person who got the ticket last problem in queue

Find out the person who got the ticket last problem in queue is a DSA topic. In plain words you use it for print jobs in a lab printer. Don’t start with a slogan — start with that picture.

Smallest example: enqueue / dequeue FIFO. Type it, run it, and say what you see. If you can do that from memory, you know Find out the person who got the ticket last problem in queue.

From the example next to this theory — Find out the person who got the ticket last problem in queue — queue is FIFO.

Trap — confusing front and rear. Fix that before you talk about advanced DSA.

Viva: what is Find out the person who got the ticket last problem in queue? Then show enqueue / dequeue FIFO. Then name the trap.

Diagram

  front → [A][B][C] ← rear
  out ↑         ↑ in
       FIFO

Exam tip

What is Find out the person who got the ticket last problem in queue? Show this: enqueue / dequeue FIFO. Trap: confusing front and rear.

Example

from collections import deque

q = deque()
q.append(10)      # enqueue
q.append(20)
print(q.popleft())  # 10
print(list(q))

Find out the person who got the ticket last problem in queue — queue is FIFO. deque.popleft() is O(1).

Short notes

DefFind out the person who got the ticket last problem in queue — print jobs in a lab printer.
Ruleenqueue / dequeue FIFO
Trapconfusing front and rear
Usea lab printer

Find out the person who got the ticket last problem in queue

Example

Short notes

Questions

Find out the person who got the ticket last problem in queue

Example

Short notes

Questions