EvoNext
رفتن به کانال در Telegram
Hi, I’m Biruk! Software Engineer bridging the gap between Full-Stack Development (Frontend & Backend), Server Environments, Computer Networks, and AI-driven Digital Art. Beyond Telegram, I love sharing my technical insights & build updates.
نمایش بیشتر1 620
مشترکین
+124 ساعت
-97 روز
-4130 روز
آرشیو پست ها
1 619
Nice pdf for -cpp looping
- nested looping
- and more
👇🏿👇🏿👇🏿👇🏿👇🏿👇🏿👇🏿👇🏿👇🏿👇🏿👇🏿👇🏿👇🏿
👉🏿https://t.me/PROGRAMINGLANGUAGES1
👆🏿👆🏿👆🏿👆🏿👆🏿👆🏿👆🏿👆🏿👆🏿👆🏿👆🏿👆🏿👆🏿
1 619
CALL BY REFERENCE
#include<iostream>
using namespace std;
void add(int *y,int *z)
{
int x;
x=*y+*z;
cout<<"Add="<<x;
}
int main()
{
int a=20,b=50;
add(&a,&b);
}
The output is. ...70
1 619
CALL BY VALUE
#include<iostream>
using namespace std;
void add(int y,int z)
{
int x;
x=y+z;
cout<<"Add="<<x;
}
int main()
{
add(10,20);
}
//the output is ....30
1 619
How to find the factorial of any number using for loop.? That accept a num from user
#include<iostream>
using namespace std;
int main()
{
int no,f=1;
cout<<"Enter any number\n";
cin>>no;
for(int i=1;i<=no;i++)
{
f=f*i;
}
cout<<"Factorial="<<f;
}
<tryOnYourCompiler>
👉👉
https://t.me/PROGRAMINGLANGUAGES1
1 619
@ltc
ASCII{American standard code for information exchange}
#include<iostream>
using namespace std;
int main()
{
for(char ch='A';ch<='Z';ch++)
{
cout<<ch<<"="<<(int)ch<<"\n";
}
}
A =65
B=66
C = 67
D = 68
E = 69
F = 70
.
.
.
.
.
.
X = 88
Y = 89
Z = 90
👉👉https://t.me/PROGRAMINGLANGUAGES1
1 619
LTC2.Which of the following is incorrect method to subtract a value of 1 from the variable 'i' ?
1 619
The evaluated value this c++ statement is __» x = 2 % 2 + 2 * 2 - 2 / 2;
1 619
An example of code to demonstrate SWITCH statements
editor:[ https://t.me/PROGRAMINGLANGUAGES1]
#include <iostream>
using namespace std;
int day = 4;
switch (day) {
case 1:
cout << "Monday";
break;
case 2:
cout << "Tuesday";
break;
case 3:
cout << "Wednesday";
break;
case 4:
cout << "Thursday";
break;
case 5:
cout << "Friday";
break;
case 6:
cout << "Saturday";
break;
case 7:
cout << "Sunday";
break;
}
// Outputs "Thursday" (day 4)
source: [https://www.w3schools.com/CPP/cpp_switch.asp]
1 619
Algorithm to find whether a Number is Prime Number or Not
What is a Prime Number?
A number that's only divisible by 1 and itself is named a Prime Number. For Example, 3, 5, 7, 11 are Prime Numbers.
Note: 2 is the only even prime number.
Flowchart for Prime Number:
Algorithm
Algorithm for Prime Number:
Step 1: Start
Step 2: Initialize variables num,flag=1, j=2
Step 3: Read num from user
Step 4: If num<=1 // Any number less than 1 is not a prime number
Display "num is not a prime number"
Goto step 7
Step 5: Repeat the steps until j<[(n/2)+1]
5.1 If remainder of number divide j equals to 0,
Set flag=0
Goto step 6
5.2 j=j+1
Step 6: If flag==0,
Display num+" is not prime number"
Else
Display num+" n is prime number"
Step 7: Stop
1 619
flowchart that determines the sqare root of a quadratic equation. it starts from accepting an input from user
1 619
[ Photo ]
Step 1. Start
Step 2. Read the coefficients of the equation, a, b and c from the user.
Step 3. Calculate discriminant = (b * b) – (4 * a * c)
Step 4. If discriminant > 0:
4.1: Calculate root1 = ( -b + sqrt(discriminant)) / (2 * a)
4.2: Calculate root2 = ( -b - sqrt(discriminant)) / (2 * a)
4.3: Display “Roots are real and different”
4.4: Display root1 and root2
Step 5: Else if discriminant = 0:
5.1: Calculate root1 = -b / (2 *a)
5.2: root2 = root1
5.3: Display “Root are real and equal”
5.4: Display root1 and root2
Step 6. Else:
6.1: Calculate real = -b / (2 * a)
6.2:Calculate imaginary = sqrt(-discriminant) / (2 * a)
6.3: Display “Roots are imaginary”
6.4: Display real, “±” , imaginary, “i”
Step 7. Stop
1 619
የኳንተም ስሌት እና የኳንተም መረጃ ለኮምፒዩተር ሳይንስ፣ ሂሳብ፣ ፊዚካል ሳይንሶች እና ምህንድስና ከፍተኛ ተያያዥነት አላቸው። በኮሙኒኬሽን፣ ስሌት እና ምስጠራ ላይ አዲስ የቴክኖሎጂ ፈጠራዎችን ያሳያሉ። የኳንተም ፊዚክስ ፅንሰ-ሀሳብ በመሠረቱ ስሮቶካስቲክ ስለሆነ፣ ዘፈቀዳዊነት (randomness) እና እርግጠኛ አለመሆን (uncertainity) በኳንተም ስሌት(quantum computation)፣ በኳንተም ማስመሰል (quantum simulation) እና በኳንተም መረጃ (quantum information) ላይ ጥብቅ ግንኙነት አላቸው። ስለዚህም የኳንተም ስልተ ቀመሮች በተፈጥሮ ዘፈቀዳዊ (random) ናቸው፣ እና ኳንተም ማስመሰል የሞንቴ ካርሎ ቴክኒኮችን በስፋት ይጠቀማል። ስለዚህ ስታቲስቲክስ በኳንተም ስሌት እና ኳንተም ማስመሰል ውስጥ ትልቅ ሚና ሊጫወት ይችላል፣ይህም በተራው ደግሞ የስታቲስቲክስ ስሌትን ለመለወጥ ትልቅ አቅም ይሰጣል። በጥንታዊ ኮምፒውተሮች የውሸት ቁጥሮች (pseudorandom numbers) ብቻ ሊፈጠሩ የሚችሉ ሲሆኑ፣ ኳንተም ኮምፒውተሮች እውነተኛ የዘፈቀደ ቁጥሮችን (genuine random numbers) መፍጠር ይችላሉ። ኳንተም ኮምፒውተሮች የሚዲያን ግምገማን፣ የሞንቴ ካርሎ ውህደትን እና የማርኮቭ ሰንሰለት ማስመሰልን በአፋጣኝ ወይም በአራት ደረጃ ማፋጠን ይችላሉ።
