Chapter 8

Question 1

Array

Answer 1

• Array – block of data where all elements are of the same type.
• The elements are accessed by indices (indexes)

Question 2

Aggregate type

Answer 2

• Aggregate type (struct/record) – block of data where different elements can have different types.
• The elements are called fields and are accessed by names.

Question 3

Lists

Answer 3

• List – collection of data whose entries are arranged sequentially.
• The beginning of a list is called head and the end is called tail.

Question 4

Stacks

Answer 4

• Stack – list in which entries are removed and inserted only at the head.
• The head of a stack is called top, and the tail is called bottom.
• Inserting an entry to a stack is called pushing, and removing an entry is called popping.
• Stack is a LIFO (last-in-first-out) structure.

Question 5

Queues

Answer 5

• Queue – list in which entries are removed only at the head and inserted only at the tail.
• Inserting an entry to a queue is called enqueuing, and removing an entry is called dequeuing.
• Queue is a FIFO (first-in-first-out) structure.

Question 6

Tree

Answer 6

• Tree – collection of data whose entries have an hierarchical organization.
• Each position in a tree is called a node, the single node at the top is called root node, and the nodes at the bottom are called leaf nodes.
• A node’s immediate descendants are called children and its immediate ascendant is called its parent.
• A child node together with its nodes below is called a subtree of the parent node.
• A tree where each node has at most two children is called a binary tree.

Question 7

Static versus dynamic data structures

Answer 7

whether the shape or size of the structure changes over time

Question 8

Pointer

Answer 8

location in memory that contains an address to some other location in memory