Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
Compsci #8
From 9.1 [data abstraction]
| Term | Definition |
|---|---|
| Array | A block of data whose entries are of the same type. A 2D array consists of rows and columns. Indices are used to identify positions |
| List | Collection of data whose entries are arranged sequentially. Head is the beginning of the list, Tail is the end of the list |
| Stack | A list where entries are removed and inserted only at the head. LIFO - Last in, First out. Pop - To remove the entry at the top. Push - To insert an entry at the top |
| Queue | A list in which entries are removed at the head and are inserted at the tail. FIFO - First in, First out |
| Tree | A collection of data whose entries have a hierarchical organization |
| Binary tree | Tree in which every node has at most two children |
| Nodes | Entry in a tree. Root node - node at the top. Terminal or Leaf node - node at the bottom |
| Depth | The number of nodes in the longest path from root to leaf |
| Abstraction | Shield users (application software) from details of actual data storage |
| Pointer | A storage area that contains the address where data is stored |
| Static structure | Fixed size and structure at compile time |
| Dynamic structure | Can change size during runtime |
Created by:
jolly_n4
Popular Computers sets