Question 1

____________ is a process that periodically runs, removing all unreferenced objects from memory.
A) System cleanup
B) Garbage collection
C) Nullification
D) Non-maskable Interrupt

Accepted Answer

Garbage collection is a process that runs periodically in managed programming languages like Java and C# that removes all unreferenced objects from memory. This process helps to optimize memory usage and prevent memory leaks. Option A is a more general term that could refer to any system cleaning process, including disk cleanup and other maintenance tasks. Option C is not a recognized term in computer science. Option D is a type of interrupt signal used in low-level computing systems and is not related to memory management.

Question 2

The ____________ is a clever algorithm that is much more efficient that the sequential search.
A) random search
B) quick sort
C) binary search
D) combinatorial search

Accepted Answer

The binary search divides the search space in half with each iteration, making it much more efficient than sequential search. Quick sort and combinatorial search are unrelated to this type of search. Random search is not more efficient, instead of it randomly searching a large search space until it comes across the desired item.

Question 3

C# provides a special loop known as the ____________, that automatically iterates once for each element in the array.
A) do-while loop
B) foreach loop
C) for loop
D) while loop

Accepted Answer

The foreach loop in C# is designed specifically for iterating through elements in an array or collection. It is a more concise and readable way to iterate through an array compared to a traditional for loop.

Question 4

Various techniques known as ____________ have been developed to locate a specific item in a larger collection of data, such as an array.
A) search engine schematics
B) search algorithms
C) database logic
D) referential protocols

Accepted Answer

Search algorithms are specifically designed methods to locate a particular item within a data collection or array efficiently. Techniques like linear search, binary search, and hash tables are all examples of search algorithms. The other options are not applicable to this scenario.

Question 5

The foreach loop is designed to work with a temporary, read-only variable known as the ____________.
A) loop variable
B) counter variable
C) iteration variable
D) foreach variable

Accepted Answer

The foreach loop uses an iteration variable that is temporary and read-only. This variable is used to represent each element in the collection or array that the loop is iterating through. The foreach loop automatically assigns the value of each element to the iteration variable on each iteration of the loop.

Question 6

To declare a two-dimensional array, two ____________ are required: The first one is for the number of rows, and the second one is for the number of columns.
A) reference variables
B) Boolean variables
C) named constants
D) size declarators

Accepted Answer

To declare a two-dimensional array, size declarators are required specifying the number of rows and columns.

Question 7

To successfully ____________ the contents of two variables, we need a third variable that can serve as a temporary storage location.
A) copy
B) swap
C) reference
D) remove

Accepted Answer

Swapping the contents of two variables involves temporarily storing the value of one variable in a third variable, then overwriting that variable with the value of the second variable, and finally, assigning the temporary value to the second variable. This process requires a temporary storage location, which is typically achieved with a third variable.

Question 8

To compare the contents of two arrays, you must compare the ____________ of the two arrays.
A) memory locations
B) reference variables
C) elements
D) size

Accepted Answer

To compare the contents of two arrays, we need to compare the elements present in both the arrays. The memory locations and reference variables may be different, but the elements should be identical in both the arrays. The size of the arrays may be different, so it cannot be the best choice for comparing the array contents.

Question 9

In C#, all arrays have a(n) ____________ that is set to the number of elements in the array.
A) Element property
B) getSize method
C) Length property
D) GetBounds method

Accepted Answer

In C#, the Length property is used to get the number of elements in an array. It is a built-in property of all arrays and returns an integer value indicating the length or size of the array. The other options are invalid in C#.

Question 10

When you call a method and pass an array as an argument, you simply pass the____________ that references the array.
A) data
B) method
C) variable
D) class

Accepted Answer

When you pass an array as an argument to a method, you are passing a reference to the memory location where the array is stored. This reference is stored in a variable, which is what is actually passed as the argument. So, the correct answer is C - variable.

Question 11

When you process a(n) ____________, you must process only the elements that contain valid items.
A) partially filled array
B) reference copy
C) sequential search
D) Boolean expression

Accepted Answer

A partially filled array contains only a subset of valid elements. Processing invalid elements in the array can lead to errors or incorrect results. Thus, when processing a partially filled array, it is important to only process the elements that contain valid items.

Question 12

____________ arrays, which are also called 2D arrays, can hold multiple sets of data.
A) Double-data
B) Two-dimensional
C) Row-column
D) Duel-derivative

Accepted Answer

Two-dimensional arrays are commonly known as matrices, which can store multiple sets of data in rows and columns.

Question 13

A(n) ____________ occurs when a loop iterates one time too many or one time too few.
A) off-by-one error
B) buffer overrun
C) system crash
D) logic error

Accepted Answer

An off-by-one error occurs when a loop iterates one time too many or one time too few. This can lead to unexpected results or even system crashes.

Question 14

When only a reference of an object is copied and not the contents of the object itself, it is called a(n) ____________.
A) shadow copy
B) memory copy
C) error copy
D) reference copy

Accepted Answer

When only a reference of an object is copied, it is called a reference copy. This means that both the original object and the copied object point to the same memory location and any changes made to one will affect the other. The other choices (shadow copy, memory copy, error copy) do not accurately describe this concept.

Question 15

The ____________ uses a loop to sequentially step through an array, starting with the first element.
A) sequential search algorithm
B) top-down algorithm
C) simple search algorithm
D) basic array traversal algorithm

Accepted Answer

The sequential search algorithm is designed to step through an array sequentially, starting with the first element, until the desired element is found or the end of the array is reached. Therefore, it is the best choice for this question. The other options do not accurately describe an algorithm that is specifically designed for array traversal.

Question 16

Because arrays are always passed ____________, a method that receives an array as an argument has access to the actual array.
A) by value
B) globally
C) in memory
D) by reference

Accepted Answer

Arrays are always passed by reference, meaning that when a method receives an array as an argument, it is actually receiving a reference to the original array in memory. This allows the method to modify the original array since it has direct access to it.

Question 17

The ____________ works like this: The smallest value in the array is located and moved to element 0. The next smallest value is located and moved to element 1. This process continues until all the elements have been placed in their proper order.
A) bubble sort
B) binary search
C) Boolean swap
D) selection sort

Accepted Answer

The description matches the process of selection sort, where the smallest element is repeatedly found and moved to the front of the array. Bubble sort also involves repeatedly swapping adjacent elements until the array is sorted, but it is not described in the given explanation. Binary search and Boolean swap are not sorting algorithms.

Question 18

Look at the following code sample:

What value will the highest variable contain when the loop finishes?
A) 1
B) 3
C) 5
D) 15

Accepted Answer

The loop iterates through the array of numbers and checks if the current number is greater than the value stored in the highest variable. If it is, the highest variable is updated to the current number. Therefore, the highest variable will contain the value 5 when the loop finishes.

Question 19

With what value should the accumulator variable be initialized to calculate the total of the values in a numeric array?
A) null
B) false
C) 0
D) -1

Accepted Answer

The accumulator variable should be initialized to 0 because it needs to start with a value that won't change the result when added to the first value in the array. Using null, false, or -1 will not work because they are not valid numerical values and will create errors in the calculation.

Question 20

____________ arrays can only hold one set of data.
A) One-dimensional
B) Two-dimensional
C) Data bound
D) Classical

Accepted Answer

One-dimensional arrays can only hold one set of data in a linear fashion, whereas two-dimensional arrays can hold multiple sets of data organized into rows and columns. Data-bound and classical are not specific types of arrays.

Quiz 7: Arrays and Lists

____________ is a process that periodically runs, removing all unreferenced objects from memory.

The ____________ is a clever algorithm that is much more efficient that the sequential search.

C# provides a special loop known as the ____________, that automatically iterates once for each element in the array.

Various techniques known as ____________ have been developed to locate a specific item in a larger collection of data, such as an array.

The foreach loop is designed to work with a temporary, read-only variable known as the ____________.

To declare a two-dimensional array, two ____________ are required: The first one is for the number of rows, and the second one is for the number of columns.

To successfully ____________ the contents of two variables, we need a third variable that can serve as a temporary storage location.

To compare the contents of two arrays, you must compare the ____________ of the two arrays.

In C#, all arrays have a(n) ____________ that is set to the number of elements in the array.

When you call a method and pass an array as an argument, you simply pass the____________ that references the array.

When you process a(n) ____________, you must process only the elements that contain valid items.

____________ arrays, which are also called 2D arrays, can hold multiple sets of data.

A(n) ____________ occurs when a loop iterates one time too many or one time too few.

When only a reference of an object is copied and not the contents of the object itself, it is called a(n) ____________.

The ____________ uses a loop to sequentially step through an array, starting with the first element.

Because arrays are always passed ____________, a method that receives an array as an argument has access to the actual array.

The ____________ works like this: The smallest value in the array is located and moved to element 0. The next smallest value is located and moved to element 1. This process continues until all the elements have been placed in their proper order.

Look at the following code sample: What value will the highest variable contain when the loop finishes?

With what value should the accumulator variable be initialized to calculate the total of the values in a numeric array?

____________ arrays can only hold one set of data.