question stringlengths 21 87 | answer stringlengths 95 217 |
|---|---|
What is a data structure? | A data structure is a way of organizing and storing data so that it can be accessed and worked with efficiently. |
What are the types of data structures? | Data structures are broadly classified into two types: Linear data structures (e.g., Arrays, Linked Lists, Stacks, Queues) and Non-linear data structures (e.g., Trees, Graphs). |
What is the difference between an array and a linked list? | An array is a collection of elements stored in contiguous memory locations, while a linked list is a collection of nodes where each node contains data and a pointer to the next node. |
What is a stack, and where is it used? | A stack is a linear data structure that follows the Last In, First Out (LIFO) principle. It is used in function calls, undo mechanisms in text editors, and expression evaluation. |
What is a queue, and how is it different from a stack? | A queue is a linear data structure that follows the First In, First Out (FIFO) principle, unlike a stack which follows LIFO. Queues are used in scheduling, resource management, and breadth-first search. |
What is a binary tree? | A binary tree is a tree data structure where each node has at most two children, referred to as the left child and the right child. |
What is the difference between a binary tree and a binary search tree? | A binary tree is a general structure, while a binary search tree (BST) is a type of binary tree where the left child contains values smaller than the parent, and the right child contains values larger than the parent. |
What is a hash table? | A hash table is a data structure that maps keys to values using a hash function. It is commonly used for efficient lookups, insertions, and deletions. |
What is a graph, and what are its types? | A graph is a non-linear data structure consisting of nodes (vertices) and edges. Types of graphs include directed, undirected, weighted, unweighted, cyclic, and acyclic graphs. |
What is a linked list? | A linked list is a linear data structure consisting of nodes, where each node contains data and a reference (or pointer) to the next node in the sequence. |
What is a doubly linked list? | A doubly linked list is a type of linked list where each node contains a pointer to both its next and previous nodes, allowing traversal in both directions. |
What is the difference between depth-first search (DFS) and breadth-first search (BFS)? | DFS explores as far down a branch as possible before backtracking, while BFS explores all neighbors at the current depth before moving to the next level. |
What is the time complexity of searching in a binary search tree (BST)? | The time complexity of searching in a BST is O(log n) in the best and average cases, but it can degrade to O(n) in the worst case if the tree becomes unbalanced. |
What is a priority queue? | A priority queue is an abstract data structure where each element is assigned a priority, and elements with higher priority are dequeued before elements with lower priority. |
What is a heap data structure? | A heap is a specialized tree-based data structure that satisfies the heap property: in a max-heap, the parent node is greater than or equal to its children, and in a min-heap, it is less than or equal to its children. |
What is the difference between a stack and a heap? | A stack is used for static memory allocation and follows LIFO, while a heap is used for dynamic memory allocation and allows flexible memory management. |
What is the purpose of a hash function in a hash table? | A hash function maps keys to indices in a hash table, enabling efficient retrieval of values associated with the keys. |
What are the operations supported by a queue? | A queue supports enqueue (inserting an element), dequeue (removing an element), peek (viewing the front element), and isEmpty (checking if the queue is empty). |
What is a circular queue? | A circular queue is a type of queue where the last position is connected back to the first, forming a circle. It efficiently uses memory by reusing vacant spaces. |
What is the time complexity of inserting an element in a hash table? | The average time complexity is O(1), but in the worst case (due to collisions), it can be O(n). |
- Downloads last month
- 16