How many ways are there to construct a bitset?

How to declare a template in c++?

What will be the output of the following C code snippet?

```c main() { printf("%x",-1<<4); } ```

Which loop construct executes the loop body at least once, even if the condition is false?

#include <stdio.h>

#if A == 3

#define Y 5

#else

#define Y 6

#endif

int main()

{

printf("%d", Y);

return 0;

}

#include<stdio.h>

char* getstring ()

{

char str[]="Abekus";

return  str; 

}

int main()

{

printf("%s", getstring());

getchar();

return 0;

}

The mem functions are meant for __________ .

 Consider the following translation unit consisting of a global variable declaration:

struct foo x;
struct foo { int i; }

 At the point of the declaration of variable x the structure type foo is incomplete. Thus the size is unknown. Only later on in the translation unit the type is completed. Is this translation unit legal? 

Consider the following C program:

#include <stdio.h> void fun1(char *s1, char *s2) {   char *temp;   temp = s1;   s1 = s2;   s2 = temp; } void fun2(char **s1, char **s2) {   char *temp;   temp = *s1;   *s1 = *s2;   *s2 = temp; } int main() {   char *str1 = "Hi", *str2 = "Bye";   fun1(str1, str2);   printf("%s %s", str1, str2);   fun2(&str1, &str2);   printf("%s %s", str1, str2);   return 0; }

The output of the program above is