Fundamentals of Data Structures
- Created by: Suicidal_Kitten
- Created on: 25-04-18 11:48
Q | A | R | L | U | N | D | I | R | E | C | T | E | D | G | R | A | P | H | F | R |
Q | S | O | I | T | X | Y | H | J | Y | O | O | D | S | S | Y | J | H | O | K | M |
G | V | R | N | S | O | N | O | S | W | N | M | H | P | T | V | T | G | P | H | W |
X | P | S | E | T | P | A | W | M | P | C | L | P | M | A | L | R | D | K | N | K |
X | W | V | A | A | H | M | I | D | R | F | G | A | V | C | W | T | F | M | C | K |
F | Q | A | R | C | J | I | S | I | I | Y | G | R | O | K | V | E | X | Q | R | W |
Y | S | B | Q | K | K | C | D | R | O | C | I | G | H | O | D | P | V | U | F | C |
B | V | Y | U | U | J | D | O | E | R | I | O | D | B | V | B | U | H | E | U | K |
I | U | H | E | N | D | A | T | C | I | R | I | E | Y | E | T | N | E | V | B | H |
I | E | N | U | D | I | T | P | T | T | C | P | T | L | R | U | X | P | W | H | L |
H | L | F | E | E | P | A | R | E | Y | U | C | H | X | F | D | B | D | F | Y | S |
T | W | D | V | R | J | S | O | D | Q | L | O | G | E | L | P | J | Q | D | P | N |
R | M | H | M | F | D | T | D | G | U | A | I | I | C | O | I | J | H | S | U | G |
T | Q | R | E | L | J | R | U | R | E | R | X | E | I | W | C | Y | Y | M | R | G |
J | U | N | J | O | M | U | C | A | U | Q | E | W | Q | I | R | N | C | D | T | R |
I | A | J | P | W | D | C | T | P | E | U | O | Q | V | C | D | W | D | B | F | M |
A | C | U | G | U | G | T | D | H | K | E | D | K | F | E | U | A | V | F | P | H |
U | I | A | S | K | F | U | O | W | J | U | E | M | G | G | R | K | K | C | X | C |
N | V | H | G | N | A | R | N | W | M | E | P | A | J | K | S | X | S | Y | P | H |
Q | P | T | X | K | Y | E | E | A | Y | F | L | O | X | S | U | C | Q | E | S | Y |
O | A | J | D | D | O | K | T | C | X | C | D | Q | R | T | W | L | K | M | Y | W |
Clues
- (a,b).(c,d) = (a * c + b * d) = (a AND c XOR b AND d): Can be used to find the angle of a vector (3, 2, 3, 7, 4)
- Data values label the edges (8, 5)
- Fixed or dynamically sized queue (6, 5)
- Front and rear pointers can wrap around from the end to the start - more efficient (8, 5)
- Occurs when more items are popped from a stack thana re currently stored (5, 9)
- Occurs when more items are pushed onto a astack than can be stored (5, 8)
- Relationships work one way (8, 5)
- Relationships work two ways (10, 5)
- Some data may leave the queue out of sequence due to having a higher priority (8, 5)
- The amount of data stored and the memory allocated will vary during runtime (7, 4, 9)
Similar Computing resources:
Teacher recommended
Comments
Report