Scribd
Upload
54 views4 pages

Introduction To Programming - CSE101 Assignment - 4 Rubric & Grading Sheet Demo 1

The document contains rubrics for grading two students' demonstrations of a programming assignment to create a text-based maze game in CSE101. For each demo, the rubric lists test cases to earn up to 15 points by implementing required classes, boundary checking, symbol representations, rotation functions, and playing a sample game to the goal position. Both students received full marks by passing all test cases in their demos.

Uploaded by

Devansh Gupta
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
54 views4 pages

Introduction To Programming - CSE101 Assignment - 4 Rubric & Grading Sheet Demo 1

The document contains rubrics for grading two students' demonstrations of a programming assignment to create a text-based maze game in CSE101. For each demo, the rubric lists test cases to earn up to 15 points by implementing required classes, boundary checking, symbol representations, rotation functions, and playing a sample game to the goal position. Both students received full marks by passing all test cases in their demos.

Uploaded by

Devansh Gupta
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/ 4

Introduction to Programming - CSE101

Assignment - 4
Rubric & Grading Sheet

DEMO 1

DEMO TAKEN BY DEMO GIVEN BY

STUDENT NAME: Rohan Jain STUDENT NAME: Devansh Gupta

STUDENT EMAIL ID: [email protected] STUDENT EMAIL ID: [email protected]

STUDENT ROLL NO.: 2019095 STUDENT ROLL NO.: 2019160

FINAL MARKS OBTAINED: 14

S.No. Test Case Max. Marks


Marks Obtained

1. Take ‘n’ as Input 0.5 0.5

2. Start and Goal Positions should be randomly placed, 0.5 0.5


check by running a couple times

3. There should be 4 classes. They should be defined as -


given in the Assignment. Deduct a whole mark if
there is anything wrong in a class including its
methods and data members.

a. Grid Class 1 1

b. Obstacle 1 1

c. Player 1 1

d. Reward 1 1
4. Check if the player is at the boundary, if the player 1 1
moves towards the boundary, then the player should
appear at the opposite side of the boundary. Try this
case yourself.

5. There should be different symbols for Rewards, 1 1


Obstacles, Player and goal position.

6. Test the special moves -> Rotate Clockwise and -


Rotate Anti-Clockwise:

a. Ask them to explain their code. 1 1

b. Ask them how could they use one 1 1


function for implementing the other.

c. Test one of the moves in the terminal. 1 1

7. The game should work correctly as shown in the


video
Input (in the same order):
15
R1D1L1U1
R7U2
A2R1L1C1

a. Check if the final state is correct. 3 3

b. If the player moves from pt A to pt B, the trail 1 0


should appear while it is moving and should
disappear after that.

c. Continue playing the game and reach the goal 1 1


position :)

TOTAL MARKS 15 14

REMARKS (IF ANY):


DEMO 2

DEMO TAKEN BY DEMO GIVEN BY

STUDENT NAME: Devansh Gupta STUDENT NAME: Rohan Jain

STUDENT EMAIL ID: [email protected] STUDENT EMAIL ID: [email protected]

STUDENT ROLL NO.: 2019160 STUDENT ROLL NO.: 2019095

FINAL MARKS OBTAINED: 15

S.No. Test Case Max. Marks


Marks Obtained

1. Take ‘n’ as Input 0.5 0.5

2. Start and Goal Positions should be randomly placed, 0.5 0.5


check by running a couple times

3. There should be 4 classes. They should be defined as -


given in the Assignment. Deduct a whole mark if
there is anything wrong in a class including its
methods and data members.

e. Grid Class 1 1

f. Obstacle 1 1

g. Player 1 1

h. Reward 1 1

4. Check if the player is at the boundary, if the player 1 1


moves towards the boundary, then the player should
appear at the opposite side of the boundary. Try this
case yourself.
5. There should be different symbols for Rewards, 1 1
Obstacles, Player and goal position.

6. Test the special moves -> Rotate Clockwise and -


Rotate Anti-Clockwise:

d. Ask them to explain their code. 1 1

e. Ask them how could they use one 1 1


function for implementing the other.

f. Test one of the moves in the terminal. 1 1

7. The game should work correctly as shown in the


video
Input (in the same order):
15
R1D1L1U1
R7U2
A2R1L1C1

d. Check if the final state is correct. 3 3

e. If the player moves from pt A to pt B, the trail 1 1


should appear while it is moving and should
disappear after that.

f. Continue playing the game and reach the goal 1 1


position :)

TOTAL MARKS 15 15

REMARKS (IF ANY):

You might also like