PCAP-31-03 5.1 Build Complex Lists Using List Comprehensions PCAP-31 Practice Questions (Page 9)

Questions 41–43

1. 41application · medium

   A financial analyst has a list of stock prices. They need a list of prices that are above the average price. Which comprehension correctly computes this?

   • B[p for p in prices if p > avg]
   • C[p for p in prices if p > (sum(prices)//len(prices))]
   • D[p for p in prices if p > sum(prices)/len(prices)]
   Reveal Solution Discussion Select an answer first
2. 42application · hard

   A logistics company has a list of routes, each route is a list of cities. They need a flat list of all cities that appear in more than one route. Which approach correctly uses a nested comprehension?

   • A[city for route in routes for city in route if routes.count(city) > 1]
   • B[city for route in routes for city in set(route) if sum(city in r for r in routes) > 1]
   • C[city for route in routes for city in route if sum(city in r for r in routes) > 1]
   • D[[city for city in route if sum(city in r for r in routes) > 1] for route in routes]
   Reveal Solution Discussion Select an answer first
3. 43expert · medium

   A developer is refactoring code for performance. They have a large list of integers and need to extract those divisible by 3, then compute their factorial. Which comprehension is most efficient and correct?

   • B[math.factorial(x) for x in nums if x % 3 == 0 and x > 0]
   • C[math.factorial(x) for x in nums if x % 3 == 0]
   • D[math.factorial(x) for x in nums if x % 3 == 0 else 0 for x in nums]
   Reveal Solution Discussion Select an answer first