Lesson 4: Stacks

Question 1

data structure in which all insertions and deletions are restricted to one end, called the top

Answer 1

Stacks

Question 2

Is Stack LIFO (last-in, first-out) or FIFO (first-in, first-out)?

Answer 2

LIFO

Question 3

Basic Stack Operations (clue: PPS)

Answer 3

Push
Pop
Stack Top (TopMost)

Question 4

[Basic Stack Operations] Used to insert a new element at the top of the stack

Answer 4

Push

Question 5

[Basic Stack Operations] Problem in Push

Answer 5

Overflow

Question 6

[Basic Stack Operations] Removes the element at the top of the stack and returns the data to the calling module

Answer 6

Pop

Question 7

[Basic Stack Operations] Problem with Pop

Answer 7

Underflow

Question 8

[Basic Stack Operations] Returns the data at the top of the stack without deleting the data from the stack.

Answer 8

Stack Top (TopMost)

Question 9

[Basic Stack Operations] Problem with Stack Top (TopMost)

Answer 9

Underflow

Question 10

Two Structures to Implement Stack (clue: HD)

Answer 10

Head
Data node

Question 11

[Two Structures to Implement Stack] Contains metadata

Answer 11

Head

Question 12

[Two Structures to Implement Stack] Head requires only two attributes, which are? (clue: TC)

Answer 12

Top pointer
Count of the number of elements in the deck

Question 13

Stack Algorithms (clue: CPPSEFSD)

Answer 13

Create stack
Push stack
Pop stack
Stack top
Empty stack
Full stack
Stack count
Destroy stack

Question 14

[Stack Algorithms] sends the data at the top of the stack back to the calling module without deleting the top node. It allows the user to see what will be deleted when the stack is popped

Answer 14

Stack top algorithm

Question 15

[Stack Algorithms] Provided to implement the structured programming concept of data hiding

Answer 15

Empty Stack

Question 16

[Stack Algorithms] Structured programming implementation of data hiding

Answer 16

Full Stack

Question 17

[Stack Algorithms] The most difficult algorithms to implement depending on the language

Answer 17

Full Stack

Question 18

[Stack Algorithms] Returns the number of elements currently in the stack

Answer 18

Stack Count

Question 19

[Stack Algorithms] Deletes all data in a stack

Answer 19

Destroy Stack

Question 20

Stack Applications (clue: RPBP)

Answer 20

Reversing data
Parsing
Backtracking
Postponing

Question 21

[Stack Applications] We can use stacks to reverse data

Answer 21

Reversing Data

Question 22

[Stack Applications] Stacks can be used to backtrack to achieve certain goals

Answer 22

Backtracking

Question 23

[Stack Applications] Evaluating arithmetic expressions

Answer 23

Postponement

Question 24

In high level languages, _____ notation cannot be used to evaluate expressions

Answer 24

Infix

Question 25

What notation is this: +ab

Answer 25

Prefix

Question 26

What notation is this: a+b

Answer 26

Infix

Question 27

What notation is this: ab+

Answer 27

Postfix