L7 01 Arrays and Linked Lists

"What is an array?"

"A contiguous block of memory holding a sequence of information."

"What is a linked list?"

"A data structure consisting of individually allocated blocks of memory, each holding data and a pointer to the next block."

"What is the time complexity for accessing an element in an array?"

"Constant time, O(1)."

"What is the time complexity for accessing an element in a linked list?"

"Linear time, O(n)."

"What is the main advantage of using an array?"

"Easy indexing and retrieval of elements."

"What is the main disadvantage of using an array?"

"Inefficient inserts and deletes in the middle of the sequence."

"What is a doubly linked list?"

"A linked list where each element points to both the next and previous elements."

"What is the time complexity for inserting an element in a linked list?"

"Constant time, O(1), once the position is found."

"What is the time complexity for deleting an element in an array?"

"Linear time, O(n), due to shifting elements."

"What is the time complexity for deleting an element in a linked list?"

"Constant time, O(1), once the position is found."

"What is memory allocation?"

"The process of reserving a block of memory for use in a program."

"What is the time complexity for memory allocation?"

"Assumed to be constant time, O(1), for simplicity."

"What is the Achilles heel of arrays?"

"Inefficient inserts and deletes in the middle of the array."

"What is the trade-off when using linked lists?"

"Slow access time versus efficient insertions and deletions."

"What is a stack?"

"A data structure that allows adding and removing elements only from one end."

"What is a queue?"

"A data structure that allows adding elements at one end and removing them from the other."