post term test 2

wooot 100 on term test two

hopefully my TA reads this before marking my assignment. it seems that looking over my code after looking at the report.txt generated on markus, i came to a conclusion

1. e should have been RegexTreeNode('e', []), rather than RegexTreeNode(' ', []). we're failing most of our tests because its complaining that its not exactly right.

2. our code processes the tree perfectly otherwise, except for one mishap: we didn't process the final outer brackets. so a regex statement like '(1|0).(1|0)' would be processed completely fine, but '((1|0).(1|0))' would not, because the outermost bracket would screw up the code. this is really disappointing because the code works fine otherwise, and its literally one line of code that fixes that problem, but we might lose a lot of marks because "the process doesn't work"

finally, some odds and ends in terms of processing the regex_match. for example, i thought e was a space, not an empty string, and some confusion on what starnode was and what it meant.

hopefully assignment 2 isn't that bad. our code works except for the two huge points mentioned above, which are killer.

test 2

the only thing that i find difficult about test 2 is big O notation, and how searching and sorting trees and lists have different times based on algorithm efficiency.other than that, binary trees and everything related to them are pretty self-explanatory. Danny did a really really good job of describing trees in detail and doing examples.

there wasn't an exercise, so nothing to comment on there.

assignment 2 was just handed in. hopefully all the test cases will be rational ones, not silly extreme examples, like 1********************* or 1|1******************************.

almost assignment 2 due date slog

i got a cherry blue mechanical keyboard over the weekend. its amazing. i will never go back to membrane keyboards ever :D.

finished up assignment 2 over the weekend. added in docstrings, changes variable names from temp1 temp2 and temp3 into something more descriptive. and overall just brushing up pep8 and style, because we initially went in hoping to just get it to work. now that it works, its all about style and making sure that our code is clear enough to whoever is reading it.

exercise 6 was similar to 5. new concepts, and some deciphering needed, along with a good knowledge base in how binary trees are built. the lab this week was challenging, especially the last bonus question. the first 2 were surprisingly a breeze, but the final question was really challenging. we were close, but we couldn't finish it in time.

also i gave my test to Danny to remark because I lost three marks for not having a test case that showed that the FunctionalList remained unchanged, when I clearly had one. how long does a remark take? I gave it back to him the tuesday after getting our tests back, and haven't heard about it since. I WANT MY MARKS YO.