Data Structures Flashcard

Front

Which data structure follows the Last-In, First-Out (LIFO) principle?

Back

Stack

Front

What is the primary advantage of a Linked List over a static Array?

Back

Dynamic size and easier insertions/deletions in the middle

Front

Which data structure uses the First-In, First-Out (FIFO) principle? Options: Stack, Tree, Queue, Hash Table

Back

Queue

Front

What is the time complexity of accessing an element in an array by its index?

Back

O(1)

Front

Which searching algorithm requires the data structure to be sorted beforehand? Options: Linear Search, Binary Search, Depth First Search, Breadth First Search

Back

Binary Search

Front

A function calling itself is an example of?

Back

Recursion

Front

Which of the following is considered one of the simplest sorting algorithms, often used for educational purposes despite its inefficiency? Merge Sort, Quick Sort, Heap Sort, Bubble Sort

Back

Bubble Sort

Front

What does Big O notation primarily describe?

Back

The upper bound or worst-case time/space complexity growth rate of an algorithm

Front

In a Hash Table, what is used to map keys to indices in the underlying array?

Back

A Hash Function

Front

Which data structure typically provides average O(1) time complexity for insertion, deletion, and search operations? Options: Array, Linked List, Hash Table, Binary Search Tree

Back

Hash Table