Axborot texnologiyalari va kommunikatsiyalarini rivojlantirish vazirligi muhammad al-xorazmiy nomidagi toshkent axborot texnologiyalari universiteti qarshi filiali

using namespace std; int main() {     vector<int> myVector(10);   // объявляем вектор размером в 10 элементов и инициализируем их нулями     // вывод элементов вектора на экран     for(int i = 0; i < myVector.size(); i++)         cout << myVector[i] << ' ';     return 0; }

Esda tutin

Topshiriq: quyidagi ketma ketlikni hisoblash algortmini tuzing.

Dastur kodi:

#include

#include

using namespace std;

int fact(int n){

int p=1;

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

p *= i;

}

return p;

}
double sinus (double x , int n ) {

int s21 = 0 ;

while(x>3.141592){

s21 ++ ;

x= x-3.141592;

}

if (s21 %2 == 1) {

x *= -1 ;

}

double s = 0 ; int ishora = 1 ;

for (int i = 1 ; i <= n ; i += 2 ) {

s += pow(x , i ) / fact(i) * ishora;

ishora *= -1 ;

}

return s;

}

int main(){

float x,n;

cout<<"x = "; cin>>x;

cout<<"n = "; cin>>n;

cout << fixed ;

cout <<"sin("<

cout <<"sin("<

return 0;

}

Dastur natijasi:

Berilgan funksiya uchun 𝑓(𝑥) = 𝑘 ∙ cos 𝑥 Fure koeffitsiyentalarini aniqlang, Hosil bo’lgan formula uchun algoritm va dastur tuzilsin! Bu yerda 𝑘 jurnal tartib raqami.

Dastur kodi:

//cos(x) ni hisoblash uchun Fure qatoridan foydalanish

#include

using namespace std;

const double PI = 3.142;

double cosXSertiesSum(double x, int n)

{

// bu yerda x GRADUSda berilgan.

// Uni radianga o'tkazamiz.

//Formula to'g'ri ishlashi uchun radian qiymat talab etiladi.

x = x * (PI / 180.0);

double res = 1;

double sign = 1, fact = 1, pow = 1;

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

sign = sign * -1;

fact = fact * (2 * i - 1) * (2 * i);

pow = pow * x * x;

res = res + sign * pow / fact;

}

return res;

}

int main()

{

float x = 0;

int n = 20, k;

cout<<"k-jurnaldagi tartib raqamingiz \nx-gradus qiymat!\n";

cout<<"k = "; cin>>k;

cout<<"x = "; cin>>x;

cout <

return 0;

}
Dastur natijasi:

Foydalanilgan internet saytlar:

1. 
   https://www.tutorialspoint.com/cplusplus-program-to-compute-discrete-fourier-transform-using-naive-approach
   
2. 
   https://www.oreilly.com/library/view/c-cookbook/0596007612/ch11s18.html
   
3. 
   https://youtu.be/r6sGWTCMz2k
   
4. 
   http://cppstudio.com/uz/post/8453/