Lesson 2.3: Stacks

Question 1

A linear data structure that can be accessed only at one of its ends for storing and retrieving data.

Answer 1

Stack

Question 2

A Stack if called a LIFO Structure. LIFO stands for?

Answer 2

Last In, First Out.

Question 3

It is an abstract data type that provides an ordered and linear sequence of items.

Answer 3

Stack

Question 4

A Stack follows a _________ structure.

Answer 4

First in, Last out (FILO) or Last In, First Out (LIFO)

Question 5

Clear the stack.

Answer 5

clear()

Question 6

Check to see if the stack is empty.

Answer 6

isEmpty()

Question 7

Put the element el on the top of the stack.

Answer 7

push(el)

Question 8

Take the topmost element from the stack.

Answer 8

pop()

Question 9

Return the topmost element in the stack without removing it.

Answer 9

topEl()

Question 10

method to insert a value at the end of the linked list

Answer 10

push

Question 11

method to remove a value from the end of the linked list

Answer 11

pop

Question 12

Stacks can be implemented in a variety of ways. Arrays can be a possible way. However we cannot implement stacks with the use of Linked lists. True or False.

Answer 12

False