C-Dynamic Memory Allocation and Data Structure Questions and Answers
Practice ModeShowing 10 of 104 questions
Q11
Linear as well as non-linear data structure is possible in
Answer: Option D
Q12
Stack is useful for implementing
Answer: Option A
Q13
Which of the following is useful in implementing quick sort/
Answer: Option A
Q14
If the memory allocation fails, then malloc()
returns
Answer: Option A
Q15
State the incorrect statement.
Answer: Option B
Q16
The default initial value of malloc () memory allocation is
Answer: Option A
Q17
Find the output
void main ( )
{
typedef struct
{
int info;
struct node *ad;
}node;
node *p,*q;
p=malloc(sizeof(node));
q=malloc(sizeof(node));
printf("%d %d", sizeof(p), sizeof(q));
}
Answer: Option C
Q18
Find the output
void main ( )
{
printf('%d", sizeof(malloc(10)));
}
Answer: Option A
Q19
Which is not true about queue/
Answer: Option C
Q20
Linked list are not suitable for implementing
Answer: Option A