Free Practice Quiz Question List

12 — Foundations Capstone Online Quiz Questions

Use this free practice quiz with 20 questions to review 12 — Foundations Capstone, test your knowledge, and prepare for your next test or exam.

20 questions
01
Choose one
1 point

A community-resource navigator must model roads connecting locations so that it can reason about routes between them. Which data structure is the most appropriate representation for those relationships?

  1. A

    A list, because every collection should be processed sequentially

  2. B

    A set, because graph data must always contain unique values

  3. C

    A graph, because the resources or locations are connected by relationships

  4. D

    A stack, because graph algorithms always process the newest item first

02
True or false
1 point

True or false: In a resource record, storing an unknown capacity as 0 is potentially misleading because 0 means that the resource has no capacity.

  1. A

    True

  2. B

    False

03
Written response
1 point

Which data structure should a capstone use when records must be retrieved by a key such as an identification number? Enter the data-structure name in words.

04
Fill in the blank
1 point

Complete the architecture description: The reads and validates records.

05
Choose one
1 point

Which activity is best classified as a unit test for the resource navigator?

  1. A

    Testing the complete application through its user interface

  2. B

    Testing one filtering function with available and unavailable records

  3. C

    Testing whether multiple modules work together after loading a file

  4. D

    Testing whether users understand the system's ethical trade-offs

06
True or false
1 point

True or false: A test suite alone can prove that an algorithm will not fail on any untested input within its defined domain.

  1. A

    True

  2. B

    False

07
Choose all
1 point

Select all situations that should be included as edge-case tests for the resource navigator.

  1. A

    An empty input collection

  2. B

    A typical collection containing several valid matching records

  3. C

    Two resources with tied distances

  4. D

    A record with invalid coordinates

08
Written response
1 point

What proof concept can state that, after each iteration of the filtering loop, the results collected so far are exactly the eligible records processed so far? Enter the concept in words.

09
Fill in the blank
1 point

Complete the complexity analysis for filtering and ranking: scanning n records takes time, and sorting m matching records takes time.

10
Choose all
1 point

Select all areas that belong in an ethical evaluation of a community-resource navigator.

  1. A

    Whether collected personal data is necessary and protected

  2. B

    Whether the system works for people with disabilities and underserved communities

  3. C

    Whether the implementation uses the most complex available algorithm

  4. D

    Whether users can understand uncertainty and challenge or correct outputs

11
Choose one
1 point

A team expects its resource dataset to grow but has not yet measured a performance problem. According to the recommended capstone process, which approach should it use before optimizing?

  1. A

    Begin with the most sophisticated spatial structure available

  2. B

    Build the simplest correct solution before optimizing

  3. C

    Optimize before defining the problem so performance targets guide the specification

  4. D

    Replace testing with complexity analysis once the baseline is implemented

12
Open ended
1 point

Explain how a strong computer science capstone connects problem definition, representation, program design, algorithms, complexity analysis, correctness, testing, ethical evaluation, and communication. Give concrete examples of how decisions in one area affect another.

13
Choose one
1 point

The filtering-and-ranking procedure has time complexity O(n + m log m), where m is the number of matches and m ≤ n. What is its worst-case time complexity when every record matches?

  1. A

    O(1)

  2. B

    O(n)

  3. C

    O(n log n)

  4. D

    O(log n)

14
Choose one
1 point

A community-resource system does not know the capacity of some shelters. Which representation best preserves the meaning of the data?

  1. A

    Store unknown capacity as 0

  2. B

    Omit the capacity field from every record

  3. C

    Represent the capacity explicitly as unknown

  4. D

    Replace unknown capacity with the average capacity

15
True or false
1 point

True or false: A sufficiently large test suite alone proves that an algorithm is correct for every input in its defined domain.

  1. A

    True

  2. B

    False

16
Choose one
1 point

Which design best supports maintainability and testing in the community-resource navigator?

  1. A

    One function reads files, filters records, prints results, and changes global state

  2. B

    Separate functions or layers handle input validation, data storage, algorithmic work, output, and evaluation

  3. C

    Put all records and algorithms in the user-interface layer

  4. D

    Use a single global procedure so that every component shares state

17
Written response
1 point

Which data structure is most appropriate when a capstone component primarily needs to track whether an item is a member and prevent duplicates?

18
Choose one
1 point

Which statement is a suitable loop invariant for the resource navigator’s filtering loop?

  1. A

    After processing the first k records, the list contains exactly the eligible records among those k records, paired with their distances

  2. B

    After processing the first k records, the list contains every input record, whether eligible or not

  3. C

    After processing the first k records, the list is already sorted by final distance

  4. D

    After processing the first k records, the list contains only the single closest resource overall

19
Written response
1 point

What type of test should be added when a newly discovered defect has been reproduced and corrected, so that the defect does not return in a later revision?

20
Choose one
1 point

A resource navigator scans n records, computes distances for the m matching records, and sorts those m records. Assuming distance computation is constant time, what is the procedure’s approximate time complexity?

  1. A

    O(m)

  2. B

    O(nm)

  3. C

    O(n + m log m)

  4. D

    O(log n + m)