🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← All topics

Quiz: Python Interview Programs: questions with answers

13 questions, each with the answer and a short explanation.

Take the timed quiz + get a certificate →
  1. Q1. What does reversenumber(1200) (from this lesson) return?
  2. Q2. Why does the prime check loop only while i i <= n?
  3. Q3. What does this print? (code)
  4. Q4. What is the time complexity of binary search?
  5. Q5. In FizzBuzz, what goes wrong if you check i % 3 == 0 before i % 15 == 0?
  6. Q6. What does this print? (code)
  7. Q7. What does this print? (code)
  8. Q8. What does this print? (code)
  9. Q9. What does this print? (code)
  10. Q10. What does this print? (code)
  11. Q11. What does this print? (code)
  12. Q12. Binary search needs at most how many comparisons for a sorted list of 1,000 items?
  13. Q13. What does this print? (code)