Data Structures

Question 1

Data Structure

Answer 1

Definition: A way of organizing and storing data so that it can be accessed and modified efficiently.
Examples: Arrays, Linked Lists, Stacks, Queues, Trees, Graphs, Hash Tables.

Question 2

Node

Answer 2

Definition: A basic unit of a data structure, such as a linked list or tree, that contains data and references to other nodes.
Components: Data (value stored), Pointer(s) (reference to the next node or child nodes)

Question 3

Pointer/Reference

Answer 3

Definition: A variable that holds the memory address of another variable, often used in dynamic data structures like linked lists and trees.
Purpose: To connect nodes or elements within a data structure.

Question 4

Linear Data Structures

Answer 4

Definition: Data structures where elements are arranged in a sequential manner.
Examples: Arrays, Linked Lists, Stacks, Queues.

Question 5

Non-Linear Data Structures

Answer 5

Definition: Data structures where elements are arranged in a hierarchical manner and are not in sequence.
Examples: Trees, Graphs.

Question 6

Dynamic Data Structures

Answer 6

Definition: Data structures that can change in size during runtime, allowing for more flexible memory usage.
Examples: Linked Lists, Trees, Graphs.

Question 7

Abstract Data Type (ADT)

Answer 7

Definition: A model for data structures that defines the data type independently of its implementation.
Examples: Stack, Queue, List, Set.