Data Structures
Arrays, lists, stacks and queues, trees, heaps, hash tables and graphs.
0/112
- 1What is a data structure?Junior
- 2Why are data structures important in algorithms?Junior
- 3What are the main types of data structures?Junior
- 4Why does the choice of data structure affect an algorithm's O(n) complexity?Junior
- 5How to evaluate the efficiency of a data structure?Junior
- 6What is time complexity?Junior
- 8What does "access time" mean in a data structure?Junior
- 9What does "insertion time" mean?Junior
- 1What is an array as a data structure?Junior
- 2How does an array differ from a list?Junior
- 3How is the memory address of an array element calculated?Junior
- 4What does "contiguous placement of elements" in memory mean?Junior
- 5How does a static array differ from a dynamic array?Junior
- 6What happens when an array goes out of bounds?Junior
- 7What is the time complexity of accessing an element in an array?Junior
- 8What is the complexity of inserting into the middle of an array?Junior
- 10What is the time complexity of deleting from an array?Junior
- 11What does amortized complexity mean?Junior
- 12What is a multidimensional array?Junior
- 1What is a linked list?Junior
- 2How does a linked list differ from an array?Junior
- 3What types of linked lists exist?Junior
- 5How are nodes connected to each other in a list?Junior
- 6What is the complexity of accessing an element by index?Junior
- 7What is the complexity of inserting at the beginning of a list?Junior
- 8What is the complexity of inserting at the end of a list?Junior
- 9What is the complexity of deletion from the middle of a list?Junior
- 10Why is a linked list efficient for frequent insertions/deletions?Junior
- 11How is a linked list stored in memory?Junior
- 12What is a singly linked list (singly linked list)?Junior
- 14What is a circular linked list (circular linked list)?Junior
- 15In which tasks is it better to use a list instead of an array?Junior
- 16What is head and tail of a list?Junior
- 1What is a queue?Junior
- 2What principle underlies how a queue works?Junior
- 3What does "FIFO" mean?Junior
- 4How does a queue differ from a stack?Junior
- 5What is the time complexity of inserting into a queue?Junior
- 6What is the time complexity of removing from a queue?Junior
- 7How does implementing a queue on a linked list differ from implementing it on an array?Junior
- 8What is "element shifting" and why is it inefficient?Junior
- 10What is a double-ended queue (deque)?Junior
- 11What operations does a deque support?Junior
- 12What is a priority queue?Junior
- 13How is a queue used in BFS (breadth-first search)?Junior
- 14What tasks is a queue often used to solve?Junior
- 1What is a hash table?Junior
- 2What is the idea behind hashing?Junior
- 3How does a hash table store data?Junior
- 4What are a key and a value in a hash table?Junior
- 6Why does a hash table provide fast access to data?Junior
- 7What is a "bucket" in the context of a hash table?Junior
- 8What is a collision in a hash table? Why are they inevitable?Junior
- 9Why is a perfect hash function impossible in practice?Junior
- 10Why is it important for a hash function to be fast?Junior
- 11What does the modulo (%) operation do in hashing? How is it related to indices?Junior
- 12What is the complexity of inserting an element into a hash table?Junior
- 13What is the complexity of accessing an element in a hash table?Junior
- 14What is the complexity of removing an element from a hash table?Junior
- 16In which tasks are hash tables most effective?Junior
- 1What is a tree as a data structure?Junior
- 2What is a node (node) in a tree?Junior
- 3What is an edge (edge) in a tree?Junior
- 4What is the root of a tree (root)?Junior
- 5What is a leaf (leaf)?Junior
- 6What are a parent and a child (parent / child)?Junior
- 8What is the height of a tree (height)?Junior
- 9What is the depth of a node (depth)?Junior
- 10How are the height and depth of a tree related?Junior
- 11What is a binary tree?Junior
- 12What is a binary search tree?Junior
- 13What is tree balancing?Junior
- 14What is the time complexity of searching for a node in a binary tree?Junior
- 16What is breadth-first tree traversal (BFS)?Junior
- 17What is depth-first tree traversal (DFS)?Junior
- 18What is tree density?Junior
- 19What is an AVL tree, and what makes it balanced?Junior
- 20What is a trie (prefix tree)?Junior
- 1What is a graph?Junior
- 2What is a vertex in a graph?Junior
- 3What is an edge in a graph?Junior
- 4What does "adjacency" of vertices in a graph mean?Junior
- 6What is the size of a graph?Junior
- 7What is a directed graph?Junior
- 8What is an undirected graph?Junior
- 9What is a weighted graph?Junior
- 10What does edge weight mean?Junior
- 11What is a loop in a graph?Junior
- 12What are the ways to store graphs?Junior
- 13What is an adjacency matrix?Junior
- 14What does breadth-first search (BFS) do?Junior
- 15What does depth-first search (DFS) do?Junior
- 16What is topological sorting? For which graphs is it possible?Junior
- 18What does the Bellman-Ford algorithm do?Junior