L5 LinkedLists, Vector and Stacks Quiz

What is the time complexity of inserting an element at the head of a linked list?

• O(n)

• O(log n)

• O(1)

• O(n²)

Which of the following is true about linked lists?

• Fixed size

• Requires additional memory for pointers

• Cannot store integers

• Supports only one data type

Which method adds an element to the end of the linked list?

• addFirst()

• addLast()

• insert()

• prepend()

What does the head node in a linked list store?

• Data and a link to the next node

• Only a link to the next node

• Cannot store data

• Data and a link to the previous node

Which of the following is true about a vector?

• Vector is synchronized

• Vector is not thread-safe

• Vector can only store primitive types

• Vector does not allow null elements

Which of the following statements is true about a vector?

• Vectors do not allow resizing

• Vectors are synchronized

• Vectors are immutable

• Vectors cannot store strings

Which principle does a stack follow?

• LIFO

• FIFO

• Random Access

• Binary Search Tree

What does the push() method do in a stack?

• Adds an element to the bottom

• Removes an element from the stack

• Adds an element to the top

• Checks for null

What does the pop() method do?

• Removes an element from the top

• Adds an element at the bottom

• Removes the middle element

• Checks the last element

What does the peek() method return?

• Retrieves the top element without removing it

• Removes the top element

• Adds an element

• Clears the stack