“The process of solving a problem by reducing it to smaller
versions itself is called __________________”
“The process of solving a problem by reducing it to smaller
versions itself is called recursion”
________ - the case for which the solution is obtained directly
Base case - the case for which the solution is obtained directly
_______________ - “A definition in which something is defined
in terms of a smaller version of itself.”
Recursive definition - “A definition in which something is defined
in terms of a smaller version of itself.”
___________________ - “An algorithm that finds the solution to a
given problem by reducing the problem to smaller versions of itself”
Recursive algorithm - “An algorithm that finds the solution to a
given problem by reducing the problem to smaller versions of itself
is called recursive algorithm”
“A method that calls itself is called a __________”
recursive method
“A method is called ________________ if it calls itself”.
“A method is called directly recursive if it calls itself”.
“A methods that calls another method and eventually results in the
original method call is said to be ____________”
indirectly recursive
“A ___________ is a collection of components,called nodes. Every
node(except the last node) , contains the address of the next
node”
linked list
“Linked List is a _____________, in which elements are not
stored at a contiguous location, rather they are linked using
pointers. Linked List forms a series of connected nodes, where
each node stores the data and the address of the next node.”
linear data structure
“In a _____________, each node contains a reference to the next
node in the sequence. Traversing a singly linked list is done in a
forward direction.”
“In a singly linked list, each node contains a reference to the next
node in the sequence. Traversing a singly linked list is done in a
forward direction.”
“In a ____________, each node contains references to both the
next and previous nodes. This allows for traversal in both forward
and backward directions, but it requires additional memory for the
backward reference.”
“In a doubly linked list, each node contains references to both the
next and previous nodes. This allows for traversal in both forward
and backward directions, but it requires additional memory for the
backward reference.”
“ In a _______________, the last node points back to the head
node, creating a circular structure. It can be either singly or doubly
linked..”
“ In a circular linked list, the last node points back to the head
node, creating a circular structure. It can be either singly or doubly
linked..”
__________: Linked lists can grow or shrink dynamically, as
memory allocation is done at runtime.
Dynamic Size: Linked lists can grow or shrink dynamically, as
memory allocation is done at runtime.
________________: Adding or removing elements from a linked
list is efficient, especially for large lists.
Insertion and Deletion: Adding or removing elements from a linked
list is efficient, especially for large lists.
____________: Linked lists can be easily reorganized and modified
without requiring a contiguous block of memory.
Flexibility: Linked lists can be easily reorganized and modified
without requiring a contiguous block of memory.
_____________: Unlike arrays, linked lists do not allow direct
access to elements by index. Traversal is required to reach a
specific node.
Random Access: Unlike arrays, linked lists do not allow direct
access to elements by index. Traversal is required to reach a
specific node.
__________: Linked lists require additional memory for storing the
pointers, compared to arrays.
Extra Memory: Linked lists require additional memory for storing the
pointers, compared to arrays.
_______: It holds the actual value or data associated with the node.
Data: It holds the actual value or data associated with the node.
__________: It stores the memory address (reference) of the
next node in the sequence.
Next Pointer: It stores the memory address (reference) of the
next node in the sequence.
_____: The linked list is accessed through the head node, which
points to the first node in the list.
Head: The linked list is accessed through the head node, which
points to the first node in the list.
“A _______________ is a linked list in which every node has a
reference of the next node and a reference of the previous node.
In other words, every node(except the last node) contains the
address of the next node and every node(except the first node)
contains the address of the previous node.”
“A doubly linked list is a linked list in which every node has a
reference of the next node and a reference of the previous node.
In other words, every node(except the last node) contains the
address of the next node and every node(except the first node)
contains the address of the previous node.”
_________: The size of a doubly linked list can change dynamically,
meaning that nodes can be added or removed as needed.
Dynamic size: The size of a doubly linked list can change dynamically,
meaning that nodes can be added or removed as needed.
_____________: In a doubly linked list, each node contains pointers to
both the previous and next elements, allowing for navigation in both forward
and backward directions.
Two-way navigation: In a doubly linked list, each node contains pointers to
both the previous and next elements, allowing for navigation in both forward
and backward directions.
_____________: Each node in a doubly linked list requires memory for two
pointers (previous and next), in addition to the memory required for the data
stored in the node.
Memory overhead: Each node in a doubly linked list requires memory for two
pointers (previous and next), in addition to the memory required for the data
stored in the node.
