Data structure

Question 2

Arrays

Answer 2

A data structure that stores a collection of items at contiguous memory locations.

Question 3

Array

Answer 3

Fixed size, elements accessed by index, efficient for random access.
- Example: int[] numbers = {1, 2, 3, 4, 5}

Question 4

Linked Lists

Answer 4

Definition: A data structure consisting of a sequence of elements, each pointing to the next

Question 5

Linked list

Answer 5

-Dynamic size, elements accessed sequentially, efficient for insertion/deletion.
- Types: Singly linked list, doubly linked list.

Question 6

Stack

Answer 6

• Definition: A data structure that follows the Last In, First Out (LIFO) principle.
  
  • Operations: Push (add element), Pop (remove top element), Peek (view top element).
  • Example: Function call stack.