Flashcards on Data Structures and Algorithm using C
Click on the flashcard to see the answer
What is Data Structure?
A data structure is a way of organizing and storing data such that it can be accessed and modified efficiently.
What is an algorithm?
An algorithm is a set of instructions designed to perform a specific task. It is a step-by-step procedure for solving a problem or accomplishing some end.
What is a linked list?
A linked list is a linear data structure where each element is a separate object called a node. Each node contains two fields, one field points to the next node and another field is the actual data.
What is a stack?
A stack is an abstract data type that serves as a collection of elements, with two main operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed.
What is a queue?
A queue is an abstract data type that stores an ordered sequence of elements, with two main operations: enqueue, which adds an element to the back of the queue, and dequeue, which removes the element from the front of the queue.
What is a binary search tree?
A binary search tree is a data structure that allows for efficient searching, insertion, and deletion operations on a collection of elements. Each node in a binary search tree has at most two child nodes, and the left child node is less than the parent node while the right child node is greater than the parent node.
What is a sorting algorithm?
A sorting algorithm is an algorithm that puts elements of a list in a certain order.
What are the different types of sorting algorithms?
Some of the common types of sorting algorithms are selection sort, insertion sort, bubble sort, merge sort, and quicksort.
What is the time complexity of binary search?
The time complexity of binary search is O(log n).
What is a graph?
A graph is a data structure that consists of a set of vertices (or nodes) and a set of edges that connect the vertices.
What is recursion?
Recursion is a process in which a function calls itself as a subroutine.
What is the difference between BFS and DFS?
BFS (Breadth First Search) visits nodes at the current depth before moving on to nodes at the next depth. DFS (Depth First Search) visits nodes along a single path as far as possible before backtracking.
What is hashing?
Hashing is a technique that is used to uniquely identify a specific object from a group of similar objects.
What is dynamic programming?
Dynamic programming is a method used to solve complex problems by breaking them down into smaller subproblems and solving each subproblem once. The results of each subproblem are then combined to obtain a final solution to the original problem.
What is a hash table?
A hash table is a data structure that stores a set of elements, each identified by a unique key. It uses a hash function to map the keys to indexes of an array, which allows for efficient lookup, insertion, and deletion operations.
What is Data Structure?
A data structure is a way of organizing and storing data such that it can be accessed and modified efficiently.
What is an algorithm?
An algorithm is a set of instructions designed to perform a specific task. It is a step-by-step procedure for solving a problem or accomplishing some end.
What is a linked list?
A linked list is a linear data structure where each element is a separate object called a node. Each node contains two fields, one field points to the next node and another field is the actual data.
What is a stack?
A stack is an abstract data type that serves as a collection of elements, with two main operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed.
What is a queue?
A queue is an abstract data type that stores an ordered sequence of elements, with two main operations: enqueue, which adds an element to the back of the queue, and dequeue, which removes the element from the front of the queue.
What is a binary search tree?
A binary search tree is a data structure that allows for efficient searching, insertion, and deletion operations on a collection of elements. Each node in a binary search tree has at most two child nodes, and the left child node is less than the parent node while the right child node is greater than the parent node.
What is a sorting algorithm?
A sorting algorithm is an algorithm that puts elements of a list in a certain order.
What are the different types of sorting algorithms?
Some of the common types of sorting algorithms are selection sort, insertion sort, bubble sort, merge sort, and quicksort.
What is the time complexity of binary search?
The time complexity of binary search is O(log n).
What is a graph?
A graph is a data structure that consists of a set of vertices (or nodes) and a set of edges that connect the vertices.
What is recursion?
Recursion is a process in which a function calls itself as a subroutine.
What is the difference between BFS and DFS?
BFS (Breadth First Search) visits nodes at the current depth before moving on to nodes at the next depth. DFS (Depth First Search) visits nodes along a single path as far as possible before backtracking.
What is hashing?
Hashing is a technique that is used to uniquely identify a specific object from a group of similar objects.
What is dynamic programming?
Dynamic programming is a method used to solve complex problems by breaking them down into smaller subproblems and solving each subproblem once. The results of each subproblem are then combined to obtain a final solution to the original problem.
What is a hash table?
A hash table is a data structure that stores a set of elements, each identified by a unique key. It uses a hash function to map the keys to indexes of an array, which allows for efficient lookup, insertion, and deletion operations.