ID

Result

Grade

L

Exercise

Percentage

Points

Passed tests?

Notes

214047

NOT PASSED

1

A1 parse_db

0.00%

0

/ 6

n

- Completely wrong

A2 parse_proof

0.00%

0

/ 6

n

- Completely wrong

A3 top

0.00%

0

/ 6

n

- some code attempt

B1 theory

25.00%

0.5

/ 2

n

B2 plus_one

0.00%

0

/ 11

n

- does not add new nodes

- tries to set data of current leaves

B3 add_row

0.00%

0

/ 8

n

- some code attempt

213718

NOT PASSED

16

A1 parse_db

100.00%

6

/ 6

y

A2 parse_proof

10.00%

0.6

/ 6

n

- forgot return

- useless digit_clean

- useless or condition

- misses steps

- doesn’t build res list

A3 top

0.00%

0

/ 6

n

no code

B1 theory

10.00%

0.2

/ 2

--

B2 plus_one

50.00%

5.5

/ 11

n

- doesn’t update _last pointer

- doesn't handle 4,5,9,9,9 case

- does extra traversal without taking advantage of _last pointer

B3 add_row

40.00%

3.2

/ 8

n

- convoluted code

- node insertions inside while

b.t.

NOT PASSED

7

A1 parse_db

0.00%

0

/ 6

n

- some code attempt

A2 parse_proof

0.00%

0

/ 6

n

- some code attempt

A3 top

50.00%

3

/ 6

n

- doesn’t sort in decreasing order

- doesn’t print labels and sequences from dm_mm

B1 theory

0.00%

0

/ 2

--

B2 plus_one

10.00%

1.1

/ 11

n

- some code attemp, mostly wrong

- wrong last digit setting inside while

- doesn’t handle 4,5,9,9,9 case

- doesn’t handle 9,9 case

B3 add_row

30.00%

2.4

/ 8

n

- retrieve leaves without saving them

- wrong boundary condition checking

- doesn't perform node insertion at all

211506

NOT PASSED

5

A1 parse_db

40.00%

2.4

/ 6

n

- many problems, see correction

A2 parse_proof

0.00%

0

/ 6

n

some code attempt

A3 top

10.00%

0.6

/ 6

n

- only some code attempt for histogram

+ prints statements from db_mm (not sorted)

B1 theory

80.00%

1.6

/ 2

--

B2 plus_one

0.00%

0

/ 11

n

- many problems

B3 add_row

10.00%

0.8

/ 8

n

-many problems, main one being it modifies tree while discovering leaves

211663

NOT PASSED

7

A1 parse_db

60.00%

3.6

/ 6

n

- doesn't extract sequences

- swaps key and value for keywords

A2 parse_proof

0.00%

0

/ 6

n

- some code attempt

A3 top

10.00%

0.6

/ 6

n

- doesn't take labels from proof

- doesn’t sort labels

- doesn’t print statements

B1 theory

75.00%

1.5

/ 2

--

B2 plus_one

0.00%

0

/ 11

n

- some code attempt

B3 add_row

20.00%

1.6

/ 8

n

- many problems

+ insertion outside while

211515

NOT PASSED

5

A1 parse_db

10.00%

0.6

/ 6

n

-many problems, see correction

A2 parse_proof

0.00%

0

/ 6

n

- completely wrong parsing

A3 top

50.00%

3

/ 6

n

+plots the data

- wrong plot parameter

- doesn’t print statements

B1 theory

70.00%

1.4

/ 2

--

B2 plus_one

0.00%

0

/ 11

n

- many problems

B3 add_row

0.00%

0

/ 8

n

- no code

g.d.

NOT PASSED

5

A1 parse_db

20.00%

1.2

/ 6

n

- many problems, in particular, you are modifying a collection while iterating it, which brings unpredictable results !

A2 parse_proof

0.00%

0

/ 6

n

- no code

A3 top

0.00%

0

/ 6

n

- no code

B1 theory

75.00%

1.5

/ 2

--

B2 plus_one

20.00%

2.2

/ 11

n

- many problems

B3 add_row

0.00%

0

/ 8

n

- no code

211591

NOT PASSED

1

A1 parse_db

0.00%

0

/ 6

n

- some code attempt

A2 parse_proof

0.00%

0

/ 6

n

- some code attempt

A3 top

0.00%

0

/ 6

n

- some code attempt

B1 theory

50.00%

1

/ 2

--

B2 plus_one

0.00%

0

/ 11

n

- no code

B3 add_row

0.00%

0

/ 8

n

- no code

212033

PASSED

21

A1 parse_db

70.00%

4.2

/ 6

n

+ general output structure correct

- including non-labels ${ $}

- wrongly parsing some keywords

- wrongly parsing some sequences

- please avoid duplicating solutions !

A2 parse_proof

60.00%

3.6

/ 6

n

+ kind of works

- searching with ‘in’ operator which can give false positives, in general parsing should be done sequentially

- makes many suppositions about input file

- doesn’t convert step ids to integers

- please avoid duplicating solutions !

A3 top

0.00%

0

/ 6

n

- no code

B1 theory

95.00%

1.9

/ 2

--

B2 plus_one

30.00%

3.3

/ 11

n

+ handled base cases

- always takes first available node as candidate for increment

- tries to recursive call the method, this leads to O(N^2) algo

B3 add_row

95.00%

7.6

/ 8

y

- first modifies the tree, and then if there aren't enough leaves raises error: when possibile you should check for potential errors *before* modifying input

214049

PASSED

26

A1 parse_db

100.00%

5.7

/ 6

y

A2 parse_proof

95.00%

5.7

/ 6

n

- using isalpha() instead of isalnum()

A3 top

30.00%

1.8

/ 6

n

- wrong key in first counting

- double counts

- doesn’t print top statements

- doesn’t sort

B1 theory

75.00%

1.5

/ 2

--

B2 plus_one

30.00%

3.3

/ 11

n

+ correct empty case

+ correct one node case

- wrong search for node to increment

- wrong setting of zeroes

B3 add_row

95.00%

7.6

/ 8

y

- first modifies the tree, and then if there aren't enough leaves raises error: when possibile you should check for potential errors *before* modifying input