0% found this document useful (0 votes)
11 views8 pages

Minor COL 100

Minor 23-24

Uploaded by

Tanvi Mathur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views8 pages

Minor COL 100

Minor 23-24

Uploaded by

Tanvi Mathur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Minor  Graded

Student
Tanvi Mathur

Total Points
23.5 / 40 pts

Question 1
1 2 / 2 pts
+ 0 pts Incorrect or not attempted

+ 1 pt Correct logic but the return value is not list

 + 2 pts Correct function and return rational number as a list


r1 = [a1, b1] and r2 = [a2, b2]
answer [a1*b2 + a2*b1, b1*b2]

Question 2
2 Resolved 2.5 / 4 pts
− 0 pts Correct
Blank 1: ([], [], [], [], [], [], [], [], [], [], [])
Blank 2: 1
Blank 3: int(mark)
Blank 4: s[0]

Any logically same/similar answers are also accepted

 − 1.5 pts Incorrect/Unattempted 1st Blank


General Mistake - H = [] or H = () or H = ([],)

− 0.5 pts Incorrect/Unattempted 2nd Blank


General Mistake - conditional statement

− 1.5 pts Incorrect/Unattempted 3rd Blank


General Mistake - adding another loop

− 0.5 pts 3rd Blank- using mark/s[1] directly as an index

− 0.5 pts Incorrect/Unattempted 4th Blank


General Mistake - conditional statement

− 4 pts Not attempted/Incorrect

 Regrade Request Submitted on: Mar 12

For the first blank, I have mentioned H=([None]*11), which works on Python IDLE

([None]11) creates a list of 11 None values*. We wanted a tuple of 11 empty lists.


The code will produce an error trying to append in a nonetype object on line
H[int(mark)].append(s[0])
if you created a tuple of 11 lists storing None each, I would have considered that, but I
cannot give marks for what you've written

Reviewed on: Mar 18


Question 3
3 4 / 4 pts

 + 4 pts complete credit

+ 0 pts NA or wrong attempt

+ 1 pt Only few cases covered, algorithm doesn't always produce correct answer.

+ 2 pts Right idea of LCM, but Algorithm has major errors

− 1 pt Minor error in LCM or helping function (GCD) algorithm.

− 2 pts Use of non standard mathematical axioms without definition

Question 4
4 2 / 4 pts
+ 1.5 pts For the first output line:
L01 is equal to (aliased to) L02, and [1, dgt, [1,dgt]]

− 0.5 pts For the first output line correct value is not appended.

 + 2 pts For the second output line:


L01 is equal to (aliased to) L02, and the update of L1 is reflected in both as [1,dgt,[1,dgt,[1,dgt]]]

 − 0.5 pts For the second output line:


Update of L1 is not correctly reflected in L01 and L02.

 + 0.5 pts For the second output line: L1 is updated correctly: [1, dgt,[1,dgt]]

+ 0 pts Incorrect/Not Attempted

Question 5
5 3 / 5 pts
+ 5 pts (1.5 marks)Part a: 3 (1.5 marks)Part b: None or -1 or (2 if
entry number ending 0 )
Part c: NOT( x > 1AN Dy >= 1AN Dx >= y)
(2 mark)Part c: ( x <= 1ORy < 1ORx < y )

 + 3 pts Both part a & b correct , c incorrect

+ 1.5 pts only part a correct

+ 1.5 pts only part b Correct

+ 0 pts incorrect
Question 6
6 Resolved 2.5 / 4 pts
+ 4 pts All the boxes are correct(Rubriks 2,3,4 and 5 are incorporated)

 + 0.5 pts Upper Left: dgt + 1

 + 0.5 pts Upper Right: dgt

 + 1.5 pts Bottom Left: dgt + 3

+ 1.5 pts Bottom Right: (dgt + 1)2dgt

+ 0 pts Incorrect

 Regrade Request Submitted on: Mar 12

For the bottom-right blank (dgt=8), I have written 9 8 9^16 {(dgt+1)^2dgt}, since I thought
print(a, b) will be included in the final call.

If you had the correct understanding of python's interpreter executes code you would have
given the correct answer. Sorry, can't give marks.

Reviewed on: Mar 20

Question 7
7 0 / 5 pts
− 1 pt Early return can only be False if more ')' found than '(' so far.

− 1 pt Final return return is incorrect. It should be count==0

 − 5 pts All incorrect / Unattempted

− 0 pts Correct

Question 8
8 2 / 6 pts
− 0 pts Correct

− 1 pt Minor mistake in number of calls

 − 2 pts Incorrect number of calls

 − 2 pts Minor error in code completion

Note: x + s//2 != x + s - s//2

− 4 pts Code provided is completely incorrect

− 6 pts Unattempted or Incorrect


Question 9
9 5.5 / 6 pts
− 0 pts Correct

Part (i): Implementation of maxgap

− 2.5 pts Incorrect

− 1 pt Partially Correct

− 1.5 pts Part (ii) : The count is in-correct

Part (iii): Implementation of Gap

− 2 pts Incorrect

 − 0.5 pts Partially Correct - One or more overlap cases not checked

− 0.5 pts Partially correct, does not cover all the cases, excluding the overlap cases.

− 1 pt Used incorrect comparison operator for comparing tuples.

− 0.5 pts Partially Correct, did not give the definition of one or more functions.

− 6 pts Not Attempted / Incorrect

You might also like