Week 7 - Activity #1 (CC104)

What is the main principle that a stack data structure follows?

• First In First Out (FIFO)

• Last In First Out (LIFO)

• Random Access

• First Come First Served

Which of the following is NOT an operation typically associated with a stack?

• Push

• Pop

• Peek

• Insert At Bottom

In the context of stacks, what does the push() operation do?

• Removes the top element

• Adds an element to the bottom

• Adds an element to the top

• Displays the top element without removing it

If a stack follows the LIFO principle, which element will be popped from the following stack [10, 20, 30, 40]?

• 10

• 20

• 30

• 40

In which real-life scenario can a stack be used?

• Queue at a bank

• Browser's back button

• Train scheduling system

• Internet routing table

What will be the result of calling peek() on an empty stack?

• Returns null

• Throws an exception

• Returns the last element

• Does nothing

What is the time complexity of the push() operation in a stack implemented with an array?

• O(1)

• O(n)

• O(log n)

• O(n²)

Which of the following describes a recursive function?

• A function that calls itself

• A function that doesn't return a value

• A function that returns multiple values

• A function that never terminates

In the factorial calculation, how is recursion demonstrated?

• By calculating the sum of numbers

• By multiplying each number by the previous result

• By calling the function multiple times with smaller values

• By using loops to find the product

Which of the following operations cannot be performed directly on a stack?

• Pushing an element

• Popping an element

• Accessing an element in the middle

• Checking if the stack is empty