How do you get the smallest three processes by memory?

Overview

QUIZ

Pipeline logic · Question 2 of 12

Explanation

Sort all process objects by WS ascending, then select the first three.

Sorting before limiting makes the smallest WS values compete across the whole result set. Selecting first limits the candidates prematurely. WS measures working-set bytes; CPU is a different property. Keep the objects intact until the calculation is complete.

Apply the reasoning

Rank the complete input by numeric working-set bytes before selecting three results. Ascending order places the smallest values first. Preserve the process objects through both operations so the Name and WS properties remain available.

Why the other choices fail

Selecting first restricts the candidate set before ranking it — the three smallest values might not be among the first three returned. CPU represents a different measurement from working set; sorting by CPU answers a different question. Specify a secondary key such as Name if a production report needs deterministic ordering for equal memory values; this fixture has distinct values.

Inspect a sample

Review the prerequisite

practice

Primary documentation

Windows services and processes documentation