/*
4-Variant.
Royhat yarating, Royhatga N ta haqiqiy son kiriting. Royhatning minimum elementini ochirich dasturini tuzing.
Dastur Kodi:
*/
#include <iostream>
using namespace std;
class Node{
public:
int number;
Node* next;
};
int main()
{ int n;
cout<<"Ro'yhat Elementlari sonini kiriting: \n\n";
cin>>n;
Node* head = NULL;
Node* lastPtr = NULL;
cout<<"\nRo'yhat Elementlarini kiriting: \n\n";
for(int i=0;i<n;i++){
{
Node* ptr = new Node;
int numb = -1;
cin>>numb;
ptr->number = numb;
ptr->next = NULL;
if (head == 0)
{ head = ptr;
lastPtr = ptr;
continue;
}
lastPtr->next = ptr;
lastPtr = ptr;
continue; } }
{
Node* ptr = NULL;
if (head == 0)
{
cout<<"\t!!! Ro'yhat bosh !!!\n\n";
system("PAUSE");
}
cout<<"\nRo'yhat minimal elementlari o'chirildi!: \n\n";
ptr = head;
int min=ptr->number;
Node* q = new Node;
while(ptr){
if(min>ptr->number){ min=ptr->number;}
ptr=ptr->next; }
ptr = head;
while (1) {
if(min==ptr->number) {
delete(ptr);}
else cout<<ptr->number<<" ";
if (ptr->next == 0) break;
ptr = ptr->next; }
cout<<"\n\n";
system("PAUSE"); } }
4-Variant.
Royhat yarating, Royhatga N ta haqiqiy son kiriting. Royhatning minimum elementini ochirich dasturini tuzing.
Dastur Kodi:
*/
#include <iostream>
using namespace std;
class Node{
public:
int number;
Node* next;
};
int main()
{ int n;
cout<<"Ro'yhat Elementlari sonini kiriting: \n\n";
cin>>n;
Node* head = NULL;
Node* lastPtr = NULL;
cout<<"\nRo'yhat Elementlarini kiriting: \n\n";
for(int i=0;i<n;i++){
{
Node* ptr = new Node;
int numb = -1;
cin>>numb;
ptr->number = numb;
ptr->next = NULL;
if (head == 0)
{ head = ptr;
lastPtr = ptr;
continue;
}
lastPtr->next = ptr;
lastPtr = ptr;
continue; } }
{
Node* ptr = NULL;
if (head == 0)
{
cout<<"\t!!! Ro'yhat bosh !!!\n\n";
system("PAUSE");
}
cout<<"\nRo'yhat minimal elementlari o'chirildi!: \n\n";
ptr = head;
int min=ptr->number;
Node* q = new Node;
while(ptr){
if(min>ptr->number){ min=ptr->number;}
ptr=ptr->next; }
ptr = head;
while (1) {
if(min==ptr->number) {
delete(ptr);}
else cout<<ptr->number<<" ";
if (ptr->next == 0) break;
ptr = ptr->next; }
cout<<"\n\n";
system("PAUSE"); } }
#include <iostream>
#include <cstdlib>
using namespace std;
class BinarySearchTree
{
private:
struct tree_node
{
tree_node* left;
tree_node* right;
int data;
};
tree_node* root;
public:
BinarySearchTree()
{
root = NULL;
}
bool isEmpty() const { return root==NULL; }
void print_inorder();
void inorder(tree_node*);
void print_preorder();
void preorder(tree_node*);
void print_postorder();
void postorder(tree_node*);
void insert(int);
void remove(int);
};
// kichkina elementi chap tarafga joylashtiriladi
// kattaroq elementi o'ng tarafga joylashtiriladi
void BinarySearchTree::insert(int d)
{
tree_node* t = new tree_node;
tree_node* parent;
t->data = d;
t->left = NULL;
t->right = NULL;
parent = NULL;
// bu yangi daraxtmi?
if(isEmpty()) root = t;
else
{
// Izoh: HAMMA qo'shimchalar barg tugunlari kabi
tree_node* curr;
curr = root;
// Find the Node's parent
while(curr)
{
parent = curr;
if(t->data > curr->data) curr = curr->right;
else curr = curr->left;
}
if(t->data < parent->data)
parent->left = t;
else
parent->right = t;
}
}
void BinarySearchTree::remove(int d)
{
// Elementni toping
bool found = false;
if(isEmpty())
{
cout<<" This Tree is empty! "<<endl;
return;
}
tree_node* curr;
tree_node* parent;
curr = root;
while(curr != NULL)
{
if(curr->data == d)
{
found = true;
break;
}
else
{
parent = curr;
if(d>curr->data) curr = curr->right;
else curr = curr->left;
}
}
if(!found)
{
cout<<" Bunday son mavjud emas! "<<endl;
return;
}
/*// 3 ta holat:
// 1. Biz barg tugunini olib tashlaymiz
// 2. Biz bitta bola bilan tugunni olib tashlaymiz
// 3. biz 2 bolali tugunni olib tashlaymiz
// Bitta bolali tugun*/
if((curr->left == NULL && curr->right != NULL)|| (curr->left != NULL
&& curr->right == NULL))
{
if(curr->left == NULL && curr->right != NULL)
{
if(parent->left == curr)
{
parent->left = curr->right;
delete curr;
}
else
{
parent->right = curr->right;
delete curr;
}
}
else // chap bola hozir, o'ng bola yo'q
{
if(parent->left == curr)
{
parent->left = curr->left;
delete curr;
}
else
{
parent->right = curr->left;
delete curr;
}
}
return;
}
//We're looking at a leaf node
if( curr->left == NULL && curr->right == NULL)
{
if(parent->left == curr) parent->left = NULL;
else parent->right = NULL;
delete curr;
return;
}
/* 2 farzandli tugun
// tugmani o'ng pastki satrda eng kichik qiymat bilan almashtirish */
if (curr->left != NULL && curr->right != NULL)
{
tree_node* chkr;
chkr = curr->right;
if((chkr->left == NULL) && (chkr->right == NULL))
{
curr = chkr;
delete chkr;
curr->right = NULL;
}
else // o'ng farzandning bolalari bor
{
/* agar tugunning o'ng bolasida chap bolasi bo'lsa
// Kichkina elementni topish uchun chap tomonga pastga siljiting*/
#include <cstdlib>
using namespace std;
class BinarySearchTree
{
private:
struct tree_node
{
tree_node* left;
tree_node* right;
int data;
};
tree_node* root;
public:
BinarySearchTree()
{
root = NULL;
}
bool isEmpty() const { return root==NULL; }
void print_inorder();
void inorder(tree_node*);
void print_preorder();
void preorder(tree_node*);
void print_postorder();
void postorder(tree_node*);
void insert(int);
void remove(int);
};
// kichkina elementi chap tarafga joylashtiriladi
// kattaroq elementi o'ng tarafga joylashtiriladi
void BinarySearchTree::insert(int d)
{
tree_node* t = new tree_node;
tree_node* parent;
t->data = d;
t->left = NULL;
t->right = NULL;
parent = NULL;
// bu yangi daraxtmi?
if(isEmpty()) root = t;
else
{
// Izoh: HAMMA qo'shimchalar barg tugunlari kabi
tree_node* curr;
curr = root;
// Find the Node's parent
while(curr)
{
parent = curr;
if(t->data > curr->data) curr = curr->right;
else curr = curr->left;
}
if(t->data < parent->data)
parent->left = t;
else
parent->right = t;
}
}
void BinarySearchTree::remove(int d)
{
// Elementni toping
bool found = false;
if(isEmpty())
{
cout<<" This Tree is empty! "<<endl;
return;
}
tree_node* curr;
tree_node* parent;
curr = root;
while(curr != NULL)
{
if(curr->data == d)
{
found = true;
break;
}
else
{
parent = curr;
if(d>curr->data) curr = curr->right;
else curr = curr->left;
}
}
if(!found)
{
cout<<" Bunday son mavjud emas! "<<endl;
return;
}
/*// 3 ta holat:
// 1. Biz barg tugunini olib tashlaymiz
// 2. Biz bitta bola bilan tugunni olib tashlaymiz
// 3. biz 2 bolali tugunni olib tashlaymiz
// Bitta bolali tugun*/
if((curr->left == NULL && curr->right != NULL)|| (curr->left != NULL
&& curr->right == NULL))
{
if(curr->left == NULL && curr->right != NULL)
{
if(parent->left == curr)
{
parent->left = curr->right;
delete curr;
}
else
{
parent->right = curr->right;
delete curr;
}
}
else // chap bola hozir, o'ng bola yo'q
{
if(parent->left == curr)
{
parent->left = curr->left;
delete curr;
}
else
{
parent->right = curr->left;
delete curr;
}
}
return;
}
//We're looking at a leaf node
if( curr->left == NULL && curr->right == NULL)
{
if(parent->left == curr) parent->left = NULL;
else parent->right = NULL;
delete curr;
return;
}
/* 2 farzandli tugun
// tugmani o'ng pastki satrda eng kichik qiymat bilan almashtirish */
if (curr->left != NULL && curr->right != NULL)
{
tree_node* chkr;
chkr = curr->right;
if((chkr->left == NULL) && (chkr->right == NULL))
{
curr = chkr;
delete chkr;
curr->right = NULL;
}
else // o'ng farzandning bolalari bor
{
/* agar tugunning o'ng bolasida chap bolasi bo'lsa
// Kichkina elementni topish uchun chap tomonga pastga siljiting*/
👍1
if((curr->right)->left != NULL)
{
tree_node* lcurr;
tree_node* lcurrp;
lcurrp = curr->right;
lcurr = (curr->right)->left;
while(lcurr->left != NULL)
{
lcurrp = lcurr;
lcurr = lcurr->left;
}
curr->data = lcurr->data;
delete lcurr;
lcurrp->left = NULL;
}
else
{
tree_node* tmp;
tmp = curr->right;
curr->data = tmp->data;
curr->right = tmp->right;
delete tmp;
}
}
return;
}
}
void BinarySearchTree::print_inorder()
{
inorder(root);
}
void BinarySearchTree::inorder(tree_node* p)
{
if(p != NULL)
{
if(p->left) inorder(p->left);
cout<<" "<<p->data<<" ";
if(p->right) inorder(p->right);
}
else return;
}
void BinarySearchTree::print_preorder()
{
preorder(root);
}
void BinarySearchTree::preorder(tree_node* p)
{
if(p != NULL)
{
cout<<" "<<p->data<<" ";
if(p->left) preorder(p->left);
if(p->right) preorder(p->right);
}
else return;
}
void BinarySearchTree::print_postorder()
{
postorder(root);
}
void BinarySearchTree::postorder(tree_node* p)
{
if(p != NULL)
{
if(p->left) postorder(p->left);
if(p->right) postorder(p->right);
cout<<" "<<p->data<<" ";
}
else return;
}
int main()
{
BinarySearchTree b;
int ch,tmp,tmp1;
while(1)
{
cout<<endl<<endl;
cout<<" Binary izlash daraxti operatsiyalari "<<endl;
cout<<" ----------------------------- "<<endl;
cout<<" 1. Insertion/Creation "<<endl;
cout<<" 2. In-Order Traversal "<<endl;
cout<<" 3. Pre-Order Traversal "<<endl;
cout<<" 4. Post-Order Traversal "<<endl;
cout<<" 5. Removal "<<endl;
cout<<" 6. Exit "<<endl;
cout<<" Tanlash uchun raqam kiriting : ";
cin>>ch;
switch(ch)
{
case 1 : cout<<" Qo'shish uchun son kiriting : ";
cin>>tmp;
b.insert(tmp);
break;
case 2 : cout<<endl;
cout<<" In-Order Traversal "<<endl;
cout<<" -------------------"<<endl;
b.print_inorder();
break;
case 3 : cout<<endl;
cout<<" Pre-Order Traversal "<<endl;
cout<<" -------------------"<<endl;
b.print_preorder();
break;
case 4 : cout<<endl;
cout<<" Post-Order Traversal "<<endl;
cout<<" --------------------"<<endl;
b.print_postorder();
break;
case 5 : cout<<" kiritilgan son o'chiriladi' : ";
cin>>tmp1;
b.remove(tmp1);
break;
case 6 : system("pause");
return 0;
break;
}
}
}
{
tree_node* lcurr;
tree_node* lcurrp;
lcurrp = curr->right;
lcurr = (curr->right)->left;
while(lcurr->left != NULL)
{
lcurrp = lcurr;
lcurr = lcurr->left;
}
curr->data = lcurr->data;
delete lcurr;
lcurrp->left = NULL;
}
else
{
tree_node* tmp;
tmp = curr->right;
curr->data = tmp->data;
curr->right = tmp->right;
delete tmp;
}
}
return;
}
}
void BinarySearchTree::print_inorder()
{
inorder(root);
}
void BinarySearchTree::inorder(tree_node* p)
{
if(p != NULL)
{
if(p->left) inorder(p->left);
cout<<" "<<p->data<<" ";
if(p->right) inorder(p->right);
}
else return;
}
void BinarySearchTree::print_preorder()
{
preorder(root);
}
void BinarySearchTree::preorder(tree_node* p)
{
if(p != NULL)
{
cout<<" "<<p->data<<" ";
if(p->left) preorder(p->left);
if(p->right) preorder(p->right);
}
else return;
}
void BinarySearchTree::print_postorder()
{
postorder(root);
}
void BinarySearchTree::postorder(tree_node* p)
{
if(p != NULL)
{
if(p->left) postorder(p->left);
if(p->right) postorder(p->right);
cout<<" "<<p->data<<" ";
}
else return;
}
int main()
{
BinarySearchTree b;
int ch,tmp,tmp1;
while(1)
{
cout<<endl<<endl;
cout<<" Binary izlash daraxti operatsiyalari "<<endl;
cout<<" ----------------------------- "<<endl;
cout<<" 1. Insertion/Creation "<<endl;
cout<<" 2. In-Order Traversal "<<endl;
cout<<" 3. Pre-Order Traversal "<<endl;
cout<<" 4. Post-Order Traversal "<<endl;
cout<<" 5. Removal "<<endl;
cout<<" 6. Exit "<<endl;
cout<<" Tanlash uchun raqam kiriting : ";
cin>>ch;
switch(ch)
{
case 1 : cout<<" Qo'shish uchun son kiriting : ";
cin>>tmp;
b.insert(tmp);
break;
case 2 : cout<<endl;
cout<<" In-Order Traversal "<<endl;
cout<<" -------------------"<<endl;
b.print_inorder();
break;
case 3 : cout<<endl;
cout<<" Pre-Order Traversal "<<endl;
cout<<" -------------------"<<endl;
b.print_preorder();
break;
case 4 : cout<<endl;
cout<<" Post-Order Traversal "<<endl;
cout<<" --------------------"<<endl;
b.print_postorder();
break;
case 5 : cout<<" kiritilgan son o'chiriladi' : ";
cin>>tmp1;
b.remove(tmp1);
break;
case 6 : system("pause");
return 0;
break;
}
}
}
In-Order Traversal
Pre-Order Traversal
Post-OrderTraversal
Pre-Order Traversal
Post-OrderTraversal
Python juda ko'p loyihalarda ishlatilgan.
Veb-dasturlash
▪️Zope — CMS yaratish uchun server va veb dasturlar qilish uchun dastur.
▪️Django — web yaratish qilish uchun dastur.
▪️Turbogears — web yaratish qilish uchun dastur.
▪️CherryPy — web yaratish qilish uchun dastur.
▪️Plone — saytni muhofaza qilish uchun dastur.
▪️Mailman — „Rassilka“ yaratish uchun dastur
▪️MoinMoin — viki — dvijok internet va intranet uchun.
▪️PlanetPlanet — RSS oqimini sindikatsiyalash.
Grafika
▪️Skencil — Vektor grafikasi uchun dastur.
Pythonni ishlatadigan dasturlar
▪️Wikipedia — botlarni yozish uchun ishlatadi.
▪️Civilization IV — Yaxshi strategiya oʻyin.
Pythonni ishlatadigan kompaniyalar
▪️Kosmik teleskop instituti
▪️NASA
▪️Google
▪️DreamWorks
▪️Industrial Light & Magic
▪️Firaxis Games
▪️Apple Computer
▪️CCP
🌐 @uz_python
Veb-dasturlash
▪️Zope — CMS yaratish uchun server va veb dasturlar qilish uchun dastur.
▪️Django — web yaratish qilish uchun dastur.
▪️Turbogears — web yaratish qilish uchun dastur.
▪️CherryPy — web yaratish qilish uchun dastur.
▪️Plone — saytni muhofaza qilish uchun dastur.
▪️Mailman — „Rassilka“ yaratish uchun dastur
▪️MoinMoin — viki — dvijok internet va intranet uchun.
▪️PlanetPlanet — RSS oqimini sindikatsiyalash.
Grafika
▪️Skencil — Vektor grafikasi uchun dastur.
Pythonni ishlatadigan dasturlar
▪️Wikipedia — botlarni yozish uchun ishlatadi.
▪️Civilization IV — Yaxshi strategiya oʻyin.
Pythonni ishlatadigan kompaniyalar
▪️Kosmik teleskop instituti
▪️NASA
▪️Google
▪️DreamWorks
▪️Industrial Light & Magic
▪️Firaxis Games
▪️Apple Computer
▪️CCP
🌐 @uz_python
Forwarded from Bekorchi Studentlar 👨🎓👩🎓
#Dasturlash
Python Dasturlash tili nechanchi yili kim tomonidan yaratilgan ?
Python Dasturlash tili nechanchi yili kim tomonidan yaratilgan ?
Anonymous Poll
23%
A)1995 Djeyms Gosling
56%
B)1991 Guido van Rossom
10%
C)1990 Bjane Stroustrup
10%
D)1992 Tim Berners-Li
😲Biz foydalanayotgan Telegram messenjeri 1985-yilda yaratilgan inson tiliga yaqin va mukammal bo'lgan C++ dasturlash tilida yozilgan...
👉 @uz_python 👈
👉 @uz_python 👈
@Dasturlash_Kurs.exe
26.2 MB
Python 3.8.0 versiya. Bu eng yangi versiyasi
➕ Bizga Qoshilish uchun quyidagi ssilkani bosing:
https://t.iss.one/joinchat/AAAAAE_s-1aj8aox1jaYSQ
➕ Bizga Qoshilish uchun quyidagi ssilkani bosing:
https://t.iss.one/joinchat/AAAAAE_s-1aj8aox1jaYSQ
This media is not supported in your browser
VIEW IN TELEGRAM
➖➖➖➖➖➖➖➖➖➖
🌐 PYTHON Darslari 23-qism
➖➖➖➖➖➖➖➖➖➖
PYTHON dasturida Input Funksiya
⏩ Keyingi Darsni o'tkazib yubormang!
➕ Bizga Qoshilish uchun quyidagi ssilkani bosing:
https://t.iss.one/joinchat/AAAAAE_s-1aj8aox1jaYSQ
🌐 PYTHON Darslari 23-qism
➖➖➖➖➖➖➖➖➖➖
PYTHON dasturida Input Funksiya
⏩ Keyingi Darsni o'tkazib yubormang!
➕ Bizga Qoshilish uchun quyidagi ssilkani bosing:
https://t.iss.one/joinchat/AAAAAE_s-1aj8aox1jaYSQ
This media is not supported in your browser
VIEW IN TELEGRAM
➖➖➖➖➖➖➖➖➖➖
🌐 PYTHON Darslari 24-qism
➖➖➖➖➖➖➖➖➖➖
PYTHON dasturini ya'ni .py faylni .exe ga o'zgartirish
➕ Bizga Qoshilish uchun quyidagi ssilkani bosing:
https://t.iss.one/joinchat/AAAAAE_s-1aj8aox1jaYSQ
🌐 PYTHON Darslari 24-qism
➖➖➖➖➖➖➖➖➖➖
PYTHON dasturini ya'ni .py faylni .exe ga o'zgartirish
➕ Bizga Qoshilish uchun quyidagi ssilkani bosing:
https://t.iss.one/joinchat/AAAAAE_s-1aj8aox1jaYSQ
Forwarded from Bekorchi Studentlar 👨🎓👩🎓
Media is too big
VIEW IN TELEGRAM
Assalomu alaykum qadri va qaddi baland qadrdonlarim! Mana o'zining yaxshi-yu yomon sovg'alarini ulashib oqsoch 2019-yil xayrlashish ostonasiga yetmoqda. Siz-u biz o'tayotgan yilning Alloh tomonidan ko'rsatgan kunlariga shukrona aytgan holda yangi yilni yorug' yuz bilan qarshilaylik.
2020-yil dardi borga davo, qarzi borga imkon, farzand talabga solih farzand, davlat talabga halol davlat, ilm yo'lidagi toliblarga mukammal diniy va dunyoviy bilim, baxti ochilmagan yigit-qizlarga baxtli turmush, keksalarga uzoq umr-u mustahkam iymon , ota-ona, qaynona-qaynota xizmatidagi yoshlarga insof , go'daklarga baxtli bolalik olib kelsin. Yilning har bir daqiqasi ezgu amallarimiz bilan umr sahifalarimizga zarhal harflar bilan yozilsin. Bizni sog'intirayotgan oppoq qor olamni qoplasin-u qalblarimizning qaysidir burchagida qotib qolgan qahraton sovuqligini mehr quyoshi eritib yuborsin. Yil bo'yi mehr-muhabbat quchog'idan chiqa olmaylik.
Yangi yilingiz muborak bo'lsin, azizlar.
2020-yil dardi borga davo, qarzi borga imkon, farzand talabga solih farzand, davlat talabga halol davlat, ilm yo'lidagi toliblarga mukammal diniy va dunyoviy bilim, baxti ochilmagan yigit-qizlarga baxtli turmush, keksalarga uzoq umr-u mustahkam iymon , ota-ona, qaynona-qaynota xizmatidagi yoshlarga insof , go'daklarga baxtli bolalik olib kelsin. Yilning har bir daqiqasi ezgu amallarimiz bilan umr sahifalarimizga zarhal harflar bilan yozilsin. Bizni sog'intirayotgan oppoq qor olamni qoplasin-u qalblarimizning qaysidir burchagida qotib qolgan qahraton sovuqligini mehr quyoshi eritib yuborsin. Yil bo'yi mehr-muhabbat quchog'idan chiqa olmaylik.
Yangi yilingiz muborak bo'lsin, azizlar.
This media is not supported in your browser
VIEW IN TELEGRAM
📹 PYTHON DASTURLASH TILI HAQIDA! →
👤 #YOUNG_PROGERS →
@uz_python : 📹360p
https://t.iss.one/joinchat/AAAAAE_s-1Y-4RF7zEI09g
👤 #YOUNG_PROGERS →
@uz_python : 📹360p
https://t.iss.one/joinchat/AAAAAE_s-1Y-4RF7zEI09g
Forwarded from Bekorchi Studentlar 👨🎓👩🎓
Media is too big
VIEW IN TELEGRAM
📹 IT мутахассиси бўлиш қанчалик яхши? Мотивация! →
👤 #Xabar_uz →
@BekorchiStudentlar 📹360p
👨💻👩💻👨💻👩💻👩💻👩💻👨💻👩💻👨💻👩💻👨💻👨💻
https://t.iss.one/joinchat/AAAAAFfjDpj60ozzHmLbKw
👤 #Xabar_uz →
@BekorchiStudentlar 📹360p
👨💻👩💻👨💻👩💻👩💻👩💻👨💻👩💻👨💻👩💻👨💻👨💻
https://t.iss.one/joinchat/AAAAAFfjDpj60ozzHmLbKw
This media is not supported in your browser
VIEW IN TELEGRAM
🛸Тошкентда бўлиб ўтган дронлар шоусида нечта учувчисиз қурилма учганини биласизми? Уни қанча мутахассис бошқарди? Дастур яна давом этадими? Шоуга тайёргарлик жараёнлари сизга қизиқми? Саволлар кўп, уларга жавобни репортажимиз орқали билиб олинг.
@uz_python
@uz_python
This media is not supported in your browser
VIEW IN TELEGRAM
🆕XXI asrning eng muhim kashfiyotlari...
👏 ✅ Do'stlaringizga ham ulashing:
👉 Dasturlashni biz bilan birga o'rganing:
👨💻 @uz_python 👏
👏 ✅ Do'stlaringizga ham ulashing:
👉 Dasturlashni biz bilan birga o'rganing:
👨💻 @uz_python 👏