This is the assignment work questions on the enum datatype... ENUMS 1) #include enum week{ MON=0, TUE=1, WED=2 }; int main(){ enum week day=WED; printf("day=%d",day); } 2) #include enum status{ working=1, onboard=2, alumni=0 }; int main(){ enum status mystatus=onboard; printf("mystatus=%d",mystatus); } 3) #include enum levels{ ceo, sm, m, sse, ase, se, je }; int main(){ enum levels myrole=ase; printf("myrole=%d",myrole); } 4) #include enum levels{ ceo=1, sm, m, sse, se, je, ja }; int main(){ enum levels myrole=sse; printf("myrole=%d",myrole); } 5) #include enum levels{ ceo=5, sm, m, sse, se, je, ja }; int main(){ enum levels myrole=sse; printf("myrole=%d",myrole); } 6) #include enum levels{ ceo=5, sm, m=1, sse, se, je, ja }; int main(){ enum levels myrole=sse; printf("myrole=%d",myrole); } 7) #include enum levels{ ceo=5, sm, m=1, sse, se, je, ja }; int main(){ enum levels myrole=sm; printf("myrole=%d",myrole); } 8) #include enum Level{ LOW = 1, MEDIUM, HIGH }; int main(){ enum Level conditions= MEDIUM; switch(conditions){ case 1: printf("Low Level"); break; case 2: printf("Medium level"); break; case 3: printf("High level"); break; } } 9) #include enum Level{ LOW, MEDIUM, HIGH }; int main(){ enum Level conditions= HIGH; switch(conditions){ case 0: printf("Low Level"); break; case 1: printf("Medium level"); break; case 2: printf("High level"); break; } }
acctually we can do when negative(-9) value there calculate one's complement when positve value there (9) we can calculate Two's complement it so lenthy use formula n = -(1+n)
so value is in negative -12 #include int main() { int a = -12; printf("%d",~a); return 0; } [out put is = 11] formula n = -(1+n) -12 = -(1+(-12)) -12 = -(-11) -12 = 11 (- -) is consider here +
This is the assignment work questions on the enum datatype...
ENUMS
1)
#include
enum week{
MON=0,
TUE=1,
WED=2
};
int main(){
enum week day=WED;
printf("day=%d",day);
}
2)
#include
enum status{
working=1,
onboard=2,
alumni=0
};
int main(){
enum status mystatus=onboard;
printf("mystatus=%d",mystatus);
}
3)
#include
enum levels{
ceo,
sm,
m,
sse,
ase,
se,
je
};
int main(){
enum levels myrole=ase;
printf("myrole=%d",myrole);
}
4)
#include
enum levels{
ceo=1,
sm,
m,
sse,
se,
je,
ja
};
int main(){
enum levels myrole=sse;
printf("myrole=%d",myrole);
}
5)
#include
enum levels{
ceo=5,
sm,
m,
sse,
se,
je,
ja
};
int main(){
enum levels myrole=sse;
printf("myrole=%d",myrole);
}
6)
#include
enum levels{
ceo=5,
sm,
m=1,
sse,
se,
je,
ja
};
int main(){
enum levels myrole=sse;
printf("myrole=%d",myrole);
}
7)
#include
enum levels{
ceo=5,
sm,
m=1,
sse,
se,
je,
ja
};
int main(){
enum levels myrole=sm;
printf("myrole=%d",myrole);
}
8)
#include
enum Level{
LOW = 1,
MEDIUM,
HIGH
};
int main(){
enum Level conditions= MEDIUM;
switch(conditions){
case 1:
printf("Low Level");
break;
case 2:
printf("Medium level");
break;
case 3:
printf("High level");
break;
}
}
9)
#include
enum Level{
LOW,
MEDIUM,
HIGH
};
int main(){
enum Level conditions= HIGH;
switch(conditions){
case 0:
printf("Low Level");
break;
case 1:
printf("Medium level");
break;
case 2:
printf("High level");
break;
}
}
acctually we can do when negative(-9) value there calculate one's complement
when positve value there (9) we can calculate Two's complement
it so lenthy use formula n = -(1+n)
enum School {
CORRESPONDENT = 1,
PRINCIPAL,
HEAD_MASTER,
TEACHING_STAFF = 15,
CLERKS,
WATCHMEN,
CLEANERS,
DRIVERS
};
int main() {
enum School count = CLEANERS;
printf("%d", count);
return 0;
}
18
enum School {
CORRESPONDENT,
PRINCIPAL,
HEAD_MASTER,
TEACHING_STAFF,
CLERKS,
WATCHMEN,
CLEANERS,
DRIVERS
};
int main() {
enum School count = CLEANERS;
printf("%d", count);
return 0;
}
so value is in negative -12
#include
int main() {
int a = -12;
printf("%d",~a);
return 0;
}
[out put is = 11]
formula n = -(1+n)
-12 = -(1+(-12))
-12 = -(-11)
-12 = 11
(- -) is consider here +
we forgot bitwise not ~
#include
int main() {
int a = 10;
printf("%d",~a);
return 0;
}
[out put -> -11]
formula is n = -(1+n)
10 = -(1+10)
10 = -11
yes
Sir me contact number evvandi nenu meetho matladali
contact me at svgie.naren@gmail.com