# Welcome to Computer Science: Data Structures!

This course is intended for any intermediate level computer science students at UNT. It will provide an overview of the four most common data structures: arrayslinked listbinary search trees, and graphs. After learning the basic theory and design of these data structures you will be quizzed test your knowledge. Getting familiar and practiced working with these data structure will help students succeed in their early and mid level computer science courses, because they will be expected to implement these structures for various programming assignments.

Good luck with the course!

## Data Structures: Arrays

### Complete the sentence using the new keywords and facts you have learned about arrays. If you get stuck it's okay to go back and review again.

1.  An array is a  collection of data that is typically stored in a  block of memory.

### Complete the sentence using the new keywords and facts you have learned about arrays. If you get stuck it's okay to go back and review again.

2.  Items in an array are called .

### Complete the sentence using the new keywords and facts you have learned about arrays. If you get stuck it's okay to go back and review again.

3.  An index can be only a .

### Complete the sentence using the new keywords and facts you have learned about arrays. If you get stuck it's okay to go back and review again.

4.  The index of an array starts counting from .

### Complete the sentence using the new keywords and facts you have learned about arrays. If you get stuck it's okay to go back and review again.

5.  A  array cannot change size once it is made.

### Complete the sentence using the new keywords and facts you have learned about arrays. If you get stuck it's okay to go back and review again.

6.  A  array can change size once it is made.

### Complete the sentence using the new keywords and facts you have learned about linked list. If you get stuck it's okay to go back and review again.

1.  Items in a linked list are called  and they are stored  in memory.

### Complete the sentence using the new keywords and facts you have learned about linked list. If you get stuck it's okay to go back and review again.

2.  Nodes store data and a  to the next node in the list.

### Complete the sentence using the new keywords and facts you have learned about linked list. If you get stuck it's okay to go back and review again.

3.  References are  in memory of data is stored.

### Complete the sentence using the new keywords and facts you have learned about linked list. If you get stuck it's okay to go back and review again.

4.  Linked list  have a fixed size.

### Complete the sentence using the new keywords and facts you have learned about linked list. If you get stuck it's okay to go back and review again.

5.  Singly linked list have  reference, while doubly linked list have .

### Complete the sentence using the new keywords and facts you have learned about linked list. If you get stuck it's okay to go back and review again.

6.  The  reference stores the address of the first node, and the  reference stores the address of the last node.

## Data Structures: Binary Search Trees

### Complete the sentence using the new keywords and facts you have learned about binary search trees. If you get stuck it's okay to go back and review again.

1.  A tree is a  data structure for storing data.

### Complete the sentence using the new keywords and facts you have learned about binary search trees. If you get stuck it's okay to go back and review again.

2.  The first node in a tree is called the  node.

### Complete the sentence using the new keywords and facts you have learned about binary search trees. If you get stuck it's okay to go back and review again.

3.  Nodes that have no child nodes associated with them are called  nodes.

### Complete the sentence using the new keywords and facts you have learned about binary search trees. If you get stuck it's okay to go back and review again.

4.  A binary search tree can no more than  child nodes branching off a parent node.

### Complete the sentence using the new keywords and facts you have learned about binary search trees. If you get stuck it's okay to go back and review again.

5.  Standard binary search trees place values less than a parent node at its  child, and values greater than a parent at its  child.

### Binary Search Tree Knowledge Check #6

#### ### Instructions 6.  Label the parts of this binary search tree using the text tiles.

• Root Node
• 8's Left Child
• 8's Right Child
• 11's Parent Node
• Leaf Node

• 5
• 7
• 9

## Data Structures: Graphs

### Complete the sentence using the new keywords and facts you have learned about graphs. If you get stuck it's okay to go back and review again.

1.  Graphs are comprised of  and  creating a web or network of connections.

### Complete the sentence using the new keywords and facts you have learned about graphs. If you get stuck it's okay to go back and review again.

2.  Edges are represented by  of a starting and ending vertex.

### Complete the sentence using the new keywords and facts you have learned about graphs. If you get stuck it's okay to go back and review again.

3.   graphs have edges that connect vertex pairs in both directions, while  graphs have edges that only connect vertex pairs in one direction.

### Complete the sentence using the new keywords and facts you have learned about graphs. If you get stuck it's okay to go back and review again.

4.  All graphs can be represented using either an adjacency  or an adjacency

### Complete the sentence using the new keywords and facts you have learned about graphs. If you get stuck it's okay to go back and review again.

5.  Adjacency matrices use the values  and  to represent if a connecting edge exist between two vertices.

### Complete the sentence using the new keywords and facts you have learned about graphs. If you get stuck it's okay to go back and review again.

6.  For adjacency matrices, the cell value of 0 means  edge exists between the two vertices and the value of 1 means  edge exist between the two vertices.