Data types

Question 1

Define tuple

Answer 1

ordered sequence of elements that is immutable

Question 2

Define immutable

Answer 2

values within cannot be modified whilst the program is running

Question 3

Define List

Answer 3

abstract data type that describes a linear collection of data items in some order, occupying a specific position in the list

Question 4

Define static list

Answer 4

when it is full, you cannot add any more items to the list.

when it is empty, or partially full, you can be wasting memory space

Question 5

Define Linked List

Answer 5

Elements are called nodes which stores:

• data relating to the element.
• pointer to next node.
• head of the list for start node (null value when empty)
• tail pointer for end of the list if queue

Question 6

Define Doubly Linked List

Answer 6

has two pointer, to the next and previous node.

Question 7

Define Stack

Answer 7

• abstract data type that holds an ordered linear sequence of items
• pointer at the top of the stack
• LIFO

Question 8

Applications of stacks

Answer 8

• converting postfix to infix notation
• undo and redo operations
• call stack

Question 9

Operations of stacks

Answer 9

• push()
• pop()
• peek()
• is_empty()
• is_full()