The answer is A, or Locating bottlenecks in a network.
Answer:
Option 1: May crash at runtime because it can input more elements than the array can hold
Explanation:
Given the code as follows:
- int[] a = {1, 3, 7, 0, 0, 0};
- int size = 3, capacity = 6;
- int value = cin.nextInt();
- while (value > 0)
- {
- a[size] = value;
- size++;
- value = cin.nextInt();
- }
From the code above, we know the <em>a</em> is an array with six elements (Line 1). Since the array has been initialized with six elements, the capacity of the array cannot be altered in later stage.
However, a while loop is created to keep prompting for user input an integer and overwrite the value in the array started from index 3 (Line 4- 9). In every round of loop, the index is incremented by 1 (Line 7). If the user input for variable <em>value</em> is always above zero, the while loop will persist. This may reach a point where the index value is out of bound and crash the program. Please note the maximum index value for the array is supposedly be 5.
Answer:
- Scrape or remove food bits from the surface.
- Wash the surface.
- Rinse the surface.
-
Sanitize the surface.
- Allow the surface to air-dry.
Explanation: These are steps for cleaning and sanitizing.
Answer:
two
Explanation:
A linked list is a data structure which stores the multiple-element with data type
and a pointer that stores the address of the next element.
A linked list is a series of nodes connecting each other by a pointer.
a node contains data and a pointer.
For build an array, two pointers are used:
the first pointer for specifies the starting node called head node.
and the second pointer is used to connect the other node to build the linked list.
Both are used to build the array if we lose the head node we cannot apply the operation because we do not know the starting node and we cannot traverse the whole linked list.
for example:
1->2->3->4->5
here, 1 is the head node and -> denote the link which makes by the second pointer.
