• TIRISH VA Z I RLIGI MUHAMMAD AL-XORAZMIY NOMIDAGI TOSHKЕ N T AX B O R OT TЕ X N
  • GI F A K U L T ETI Axborot texnologiyalari kafedrasi ALGORITMLARNI LOYIHALASH M a
  • Topshiriq №1
  • Topshiriq №2
  • Topshiriq №3
  • Vatarlar usuli
  • O'zbеkiston r




    Download 131.23 Kb.
    Sana28.04.2023
    Hajmi131.23 Kb.
    #54574
    Bog'liq
    O\'zbеkiston res
    Aniq integralni taqribiy hisoblash usullari To`g`ri to`rtburchak11

    O'ZBЕKISTON RESPUBLIKASI AXBOROT TEXNOLOGIYALARI VA
    KOMMUNIKATSIYALARINI RIVOJLANTIRISH VAZIRLIGI

    MUHAMMAD AL-XORAZMIY NOMIDAGI
    TOSHKЕNT AXBOROT TЕXNOLOGIYALARI UNIVЕRSITI


    KOMPYUTER INJINIRINGI FAKULTETI

    Axborot texnologiyalari kafedrasi

    ALGORITMLARNI LOYIHALASH

    Mavzu:Chiziqli va tarmoqlanuvchi algoritmlar

    BAJARDI:Abdurahmonov Otabek


    TEKSHIRDI:Begimov Oybek

    TOSHKENT 2022

    Topshiriq №1
    NxM o’lchamdagi ikki o’lchovli massiv (matritsa) hosil qilinsin va elementlari kiritilsin va matritsa ko’rinishida ekranga chiqarilsin, hosil bo’lgan matritsa elementlaridan variantdagi shartlar bo’yicha bir o’lchovli massiv hosil qilinib ekranga chiqarilsin.
    2-variant
    1-topshiriq:(nxm) o’lchamdagi ikki o’lchovli A massiv berilgan, matritsaning har bir ustinidagi musbat elementlari yig’indisidan tashkil topgan bir o’lchovli massiv hosil qiling

    #include


    #include
    #include
    using namespace std;
    int main (){
    srand(time(0));
    int a[100][100],n,b[100];
    cout<<"n = "; cin>>n;
    for (int i=0; ifor (int j=0; ja[i][j] = rand()%5-1;
    cout<}cout<}
    cout<<"A[n][m] matritsaning har bir ustinidagi musbat elementlari yig'indisidan tashkil topgan P[n] bir o’lchovli massiv"<for (int i=0; ifor (int j=0; jif (a[i][j]>0) {
    b[j]+=a[i][j];
    } } }
    for (int i=0; icout<}}


    Topshiriq №2

    #include
    #include
    float y(float x)
    {
    return (1-cos(x))/((x-sin(x))*(x-sin(x)));
    }
    float trapezoidal(float a, float b, float n)
    {
    float h = (b - a) / n;
    float s =1;
    for (int i = 0; i < n; i++)
    s += y(a + i * h);
    return h * s;
    }
    int main()
    {
    std::cout << "Natija: " << trapezoidal(3.14, 3.14*2, 100);
    return 0;
    }

    #include


    #include
    float y(float x)
    {
    return (1-cos(x))/((x-sin(x))*(x-sin(x)));
    }
    float tort(float a, float b, float n)
    {
    float h = (b - a) / n;
    float s = s = y(a) + y(b);
    for (int i = 0; i < n; i++)
    s +=2*y(a + i * h);
    return(h / 2) * s;
    }
    int main()
    {
    std::cout << "Natija: " << tort(3.14, 3.14*2, 100);
    return 0;
    }

    #include
    #include
    using namespace std;
    float func(float x)
    {
    return (1-cos(x))/((x-sin(x))*(x-sin(x)));
    }
    float simpsons_(float ll, float ul, int n)
    {
    float h = (ul - ll) / n;
    float x[101], fx[101];
    for (int i = 0; i <= n; i++) {
    x[i] = ll + i * h;
    fx[i] = func(x[i]);
    }
    float res = 0;
    for (int i = 0; i <= n; i++) {
    if (i == 0 || i == n)
    res += fx[i];
    else if (i % 2 != 0)
    res += 4 * fx[i];
    else
    res += 2 * fx[i];
    }
    res = res * (h / 3);
    return res;
    }
    int main()
    {
    cout << simpsons_(3.14, 3.14*2, 100);
    return 0;
    }

    Topshiriq №3

    2-variant

    #include


    #include
    #define EP 0.001
    using namespace std;
    double yechim(double x) {
    return pow(2.71,x-1)-x*x*x*x*x+1;
    }
    void ikkiga_bolish(double a, double b) {
    if (yechim(a) * yechim(b) >= 0) {
    cout << "Siz a va b ni to'g'ri qabul qilmadingiz\n";
    return;
    }
    double c = a;
    while ((b - a) >= EP) {
    c = (a + b) / 2;
    if (yechim(c) == 0.0)
    break;
    else if (yechim(c) * yechim(a) < 0)
    b = c;
    else
    a = c;
    }
    cout << "Tenglama ildizi : " << (c);
    }
    int main() {
    double a, b;
    cout << "a ni kiriting:"; cin >> a;
    cout << "b ni kiriting:"; cin >> b;
    ikkiga_bolish(a, b);
    return 0;
    }
    Vatarlar usuli
    #include
    #include
    using namespace std;
    float f(float x) {
    float f = pow(2.71,x-1)-x*x*x*x*x+1;
    return f;
    }
    void secant(float x1, float x2, float E) {
    float n = 0, xm, x0, c;
    if (f(x1) * f(x2) < 0) {
    do {
    x0 = (x1 * f(x2) - x2 * f(x1)) / (f(x2) - f(x1));
    c = f(x1) * f(x0);
    x1 = x2;
    x2 = x0;
    n++;
    if (c == 0)
    break;
    xm = (x1 * f(x2) - x2 * f(x1)) / (f(x2) - f(x1));
    } while (fabs(xm - x0) >= E);
    cout << "tenglama ildizi=" << (x0) << endl;
    cout << "qadamlar soni = " << n << endl;
    } else
    cout << "javobi topilmadi";
    }
    int main() {
    float x1 = 0, x2 = 1, E = 0.0001;
    secant(x1, x2, E);
    return 0;
    }

    Download 131.23 Kb.




    Download 131.23 Kb.