uz
Feedback

Firibgarlarga uchmang! Telemetrio bunday kanallarni topadi va belgilaydi 👉 Belgini ko‘rmoqchi bo‘lsangiz, obuna bo‘ling

AI Coding & CSE Fundamentals

AI Coding & CSE Fundamentals

Kanalga Telegram’da o‘tish

🚀 Explore AI, Coding & Computer Science Fundamentals. 💻 Programming • DSA • DBMS • OS • Networks 🤖 AI & Emerging Technologies 🛠️ Projects • Tutorials • Learning Resources 📚 Your freedom to gain knowledge for free.

Ko'proq ko'rsatish

📈 Telegram kanali AI Coding & CSE Fundamentals analitikasi

AI Coding & CSE Fundamentals (@aicoding_csefundamentals) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 12 310 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 10 235-o'rinni va Hindiston mintaqasida 31 257-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

невідомо sanasidan buyon loyiha tez o‘sib, 12 310 obunachiga ega bo‘ldi.

13 Noyabr, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -236 ga, so‘nggi 24 soatda esa -9 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya o‘rtacha 10.85% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining N/A% ini tashkil etuvchi reaksiyalarni to‘playdi.
  • Post qamrovi: Har bir post o‘rtacha 1 337 marta ko‘riladi; birinchi sutkada odatda 0 ta ko‘rish yig‘iladi.
  • Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 11 ta reaksiya keladi.
  • Tematik yo‘nalishlar: Kontent input, string, scanf("%d, array, element kabi asosiy mavzularga jamlangan.

📝 Tavsif va kontent siyosati

Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
“🚀 Explore AI, Coding & Computer Science Fundamentals. 💻 Programming • DSA • DBMS • OS • Networks 🤖 AI & Emerging Technologies 🛠️ Projects • Tutorials • Learning Resources 📚 Your freedom to gain knowledge for free.”

Yuqori yangilanish chastotasi (oxirgi ma’lumot 14 Noyabr, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli bo‘lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Texnologiyalar & Aralashmalar toifasidagi muhim ta’sir nuqtasiga aylantirishini ko‘rsatadi.

12 310
Obunachilar
-924 soatlar
-837 kun
-23630 kun
Postlar arxiv
//Program to print the adress of variable and using that address get the value of that variable. #include<stdio.h> int main(){ int a=10; int *address=&a; printf("Address of variable a: %p\n",&a); printf("Value of a:%d",*address); return 0; }

//Program to print the adress of variable and using that address get the value of that variable. #include<stdio.h> int main(){ int a=10; int *address=&a; int b=5; printf("Address of variable a: %p\n",&a); printf("Value of a:%d",*address); return 0; }

//Guessing a number game in c #include <stdio.h> #include<stdlib.h> #include<time.h> int main() { int number,guess,numguesses=1; srand(time(0)); number=rand()%100+1; do { printf("Guess a number between 1 to 100:"); scanf("%d",&guess); if(guess>number){ printf("Your guess is wrong \nPlease enter lower number\n"); } else if(guess<number){ printf("Your guess is wrong \nPlease enter a greater number\n"); } else{ printf("Congrats! You have guessed it correct\n"); printf("The number of attempts you've taken to guess the correct number is %d times ",numguesses); } numguesses++; } while (guess!=number); return 0; }

//function to calculate factorial #include <stdio.h> int factorial(int); int main() { int n; printf("Enter the number you want to factoriate:"); scanf("%d",&n); printf("Factorial of %d is %d",n,factorial(n)); return 0; } int factorial(int n){ if(n==1 || n==0){ return 1; } return n*factorial(n-1); }

// Password validation using do while loop. #include <stdio.h> int main() { int password; do { printf("Enter the password:"); scanf("%d",&password); }while(password!=1243); printf("Access Granted."); return 0; }

// Program to generate fibonacci series using while loop. #include <stdio.h> int main() { int num, i = 2, isPrime = 1; printf("Enter the number:"); scanf("%d", &num); if (num <= 1) { isPrime = 0; } else { while (i <= num / 2) { if (num % i == 0) { isPrime = 0; break; } i++; } } if(isPrime==1) { printf("%d is a prime number.",num); } else{ printf("%d is not a prime number.",num); } return 0; }

//Program to generate fibonacci series using while loop. #include<stdio.h> int main() { int i=1,n,n1=0,n2=1,nextTerm; printf("Enter the limit of fibonacci series:"); scanf("%d",&n); while(i<=n) { printf("%d\n",n1); nextTerm=n1+n2; n1=n2; n2=nextTerm; i++; } return 0; }

//Program to find factorial of a number using while loop. #include<stdio.h> int main() { int i=1,fact=1,n; printf("Enter the value of n:"); scanf("%d",&n); while(i<=n) { fact=fact*i; i++; } printf("The factorial of %d is : %d",n,fact); return 0; }

//Program to print multiplication table in reverse order using while loop. #include<stdio.h> int main() { int i=10,n; printf("Enter the value of n:"); scanf("%d",&n); while(i) { printf("%d x %d = %d\n",n,i,n*i); i--; } return 0; }

//Program to print multiplication table using while loop. #include<stdio.h> int main() { int i=1,n; printf("Enter the value of n:"); scanf("%d",&n); while(i<=10) { printf("%d x %d = %d\n",n,i,n*i); i++; } return 0; }

//Program to add numbers from 1 to n using while loop. #include<stdio.h> int main() { int i=1,n,sum=0; printf("Enter the value of n:"); scanf("%d",&n); while(i<=n) { sum=sum+i; i++; } printf("The sum of %d numbers is :%d",n,sum); return 0; }

//Program to print odd numbers from 1 to n using while loop. #include<stdio.h> int main() { int i=1,n; printf("Enter the value of n:"); scanf("%d",&n); while(i<=n) { printf("%d\n",i); i=i+2; } return 0; }

//Program to print evun numbers from 0 to n using while loop. #include<stdio.h> int main() { int i=0,n; printf("Enter the value of n:"); scanf("%d",&n); while(i<=n) { printf("%d\n",i); i=i+2; } return 0; }

//Program to print even numbers from 0 to n using while loop. #include<stdio.h> int main() { int i,n; printf("Enter the value of n:"); scanf("%d",&n); for(i=0;i<=n;i=i+2) { printf("%d\n",i); } return 0; }

.
+1
.

lower price deals grab fast and join channel ☝️

join for lowest price deals of Flipkart ☝️