Data Structures - Flashcards
Q: What is an array?
A: A collection of elements identified by index, with fixed size and random access.
Q: Types of Linked Lists?
A: Singly, Doubly, Circular
Q: What is a stack?
A: A LIFO data structure with push, pop, and peek operations.
Q: Types of Queues?
A: Simple, Circular, Priority, Deque
Q: What is a Binary Search Tree?
A: A binary tree with the left < root < right property.
Q: Tree traversal methods?
A: Inorder, Preorder, Postorder, Level-order
Q: Graph traversal methods?
A: DFS (Depth-First Search) and BFS (Breadth-First Search)
Q: Graph representations?
A: Adjacency Matrix and Adjacency List
Q: What is hashing?
A: A method to map data using a hash function into a hash table.
Q: What is an array?
A: A collection of elements identified by index, with fixed size and random access.
Q: Types of Linked Lists?
A: Singly, Doubly, Circular
Q: What is a stack?
A: A LIFO data structure with push, pop, and peek operations.
Q: Types of Queues?
A: Simple, Circular, Priority, Deque
Q: What is a Binary Search Tree?
A: A binary tree with the left < root < right property.
Q: Tree traversal methods?
A: Inorder, Preorder, Postorder, Level-order
Q: Graph traversal methods?
A: DFS (Depth-First Search) and BFS (Breadth-First Search)
Q: Graph representations?
A: Adjacency Matrix and Adjacency List
Q: What is hashing?
A: A method to map data using a hash function into a hash table.
