Question

Please Help ASAP.

1Consider the below code which iterates over a linked list of n nodes (assume the list has at least 1 node). How many lines of output will it write?

Node *thisNode = headPtr;
while (thisNode != null) {
    cout << thisNode->item << endl;
    thisNode = thisNode->next;
}

1.n

2.1

3.n²

4.n / 2

5.2 * n

2The below algorithm contains nested loops.  

for (int total = 1; total <= n; total++) {
    for (int samples = 0; samples < n; samples++) {
        for (int location = 1; location < n; location++) {
            ...
        }
    }
}

This algorithm has __________ complexity.

Group of answer choices

1.O(n log n)

2.O(1)

3.O(n)

4.O(n²)

5.O(n³)

3Consider an algorithm that requires the following number of operations (time units) for these input sizes (n). The algorithm is ___________ .

Input size	Operations
100	20,000
400	320,000
1600	5,120,000

Group of answer choices

1.O(n log n)

2.O(2ⁿ)

3.O(n²)

4.O(n)

5.O(n³)

Answer 1

1 n

Node *thisNode = headPtr;
while (thisNode != null) {
    cout << thisNode->item << endl;
    thisNode = thisNode->next;
}

this is code for traversing the node and printing the each node date so if there are n node then it will print each node data so it will execute O(n)

2  O(n³)

3 3.O(n²)

explanation :-

for this input size and operation the recurrence relation is

T(n) = 2 n²