Question 1

An unbounded stack is most logically made from what data structure?

Question 1 options:

A)	Associative Array

B)

Array

C)	Linked List

D)

Hash

Question 2

Which method is used to add an element to a Stack

Question 2 options:

A)

pop

B)

length

C)

push

D)

add

Question 3

A Stack is what type of data structure?

Question 3 options:

A)

FILO

B)

FISH

C)

FIFO

D)

LIFO

Question 4

What method returns the data found at the stack element number index?

Question 4 options:

A)

indexAt()

B)

push

C)

peek

D)

valueAt()

Question 5

Stacks can be implemented using what data structures?

Question 5 options:

A)

Linked List

B)

Hashes

C)

Trees

D)	Associative Arrays

Question 6

A bounded stack is most logically made from what data structure

Question 6 options:

A)

Array

B)	Associativie Array

C)	Linked List

D)

Hash

Question 7

Which method is used to retrieve an element from a Stack

Question 7 options:

A)

get

B)

length

C)

pop

D)

push

Question 8

What method returns the position where an object occurs as an item in the Stack?

Question 8 options:

A)

indexAt()

B)

push

C)

valueAt()

D)

pop

Question 9

What type of data structure are Stacks?

Question 9 options:

A)

Tertiary

B)

Primary

C)

Secondary

Question 10

Stacks

Question 10 options:

A)	Remove the least recently added element.

B)	Are immutable

C)	Keep all elements

D)	Remove the most recently added element