СПИСОК ЛИТЕРАТУРЫ. ПРИЛОЖЕНИЕ Б

СПИСОК ЛИТЕРАТУРЫ

1. Методические указания к курсовой работе по дисциплине «Современные пакеты прикладных программ» / Сост. : Мариничев В. Ю. – Донецк: ДОННТУ, 2017. – 32 с.

2. Павловская, Т. А. C/C++. Программирование на языке высокого уровня: учебник для вузов / Т. А. Павловская. - СПб. : Питер, 2010. - 461с.

3. Алексеев, Е. Р. Самоучитель по программированию на C/C++ [Электронный ресурс] / Е. Р. Алексеев, О. В. Чеснокова; ГВУЗ " ДонНТУ". - (7, 6 Мб). - Донецк: ДВНЗ " ДонНТУ", 2013. - 1 файл. - Систем. требования: Acrobat Reader.

4. Могилев, А. В. Информатика: учебное пособие для вузов / А. В. Могилев, Н. И. Пак, Е. К. Хеннер; А. В. Могилев, Н. И. Пак, Е. К. Хеннер; под ред. Е. К. Хеннера. - 7-е изд., стер. - М. : ИЦ " Академия", 2009. – 848 с.

5. Гриффитс, Д. Изучаем программирование на C [Электронный ресурс]: перевод с английского / Д. Гриффитс, Д. Гриффитс. - 71 Мб. - М. : Эксмо, 2013. – 624 с.

6. http: //kpolyakov. spb. ru/school/c. htm.

ПРИЛОЖЕНИЕ А

Перечень замечаний нормоконтролера

cтудента Жука О. Е., группы ЭАПУ-20

Обозначение документа	Документ	Условная оценка	Содержание замечания

Дата ____________ Подпись __________________________

^(ФИО)

ПРИЛОЖЕНИЕ Б

Листинг программы

Program:

#include < stdio. h>

#include < math. h>

#include < conio. h>

FILE *fp;

int i, j;

float temp, tx, tf1, tf2, tf3, tF1, tF2, tF3;

char s[80];

void Tablica(float xn, float xk, float dx, float x, float f1, float f2, float f3)

{

fp = fopen(" tablica. txt", " w" );

fprintf(fp, " Calculation results: \n\n\0" );

for (x = xn; x < = xk; x += dx)

{

f1 = pow(fabs(x), x + 2) + sin(x);

f2 = pow(3, x + 3) + 2 * x;

f3 = pow(x * x + x + 1, 1. /5);

fprintf(fp, " %-12. 2f", x);

fprintf(fp, " %-21. 2f", f1);

fprintf(fp, " %-17. 2f", f2);

fprintf(fp, " %-4. 2f\n", f3);

}

fclose(fp);

}

void SortF1(float *F1, float *sF1, int k)

{

for (i = 1; i < k; i++)

{

sF1[i] = F1[i];

temp = sF1[i];

j = i - 1;

while (j > = 0 & & temp < sF1[j])

{

sF1[j+1] = sF1[j];

sF1[j] = temp;

j--;

}

void SortF2(float *F2, float *sF2, int k)

{

for (i = 1; i < k; i++)

{

sF2[i] = F2[i];

temp = sF2[i];

j = i - 1;

while (j > = 0 & & temp > sF2[j])

{

sF2[j+1] = sF2[j];

sF2[j] = temp;

j--;

}

void SortF3(float *F3, float *sF3, int k)

{

for (i = 0; i < k; i++)

{

sF3[i] = F3[k-1-i];

}

float ArithmeticF1(float F1[i], int k)

{

float SrF1, S = 0;

for (i = 0; i < k; i++)

{

S += F1[i];

}

SrF1 = S / k;

return SrF1;

}

float ArithmeticF2(float F2[i], int k)

{

float SrF2, S = 0;

for (i = 0; i < k; i++)

{

S += F2[i];

}

SrF2 = S / k;

return SrF2;

}

float ArithmeticF3(float F3[i], int k)

{

float SrF3, S = 0;

for (i = 0; i < k; i++)

{

S += F3[i];

}

SrF3 = S / k;

return SrF3;

}

float MaximumF1(float F1[i], int k)

{

float MaxF1 = F1[0];

for (i = 1; i < k; i++)

{

if (MaxF1 < F1[i]) MaxF1 = F1[i];

}

return MaxF1;

}

float MaximumF2(float F2[i], int k)

{

float MaxF2 = F2[0];

for (i = 1; i < k; i++)

{

if (MaxF2 < F2[i]) MaxF2 = F2[i];

}

return MaxF2;

}

float MaximumF3(float F3[i], int k)

{

float MaxF3 = F3[0];

for (i = 1; i < k; i++)

{

if (MaxF3 < F3[i]) MaxF3 = F3[i];

}

return MaxF3;

}

float MinimumF1(float F1[i], int k)

{

float MinF1 = F1[0];

for (i = 1; i < k; i++)

{

if (MinF1 > F1[i]) MinF1 = F1[i];

}

return MinF1;

}

float MinimumF2(float F2[i], int k)

{

float MinF2 = F2[0];

for (i = 1; i < k; i++)

{

if (MinF2 > F2[i]) MinF2 = F2[i];

}

return MinF2;

}

float MinimumF3(float F3[i], int k)

{

float MinF3 = F3[0];

for (i = 1; i < k; i++)

{

if (MinF3 > F3[i]) MinF3 = F3[i];

}

return MinF3;

}

void Function1(float *F1, float *sF1, float SrF1, float MaxF1, float MinF1, int k)

{

fp = fopen(" function_1. txt", " w" );

fprintf(fp, " Default array: \t\tSort in ascending order: \n\n\0" );

for (i = 0; i < k; i++)

{

fprintf(fp, " %-23. 2f", F1[i]);

fprintf(fp, " %. 2f\n", sF1[i]);

}

fprintf(fp, " \n Arithmetic average: %. 2f\n", SrF1);

fprintf(fp, " \n Maximum element: %. 2f\n", MaxF1);

fprintf(fp, " \n Minimum element: %. 2f\n", MinF1);

fclose(fp);

}

void Function2(float *F2, float *sF2, float SrF2, float MaxF2, float MinF2, int k)

{

fp = fopen(" function_2. txt", " w" );

fprintf(fp, " Default array: \t\tSort in descending order: \n\n\0" );

for (i = 0; i < k; i++)

{

fprintf(fp, " %-23. 2f", F2[i]);

fprintf(fp, " %. 2f\n", sF2[i]);

}

fprintf(fp, " \n Arithmetic average: %. 2f\n", SrF2);

fprintf(fp, " \n Maximum element: %. 2f\n", MaxF2);

fprintf(fp, " \n Minimum element: %. 2f\n", MinF2);

fclose(fp);

}

void Function3(float *F3, float *sF3, float SrF3, float MaxF3, float MinF3, int k)

{

fp = fopen(" function_3. txt", " w" );

fprintf(fp, " Default array: \t\tInversion: \n\n\0" );

for (i = 0; i < k; i++)

{

fprintf(fp, " %-23. 2f", F3[i]);

fprintf(fp, " %. 2f\n", sF3[i]);

}

fprintf(fp, " \n Arithmetic average: %. 2f\n", SrF3);

fprintf(fp, " \n Maximum element: %. 2f\n", MaxF3);

fprintf(fp, " \n Minimum element: %. 2f\n", MinF3);

fclose(fp);

}

void Matrica(float *X, float *F1, float *F2, float *F3, int k)

{

fp = fopen(" tablica. txt", " r" );

fgets(s, 80, fp);

for (i = 0; i < k; i++)

{

fscanf(fp, " %f %f %f %f", & tx, & tf1, & tf2, & tf3); X[i] = tx;

}

fclose(fp);

fp = fopen(" function_1. txt", " r" );

fgets(s, 80, fp);

for (i = 0; i < k; i++)

{

fscanf(fp, " %f %f", & tf1, & tF1); F1[i] = tf1;

}

fclose(fp);

fp = fopen(" function_2. txt", " r" );

fgets(s, 80, fp);

for (i = 0; i < k; i++)

{

fscanf(fp, " %f %f", & tf2, & tF2); F2[i] = tf2;

}

fclose(fp);

fp = fopen(" function_3. txt", " r" );

fgets(s, 80, fp);

for (i = 0; i < k; i++)

{

fscanf(fp, " %f %f", & tf3, & tF3); F3[i] = tf3;

}

fclose(fp);

fp = fopen(" matrica. txt", " w" );

fprintf(fp, " Matrix of results: \n\n" );

for (i = 0; i < k; i++)

{

fprintf(fp, " X[%-3d] = %-12. 2f", i, X[i]);

fprintf(fp, " f1(%-5. 2f) = %-21. 2f", X[i], F1[i]);

fprintf(fp, " f2(%-5. 2f) = %-17. 2f", X[i], F2[i]);

fprintf(fp, " f3(%-5. 2f) = %-4. 2f\n", X[i], F3[i]);

}

fclose(fp);

}

main()

{

int k = 0;

float xn, xk, dx, x, f1, f2, f3;

printf(" Initial data: \n\n" );

printf(" Xn = " ); scanf(" %f", & xn);

printf(" Xk = " ); scanf(" %f", & xk);

printf(" dX = " ); scanf(" %f", & dx);

printf(" \n Calculation results: \n\n" );

for (x = xn; x < = xk; x += dx)

{

f1 = pow(fabs(x), x + 2) + sin(x);

f2 = pow(3, x + 3) + 2 * x;

f3 = pow(x * x + x + 1, 1. /5);

printf(" X = %-12. 2f", x);

printf(" f1 = %-21. 2f", f1);

printf(" f2 = %-17. 2f", f2);

printf(" f3 = %-4. 2f\n", f3);

k++;

}

Tablica(xn, xk, dx, x, f1, f2, f3);

float X[k], F1[k], F2[k], F3[k];

fp = fopen(" tablica. txt", " r" );

if (fp == NULL)

{

printf(" \n The data file could not be found! " );

return 1;

}

printf(" \n Default arrays: \n\n" );

fgets(s, 80, fp);

for (i = 0; i < k; i++)

{

if (0 == fscanf(fp, " %f %f %f %f", & tx, & tf1, & tf2, & tf3))

{

printf(" \n There is not enough data in the file! " );

return 1;

}

else

{

fscanf(fp, " %-4. 2f %-13. 2f %-9. 2f %-4. 2f", & tx, & tf1, & tf2, & tf3);

X[i] = tx; printf(" X[%-3d] = %-12. 2f", i, X[i]);

F1[i] = tf1; printf(" F1[%-3d] = %-21. 2f", i, F1[i]);

F2[i] = tf2; printf(" F2[%-3d] = %-17. 2f", i, F2[i]);

F3[i] = tf3; printf(" F3[%-3d] = %-4. 2f\n", i, F3[i]);

}

fclose(fp);

float sF1[k], sF2[k], sF3[k];

SortF1(F1, sF1, k);

SortF2(F2, sF2, k);

SortF3(F3, sF3, k);

printf(" \n Sorting arrays: \n" );

printf(" (F1 - Sort in descending order, F2 - Sort in descending order, F3 - Inversion)\n\n" );

for (i = 0; i < k; i++)

{

printf(" sF1[%-3d] = %-21. 2f", i, sF1[i]);

printf(" sF2[%-3d] = %-17. 2f", i, sF2[i]);

printf(" sF3[%-3d] = %-4. 2f\n", i, sF3[i]);

}

float SrF1, SrF2, SrF3;

SrF1 = ArithmeticF1(F1, k);

SrF2 = ArithmeticF1(F2, k);

SrF3 = ArithmeticF1(F3, k);

printf(" \n Arithmetic average: \n" );

printf(" \n SrF1 = %. 2f\n", SrF1);

printf(" SrF2 = %. 2f\n", SrF2);

printf(" SrF3 = %. 2f\n", SrF3);

float MaxF1, MaxF2, MaxF3;

MaxF1 = MaximumF1(F1, k);

MaxF2 = MaximumF2(F2, k);

MaxF3 = MaximumF3(F3, k);

printf(" \n Maximum element: \n" );

printf(" \n MaxF1 = %. 2f\n", MaxF1);

printf(" MaxF2 = %. 2f\n", MaxF2);

printf(" MaxF3 = %. 2f\n", MaxF3);

float MinF1, MinF2, MinF3;

MinF1 = MinimumF1(F1, k);

MinF2 = MinimumF2(F2, k);

MinF3 = MinimumF3(F3, k);

printf(" \n Minimum element: \n" );

printf(" \n MinF1 = %. 2f\n", MinF1);

printf(" MinF2 = %. 2f\n", MinF2);

printf(" MinF3 = %. 2f\n ", MinF3);

Function1(F1, sF1, SrF1, MaxF1, MinF1, k);

Function2(F2, sF2, SrF2, MaxF2, MinF2, k);

Function3(F3, sF3, SrF3, MaxF3, MinF3, k);

Matrica(X, F1, F2, F3, k);

printf(" \n Matrix of results: \n\n" );

for (i = 0; i < k; i++)

{

printf(" X[%-3d] = %-12. 2f", i, X[i]);

printf(" f1(%-5. 2f) = %-21. 2f", X[i], F1[i]);

printf(" f2(%-5. 2f) = %-17. 2f", X[i], F2[i]);

printf(" f3(%-5. 2f) = %-4. 2f\n", X[i], F3[i]);

}

getch();

}

Graphic:

#include < stdio. h>

#include < graphics. h>

#include < conio. h>

FILE *fp;

const int X0 = 400, Y0 = 400, k = 25, n = 111;

int i, j;

float tx, tf1, tf2, tf3, tF1, tF2, tF3;

char s[80];

int ScreenX (float x)

{

return X0 + k * x;

}

int ScreenY (float y)

{

return Y0 - k * y;

}

void Axes()

{

int xe, ye;

char s[10];

line (X0, 0, X0, 599);

line (0, Y0, 799, Y0);

for (i = (-X0) / k; i < = X0 / k; i++)

{

xe = ScreenX(i);

line (xe, Y0 - 2, xe, Y0 + 2);

sprintf (s, " %d", i);

outtextxy (xe - 10, Y0 + 4, s);

}

for (i = (-Y0) / k; i < = Y0 / k; i++)

{

ye = ScreenY(i);

line (X0 - 2, ye, X0 + 2, ye);

sprintf (s, " %d", i);

outtextxy (X0 + 10, ye + 4, s);

}

void GraphicFunctions(float *X, float *F1, float *F2, float *F3)

{

fp = fopen(" tablica. txt", " r" );

fgets(s, 80, fp);

for (i = 0; i < n; i++)

{

fscanf(fp, " %f %f %f %f", & tx, & tf1, & tf2, & tf3);

X[i] = tx; F1[i] = tf1; F2[i] = tf2; F3[i] = tf3;

}

setcolor(COLOR(255, 0, 0));

moveto(ScreenX(X[0]), ScreenY(F1[0]));

for (i = 1; i < n; i++)

{

lineto(ScreenX(X[i]), ScreenY(F1[i]));

}

setcolor(COLOR(0, 255, 0));

moveto(ScreenX(X[0]), ScreenY(F2[0]));

for (i = 1; i < n; i++)

{

lineto(ScreenX(X[i]), ScreenY(F2[i]));

}

setcolor(COLOR(255, 225, 0));

moveto(ScreenX(X[0]), ScreenY(F3[0]));

for (i = 1; i < n; i++)

{

lineto(ScreenX(X[i]), ScreenY(F3[i]));

}

fclose(fp);

}

void GraphicF1(float *X, float *F1, float *sF1)

{

fp = fopen(" function_1. txt", " r" );

fgets(s, 80, fp);

for (i = 0; i < n; i++)

{

fscanf(fp, " %f %f", & tf1, & tF1); sF1[i] = tF1;

}

setcolor(COLOR(0, 255, 255));

moveto(ScreenX(X[0]), ScreenY(F1[0]));

for (i = 1; i < n; i++)

{

lineto(ScreenX(X[i]), ScreenY(F1[i]));

}

setcolor(COLOR(255, 0, 255));

moveto(ScreenX(X[0]), ScreenY(sF1[0]));

for (i = 1; i < n; i++)

{

lineto(ScreenX(X[i]), ScreenY(sF1[i]));

}

fclose(fp);

}

void GraphicF2(float *X, float *F2, float *sF2)

{

fp = fopen(" function_2. txt", " r" );

fgets(s, 80, fp);

for (i = 0; i < n; i++)

{

fscanf(fp, " %f %f", & tf2, & tF2); sF2[i] = tF2;

}

setcolor(COLOR(0, 255, 255));

moveto(ScreenX(X[0]), ScreenY(F2[0]));

for (i = 1; i < n; i++)

{

lineto(ScreenX(X[i]), ScreenY(F2[i]));

}

setcolor(COLOR(255, 0, 255));

moveto(ScreenX(X[0]), ScreenY(sF2[0]));

for (i = 1; i < n; i++)

{

lineto(ScreenX(X[i]), ScreenY(sF2[i]));

}

fclose(fp);

}

void GraphicF3(float *X, float *F3, float *sF3)

{

fp = fopen(" function_3. txt", " r" );

fgets(s, 80, fp);

for (i = 0; i < n; i++)

{

fscanf(fp, " %f %f", & tf3, & tF3); sF3[i] = tF3;

}

setcolor(COLOR(0, 255, 255));

moveto(ScreenX(X[0]), ScreenY(F3[0]));

for (i = 1; i < n; i++)

{

lineto(ScreenX(X[i]), ScreenY(F3[i]));

}

setcolor(COLOR(255, 0, 255));

moveto(ScreenX(X[0]), ScreenY(sF3[0]));

for (i = 1; i < n; i++)

{

lineto(ScreenX(X[i]), ScreenY(sF3[i]));

}

fclose(fp);

}

main()

{

float X[n], F1[n], F2[n], F3[n], sF1[n], sF2[n], sF3[n];

initwindow (800, 600);

Axes(); GraphicFunctions(X, F1, F2, F3);

initwindow (800, 600);

Axes(); GraphicF1(X, F1, sF1);

initwindow (800, 600);

Axes(); GraphicF2(X, F2, sF2);

initwindow (800, 600);

Axes(); GraphicF3(X, F3, sF3);

getch(); closegraph();

}

⇐ Предыдущая 123 Следующая ⇒