Pythonning pyrogram kutubxonasida ishlashni o'rganish.(telegram kanallarida admin bo'lmasdan malumotlarni olish, kanal va guruhlarga O'zbekistonlik odamlarni qo'shish,soxta like, soxta posmotr kopaytirish va boshqa ko'plab qulayliklar mavjud).Kompyuteri yo'qlar bu videoni yuklab vaqtlarini ketkazmasin.

Bu video 10000 dan ortiq posmotr to'plashiga ishonaman!

#pyrogram #python #auth

Kanalga a'zo bo'lish 👇
https://t.me/joinchat/AAAAAE_s-1YJnZDrJpjURg

"Dasturchi bo'lishni xoxlaysizmi?" kitobi
@Tohirbek_Ibragimov

Hich sizlarda savol bolganmi qanday qilb python programist bolsam boladi qanqb ishga kirsam boladi deb?
Manimcha bolgan 😅😅. 2 yil oldin shu gurpaga kirganmdayam shu atmosfera xozram shu osha osha narsala xafa bomisila achiq gapirsam balki xaq gapirvotgandrman balkim no xaq python uz atmosferasi ozgartirsh kere xop temadan uzolawmimiza xop qanday qilb python programist bolb stajer yoki ishga kirsa boladi?
1- qadam python boshlang'ichni organish kerak (usloviyalar function class requests json va azgina algaritimlar xisob kitobl)
1.2- SQLITE3 va Chuquroq OOP va baza qanday ishlashini organish kere.
2- qadam OOP da biror bir turniket yoki shunga oxshash project qilb korish kere sqlite3 ga ulagan xolda.
3- qadam HTTP qanday ishlani korib chqsh kere GET,POST,DELETE,PUT METODLARINI
4-qadam Ana endi Frameworkga otamiza Django xozrda python frameworklari boyicha 1-chi orinda turadi va ancha qulay boshlanishida qorqinchli korinishi mumkin aslida unchalik qorqinchli mas bora bora juda yoqib qoladi django Djangoda nmani organish kerak?
DJANGO TEMPLATE BOR - https://www.djangoproject.com/ va
DJANGO RESTFRAMEWROK BOR - https://www.django-rest-framework.org/ lekn ikkaliyam bir narsa django ni ichiga django restframewrok kiradi
django template da nmalar qilsa boladi? django template orqali siz sayt yarata olasiz html css javascriptlariniham ozizgiz yozasiz phpga oxshab ketadi agar html css js ni bilsangiz shuni organishni maslahat beraman agar html css js ni bilmasangiz frontend sizga yoqmasa manga oxshab))
django restni organishni maslahat beraman otda html css javascritpni unitasiz mutlaqo)) frontendga faqat api chiqarib berasiz unin uchun jsoni yaxwi bilishingiz kerak boladi va baza bilan ancha yaxwi ishlawni organishingiz shart! Shu narsalani organsangiz xatyabi djangoda biror bir blog mi yoki kichkinoroq sayt yoki api chiqarorlansgiz ishga kirshga shans 60-70 % boladi yoki stajerlikga 90-100% hammaga omad agar kimgadir gapim yoqmagan bolsa oldindan uzur sorayman
#ishgakirsh #python #progammist #stajer

​Бугун метродаги интернет тезлигини ўлчаб кўриш мақсадида метрога тушган эдим, афсус, чучварани хом санаган эканман...

Тошкент метрополитенида вай-файга уланиш тартиби:
1. Метрога тушинг
2. Миллий боғ метро бекатига боринг (Тошкентда фақат ушбу бекатда метро ичида мобил алоқа ишлайди)
3. Бекатда бир вақтнинг ўзида ҳам антенна, ҳам вай-фай ишлаётганлигтини текширинг
4. Телефон рақамингизни киритинг
5. Телефонингизга смс орқали келган тасдиқлаш кодини киритиб рақамингизни тасдиқланг
6. Авторизация муддати (cookie lifetime) тугамагунча бемалол метронинг ихтиёрий нуқтасидан интернетдан фойдаланинг (агарда буларнинг тизимида хатолик бўлмаса)
7. Агарда яна қайтадан телефон рақам ва тасдиқлаш коди сўралса, 1-қадамга қайтинг.

#нюс #мем_дня

@dev_story

Qachonki kod yozish davomida kompilatsiyada xatolik bo'lsa
😂😂😂

#include <iostream>
#include<algorithm>
using namespace std;

int main()
{
int count, i, first, last, middle;
char arr[10],key;

cout<<"qancha element kiritmoqchisiz?:";
cin>>count;

for (i=0; i<count; i++)
{
cout<< " belgilarni kiriting "<<(i+1)<<": ";
cin>>arr[i];
}
cout<<endl<<endl;
sort(arr,arr+count);
for (i=0; i<count; i++)
{
cout<< " belgilarni kiriting "<<(i+1)<<": "<<arr[i]<<endl;
}

o:
cout<<"Kiritilgan belgilardan qayssi birini topmoqchisiz:";
cin>>key;
first = 0;
last = count-1;
middle = (first+last)/2;
while (first <= last)
{
if(arr[middle] < key)
{
first = middle + 1;

}
else if(arr[middle] == key)
{
cout<<key<<" kiritilgan belgilar ichida bor joylashuvi= "<<middle+1<< " - qatorda " <<"\n";
break;
}
else {
last = middle - 1;
}
middle = (first + last)/2;
}
if(first > last)
{
cout<<key<<" belgi topilmadi\n";
}
int a;
cout<<"Yana qidirib ko'rasizmi xa:1 yoq:0 ";cin>>a;
if(a==1) goto o;
else cout<<"Raxmat";
}

#Savol7 Binar daraxti berilgan bo'lsin. va undagi elementlar kalit qiymatiga teng elementlarni o'chirish dasturi tuzilsin

#include<stdio.h>
#include<stdlib.h>



struct node
{

int key;

struct node *left, *right;
};



struct node *newNode(int item)
{

struct node *temp = (struct node *)malloc(sizeof(struct node));

temp->key = item;

temp->left = temp->right = NULL;

return temp;
}


void inorder(struct node *root)
{

if (root != NULL)

{

inorder(root->left);

printf("%d ", root->key);

inorder(root->right);

}
}


struct node* insert(struct node* node, int key)
{


if (node == NULL) return newNode(key);




if (key < node->key)

node->left = insert(node->left, key);

else

node->right = insert(node->right, key);




return node;
}



struct node * minValueNode(struct node* node)
{

struct node* current = node;



while (current && current->left != NULL)

current = current->left;



return current;
}



struct node* deleteNode(struct node* root, int key)
{


if (root == NULL) return root;




if (key < root->key)

root->left = deleteNode(root->left, key);




else if (key > root->key)

root->right = deleteNode(root->right, key);





else

{

if (root->left == NULL)

{

struct node *temp = root->right;

free(root);

return temp;

}

else if (root->right == NULL)

{

struct node *temp = root->left;

free(root);

return temp;

}





struct node* temp = minValueNode(root->right);



root->key = temp->key;



root->right = deleteNode(root->right, temp->key);

}

return root;
}



int main()
{

/*
50

/ \

30 70

/ \ / \

20 40 60 80 */

struct node *root = NULL;

root = insert(root, 50);

root = insert(root, 30);

root = insert(root, 20);

root = insert(root, 40);

root = insert(root, 70);

root = insert(root, 60);

root = insert(root, 80);



printf("Inorder traversal of the given tree \n");

inorder(root);



printf("\nDelete 20\n");

root = deleteNode(root, 20);

printf("Inorder traversal of the modified tree \n");

inorder(root);



printf("\nDelete 30\n");

root = deleteNode(root, 30);

printf("Inorder traversal of the modified tree \n");

inorder(root);



printf("\nDelete 50\n");

root = deleteNode(root, 50);

printf("Inorder traversal of the modified tree \n");

inorder(root);



return 0;
}

#Javob10


#include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
struct node
{
float key;
struct node *left, *right;
};
struct node *newNode(float item)
{
struct node *temp = (struct node *)malloc(sizeof(struct node));
temp->key = item;
temp->left = temp->right = NULL;
return temp;
}
void inorder(struct node *root)
{
if (root != NULL)
{
inorder(root->left);
printf("%g ", root->key);
inorder(root->right);
}
}
struct node* insert(struct node* node, float key)
{
if (node == NULL) return newNode(key);
if (key < node->key)
node->left = insert(node->left, key);
else
node->right = insert(node->right, key);
return node;
}
struct node * minValueNode(struct node* node)
{
struct node* current = node;
while (current && current->left != NULL)
current = current->left;
return current;
}
struct node* deleteNode(struct node* root, float key)
{
if (root == NULL) return root;
if (key < root->key)
root->left = deleteNode(root->left, key);
else if (key > root->key)
root->right = deleteNode(root->right, key);
else
{
if (root->left == NULL)
{
struct node *temp = root->right;
free(root);
return temp;
}
else if (root->right == NULL)
{
struct node *temp = root->left;
free(root);
return temp;
}
struct node* temp = minValueNode(root->right);
root->key = temp->key;
root->right = deleteNode(root->right, temp->key);
}
return root;
}

int main()
{

struct node *root = NULL;

printf("Daraxt tugunlari soni: ");
int n;
cin>>n;
printf("Daraxt tugunlarini kiriting: \n");
float s=0;
for(int i=0; i<n; i++)
{
float temp;
cin>>temp;
s += temp;
root = insert(root, temp);
}
s /= n;
printf("\nDaraxtning tugunlari qiymatlarining orta arifmetigi: %g\n\n",s);

root = insert(root, s);
printf("Daraxtga %g qiymatli tugun qoshildi ! \n\n",s);

inorder(root);
return 0;
}

#Javob10.2


#include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
struct node
{
float key;
struct node *left, *right;
};
struct node *newNode(float item)
{
struct node *temp = (struct node *)malloc(sizeof(struct node));
temp->key = item;
temp->left = temp->right = NULL;
return temp;
}
void inorder(struct node *root)
{
if (root != NULL)
{
inorder(root->left);
printf("%g ", root->key);
inorder(root->right);
}
}
void node_view(struct node *root)
{
if (root != NULL)
{

printf("%f ", root->key);
}
}
struct node* insert(struct node* node, float key)
{
if (node == NULL) return newNode(key);
if (key < node->key)
node->left = insert(node->left, key);
else
node->right = insert(node->right, key);
return node;
}
struct node * minValueNode(struct node* node)
{
struct node* current = node;
while (current && current->left != NULL)
current = current->left;
return current;
}
struct node* deleteNode(struct node* root, float key)
{
if (root == NULL) return root;
if (key < root->key)
root->left = deleteNode(root->left, key);
else if (key > root->key)
root->right = deleteNode(root->right, key);
else
{
if (root->left == NULL)
{
struct node *temp = root->right;
free(root);
return temp;
}
else if (root->right == NULL)
{
struct node *temp = root->left;
free(root);
return temp;
}
struct node* temp = minValueNode(root->right);
root->key = temp->key;
root->right = deleteNode(root->right, temp->key);
}
return root;
}

int main()
{

struct node *root = NULL;

printf("Daraxt tugunlari soni: ");
int n;
cin>>n;
printf("Daraxt tugunlarini kiriting: \n");
for(int i=0; i<n; i++)
{
float temp;
cin>>temp;
root = insert(root, temp);
}
inorder(root);
cout<<endl;
struct node *t_left = root->left;
struct node *t_right = root->right;
if((root->key)-(t_left->key) < (t_right->key)-(root->key)){
node_view(t_left);
}
else{
node_view(t_right);
}
return 0;
}

Barcha IT soxasida talim olayotganlar yani TATU da o'qiyotgan ko'pchilik 50-60% Talabalarga uy vazifa (deadline) va mustaqil ishlar ko'payib unga vaqti yetmayapti yoki uni Bajara olmayotkanlar uchun xam biz ularga yordam qilamiz. ( Kelishuv asosida muddat va misolni qiyinlik darajasi bo'yicha ishlab beradigon, bizda tajribali dasturchilar mavjud )
Murojat uchun :
Admin: @Frozen_ice
Channel: @uz_python

2)

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
struct node
{
int key;
struct node *left, *right;
};
struct node *newNode(int item)
{
struct node *temp = (struct node *)malloc(sizeof(struct node));
temp->key = item;
temp->left = temp->right = NULL;
return temp;
}
int height(node *tree, int d){
if (tree->key == d) return 0;
else {
if (d > tree->key) return height(tree->right,d)+1;
else return height(tree->left,d)+1;
}
}
int intrave(node *tree){
if(tree!=NULL) {
intrave(tree->left);
cout<<tree->key<<" ";
intrave(tree->right);
}
return 0;
}


struct node* insert(struct node* node, int key)
{
if (node == NULL) return newNode(key);
if (key < node->key)
node->left = insert(node->left, key);
else
node->right = insert(node->right, key);
return node;
}


int main()
{

struct node *root = NULL;

printf("Daraxt tugunlari soni: ");
int n;
cin>>n;
printf("Daraxt tugunlarini kiriting: \n");

for(int i=0; i<n; i++)
{
float temp;
cin>>temp;
root = insert(root, temp);
}
int a;
cout<<"Kerakli tugun kalit qiymatini kiriting: "; cin>>a;

intrave(root);
cout<<endl;
cout<<"Berilgan tugungacha masofa: "<<height(root,a);

return 0;
}