Data Structures and Algorithms Quiz

What is an "elementary item" in data structures?

• A data item divided into subitems

• A single unit of data that cannot be further divided

• A collection of records

• A primary key field

What defines an "entity set"?

• A single data record

• A collection of entities with similar attributes

• A hierarchical data model

• A sorted array

What is a "primary key" in a data file?

• A field that stores duplicate values

• A field that uniquely identifies each record

• A field used only for sorting

• A temporary variable in algorithms

What is the correct definition of a linear array?

• A tree-like structure with branches

• A list of similar elements referenced by consecutive indices

• A circular linked list

• A nonlinear data structure

Which operation involves accessing each element of an array exactly once?

• Sorting

• Traversing

• Merging

• Hashing

What happens during the insertion of an element into a sorted array?

• All elements shift left

• Elements are swapped randomly

• Elements from the insertion point shift right

• The array is resized dynamically

When deleting an element from an array, what is the necessary adjustment?

• The array size increases

• Elements after the deletion point shift left

• The deleted element is replaced with zero

• A new primary key is assigned

How does bubble sort ensure elements are ordered?

• By recursively dividing the array

• By repeatedly swapping adjacent elements if they are out of order

• By selecting the smallest element and moving it to the front

• By merging two sorted subarrays

After the first pass of bubble sort, what is guaranteed?

• The smallest element is in its correct position

• The largest element is in its correct position

• The array is fully sorted

• No swaps occur

What is the worst-case time complexity of bubble sort?

• O(log n)

• O(n)

• O(n²)

• O(1)