Data Structures Quiz

What is the main factor to consider when choosing an appropriate data structure for a problem?

• The complexity of the algorithm's logic

• The speed and memory efficiency of operations

• The programming language used

• The color scheme of the interface

Which of the following data structures provides efficient random access to elements?

• Linked List

• Stack

• Array

• Queue

In which scenario would a linked list be more appropriate than an array?

• When you need to access elements randomly by index

• When the size of the data is fixed and known beforehand

• When frequent insertions and deletions at arbitrary positions are required

• When the data needs to be sorted for binary search operations

What is the primary advantage of using procedural abstraction in programming?

• It makes code slower

• It promotes code duplication

• It hides implementation details and promotes code reusability

• It makes the program require more memory

Which of the following is a dynamic data structure?

• Array

• Matrix

• Stack (using arrays)

• Linked List

In a binary search tree (BST), what is the main characteristic of the left child node compared to its parent?

• It holds a greater value than the parent node

• It holds a lesser value than the parent node

• It holds the same value as the parent node

• It holds a random value unrelated to the parent node

Which type of loop is appropriate when you want to guarantee that the loop body executes at least once?

• For loop

• While loop

• Do-while loop

• Nested loop

Which of the following is a key feature of dynamic arrays (such as ArrayList or Vector)?

• Fixed size, determined at compile time

• Automatic resizing to accommodate new elements

• No ability to change the size after initialization

• Efficient in performing all types of operations, including sorting

Which of the following data structures is typically used in databases to manage large datasets stored externally?

• Binary Search Tree

• Hash Table

• B-tree

• Linked List

Which of the following is a characteristic of a stack data structure?

• Elements are inserted and removed from the front (FIFO)

• Elements are inserted and removed from the back (LIFO)

• Elements are randomly accessed

• Elements are inserted at random positions