Free C++ Institute CLA-11-03 Exam Practice Questions
CLA - C Certified Associate Programmer
Total Questions: 40Focus Only on What Matters For C++ Institute CLA-11-03 Exam Preparation
Many candidates desire to prepare their C++ Institute CLA-11-03 exam with the help of only updated and relevant study material. But during their research, they usually waste most of their valuable time with information that is either not relevant or outdated. Study4Exam has a fantastic team of subject-matter experts that make sure you always get the most up-to-date preparatory material. Whenever there is a change in the syllabus of the CLA - C Certified Associate Programmer exam, our team of experts updates CLA-11-03 questions and eliminates outdated questions. In this way, we save you money and time.
C++ Institute CLA-11-03 Exam Sample Questions & Answers
Assume that ints and floats are 32-bit wide.
What happens if you try to compile and run this program?
#include
union uni {
float f, g;
int i, j;
};
int main (int argc, char *argv[]) {
union uni u;
printf ("%ld", sizeof (u) ) ;
return 0;
}
Choose the right answer:
What happens if you try to compile and run this program?
enum { A, B, C, D, E, F };
#include
int main (int argc, char *argv[]) {
printf ("%d", B + D + F);
return 0;
}
Choose the right answer:
What happens if you try to compile and run this program?
#define ALPHA 0
#define BETA ALPHA-1
#define GAMMA 1
#define dELTA ALPHA-BETA-GAMMA
#include
int main(int argc, char *argv[]) {
printf ("%d", DELTA);
return 0;
Choose the right answer:
What happens if you try to compile and run this program?
#include
int main (int argc, char *argv[]) {
int i = 1;
for(;i > 128;i *= 2);
printf("%d", i) ;
return 0;
}
-
Choose the right answer:
What happens if you try to compile and run this program?
#include
int main (int argc, char *argv[]) {
char *t = "abcdefgh";
char *p = t + 2;
int i;
p++;
p++;
printf("%d ", p[2] - p[-1]);
return 0;
}
Choose the right answer:
Review details
Country · 1 review
Currently there are no comments in this discussion, be the first to comment!