Back to marketplace

2.1.4 Thinking Logically

No description yet. This curated deck is ready for daily study.

Total cards: 4•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (4)

#1

Front (Question)

What are the examples of branching?

Back (Answer)

IF Statement Case/Switch Statement BRP / BRA / BRZ

#2

Front (Question)

What decisions are made in the enqueue and dequeue algorithms?

Back (Answer)

Enqueue – Is the queue already full? | Return error | enqueue item to queue and adjust pointer Dequeue – Is the queue empty? | Return error | dequeue item and adjust pointer Format to use: What is the decision?| Action if true | Action if false:*

#3

Front (Question)

What decisions are made in the pop and push algorithms?

Back (Answer)

Push – Is the stack already full? | Return error | push item and adjust pointer Pop – Is the stack empty? | Return error | pop item and adjust pointer Format to use: What is the decision?| Action if true | Action if false:

#4

Front (Question)

What decisions are made in the pop and push algorithms?

Back (Answer)

Push – Is the stack already full? | Return error | push item and adjust pointer Pop – Is the stack empty? | Return error | pop item and adjust pointer Format to use: What is the decision?| Action if true | Action if false: