This is the 8th week and we learn about counting steps using worst case.Basically, what it asks us to do is just counting how many times a line should run in python, which eventually has something related to the course csc108. Overall, this part is not so hard though as long as we understand the meaning of the code which is necessary to know in csc108. What's more, professor also talks a little bit about Big O. At first, I was really confused because there are too many variables in the definition. But later, after we did the prove stuff, I gradually figure out what does it mean and the definition seems pretty clear to me.
There will be a second term test next week, which mainly tests us how to prove based on what we learnt these weeks. I personally have more confidence on this test than on the previous one partly because I did very well on tutorials and the example test that was given to us is pretty easy. But still, I need to do much work to review just in case that there was any knowledge that I didn't cover before.I hope I can get a higher mark on it.
Problem solving:(counting steps)
No comments:
Post a Comment