C
Programming and Technical
Programming
Program
Answer the questions based on the following program
STRUCT DOUBLELIST
{
DOUBLE CLINKED
INT DET; LIST VOID
STRUCT PREVIOUS; (BE GIVEN AND A PROCEDURE TO DELETE)
STRUCT NEW; (AN ELEMENT WILL BE GIVEN)
}
DELETE(STRUCT NODE)
{NODE-PREV-NEXT NODE-NEXT;
NODE-NEXT-PREV NODE-PREV;
IF(NODE==HEAD)
NODE
}
Read Solution (Total 1)
-
- full question is
(1) STRUCT DOUBLELIST
{
DOUBLE CLINKED INT DET;
LIST VOID STRUCT PREVIOUS;
BE GIVEN AND A PROCEDURE TO DELETE STRUCT NEW;
AN ELEMENT WILL BE GIVEN
}
DELETE(STRUCT NODE)
{
NODE->PREV->NEXT=NODE-NEXT;
NODE->NEXT->PREV = NODE->PREV;
IF(NODE==HEAD) NODE
}
IN WHAT CASE THE PREV WAS
(A) ALL CASES
(B) IT DOES NOT WORK FOR LAST ELEMENT
(C) IT DOES NOT WORK FOR-----
(2)SIMILAR TYPE QUESTION
ANS is
ALL DON'T WORK FOR NON NULL VALUE - 10 years agoHelpfull: Yes(0) No(0)
C Other Question
Answer the questions based on the following program
VOID FUNCTION(INT KK)
{KK+=20;
}
VOID FUNCTION (INT K)
INT MM,N=&M
KN = K
KN+-=10;
}
What is the output of the following program
main()
{ int var=25,varp;
varp=&var;
varp p = 10;
fnc(varp)
printf("%d%d,var,varp);
}
(a) 20,55
find the output
main( )
{
static int a[ ] = {0,1,2,3,4};
int *p[ ] = {a,a+1,a+2,a+3,a+4};
int **ptr = p;
ptr++;
printf(“n %d %d %d”, ptr-p, *ptr-a, **ptr);
*ptr++;
printf(“n %d %d %d”, ptr-p, *ptr-a, **ptr);
*++ptr;
printf(“n %d %d %d”, ptr-p, *ptr-a, **ptr);
++*ptr;
printf(“n %d %d %d”, ptr-p, *ptr-a, **ptr);
}