Exercise 1

Question 1

What is physical memory usually represented as?

Answer 1

An array of bytes

Question 2

Which data structure best represents the chess board?

Answer 2

Array

Question 3

Which data structure best stores printing job in printers?

Answer 3

Queue

Question 4

What are we advocating as software engineering process model in CSD2181/2183?

Answer 4

Test-Driven Development

Question 5

IF speed is important to me when randomly picking an item from a collection, which implementation should I use?

Answer 5

Array

Question 6

How do we exploit the locality of reference principle when we design code (multiple answers)?

Answer 6

1. Keep subsequent data accessed close to each other in memory.
2. Allocate and self-manage contiguous memory of our program.
3. If the same data is accessed frequently, keep it in a cache that has high-speed access but smaller storage.

Question 7

In a binary buddy sytem, what happens when a request is made and its size is less than the initial block but greater than half of it?

Answer 7

The entire block is allocated.

Question 8

If the total size of free blocks is larger than the size of requested memory, then there will be no “out of memory” error.

Answer 8

False.

Question 9

Which of the following best reduces internal fragmentation?

Answer 9

Use variable block sizes