C-Dynamic Memory Allocation and Data Structure Questions and Answers
Practice ModeShowing 10 of 104 questions
Q41
Consider the following C-program frangment in which i,j and n are integer variables.
For (i=n, j=0; i>0; i/=2, j+=i);
Let val(j) denote the value stored in the variable J after termination of the for loop. Which one of the following is true?
Answer: Option D
Q42
If the characters 'D', 'C', 'B', 'A' are placed in a queue ( in tha oreder), and then removed one at a time, in what order will they be removed?
Answer: Option D
Q43
The number of arguments used in realloc()is
Answer: Option C
Q44
In the circular array version of the queue class (with a fixed-sized array), which operations require linear time for their worst-case behavior?
Answer: Option D
Q45
In the linked-list version o the queue class, which operations require linear time for their worst-case behavior?
Answer: Option D
Q46
In the circular array version of the queue class (with a fixed-sized array), which operations require linear time for their worst-case behavior/
Answer: Option D
Q47
Queue is a:
Answer: Option A
Q48
Queue works on the principle of
Answer: Option D
Q49
data is a circular array of CAPACITY elements, and last is an index into that array, what is the formula for the index after last ?
Answer: Option C
Q50
The end at which a new element is added to a queue is called
Answer: Option B