Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n’ and there are ‘m’ number of variables in this stack. The time complexity of performing deQueue operation is (Using only stack operations like push and pop)(Tightly bound).
Which of the following statements regarding Stacks is/are True? i) The stack always grows towards higher addresses ii) The stack always grows towards lower addresses iii) The stack has a fixed size iv) The width of the stack is 32 bits
Suppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
Pushing an element into stack already having five elements and stack size of 5, then stack becomes ___________
Which of the following array element will return the top-of-the-stack-element for a stack of size N elements(capacity of stack > N)? b) S c) S d) S
Principle: A person is duty bound to act with such reasonable caution as a prudent man would have exercised under such circumstances.
Facts: The defendant 'D', built a hay stack near the boundary of his land which bordered the plaintiffs land. He had been warned several times by many in the vicinity over a period of five weeks that the manner in which he built the hay stack was dangerous. The defendant's hay stack had been built with a precautionary "chimney" to prevent the hay from spontaneously igniting, but one day it caught fire. Consequently, the hay ignited and spread to the plaintiffs land, burning down two of the plaintiffs cottages.
Is 'D' liable?
Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?
What happens when you pop from an empty stack while implementing using the Stack ADT in Java?
The visibility of a property or method can be defined by prefixing the declaration with the keywords public, protected or private. Class members declared public can be accessed everywhere. Members declared protected can be accessed only within the class itself and by inherited classes. Members declared as private are not accessible.
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