Welcome to CSCA48

Tutorial 0002: Monday, 10:00 AM - 11:00 AM, at IC 208.

TA name: Prantar Bhowmik

I will update this website on a weekly basis. All code written in class will be made available here.

There may or may not be quiz held in the tutorial so please be on time.

You can attend any practical held by any CSCA48 TA. I'll be at:

Practical 004: Wednesday, 4:00 PM - 5:00 PM, at BV 471.

Email Policy

My email address is prantar.bhowmik@mail.utoronto.ca. I will be checking my email every night. But before you email me, consider attending a practical or post the question on Piazza as you will get a much faster response there.

If you email me, use your utoronto email, any other email address will go directly to spam.

Also, in the subject write "CSCA48" to increase my chances of responding.


I always like to know how you feel about my teaching style. Feel free to leave anonymous feedback here

Week 11: March 20, 2017

Week 10: March 13, 2017

Week 9: March 5, 2017

  • Binary Search
  • Worst case runtime for Binary search: O(logn)
  • Best case runtime for Binary search: O(1)
  • Worst case runtime for Binary search: O(n)
  • Best case runtime for Binary search: O(1)

Week 8: February 27, 2017

Week 7: February 13, 2017

  • Fibonacci Sequence
  • Visualize Fib
  • Python Tutor is a good resource to use to visualize the memory model. Choose "render all objects", "use text labels for references", and Python 3.3 to look a version of the memory model we are accustomed with.

Week 6: February 6, 2017

  • Binary Search Trees
  • A visualization of BST can be found here. The only problem with this is that if two nodes are equal it picks the left child instead of the right. But otherwise I think it does a pretty good job.
  • Heaps
  • A visualization of min heap can be found here.

Week 5: January 30, 2017

Week 4: January 23, 2017

Week 3: January 16, 2017

Week 2: January 9, 2017