Skills101
← All practice quizzes

Quiz: Query Processing and Optimization

5 questions · new set on every retakeNo time limitPass: 60%+10 XP on first pass

What a database does between receiving your SQL and returning rows. Parsing, relational algebra query trees, heuristic rules such as pushing selections down, join algorithms and their costs, and reading a real query plan with EXPLAIN.

Log in to take the quiz

Free account · see your score, answers and explanations, earn XP

  1. Question 1

    What is the correct order of query processing steps?

  2. Question 2

    Why does "push selections down" usually make a query faster?

  3. Question 3

    A table has 20,000 rows and the column dept has 40 distinct values. About how many rows does the optimizer estimate for dept = 'CSE'?

  4. Question 4

    What does this print?

    b_r, b_s = 200, 50
    n_r = 4000
    print(n_r * b_s + b_r, b_r * b_s + b_r)
    
  5. Question 5

    Which join algorithm can handle a condition like r.salary < s.limit?

🎯 Today’s placement challenge — 10 questions, no login. Can you score 10/10?Take today’s challenge →