1-amaliy ish Masalaning qo’yilishi: Foydalanuvchi kiritgan 16lik sonni 10likka o’tkazuvchi dastur tuzing. Dastur

1-amaliy ish

Masalaning qo’yilishi: Foydalanuvchi kiritgan 16lik sonni 10likka o’tkazuvchi dastur tuzing.
Dastur:

#include

#include

#include

int main()

{

char hex[17];

long long decimal;

int i = 0, val, len, s = 0;

decimal = 0;

printf("16 lik sonni kiriting: ");

gets(hex);

len = strlen(hex);

len--;

for(i=0; hex[i]!='\0'; i++)

{

if(hex[i]>='0' && hex[i]<='9')

{

val = hex[i] - 48;

}

else if(hex[i]>='a' && hex[i]<='f')

{

val = hex[i] - 97 + 10;

}

else if(hex[i]>='A' && hex[i]<='F')

{

val = hex[i] - 65 + 10;

}

else if(hex[i]>'F'){

printf("Notogri son kiritildi");

s = 1;

break;

}

decimal += val * pow(16, len);

len--;

}

if(s == 0){

printf("16 lik son = %s\n", hex);

printf("10 lik son = %lld", decimal);

}

return 0;

}

Natija:



Xulosa: Bu masalani yechishda 16 lik sanoq sistemasida kiritilgan sonni 10 lik sanoq sistemasiga o’tishda 16 likda berilgan sonni indekslari bo’yicha uni 10 lik sanoq sistemasiga o’tish dasturini o’rgandim.

2-amaliy ish

Masalaning qo’yilishi: Massiv o’sish tartibida saralangan. Ushbu massivdan binary qidirish usuli orqali kerakli qiymatni topuvchi dastur tuzing.

Dastur :

#include

int main()

{ int SZ = 1000;

int a[SZ];

for(int i = 0; i < SZ ;i++){

a[i]=i+1;

}

int obr;

scanf("%i",&obr);

int top = 0;

int bot = SZ - 1;

int found=0;

int n=0;

int mid;

do{

mid=(bot-top)/2 + top;

n++;

if(a[mid]==obr)

found=1;

if(obr

bot=mid-1;

else top = mid+1;

} while(top<=bot&&!found);

if(found){

printf("%i", mid+1);

printf("\n%i ta amal bajarildi",n);

}

else

printf("topilmadi!\n");

return 0;

}

Natija :


Xulosa : Bu masalani yechishda o’sish tartibida saralangan massiv berilgan, shu massivni binary usulida ya’ni massivni ikkiga bo’lish orqali foydalanuvchi kiritgan sonni qidirish amali bajarish dasturini tuzdik.