Algorithms with Selection and Repetition Practice Test

A traffic light cycles through GREEN, YELLOW, RED for a fixed number of cycles. Inputs are cycles and starting state; output is the printed sequence of states. Example input: cycles 1, start GREEN; output: GREEN, YELLOW, RED. Example input: cycles 2, start RED; output: RED, GREEN, YELLOW, RED, GREEN, YELLOW.

String state = startState;

for (int c = 0; c < cycles; c++) {

    for (int t = 0; t < 3; t++) {

        System.out.println(state);

        if (state.equals("GREEN")) state = "YELLOW";

        else if (state.equals("YELLOW")) state = "RED";

        else state = "GREEN";

    }

}

Consider the algorithm for the traffic light; what is the time complexity in terms of cycles $c$?

A traffic light simulation prints states for a total duration in seconds, changing every 5 seconds. Inputs are totalSeconds and startState; output is the printed state at each second. Example input: total 6, start GREEN; output: GREEN printed 5 times, then YELLOW once. Example input: total 5, start RED; output: RED printed 5 times.

String state = startState;

for (int s = 1; s <= totalSeconds; s++) {

    System.out.println(state);

    if (s % 5 == 0) {

        if (state.equals("GREEN")) state = "YELLOW";

        else if (state.equals("YELLOW")) state = "RED";

        else state = "GREEN";

    }

}

Consider the algorithm for the traffic light; what is the output after totalSeconds = 5, startState = GREEN?