DATA STRUCTURES 2 EXAM
QUESTIONS AND ANSWERS
Array - Correct Answers -An ordered group of times, each of the same data type.
Number of items fixed in size. Each item is identified by a subscript
Binary Search - Correct Answers -A search on an ordered list where the middle term is
inspected, if it does not match half the list is discarded. This process is then repeated.
Binary Sort Tree - Correct Answers -A binary tree where all the values in the left subtree
of any node are smaller than the value in the previous node AND all the values in the
right subtree of any node are larger than the value in the previous node.
Binary Tree - Correct Answers -A tree where no node has more than 2 children
Branch - Correct Answers -A path joining parts of a tree
Bubble Sort - Correct Answers -A simple sort routine that compares successive values,
exchanging them if necessary. Repeating the process until the values are sorted.
Child - Correct Answers -Nodes in a tree connected to and immediately below a given
node
Record - Correct Answers -A data structure that holds a number of related values
(possibly of different data types), normally about one object.
Root - Correct Answers -The very top of a tree
Static Data Strcuture - Correct Answers -A data structure that is fixed in size. e.g. Array
Subtree - Correct Answers -From any node the branches beneath it form a tree, since
they have a tree structure and are part of a larger tree they are called sub trees
(essentially - picking a new root)
Data Structure - Correct Answers -A group of related data items that can be referred to
individually or all together
Dynamic Data Structure - Correct Answers -A data structure that expands and contracts
as data is added or removed
QUESTIONS AND ANSWERS
Array - Correct Answers -An ordered group of times, each of the same data type.
Number of items fixed in size. Each item is identified by a subscript
Binary Search - Correct Answers -A search on an ordered list where the middle term is
inspected, if it does not match half the list is discarded. This process is then repeated.
Binary Sort Tree - Correct Answers -A binary tree where all the values in the left subtree
of any node are smaller than the value in the previous node AND all the values in the
right subtree of any node are larger than the value in the previous node.
Binary Tree - Correct Answers -A tree where no node has more than 2 children
Branch - Correct Answers -A path joining parts of a tree
Bubble Sort - Correct Answers -A simple sort routine that compares successive values,
exchanging them if necessary. Repeating the process until the values are sorted.
Child - Correct Answers -Nodes in a tree connected to and immediately below a given
node
Record - Correct Answers -A data structure that holds a number of related values
(possibly of different data types), normally about one object.
Root - Correct Answers -The very top of a tree
Static Data Strcuture - Correct Answers -A data structure that is fixed in size. e.g. Array
Subtree - Correct Answers -From any node the branches beneath it form a tree, since
they have a tree structure and are part of a larger tree they are called sub trees
(essentially - picking a new root)
Data Structure - Correct Answers -A group of related data items that can be referred to
individually or all together
Dynamic Data Structure - Correct Answers -A data structure that expands and contracts
as data is added or removed
