Data Structures 2

Question 1

Which type of operation is represented in the pseudocode?
int x,y,z;
x=y=z=100;

Answer 1

Assignment

Question 2

What is the most efficient data type to use for this data set of a fixed size in Java?
a = [0, 0, 1, 4, 7, 16, 31, 64, 127]

Answer 2

Array

Question 3

Which data type is appropriate for this array to store the given data?
a = [“AF”, “71”, “BC”, “157”, “BA”, “253”]

Answer 3

String

Question 4

Which data type is appropriate for the given data set?
a = [1, 717, 23, 12, 314, 6]

Answer 4

Int

Question 5

Which data type should be used for this object?
days = { “Sunday”, “Monday”, “Tuesday”, “Wednesday”, “Thursday”, “Friday”, “Saturday”}

Answer 5

String

Question 6

Which data type should be used for this variable?
phoneNum = “212-555-1212”

Answer 6

String

Question 7

What is true about garbage collection?

Answer 7

It reclaims memory from data structures implemented using linked allocations.

Question 8

What is true about a data structure implemented using linked allocation?

Answer 8

Storage is allocated using pointers to new locations as needed.

Question 9

What are the array elements corresponding to the mid-values in the first and second iterations of a binary search in an array arr = {45, 77, 89, 90, 94, 99, 100} and key = 100?

Answer 9

90 and 99

Question 10

What is the effect on the object Computing regarding garbage collection?
Computing obj = new Computing(); obj = null;

Answer 10

It is automatically available for garbage collection.