Week 3
This week we covered converting infix expressions to prefix (or polish notation) and postfix (reverse polish notation) using stacks. The video tutorials we are following also explained how to evaluate the expressions using stacks but we didn't practice that ourselves. We also covered queues. The basic ideas of queues are very simple and I have been impressed with the challenges provided in the assignments.I'm excited to learn about complexity next week and really deepen my knowledge on algorithm efficiency. This is a topic that you can never have enough review of and is extremely helpful for job interviews and real-world practice.
Here is my video on the programming assignment this week:
No comments:
Post a Comment