Prepping for test 2, last two weeks were just hell, pelted by midterms one after the other. This is my last midterm. So far A2 was pretty good, the last proof was pretty hard to get and we didn't have enough time to complete it so not expecting anything good on that. Since then I have gotten better at proofs and hopefully I'll do well on the test tomorrow.
Counting steps and Big O notations.... counting steps is easy enough, possibly because of my programming background, but converting them into formulas is weird; not good at math...not even addition. Learned a new notation last week in the tutorial that big E sum notation, comes in pretty handy when finding worst case for nested loops.
The proofs regarding Big O notations don't seem to be that hard, they all make sense no more mathematical voodoo to worry about, hopefully this last bit of class would be easy because I'm in familiar territory.
No comments:
Post a Comment