Fundamentals of Data Structures Quiz

What is the main difference between arrays and linked lists?

• Linked lists store elements in contiguous memory locations

• Arrays store elements in non-contiguous memory locations

• Arrays store elements in contiguous memory locations, while linked lists store elements in nodes with pointers to the next node.

• Arrays have pointers to the next element

What is the purpose of a stack in data structures?

• To store and manage data in a First In, First Out (FIFO) manner

• To store and manage data in a Last In, First Out (LIFO) manner

• To store and manage data in a sorted manner

• To store and manage data in a random order

Explain the concept of a queue and its application in data structures.

• A queue is used to store and retrieve data in random order.

• A queue is a non-linear data structure.

• A queue is a linear data structure that follows the First In First Out (FIFO) principle. It is used to store and retrieve data in the order it was added.

• A queue is a data structure that follows the Last In First Out (LIFO) principle.

What is the time complexity of the bubble sort algorithm?

• O(n^2)

• O(1)

• O(n log n)

• O(n)

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

• Easier to implement

• Lower memory usage

• Dynamic size

• Faster access time

Explain the concept of a doubly linked list and its advantages over a singly linked list.

• A doubly linked list can only be traversed in one direction

• A doubly linked list is the same as a singly linked list but with more nodes

• A doubly linked list is less efficient than a singly linked list

• A doubly linked list allows for traversal in both directions and easier deletion of nodes compared to a singly linked list.

What is the purpose of a priority queue in data structures?

• To store elements with priorities and serve the highest priority element first.

• To randomly access elements in any order

• To remove elements based on their value

• To sort elements in descending order

What is the main difference between a stack and a queue?

• The main difference is the size of the data structure.

• The main difference is the color of the data structure.

• The main difference is the order in which items are removed from the data structure.

• The main difference is the shape of the data structure.

Explain the concept of a binary search and its application in data structures.

• A binary search is only applicable to linked lists and not arrays.

• A binary search is a search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array and continues narrowing down the search until the value is found or the subarray is empty.

• A binary search is a search algorithm that finds the position of a target value within an unsorted array.

• A binary search compares the target value to the first element of the array and continues searching from there.