Choosing the right data structure in Intro to Computing - Draw & Build Visually

Draw This - beginner

Draw a flowchart to help decide which data structure to use for storing a collection of items based on these questions: 1. Do you need to keep the items in order? 2. Do you need to access items by position quickly? 3. Do you need to add or remove items often? 4. Do you need to find items by a key or name? Use the answers to guide to one of these data structures: Array, Linked List, Hash Table, or Tree.

10 minutes

Hint 1

Hint 2

Hint 3

Hint 4

Grading Criteria

Start and End symbols present

Decision diamonds used for yes/no questions

Flow follows logical order of questions

Each decision leads to a correct data structure

Data structures named correctly in terminal boxes

Solution

  +-----------------------------+
  |          Start              |
  +-----------------------------+
                |
                v
  +-----------------------------+
  | Need to keep items in order?|
  +-----------------------------+
              Yes      No
               |        |
               v        v
  +-----------------------+  +-----------------------------+
  | Need fast access by   |  | Need to find items by key?  |
  | position?             |  +-----------------------------+
  +-----------------------+           Yes     No
              Yes      No                 |       |
               |        |                 v       v
               v        v        +---------------+  +----------+
         +----------+  +----------+  | Hash Table  |  | Tree    |
         +----------+  +----------+  +---------------+  +----------+
         |  Array   |  |Linked List|

This flowchart helps decide the best data structure based on your needs.

1. Start by asking if you need to keep items in order. If yes, go to step 2; if no, go to step 4.
2. If you need order, ask if you need fast access by position. If yes, use an Array because it stores items in order and allows quick access by index.
3. If you don't need fast access by position but still want order and frequent adding/removing, a Linked List is better.
4. If you don't need order, ask if you need to find items by a key or name. If yes, use a Hash Table for fast key-based lookup.
5. If no key-based lookup is needed but you want sorted data and fast search, use a Tree.

This step-by-step decision helps pick the right data structure for your problem.

Variations - 2 Challenges

[intermediate] Draw a flowchart to choose between Array, Linked List, Stack, and Queue based on whether you need order, fast access, or last-in-first-out behavior.

[advanced] Draw a detailed flowchart to select the best data structure among Array, Linked List, Hash Table, Tree, Stack, and Queue considering order, access speed, insertion/deletion frequency, and search by key.