6.2.3 Utilizing data structures:

• Why are data structures essential in programming?

  Organizing and managing data
• Choosing the right data structure can optimize data manipulation and calculations.


  True
• Linked lists allow dynamic resizing
• Stacks are ideal for backtracking algorithms.


  True
• For what type of applications are stacks commonly used?

  Undo functions
• How are elements in an array accessed?

  By their index
• Steps for performing array operations in Python:

  1️⃣ Array creation

  2️⃣ Accessing an element

  3️⃣ Inserting an element

  4️⃣ Deleting an element
• What is the starting index for accessing elements in an array?

  0
• What is one key benefit of using data structures in programming?

  Improved performance
• What is the primary characteristic of arrays?

  Fixed size
• Arrays are accessed using their index
• What does the acronym LIFO stand for in the context of stacks?

  Last-In-First-Out
• How are elements in an array accessed?

  Using their index
• Match the linked list operation with its description:

  Insertion ↔️ Adding a new node to the list

  Traversal ↔️ Iterating through the nodes
• A stack is a data structure that operates on a LIFO basis.
• Stacks use a Last-In-First-Out (LIFO) principle.

  True
• The "Pop" operation in a stack removes and returns the top element.
• What does the "isEmpty" operation check in a stack?

  If the stack is empty
• Data structures allow for effective storage and retrieval, reducing the time it takes to access data
• What is an array in terms of data structures?

  A collection of elements
• What principle do stacks operate on?

  Last-In-First-Out (LIFO)
• Arrays are useful for storing a fixed number of items
• Linked lists use nodes that point to the next node in the sequence.

  True
• Stacks operate on a Last-In-First-Out (LIFO) basis
• Arrays require a fixed size at creation.


  True
• Arrays require a fixed size
• Data structures facilitate quick data retrieval and storage.


  True
• Linked lists allow for dynamic resizing.


  True
• Arrays require a fixed size
• Linked lists allow for dynamic resizing.

  True
• What principle does a stack operate on?

  LIFO
• What does the "Push" operation do in a stack?

  Adds an element
• The "Peek" operation modifies the stack by removing the top element.

  False
• Example stack operations with [1, 2, 3] as initial elements

  1️⃣ Pushing 4 results in [1, 2, 3, 4]

  2️⃣ Popping removes 4, leaving [1, 2, 3]
• Data structures are essential for organizing and managing data efficiently.
• Match the common data structure with its example use:

  Array ↔️ Storing a list of student names

  Queue ↔️ Managing tasks in sequence

  Dictionary ↔️ Storing key-value pairs
• What allows linked lists to dynamically resize?

  Each node points to the next
• What data structure stores key-value pairs?

  Dictionaries
• The "Access" operation in arrays retrieves an element using its index.


  True
• What is the primary purpose of the 'Creation' operation in arrays?

  Initialize array with size