Pisa

Shu Piza binosida qilingan bir necha Fizik experementlarni xaqida masalalar ishlagandim maktabda. Xaqiqatdan xam qishiq ekan.

Quyosh charaqablab turibdi Pizada xozir 11:00 va xarorat 30 daraja.

Xamma Pisa ni ushab qolishga xarakat qilyapti. :)

Physics Problem: The Leaning Tower of Pisa

The Leaning Tower of Pisa is an iconic structure that has captured the imagination of people worldwide. Suppose you are a physics enthusiast visiting the tower, and you decide to conduct an experiment to determine the angle of inclination and its implications on the tower's stability.

Problem Statement:

You have been given the task of calculating the angle of inclination of the Leaning Tower of Pisa and investigating its stability. To achieve this, you will need to gather the following information:

1. Height of the Tower: The height of the tower is approximately 56 meters (h = 56 m).
2. Distance from the Top: You measure the distance from the top of the tower to its center (d = 1.2 m).
3. Mass of the Tower: The total mass of the tower is 14,500 metric tons (m = 14,500,000 kg).
4. Acceleration due to Gravity: The acceleration due to gravity is 9.81 m/s² (g = 9.81 m/s²).

Part 1: Angle of Inclination

a) Calculate the angle of inclination (θ) of the Leaning Tower of Pisa using the given height and distance from the top to the center.

Part 2: Stability Analysis

b) Given the mass of the tower and its angle of inclination, analyze the stability of the tower. Determine whether the tower is in equilibrium or not.

c) Discuss the factors that contribute to the stability of the tower despite its inclined position.

Hints:

1. For Part 1, you can use trigonometry to calculate the angle of inclination (θ) using the height (h) and distance from the top to the center (d) of the tower.
2. For Part 2, consider the center of mass of the tower and how it relates to the base of the tower in its inclined position.

Note: When conducting experiments or calculations related to real-world structures like the Leaning Tower of Pisa, ensure to prioritize safety and respect any restrictions or guidelines set by the authorities responsible for the preservation of such landmarks.

Day 045

Kun masalalari:

🟢 257. Binary Tree Paths
🟡 513. Find Bottom Left Tree Value

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:
- cmp

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
touch file1.md
echo "Apple\nBanana\nCherry\nDurian" >> file1.md
touch file2.md
echo "Apple\nBanana\nCherry\ndurian" >> file2.md
cmp file1.md file2.md
cp file2.md file3.md
cmp file2.md file3.md

Javoblar:

🟢 606. Construct String from Binary Tree
🟡 230. Kth Smallest Element in a BST

#SDM

@khamidulla_inoyatov_microblog

Day 046

Kun masalalari:

🟢 653. Two Sum IV - Input is a BST
🟡 515. Find Largest Value in Each Tree Row

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- md5sum

DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
touch file.md
echo "We are testing md5sum" >> file.md
md5sum file.md
cp file.md file2.md
md5sum file2.md
echo " " >> file.md
md5sum file.md

Javoblar:

🟢 257. Binary Tree Paths
🟡 513. Find Bottom Left Tree Value

#SDM

@khamidulla_inoyatov_microblog

Day 047

Kun masalalari:

🟢 783. Minimum Distance Between BST Nodes
🟡 2265. Count Nodes Equal to Average of Subtree

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- shasum

*DIY:*

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
touch file.md
echo "We are testing shasum" >> file.md
shasum file.md
shasum -a 256 file.md
cp file.md file2.md
shasum file2.md
echo " " >> file2.md
shasum file2.md

Javoblar:

🟢 653. Two Sum IV - Input is a BST
🟡 515. Find Largest Value in Each Tree Row

#SDM

@khamidulla_inoyatov_microblog

Piazza Del Popolo

Men o’qigan kitob qaxramonlari mana shu Piazza Del Popolo da uchrashishadi. Shu kitob kim tomonidan yozilganligi, kitob nomi va shu erda uchrashgan qaxramonlarni otini komentda yozgan odamga Amsterdamdan kichik esdalik berib yuboraman @khumoyun_codes dan.

Day 048

Kun masalalari:

🟢 100. Same Tree
🟡 865. Smallest Subtree with all the Deepest Nodes

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- shutdown

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
sudo shutdown -h +2 "This is a scheduled reboot"


Javoblar:

🟢 783. Minimum Distance Between BST Nodes
🟡 2265. Count Nodes Equal to Average of Subtree

#SDM

@khamidulla_inoyatov_microblog

Austria 🇦🇹 dagi kamalak 🌈.

Day 049

Kun masalalari:

🟢 530. Minimum Absolute Difference in BST
🟡 103. Binary Tree Zigzag Level Order Traversal

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- write

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. Buning uchun sizga 2 ta Terminal kerak bo’ladi. Terminal 1 dan komandani bajarib, uning natijasini Terminal 2 da ham ko’rishingiz mumkin. Kerakli xabarni qoldirganingizdan so’ng Ctrl+C orqali xabar jo’natishni to’xtatishingiz mumkin

Terminal 1:

cd ~
write $(whoami)
Hello
How are you doing?

Javoblar:

🟢 100. Same Tree
🟡 865. Smallest Subtree with all the Deepest Nodes

#SDM

@khamidulla_inoyatov_microblog

Day 050

Kun masalalari:

🟢 404. Sum of Left Leaves
🟡 623. Add One Row to Tree

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- wall

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. Buning uchun sizga 2 ta Terminal kerak bo’ladi. Terminal 1 dan komandani bajarib, uning natijasini Terminal 2 da ham ko’rishingiz mumkin.

Terminal 1:

cd ~
wall "The system will be restarted in 10 minutes"


Javoblar:

🟢 530. Minimum Absolute Difference in BST
🟡 103. Binary Tree Zigzag Level Order Traversal

#SDM

@khamidulla_inoyatov_microblog

Day 051

Kun masalalari:

🟢 101. Symmetric Tree
🟡 655. Print Binary Tree

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- expr

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
expr 3 + 5
expr length ABCdef

Javoblar:

🟢 404. Sum of Left Leaves
🟡 623. Add One Row to Tree

#SDM

@khamidulla_inoyatov_microblog

Day 052

Kun masalalari:

🟢 993. Cousins in Binary Tree
🟡 107. Binary Tree Level Order Traversal II

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- nslookup

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
nslookup


Javoblar:

🟢 101. Symmetric Tree
🟡 655. Print Binary Tree

#SDM

@khamidulla_inoyatov_microblog

Day 053

Kun masalalari:

🟢 112. Path Sum
🟡 129. Sum Root to Leaf Numbers

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- dig

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
dig

Javoblar:

🟢 993. Cousins in Binary Tree
🟡 107. Binary Tree Level Order Traversal II

#SDM

@khamidulla_inoyatov_microblog

Day 054

Kun masalalari:

🟢 572. Subtree of Another Tree
🟡 106. Construct Binary Tree from Inorder and Postorder Traversal

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- ifconfig

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
ifconfig -a


Javoblar:

🟢 112. Path Sum
🟡 129. Sum Root to Leaf Numbers

#SDM

@khamidulla_inoyatov_microblog

Day 055

Kun masalalari:

🟢 111. Minimum Depth of Binary Tree
🟡 109. Convert Sorted List to Binary Search Tree

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- iftop

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
iftop
iftop -i eth0
iftop -t


Javoblar:

🟢 572. Subtree of Another Tree
🟡 106. Construct Binary Tree from Inorder and Postorder Traversal

#SDM

@khamidulla_inoyatov_microblog

Day 056

Kun masalalari:

🟢 671. Second Minimum Node In a Binary Tree
🟡 113. Path Sum II

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- bzip2

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
dd if=/dev/urandom of=bigfile.txt bs=1M count=100
bzip2 bigfile.txt
ls -lh bigfile.txt*


Javoblar:

🟢 111. Minimum Depth of Binary Tree
🟡 109. Convert Sorted List to Binary Search Tree

#SDM

@khamidulla_inoyatov_microblog

Day 057

Kun masalalari:

🟢 222. Count Complete Tree Nodes
🟡 958. Check Completeness of a Binary Tree

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- bunzip2

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
dd if=/dev/urandom of=bigfile.txt bs=1M count=100
bzip2 bigfile.txt
ls -lh bigfile.txt*

mkdir zip_files
mv bigfile.txt.bz2 zip_files/
cd zip_files
bunzip2 bigfile.txt.bz2


Javoblar:

🟢 671. Second Minimum Node In a Binary Tree
🟡 113. Path Sum II

#SDM

@khamidulla_inoyatov_microblog

Day 058

Kun masalalari:

🟢 1464. Maximum Product of Two Elements in an Array
🟡 2336. Smallest Number in Infinite Set

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- route

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
route -n
sudo route add default gw 192.168.1.1
route -n
sudo route del default gw 192.168.1.1


Javoblar:

🟢 222. Count Complete Tree Nodes
🟡 958. Check Completeness of a Binary Tree

PS. Bugundan heap (priority queue) ga bog’liq bo’lgan masalalarni ishlashni boshlaymiz. Agar savollaringiz bo’lsa, tushuncha berib o’tishimiz mumkin.

#SDM

@khamidulla_inoyatov_microblog

Day 059

Kun masalalari:

🟢 2500. Delete Greatest Value in Each Row
🟡 451. Sort Characters By Frequency

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- tcpdump

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
sudo tcpdump -i eth0
sudo tcpdump port 80

Javoblar:

🟢 1464. Maximum Product of Two Elements in an Array
🟡 2336. Smallest Number in Infinite Set

#SDM

@khamidulla_inoyatov_microblog