Welcome to CSCA48

Tutorial 0006: Monday, 2:00 PM - 3:00 PM, at MW 120.

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 002: Monday, 6:00 PM - 7: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.

Feedback

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

Week 12: July 31, 2017

• Insertion Sort

Week 11: July 24, 2017

• Recursion: Binary Search example

Week 10: July 17, 2017

• Recursion: Same string example

Week 9: July 10, 2017

• Recursion: Fibonacci example

Week 8: June 26, 2017

• Heap: Traced through the remove_max function
• A visualization of min heap can be found here

Week 7: June 19, 2017

• Deletion in Binary Search Tree

Week 6: June 12, 2017

• Linked List: Traced through 'get_last' and 'retrieve' methods from the List class

Week 5: June 5, 2017

• Doubly Linked List

Week 4: May 29, 2017

• Deque ADT
• Deque Dict ADT
• Use of Deque
• How to make representation invariant

Week 3: May 15, 2017

• Queue ADT
• Stack ADT
• Decimal to Binary

Week 2: May 8, 2017

• Memory Model
• 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.