ABCDEFGHIJKLMNOPQRSTUVWXYZAA
1
#NameGroupCommentsGrade (max 10)Plagiarism Detection
2
1Baltatescu Otilia412G* performance evaluation missing: memory usage and performance in big O notation (-1)9
3
2Barnoviciu Eduard411G* attachments not according to specification (-2)
* performance evaluation missing: memory usage and performance in big O notation (-1)		7
4
3Pelin Bodan411G* performance evaluation missing: memory usage and performance in big O notation (-1)
* optimal solution implementation (!)
* text file missing - next time you will get a -2 penalty		9
5
4Bulgaru Andrei412G* performance is greater than O(n^2), memory evaluation missing10
6
5Carstea Vlad412G* performance is slightly smaller than O(n^3), memory evaluation missing10
7
6Cazangiu Dragos411G* program outputs wrong data - the gcd function is wrong (-5)
* performance evaluation missing: memory usage and performance in big O notation (-1)		4
8
7Chiper Florin411G* uncompilable source code - syntax error; next time you will get 0 points (-2)
* missing memory analysis		8
9
8Ciovica Ana Maria411G* performance evaluation missing: memory usage and performance in big O notation (-1)9
10
9Corneci Marian412G* code uncompilable on gcc - don't use conio.h and getch, next time you will get a penalty
* performance evaluation missing: memory usage and performance in big O notation (-1)
* late submission (-50%)		5
11
10Damoc Alexandru411G* performance evaluation missing: memory usage and performance in big O notation (-1)
* .txt extension missing from the textfile		9
12
11David Simona411G* performance is greater than O(n^2), memory evaluation missing10
13
12Decsei Cristian Alexandru412G* .txt file missing (-2)8
14
13Diaconu Dana Gabriela411G* unrequired fractions output (don't add anything that is not required)
* "PAUSE" does not exist on Linux,don't use it
* performance is greater than O(n^2), memory evaluation missing		10
15
14Dimbeanu Melania412G* wrong source code extension - use .c, not .cpp, we're not coding in C++
* compilation warning - long int is printed with "%ld", not "%d"
* wrong program output for n=100, the array "v" is one element too short
* performance evaluation missing: memory usage and performance in big O notation (-1)
* optimal solution implementation (!)		9
16
15Dinu Iuliana Roxana421G* don't use system("PAUSE") - PAUSE executable doesn't exist on Linux
* wrong usage of "=" for comparison: if(m=0), correct is if(m==0)
* unrequired additional user input and fractions output, don't add anything that isn't specifically requested
* wrong program output for values >= 15 (-3)		7#3
17
16Auritei Doru Andrei411G* .c file missing (-2)
* performance is greater than O(n^2), memory evaluation missing		8
18
17Draghici Alexandra411G* performance evaluation missing: memory usage and performance in big O notation (-1)9
19
18Farcasanu Mircea411G* e-mail subject not according to specification (-1)
* attachements not according to specification (-2)
* uncompilable source code - syntax error (-2)
* usage of wrong destination e-mail address - should be homework@dcae.pub.ro (-2)
* program outputs "n" for "n" input value (-5)		0
20
19Galbenuse Fabian?* .c file missing (-2)
* .txt file missing (-2)
* e-mail subject not according to specification (-1)
* program outputs "1" for every input value (-5)		0#1
21
20Gales Ema411G* performance evaluation missing: memory usage and performance in big O notation (-1)9
22
21Gheboianu Madalina Petruta411G* algorithm segfaults for values greater than 31 - the i in main goes to n^2 and for n = 100, the maximum value for i and
so for the array v must be 10000, yours is 1000 (-2)
* performance evaluation missing: memory usage and performance in big O notation (-1)		7
23
22Holca Anamaria411G* performance is greater than O(n^2), memory evaluation missing10
24
23Huica Andrei412G* .txt file missing (-2)
* wrong source code extension - use .c, not .cpp, we're not coding in C++
* uncompilable source code - syntax error; next time you will get 0 points (-2)		6
25
24Ioniță Codruț Sorin411G* compilation warning - exit() function is defined in stdlib.h header file which wasn't included
* performance is greater than O(n^2), memory evaluation missing		10
26
25Ivana TomicErasmus* attachments not according to specification (-2)
* .txt file missing (-2)
* late submission (-50%)
* this course (lectures and more importantly the labs) is taught in C your submission is in Java
* the program has a hardcoded n = 1, it does not request input from the keyboard (-1)		3#2
27
26Juvina Simona Ioana412G* code uncompilable on gcc - don't use conio.h and getch, next time you will get a penalty
* complexity is greater than O(n^2) and the memory analysis didn't specify where it is allocated (program, stack or heap)		10
28
27Maciuceanu Stefan Andrei411G* memory evaluation missing
* late submission (-50%)		5
29
28Manolache Cristian412G* code uncompilable on gcc - don't use conio.h and getch, next time you will get a penalty
* unrequired fractions output - don't add anything that wasn't required
* complexity is greater than O(n^2) and the memory analysis didn't specify where it is allocated (program, stack or heap)		10
30
29Marin Mihai412G* code uncompilable on gcc - don't use conio.h and getch, next time you will get a penalty
* unrequired fractions output (don't add anything that is not required)
* wrong source code extension - use .c, not .cpp, we're not coding in C++
* performance evaluation missing: memory usage and performance in big O notation (-1)		9
31
30Micu Alexandru435B / 422G* performance is greater than O(n^2), memory evaluation missing10
32
31Mohora Iulian Valentin411G* performance evaluation missing: memory usage and performance in big O notation (-1)9
33
32Muhamad Amru Eldan411G* missing extension for .txt file
* performance evaluation missing: memory usage and performance in big O notation (-1)
* late submission - next time make sure you send your work on time		9
34
33Neacsu Ana411G* the allocated memory area x serves no purpose in your program and half of your description talks about it (-1)
* performance evaluation missing: memory usage and performance in big O notation (-1)
* extremely slow execution speed for n=100		8
35
34Nebojsa SpasojevicErasmus* attachments not according to specification (-2)
* .txt file missing (-2)
* late submission (-50%)
* this course (lectures and more importantly the labs) is taught in C your submission is in Java
* the program has a hardcoded n = 1, it does not request input from the keyboard (-1)		3#2
36
35Nedelcu Adelin411G* complexity is greater than O(n^2) and the memory analysis didn't specify where it is allocated (program, stack or heap)10
37
36Nichita Adrian412G* code and description unrelated to the requirement0
38
37Niculae Ruxandra Magdalena412G* code uncompilable on gcc - don't use conio.h and getch, next time you will get a penalty
* wrong file extension: cpp is for C++ source code which we don't use
* unrequired fractions output - don't add anything that wasn't required
* performance evaluation missing: memory usage and performance in big O notation (-1)
* late submission (-50%)		5
39
38Petre Andrei Marius412G* .txt file missing (-2)
* don't use system("PAUSE") - PAUSE executable doesn't exist on Linux
* wrong usage of "=" for comparison: if(m=0), correct is if(m==0)
* unrequired additional user input and fractions output, don't add anything that isn't specifically requested
* wrong program output for values >= 15 (-3)
* late submission (- 50%)		3#3
40
39Podar Raluca412G* wrong source code extension - use .c, not .cpp, we're not coding in C++
* usage of C++ functions and streams - code uncompilable with a C compiler (-1)
* code uncompilable on gcc - don't use conio.h and getch, next time you will get a penalty
* unrequired fractions output - don't add anything that wasn't required
* .txt file missing (-2)
* optimal solution implementation (!)		7
41
40Popescu Vlad411G* this algorithm does not have a worst/ best case scenario; execution time scales with N, and that is the expression you
found for the "worst" case scenario, which you can verify if you replace n with 1 (1^2 * sqrt(1) == 1)
* memory evaluation missing		10
42
41Prisiceanu Denisa411G* performance is greater than O(n^2), memory evaluation missing10
43
42Sava Vlad Mihai412G* "PAUSE" does not exist on Linux,don't use it
* complexity is greater than O(n^2)		10
44
43Seceleanu Alexandru412G* unrequired fractions output (don't add anything that is not required)
* compilation warnings - check the printf syntax
* missing algorithm description (-1)
* complexity is greater than O(n^2) and the memory analysis didn't specify where it is allocated (program, stack or heap)		9
45
44Sipica Alin431A* PAUSE doesn't exist on Linux bash, don't use it.
* performance evaluation missing: memory usage and performance in big O notation (-1)
* late submission (-50%)		5
46
45Stan Livia412G* .c file missing (-2)
* .txt file missing (-2)
* e-mail subject not according to specification (-1)
* program outputs "1" for every input value (-5)		0#1
47
46Stoicescu Alin411G* complexity is greater than O(n^2) and the memory analysis didn't specify where it is allocated (program, stack or heap)10
48
47Virdol Costin412G* performance is slightly smaller than O(n^3), memory evaluation missing10
49
48Vranceanu Vlad412G* attachments not according to specification (-2)
* performance evaluation missing: memory usage and performance in big O notation (-1)
* absolute value computation isn't needed because the module value of two positive numbers will always be positive		7
50
49Yazan Alshawa411G* memory evaluation missing
* late submission (-50%)		5
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100