Programming Quiz Channel
Kanalga Telegramāda oātish
Programming quizzes and knowledge tests Short quizzes on programming, logic and computer science. Test and improve your coding knowledge. Join š https://rebrand.ly/bigdatachannels DMCA: @disclosure_bds Contact: @mldatascientist
Ko'proq ko'rsatish803
Obunachilar
+124 soatlar
+27 kun
+1230 kun
Ma'lumotlar yuklanmoqda
O'xshash kanallar
Ma'lumot yo'q
Muammo bormi? Iltimos, sahifani yangilang yoki bizning qo'llab-quvvatlash boshqaruvchimizga murojaat qiling>.
Taglar buluti
Ma'lumot yo'q
Muammo bormi? Iltimos, sahifani yangilang yoki bizning qo'llab-quvvatlash boshqaruvchimizga murojaat qiling>.
Kirish va chiqish esdaliklari
---
---
---
---
---
---
Obunachilarni jalb qilish
Oktabr '26Okt '26
Oktabr '26
+24
2 kanalda
Sentabr '26
+27
4 kanalda
Get PRO
Avgust '26
+33
3 kanalda
Get PRO
Iyul '26
+30
2 kanalda
Get PRO
Iyun '26
+51
4 kanalda
Get PRO
May '26
+38
3 kanalda
Get PRO
Aprel '26
+55
5 kanalda
Get PRO
Mart '26
+68
5 kanalda
Get PRO
Fevral '26
+167
5 kanalda
Get PRO
Yanvar '260
0 kanalda
Get PRO
Dekabr '250
0 kanalda
Get PRO
Noyabr '250
0 kanalda
Get PRO
Oktabr '250
0 kanalda
Get PRO
Sentabr '250
0 kanalda
Get PRO
Avgust '250
0 kanalda
Get PRO
Iyul '250
0 kanalda
Get PRO
Iyun '250
0 kanalda
Get PRO
May '250
0 kanalda
Get PRO
Aprel '250
0 kanalda
Get PRO
Mart '250
0 kanalda
Get PRO
Fevral '25
+23
0 kanalda
Get PRO
Yanvar '25
+53
0 kanalda
Get PRO
Dekabr '24
+132
0 kanalda
Get PRO
Noyabr '24
+293
0 kanalda
| Sana | Obunachilarni jalb qilish | Esdaliklar | Kanallar | |
| 26 Oktabr | +1 | |||
| 25 Oktabr | 0 | |||
| 24 Oktabr | +1 | |||
| 23 Oktabr | 0 | |||
| 22 Oktabr | +1 | |||
| 21 Oktabr | +1 | |||
| 20 Oktabr | 0 | |||
| 19 Oktabr | +1 | |||
| 18 Oktabr | +2 | |||
| 17 Oktabr | 0 | |||
| 16 Oktabr | +1 | |||
| 15 Oktabr | +2 | |||
| 14 Oktabr | +1 | |||
| 13 Oktabr | 0 | |||
| 12 Oktabr | 0 | |||
| 11 Oktabr | 0 | |||
| 10 Oktabr | +2 | |||
| 09 Oktabr | +2 | |||
| 08 Oktabr | +2 | |||
| 07 Oktabr | 0 | |||
| 06 Oktabr | 0 | |||
| 05 Oktabr | +1 | |||
| 04 Oktabr | 0 | |||
| 03 Oktabr | +3 | |||
| 02 Oktabr | +1 | |||
| 01 Oktabr | +2 |
Kanal postlari
In a distributed system, what is the main purpose of a message queue such as RabbitMQ or Kafka?
| 2 | A device has an IPv4 address of 192.168.1.25/24. Which address is the network address? | 94 |
| 3 | What does a Python function return if it reaches the end without encountering a return statement? | 94 |
| 4 | Which approach is most appropriate for preventing a single database from becoming a bottleneck when read traffic grows significantly? | 110 |
| 5 | Which HTML element is used to create a hyperlink? | 507 |
| 6 | Which technique is commonly used to distribute incoming requests across multiple servers? | 116 |
| 7 | Which practice most directly reduces the risk of SQL injection in an application? | 123 |
| 8 | Which protocol is primarily responsible for translating domain names such as example.com into IP addresses? | 121 |
| 9 | What is the result of typeof null in JavaScript? | 584 |
| 10 | How does @staticmethod differ from @classmethod in Python? | 622 |
| 11 | What is a common reason to introduce a circuit breaker pattern between services? | 117 |
| 12 | What does the spread operator do when used on an object, like {...obj}? | 569 |
| 13 | Why is idempotent design particularly important with at-least-once delivery message queues? | 119 |
| 14 | What does horizontal scaling mean? | 117 |
| 15 | Why might a system use a Content Delivery Network (CDN)? | 515 |
| 16 | What is a common cause of an N+1 query problem in an application using an ORM? | 530 |
| 17 | What is the time complexity of this function, and why does it differ from naive recursive Fibonacci? | 115 |
| 18 | Topic: Data Structures & Algorithms
š Quick look before the question:
def mystery(n, memo={}):
if n in memo:
return memo[n]
if n <= 1:
return n
memo[n] = mystery(n-1, memo) + mystery(n-2, memo)
return memo[n]
print(mystery(30)) | 97 |
| 19 | What is the main goal of the Liskov Substitution Principle? | 106 |
| 20 | What happens when this code runs? | 113 |
