Skip to content

Course home

Programming concepts

Programming concepts

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
Question 40

Refer to the following Python function designed to find the prime factors of an integer nnn:

def prime_factorize(n):
    factors = []
    temp = n
    for d in range(2, n):
        while temp % d == 0:
            factors.append(d)
            temp = temp // d
    return factors

Which option correctly describes the loop structure demonstrated in this function?

A

Definite iteration nested inside indefinite iteration

B

Nested definite iterations

C

Indefinite iteration nested inside definite iteration

D

Nested indefinite iterations

Markscheme

Programming concepts Questions

  1. GCSE
  2. /Computer Science
  3. /Programming concepts

298 exam-style questions on AQA GCSE Computer Science Programming concepts. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank