C-Dynamic Memory Allocation and Data Structure
C-Dynamic Memory Allocation and Data Structure
41. 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?
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?
- Vaj(j)=0(logn)
- Val(j)=0("n)
- Val(j)=0(n)
- Val(J)=(n logn)
42. 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?
- ABCD
- ABDC
- DCAB
- DCBA
44. In the circular array version of the queue class (with a fixed-sized array), which operations require linear time for their worst-case behavior?
- Front
- Push
- Empty
- None of these operations require linear time
45. In the linked-list version o the queue class, which operations require linear time for their worst-case behavior?
- Front
- Push
- Empty
- None of these operations require linear time.
46. In the circular array version of the queue class (with a fixed-sized array), which operations require linear time for their worst-case behavior/
- Front
- Push
- Empty
- None of these operations require linear time
47. Queue is a:
- Linear data structure
- Non lenear data structure
- Both a and b
- None of the above
49. 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 ?
- (last % 1) + CAPACITY
- (last %(1 +CAPACITY)
- (LAST +1)% CAPACITY
- last + (1% CAPACITY