Compiler Error: Constant expression required in function main. Explana

#include
main()
{
int i=1,j=2;
switch(i)
{
case 1: printf("GOOD");
break;
case j: printf("BAD");
break;
}
}

Question Posted / surenda pal singh chouhan

6 Answers
19416 Views
ME, I also Faced
E-Mail Answers

Answer Posted / surenda pal singh chouhan

Compiler Error: Constant expression required in function
main.

Explanation:
The case statement can have only constant expressions (this
implies that we cannot use variable names directly so an
error).
Note:
Enumerated types can be used in case statements.

Is This Answer Correct ?

10 Yes

2 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

Why c is called top down?

1094

Why is this loop always executing once?

999

Do you know the use of 'auto' keyword?

1129

What is %lu in c?

1180

What is the benefit of using an enum rather than a #define constant?

1172

What are structure types in C?

1049

What are the similarities between c and c++?

1002

What is adt in c programming?

1101

Write a program to replace n bits from the position p of the bit representation of an inputted character x with the one's complement. Method invertBit takes 3 parameters x as input character, p as position and n as the number of positions from p. Replace n bits from pth position in 8 bit character x. Then return the characters by inverting the bits.

4150

Why is c called c not d or e?

1048

Is anything faster than c?

969

What is the difference between text files and binary files?

1283

How can I write a function that takes a format string and a variable number of arguments?

1003

You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

3127

Is c weakly typed?

968