461 hw4

pdf

School

Pennsylvania State University *

*We aren’t endorsed by this school

Course

461

Subject

Computer Science

Date

Apr 3, 2024

Type

pdf

Pages

16

Uploaded by GrandWaterBuffalo3975

Report
Graded Assignment #4- Function and Parameter Passing Student Mayank Singh Total Points 36.5 / 50 pts Question 1 Tail Recursion 10 / 10 pts 1.1 a) 5 / 5 pts − 0 pts Correct − 2 pts Not tail-recursive − 3 pts Incorrect Algorithm − 2 pts No Algorithm/code provided 1.2 b) 5 / 5 pts − 0 pts Correct − 2 pts Not tail-recursive − 3 pts Incorrect Algorithm − 2 pts No Algorithm/code provided
Question 2 Parameter Passing 7.5 / 16 pts 2.1 Pass by Value 2 / 4 pts + 4 pts Correct + 3 pts Some information missing / 2 outputs correct + 2 pts Most information missing / 1 output correct + 0 pts Incorrect − 2 pts Unmarked Pages 2.2 Pass by Reference 0 / 4 pts + 4 pts Correct + 3 pts Some information missing / 2 outputs correct + 2 pts Most information missing / 1 output correct + 0 pts Incorrect − 2 pts Unmarked Pages 2.3 Pass by value result 3.5 / 4 pts − 0 pts Correct − 0.8 pts no explanation − 0.5 pts minor errors − 1 pt missing one of the outputs (prints) − 2 pts partial credits − 2 pts page not marked − 4 pts wrong answer 2.4 Pass by name 2 / 4 pts − 0 pts Correct − 0.8 pts no explanation − 0.5 pts minor errors − 1 pt missing one of the outputs (prints) − 2 pts partial credits − 4 pts wrong answer − 2 pts page not marked
Question 3 Exception Handling 10 / 14 pts 3.1 1 6.5 / 7 pts − 0 pts Correct − 0.5 pts Mostly correct, please check answer key − 1.4 pts Correct but missing thorough explanation − 3.5 pts Good attempt but incorrect − 1.4 pts Handwritten − 3.5 pts Page not marked − 7 pts Unattempted/incorrect 3.2 2 3.5 / 7 pts − 0 pts Correct − 0.5 pts Mostly correct, see answer key − 1.4 pts Correct but missing thorough explanation − 3.5 pts Good attempt but incorrect − 1.4 pts Handwritten − 3.5 pts Page not marked − 7 pts Incorrect/unattempted − 1 pt Reasoning provided, but incomplete.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help
i i d h f ll i Question 4 Theory of function recursion and calling sequence 9 / 10 pts 4.1 1 4 / 5 pts − 0 pts Correct − 1 pt Minor Mistakes in 1 part or across Both Parts (Ex. Frame/Stack reuse because Frames/Stacks are deallocated then reallocated at the same memory location for the next call so it is not the same, etc.) − 2 pts Some Mistakes either in 1 Part Or Across Both − 3 pts Incorrect Explanation / Multiple Mistake Across Both Parts − 4 pts The Answer is not Related to What is Asked − 5 pts No Answer − 1 pt Handwritten Answer − 1 pt Did Not Mark Pages − 1 pt Lack of Detailed Explanation or Lack of Detail Demonstrating Conceptual Understanding 4.2 2 5 / 5 pts − 0 pts Correct − 2.5 pts Partially correct − 1 pt Minor mistake − 5 pts Incorect − 1 pt Didn't mark correct page Question 5 Late Submission 0 / 0 pts − 0 pts Correct
No questions assigned to the following page.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help
Questions assigned to the following page: 1.1 and 1.2
Questions assigned to the following page: 2.1 , 2.2 , 2.3 , and 2.4
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help
Questions assigned to the following page: 3.1 and 3.2
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help
Questions assigned to the following page: 4.1 and 4.2
i i d h f ll i
No questions assigned to the following page.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help