Understanding Sorting and Data Structures

Which of the following is a characteristic of the Bubble Sort algorithm?

• It is a divide and conquer algorithm.

• It repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

• It builds a heap from the input data.

• It uses a pivot element to partition the array.

What is the main advantage of using a linked list over an array?

• Faster access to elements.

• Dynamic size and ease of insertion/deletion.

• Requires less memory.

• Elements are stored in contiguous memory locations.

Which sorting algorithm is known for its "divide and conquer" approach?

• Bubble Sort

• Quick Sort

• Insertion Sort

• Selection Sort

In a binary search tree, what is the maximum number of children a node can have?

• 1

• 2

• 3

• 4

Which data structure uses the Last In First Out (LIFO) principle?

• Queue

• Stack

• Array

• Linked List

What is the time complexity of the Merge Sort algorithm in the worst case?

Which data structure is best suited for implementing a priority queue?

• Stack

• Queue

• Heap

• Linked List

What is the main disadvantage of using an array?

• Fixed size

• Slow access to elements

• High memory usage

• Complex insertion and deletion

Which sorting algorithm is considered the simplest but not the most efficient for large datasets?

• Merge Sort

• Quick Sort

• Bubble Sort

• Heap Sort

In a queue, which operation is used to add an element?

• Push

• Pop

• Enqueue

• Dequeue