ITE 031 blk2 Quiz

In Java, which of the following best describes the behavior of a Queue?

• First-In, Last-Out

• First-In, First-Out

• First-In, Last-Out

• First-In, Last-In

Which method is used to add an element to a Stack?

• push()

• Push()

• Add()

• add()

What is the primary difference between a Stack and a Queue?

• A Stack uses LIFO behavior, and a Queue uses FIFO behavior.

• A Stack uses FIFO behavior, and a Queue uses LIFO behavior.

• A Queue uses LIFO behavior, and Stack uses FIFO behavior.

• A Queue uses FIFO behavior, and a Stack uses FOFI behavior.

Which of the following is a key advantage of using an ArrayList in Java?

• Efficient element search and random access by index.

• Fast element insertion and removal at any position.

• It is synchronized, making it thread-safe by default.

• It can only store primitive data types.

The java.util.Queue interface provides methods for which operations?

• push(), pop(), peek()

• d) add(), remove(), peek()

• get(), set(), remove()

• add(),push(),get()

Which operation in a stack is used to insert an element?

• push()

• Push()

• push

• (push())

Which data structure is typically implemented using a linked list or an array?

• Queue

• Binary Tree

• Hash Table

• Stack

To remove the top element from a stack, which method do you call?

• remove()

• Pop()

• Remove()

• pop()

What is the primary disadvantage of using a standard array as a list?

• It's hard to access elements by index.

• It has a fixed size and is difficult to resize.

• It is not supported in Java.

• It is slow for searching

A variable that stores the address/reference of another variable or object.

• Stacks

• Queue

• class

• pointer