Posts
Data types
- Get link
- X
- Other Apps
Data Types Data Types byte used to store the small digit numbers Range = -128 to 127 short used to small numbers Range = -32768 to 32767 int used to store integer values Depends upon processor char used to store any single character uses 2 bytess in java and 1 byte in C float used to store the decimal values upto 6 decimals Place 'f' after the last digit of the number double used to store the decimal values upto 8 - 10 decimals long used to large numbers Place 'L' after the last digit of the number NOTE:- If we the given range is exceed its range value then it comes from lower to upper range repeatedly Example : - byte a=128; byte b=130; System.out.println(a+" "+b); output :- -128 -126
Operators
- Get link
- X
- Other Apps
Operators Operators Arithemetic Operators + Addition 1+2 - Subtraction 2-3 * Multiplication 3*4 / Division 4/3 % Modules 5%3 Unary Operators ++ Increament a++ or ++a -- Decrement a-- or --a + Unary Plus +a - Unary Minus -a Assignment Operators = equals a=a+b a+=b a=a-b a-=b a=a*b a*=b a=a/b a/=b a=a%b a%=b Relational Operators < Lessthan a < b > Greaterthan a > b <= Lessthan or Equal to a <= b >= Greaterthan or Equal to a >= b == Equalto a == b != Not Equal to a != b Bitwise Operators & Bitwise AND a&b | Bitwise OR a|b ! Bitwise NOT a!b Logical Operators && Logical AND a&&b || Logical OR a||b ! Logical NOT !TRUE or !FALSE
Refferal code
- Get link
- X
- Other Apps
Simplilearn ref link :- https://simpli-web.app.link/e/1gSo90jXRub Simplilearn apk :- https://simpli.app.link/getapp Udemy apk :- https://bnc.lt/get-mobile-app Great learning :- Signup to Great Learning App using my referral code "GLC03UJSUZ0T0" and Earn 100 GL Coins. Use GL coins to earn exciting rewards https://j8wy8.app.goo.gl/ivXsH928cJG4cx7F7
White
- Get link
- X
- Other Apps
class Three{ public static void main(String [] gdv){ String input1="999"; String input2="99"; int len1=input1.length(); int len2=input2.length(); int len=(len1>len2) ?len1:len2; len=len+1; int lenl=len; char []ch=new char[len]; int sum=0; int val=0; for(int i=0;i<lenl;i++){ if(i<len1&&i<len2){ val=(int)(input1.charAt(i)-48)+(input2.charAt(i)-48)+sum; if (val>9){ val%=10; sum=1; }else sum=0; ch[--len]=(char)(val+48); }else{ if(i>=len1) val=(int)(input2.charAt(i)-48+sum); else if(i>=len2) val=(int)(input1.charAt(i)-48+sum); if (val>9){ val%=10; sum=1; } else sum=0; ch[--len]=(char)(val+48); } } System.out.println("\n"); for(char c:ch) System.out.print(c); System.out.println("\n"); System.out.println(len); } }
Flames program in c
- Get link
- X
- Other Apps
/* ****flames*****/ #include<stdio.h> #include<string.h> void next(int); int main() { char name1[2003],name2[1003]; int a,b,c; printf("π€£π₯°ππ₯³πΊπ€―FLΓMΓ§πππ€©ππ‘π\n"); printf("Enter first person Name :\n"); gets(name1); printf("Enter second person Name :\n"); gets(name2); printf("\nπππππππππ\n\n"); printf("%s\nF L A M E S\n%s\n\n",name1,name2); a=strlen(name1) ; b= strlen(name2); strncat(name1,name2,b); c=a+b;//total strlen of new name1 int h,k,l; char ch; for( h=0;h<c;h++){ if(name1[h]>64&&name1[h]<91) name1[h]=name1[h]+32; }//all become small alphabet for(h=0;h<a;h++){ for(k=a;k<c;k++){ if(name1[h]==name1[k]){ ch=name1[h]; name1[k]='0'; } } if(name1[h]==ch) name1[h]='0'; }//all common values become zero int gdv=0;// to calc the remaining letters for(h=0;h<c;h++){ if(name1[h]!=
Numerology program
- Get link
- X
- Other Apps
#include<stdio.h> #include<string.h> int recc(int); void info(); int main(){ int val,y,total=0; puts("Numerology\nEnter your name :"); char a[2003]; gets(a); y = strlen(a); //printf("length of string is %d\n\n",y); printf("\nEntered name is %s\n\n",a); for(int r=0;r<y;r++){ switch(a[r]){ case 'a': case 'i': case 'j': case 'q': case 'y': case 'A': case 'I': case 'J': case 'Q': case 'Y': val =1; break; case 'b': case 'k': case 'r': case 'B': case 'K': case 'R': val =2; break; case 'c': case 'g': case 'l': case 's': case 'C': case 'G': case 'L': case 'S': val =3; break; case 'd': case 'm': case 't': case 'D': case 'M': case 'T': val =4; break; case 'e': case 'h': case 'n': case