Code TracingFoundational
What value is returned? sum = 0 for n in [2, 4, 6]: sum = sum + n return sum
A.6
B.10
C.12
D.24
The loop adds 2 + 4 + 6, which equals 12.
Foundational Coding Test
Assess entry-level programming fundamentals, basic logic and readiness for a junior technical role.
45 minEasy20 questions15 sections
Programming basicsLogic buildingSyntax fundamentalsProblem-solving
Topics covered
Code TracingData StructuresComplexitySearchingDebuggingFunctionsBoolean LogicTestingError HandlingCode QualityVersion ControlAlgorithm ExplanationTest DesignRefactoringPerformance Reasoning
Sample questions
A preview from the supplied content for this template. Use it as a reference when building your test.
Data StructuresFoundational
Which structure is most appropriate for an undo history?
A.Queue
B.Stack
C.Set
D.Graph
Undo normally removes the most recently added action first.
ComplexityFoundational
A function compares every item with every other item using two nested loops over n items. What is the likely time complexity?
A.O(1)
B.O(log n)
C.O(n)
D.O(n²)
The inner operation can run approximately n × n times.
SearchingFoundational
What must normally be true before binary search can be used correctly?
A.The collection is sorted
B.The collection contains no duplicates
C.The collection is a queue
D.The values are strings
Binary search relies on ordered data to discard half the search space.
The supplied content includes 16 more questions.
Use Foundational Coding Test as your starting point.
Review this preview, then create a test that matches your candidates, employees or learners.
Use This Template