Term
|
Definition
| Roughly how many steps an algorithm takes to complete |
|
|
Term
|
Definition
| search one node and then all nodes connected. O(b^d) |
|
|
Term
|
Definition
graph coloring
traveling salesperson
knapsack
vertex cover
circuit satisfiability |
|
|
Term
| The"best"known"algorithms"for"the"problem"require"more"than"polynomial"time |
|
Definition
| only if it is NP complete |
|
|
Term
| Operating System Functions |
|
Definition
| interact with user; interact with application programs which want access to system resources; manage processes in a time-share or multiprogramming environment; control/interact with peripheral devices; other answers were possible |
|
|
Term
|
Definition
Source Ip
destination IP
length of packet
reconstruction info
number of hops count
error correction |
|
|
Term
|
Definition
|
|
Term
|
Definition
| path given from current working directory |
|
|
Term
| Scan method for disk scheduling |
|
Definition
| the disk head moves in and out from the center, processing disk access requests as it goes |
|
|
Term
|
Definition
| how the file system is naturally ordered |
|
|
Term
|
Definition
| Page"of"memory"retrieved"from"disk"when"process"needs"it |
|
|
Term
|
Definition
| time between process entering ready state and time exiting. they all start at 0 |
|
|
