AP Computer Science Principles: Big Idea 4: Computer Systems and Networks

Original, AI-authored English practice with worked guidance. Selected topics only; independent teacher review is pending. This is not a complete syllabus, official past-paper collection or predicted exam score. SubjectScout is not affiliated with or endorsed by College Board. SAT practice is not a full adaptive test; AP practice does not simulate an entire exam.

18 original questions across 5 selected topic areas. No account or payment required to practise.

2 questions in this topic. This is a limited practice preview and is not submitted for search indexing.

Official AP framework reference (framework only, not a source of copied questions).

Topic Practice view Difficulty Search questions

0 of 18 checked · 0 correct · 2 shown

Loading saved progress

Question 8 · Big Idea 4: Computer Systems and Networks · standard

A network has bidirectional links A-B, B-D, A-C, and C-D, and no others. If link B-D fails while every other link and node works, which statement about sending data from A to D is correct?A. Delivery is impossible because every route uses B-D.B. The path A-C-D remains available, illustrating redundant paths.C. The failure guarantees zero transmission delay.D. Redundant paths require every node to connect directly to every other node.

Question 16 · Big Idea 4: Computer Systems and Networks · challenge

Task A takes 6 seconds and must finish before tasks B and C can start. B takes 4 seconds and C takes 8 seconds; B and C are independent. Each task runs on one processor and cannot be subdivided. Two identical processors are available with no overhead. What is the minimum completion time and speedup relative to running all three tasks sequentially?A. 14 seconds; speedup 9/7B. 9 seconds; speedup 2C. 8 seconds; speedup 9/4D. 18 seconds; speedup 1

All Advanced Placement subjects