Bissoy.com
Doctors Medicines MCQs Q&A

What is the meaning of the following C code if output is 0?
#include#includeint main(){ struct tm *local; time_t t; t=time(NULL); local=localtime(&t); printf("%d",local->tm_isdst); return 0;}

What is the meaning of the following C code if output is 0?

#include<stdio.h>#include<time.h>int main(){ struct tm *local; time_t t; t=time(NULL); local=localtime(&t); printf("%d",local->tm_isdst); return 0;}
Correct Answer DST is not in effect

Related Questions

Which of the following should be used for freeing the memory allocated in the following C code?
#include struct p{ struct p *next; int x;};int main(){ struct p *p1 = (struct p*)malloc(sizeof(struct p)); p1->x = 1; p1->next = (struct p*)malloc(sizeof(struct p)); return 0;}
The number of distinct nodes the following struct declaration can point to is . . . . . . . .
struct node{ struct node *left; struct node *centre; struct node *right;};
The following C code results in an error. State whether true or false.
#include#includeint main(){ struct tm *local; time_t t; t=time(NULL); local=asctime(localtime(&t)); printf("%d",local->tm_wday); return 0;}
What is the output of this program? #include
using namespace std;
struct sec {
int a;
char b;
};
int main()
{
struct sec s ={25,50};
struct sec *ps =(struct sec *)&s;
cout << ps->a << ps->b;
return 0;
}
A doubly linked list is declared as struct Node{                 int Value;                 struct Note*fwd;                 struct Node * Bwd; } Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly liked list, if it is assumed that X points to neither the first nor the last node of the list?
Following declaration of an array of struct, assumes size of byte, short, int and long are 1, 2, 3 and 4 respectively. Alignment rule stipulates that n-type field must be located at an address divisible by n. the fields in a struct are not rearranged, padding is used to ensure alignment. All elements of array should be of same size. Struct complx                 Short s                 Byte b                 Long l                 Int i End complx Complx C[10] Assuming C is located at an address divisible by 8, what is the total size of C, in bytes?
Can the following C code be compiled successfully?
#include struct p{ int k; char c; float f;};int main(){ struct p x = {.c = 97, .f = 3, .k = 1}; printf("%f\n", x.f);}
What will output when you compile and run the following code?#include
struct student
{ int roll;
int cgpa;
int sgpa[8]; }; void main()
{ struct student s = { 12,8,7,2,5,9 };
int *ptr;
ptr = (int *)&s;
clrscr();
printf( "%d", *(ptr+3) );
getch(); }
Which of the following will stop the loop at the last node of a linked list in the following C code snippet?
struct node{ struct node *next;};
Consider the following two C code segment. Y and X are one- and two-dimensional arrays of size n and n × n respectively, where 2 ≤ n ≤ 10. Assume that in both code segments, elements of y are initialized to 0 and each element X[i] [j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of x are in same main memory page frame. Code segment 1:                 //initialize elements of y to 0                 //initialize elements X[i] [j] of X to i+j                       for (i = 0; i < n; i++)                                 Y[i] += X[0] [i]; Code Segment 2:                 //initialize elements of Y to 0                 //initialize elements X[i] [j] of X to i+j                        for (i = 0; i < n; i++)                                 Y[i] += X[i] [0]; Which of the following statements is/are correct? S1: Final contents of array Y will be same in both code segments S2: Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory S3: Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory