| S N |
Roll No |
Question posted on |
Due by |
Rcvd |
Evaluation/Corrective
Comments |
Score/10 |
| 0 |
00 |
-- |
-- |
-- |
-- |
10 |
| 1 |
04 |
13.12 |
13.12 18.12 |
Multiple files with same name. So, some
files not processed. Re-submissions rcvd. (1) Readme file is not to replicate the code/algorithm. It is to help the user/reader on not so obvious things. Here it may tell the reader/evaluator what each file is meant for, how the input is to be supplied, compiling instructions if any etc. No code documentation or comments. Could have clarified the doubts. Asked to use command line arguments for input. Not done. Then how is the running time computed? Not documented. The time taken reported value is far different from run time observed (0m0.004s) using your code. No comparison between the two methods. Discuss to improve and for permission to re-submit. (2)Same remarks Re-submission permitted, by 19/12. 8/2/22: Done well. The readme file gain is not to explain the answer. Those details should be there in the main answer file. |
9.5 |
|
| 2 |
12 |
13.12 | 13.12 19.12 |
Multiple files with same name. So, some
files not processed. Re-submissions rcvd. Compile error with linux. Discuss to improve and for permission to re-submit. Re-submission permitted, by 19/12. "tabulate, compare, and conclude" were the final tasks. Compare, and conclude are missing. |
9 |
|
| 3 |
18 |
7.12 |
14.12 |
14.12 |
Code files are not submitted. Unable to
check. Discuss to improve and for permission to re-submit. 21/12: Discussed. Re-submission permitted, by 24/12. 21/2/22: Student reported today asking for evaluation of the files submitted through three emails on 28/12/22. Explained to her on how to properly do things on some relevant matters. Will check the files. 5/3/22: Downloaded the files from three emails. Renamed one file as two of them had the same file name. No readme file. Code not documented. How to give the input? Had to figure out from the code. Simple task. Could have done better. |
8 |
| 4 |
16 |
9.12 |
16.12 |
15.12 24.12 |
How will you enter x^1000+x+1? 1000 prompts
and answers? int A[10][2]; is not a good idea. Code is without comments. Sample results of your code ------ Enter the order of the polynomial:2 Enter degree and coefficient:5 1 Enter degree and coefficient:6 1 Enter degree and coefficient:7 1 x^7 + x^6 + 1 -------------- ------------ Enter the order of the polynomial:1 Enter degree and coefficient:5 6 Enter degree and coefficient:5 6 6x^5 + 6 --------------- Are these ok? Discuss. 21/12: Discussed. Re-submission permitted, by 24/12. 8/2/22: Wrong instruction in readme file. Code not well aligned. Obtaining wrong answer. Your submitted result itself is wrong. Check the last term. |
8 |
| Q04 |
(i) Implement binary_search_recursive, and
binary_search_iterative algorithms in C as discussed in
class. Compare their running times for input size of
500 numbers. (ii) Implement fibonacci_dp, and fibonacci_recursive algorithms in C as discussed in class. Compare their running times for values 30 upward until one version takes more than 50 seconds. |
| Q12 |
Implement interchange sort, selection
sort, selection sort with conditional swap algorithms in C
as discussed in class. Run them on an input of size 50k,
tabulate, compare, and conclude on the running time taken
by the programs. |
| Q18 |
Implement both versions of polynomial
evaluation algorithms as discussed in class. Do an
actual running time comparison between them. |
| Q16 |
Operations on polynomial using 2D array as
discussed in class will work well only if its terms
are ordered based on exponent. Sometimes the input
may not be in that order. Write a function to read and create a 2D array representation of polynimal. Write another function to print a polynomial. Write a third function to re-arrange the terms in proper order. |