ID | Result | Grade | L | Exercise | Percentage | Points | Passed tests? | Notes | ||

213718 | NOT PASSED | 13 | B1.1 Complexity | 90.00% | 0.9 | / 1 | y | |||

B1.2 Data structure choice | 10.00% | 0.1 | / 1 | n | ||||||

B2.1 rotate | 5.00% | 0.35 | / 7 | n | - obliterating head before traversal - previous should be initialized to None - forgot to point last to head - forgot to remove last - useless previous.set_next line | |||||

B2.2 rotaten | 0.00% | 0 | / 9 | n | no code | |||||

B3.1 sum_leaves_rec | 50.00% | 3.5 | / 7 | n | - useless check on data being None - forgot to assign recursive call to res - forgot method call parenthesis - forgot to handle case of all non-empty children | |||||

B3.2 leaves_stack | 100.00% | 8 | / 8 | y | ||||||

style bonus | 0.00% | 0 | / 1 | -- | ||||||

212104 | PASSED | 24 | B1.1 Complexity | 100.00% | 1 | / 1 | y | |||

B1.2 Data structure choice | 50.00% | 0.5 | / 1 | y | ||||||

B2.1 rotate | 100.00% | 7 | / 7 | y | - style: using None instead of pass (or return) | |||||

B2.2 rotaten | 90.00% | 8.1 | / 9 | n | - forgot to check when you don't need to rotate (k%n == 0) - style: using None instead of pass (or return) | |||||

B3.1 sum_leaves_rec | 100.00% | 7 | / 7 | y | ||||||

B3.2 leaves_stack | 0.00% | 0 | / 8 | n | - there is no stack at all !! - V commandment infringment: you shall never ever reassign self | |||||

style bonus | 0.00% | 0 | / 1 | -- | ||||||

214226 | PASSED | 29 | B1.1 Complexity | 100.00% | 1 | / 1 | y | |||

B1.2 Data structure choice | 0.00% | 0 | / 1 | -- | ||||||

B2.1 rotate | 100.00% | 7 | / 7 | y | ||||||

B2.2 rotaten | 70.00% | 6.3 | / 9 | n | + got main idea - overcomplex - wrong case splitting depending on k value - IV commandment infringement: you shall never ever reassign parameters | |||||

B3.1 sum_leaves_rec | 100.00% | 7 | / 7 | y | ||||||

B3.2 leaves_stack | 100.00% | 8 | / 8 | y | - no need for level | |||||

style bonus | 0.00% | 0 | / 1 | -- | ||||||

214924 | PASSED | 30 | B1.1 Complexity | 100.00% | 1 | / 1 | y | |||

B1.2 Data structure choice | 0.00% | 0 | / 1 | -- | ||||||

B2.1 rotate | 100.00% | 7 | / 7 | y | ||||||

B2.2 rotaten | 100.00% | 9 | / 9 | y | ||||||

B3.1 sum_leaves_rec | 100.00% | 7 | / 7 | y | ||||||

B3.2 leaves_stack | 100.00% | 8 | / 8 | y | ||||||

style bonus | 100.00% | 1 | / 1 | -- | ||||||

214561 | PASSED | 20 | B1.1 Complexity | 90.00% | 0.9 | / 1 | y | |||

B1.2 Data structure choice | 80.00% | 0.8 | / 1 | y | ||||||

B2.1 rotate | 100.00% | 7 | / 7 | y | ||||||

B2.2 rotaten | 10.00% | 0.9 | / 9 | n | - many problems, see correction | |||||

B3.1 sum_leaves_rec | 30.00% | 2.1 | / 7 | n | - had to uncomment what appeared to be ‘most correct’ code - always summing data even for internal nodes - wrong equality checking with None for left and right | |||||

B3.2 leaves_stack | 100.00% | 8 | / 8 | y | ||||||

style bonus | 0.00% | 0 | / 1 | -- | ||||||

212033 | NOT PASSED | 14 | B1.1 Complexity | 100.00% | 1 | / 1 | y | |||

B1.2 Data structure choice | 100.00% | 1 | / 1 | y | ||||||

B2.1 rotate | 50.00% | 3.5 | / 7 | n | - using self._next instead of self._head - current should arrive just before last node - forgot to handle one node case | |||||

B2.2 rotaten | 50.00% | 4.5 | / 9 | n | + main idea is there - doesn't handle empty list - doesn’t handle k%n == size case - wrong left sublist calculation - left sublist end is set one node too far | |||||

B3.1 sum_leaves_rec | 50.00% | 3.5 | / 7 | n | - forgot to assign recursive calls results to somma - forgot underscore for _right - wrong else when a child is found empty | |||||

B3.2 leaves_stack | 0.00% | 0 | / 8 | n | - exercises with stacks should always have stacks and pops !!! | |||||

style bonus | 0.00% | 0 | / 1 | -- | ||||||

214150 | NOT PASSED | 9 | B1.1 Complexity | 100.00% | 1 | / 1 | y | |||

B1.2 Data structure choice | 100.00% | 1 | / 1 | y | ||||||

B2.1 rotate | 0.00% | 0 | / 7 | n | - doesn't compile - some idea with many problems - raises ValueErrors, but text says nothing about them | |||||

B2.2 rotaten | 0.00% | 0 | / 9 | n | - no code | |||||

B3.1 sum_leaves_rec | 20.00% | 1.4 | / 7 | n | - using both underscore and parenthesis in all method calls !! - forgot to assign recursive call result to res - missing return - alwyas adds data, even on non- leaves | |||||

B3.2 leaves_stack | 70.00% | 5.6 | / 8 | n | - using both underscore and parenthesis in all method calls !! - forgot to reverse result | |||||

style bonus | 0.00% | 0 | / 1 | -- | ||||||

214050 | NOT PASSED | 15 | B1.1 Complexity | 100.00% | 1 | / 1 | y | |||

B1.2 Data structure choice | 100.00% | 1 | / 1 | y | ||||||

B2.1 rotate | 90.00% | 6.3 | / 7 | y | + it works - returning empty list for empty case - returning head node in one-element case, thus exposing private nodes. | |||||

B2.2 rotaten | 0.00% | 0 | / 9 | n | - no code | |||||

B3.1 sum_leaves_rec | 50.00% | 3.5 | / 7 | n | - doubling leaf data - forgot to reassign recursiv call result | |||||

B3.2 leaves_stack | 40.00% | 3.2 | / 8 | n | - misplaced leaf case handling - appending nodes instead of data to ret - not reversing ret | |||||

style bonus | 0.00% | 0 | / 1 | -- | ||||||

214049 | PASSED | 19 | B1.1 Complexity | 70.00% | 0.7 | / 1 | y | |||

B1.2 Data structure choice | 0.00% | 0 | / 1 | -- | ||||||

B2.1 rotate | 100.00% | 7 | / 7 | y | ||||||

B2.2 rotaten | 0.00% | 0 | / 9 | n | - 2 lines of code | |||||

B3.1 sum_leaves_rec | 40.00% | 2.8 | / 7 | n | - forgot to reassign recursive call result - forgot to check nodes exist - forgot to reset ret - forgot to reset return
| |||||

B3.2 leaves_stack | 100.00% | 8 | / 8 | y | ||||||

style bonus | 0.00% | 0 | / 1 | -- | ||||||

212106 | PASSED | 29 | B1.1 Complexity | 100.00% | 1 | / 1 | y | |||

B1.2 Data structure choice | 100.00% | 1 | / 1 | y | ||||||

B2.1 rotate | 100.00% | 7 | / 7 | y | ||||||

B2.2 rotaten | 50.00% | 4.5 | / 9 | y | + it works - O(k*n) complexity, with the double while it’s like calling .rotate() k times ! | |||||

B3.1 sum_leaves_rec | 100.00% | 7 | / 7 | y | ||||||

B3.2 leaves_stack | 100.00% | 8 | / 8 | y | ||||||

style bonus | 0.00% | 0 | / 1 | -- | ||||||