Algoritmni loyihalash

MUHAMMAD AL-XORAZMIY NOMIDAGI TOSHKENT AXBOROT TEXNOLOGIYALARI UNIVERSITETI QARSHI FILIALI “ TT VA KT ” FAKULTETI 2-BOSQICH AKT 11-21 GURUH TALABASINING “ ALGORITMNI LOYIHALASH” FANIDAN 4 AMALIY ISHI
Bajardi : RAIMOV.O
Qabul qildi : SAMANDAROV.SH

VARIANT 10

Amaliy ishini bajarish tartibi. Laboratoriya ishini bajarishda quyidagi tartibga amal qiling:
1. Guruh jurnalidagi nomerga ko‘ra o‘z variantingizni aniqlang
2. Masalani yechish uchun algoritm va dastur quring.
3. Kichik hajmdagi ma’lumotlar uchun dasturning to‘g‘ri ishlayotganligiga ishonch hosil qiling. 4. Bajarilgan ishlar haqida hisobot tayyorlang
1)x3+4sinx=0
4 + =0
=πK-
4 + =0
4 =-


A=
A=x a=
X=πk-

2) x3 -3x2+12x-9=0

x3 -3x2+12x-9=0
12x=-

Dastur kodi

#include
#include
using namespace std;

double f(double x) {

return (1.0/tan(x)) - (x/4.0); // ctg(x) ni tan(x) ga o'zlashtirish
}

double bisection(double a, double b, double eps) {

double c = (a + b) / 2.0;
while (fabs(f(c)) > eps) {
if (f(a) * f(c) < 0) {
b = c;
} else {
a = c;
}
c = (a + b) / 2.0;
}
return c;
}

int main() {

double a = 1.0; // Ishorani bo'lgan oraliqning boshi
double b = 2.0; // Ishorani bo'lgan oraliqning oxiri
double eps = 0.00001; // Xatolar miqdori
double x = bisection(a, b, eps); // Bisection usuli bilan yechimni topish
cout << "Tenglama yechimi: x = " << x << endl;
return 0;
}