In comparison to stack algorithm, Fano’s algorithm is simpler.

Which of the following is not an advantage of Fano’s algorithm in comparison to Viterbi’s algorithm?

A

Less storage

B

Large constraint length

C

Error rate

D

Small delays

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).

A

O(m)

B

O(n)

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

A

i and iii

B

i and iv

C

ii and iv

D

iii and iv

Sentences of a paragraph are given below in jumbled order. Arrange the sentences in the right order to form a meaningful and coherent paragraph. A. This whole process of breakdown of complex components of food into simpler substances is called digestion B. These complex substances cannot be utilized as such. C. The components of food such as carbohydrates are complex substances. D. So they are broken down into simpler substances.

A

ABDC

B

CDAB

C

CBDA

D

DBCA

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?

A

A queue cannot be implemented using this stack.

B

A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.

C

A queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction.

D

A queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each.

Pushing an element into stack already having five elements and stack size of 5, then stack becomes ___________

A

Overflow

B

Crash

C

Underflow

D

User flow

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

A

S

B

N-1

C

N-1

D

N-1

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?

A

There is no duty on the defendant to be responsible for the consequential damage

B

As the hay stack had been built with a precautionary "chimney" to prevent the hay from spontaneously igniting, 'D' could be said to have taken reasonable care and hence he is not liable

C

The defendant ought to adhere to the rule which requires in all cases a regard to caution such as a man of ordinary prudence would observe and hence, 'D' is liable

D

According to the principle of strict liability, 'D' is liable to compensate the loss to his neighbour

Fano’s algorithm searches all the paths of trellis diagram at same time to find the most probable path.

A

True

B

False

Which decoding method involves the evaluation by means of Fano’s algorithm?

A

Maximum Likelihood Decoding

B

Sequential Decoding

C

Maximum a priori

D

Minimum mean square

In comparison to stack algorithm, Fano’s algorithm is simpler.

Related Questions