ECS 32B Flashcardizz

Front

Does a Linked List have a fixed size in memory?

Back

No, a Linked List can grow and shrink in size dynamically as elements are added or removed.

Front

What kind of graph does Dijkstra's Algorithm not work with?

Back

Dijkstra's Algorithm does not work with graphs that have negative weights.

Front

Which of these is a divide and conquer algorithm?

Back

Merge Sort is a divide and conquer algorithm that divides the array into halves, sorts them, and then merges them.

Front

What is good about using arrays in algorithms?

Back

Array elements can be accessed directly, allowing for efficient retrieval of data.

Front

What algorithm is used to find the shortest path in a graph?

Back

Dijkstra's Algorithm is used to find the shortest path in a graph.

Front

What is a Linked List?

Back

A Linked List is a data structure consisting of nodes, where each node contains data and a reference to the next node in the sequence.

Front

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

Back

O(1), because elements can be accessed directly using their index.

Front

What is the difference between a stack and a queue?

Back

A stack follows Last In First Out (LIFO) order, while a queue follows First In First Out (FIFO) order.

Front

What is a binary tree?

Back

A binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child.

Front

What is the purpose of a hash table?

Back

A hash table is used to implement an associative array, allowing for fast data retrieval based on keys.