Which of the following is untrue regarding the scoring system used in dynamic programming?

Which of the following are true? (i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation (ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function (iii) Recursion in programming languages cannot be implemented with dynamic storage allocation (iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records (v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.

A

(ii) and (v) only

B

(i), (iii) and (iv) only

C

(i), (ii) and (v)

D

(ii), (iii) and (v) only

Which of the following is untrue regarding the gap penalty used in dynamic programming?

A

Gap penalty is subtracted for each gap that has been introduced

B

Gap penalty is added for each gap that has been introduced

C

The gap score defines a penalty given to alignment when we have insertion or deletion

D

Gap open and gap extension has been introduced when there are continuous gaps (five or more)

Use of the dynamic programming method requires a scoring system for the comparison of symbol pairs, and a scheme for GAP penalties.

A

True

B

False

A feature of the dynamic programming algorithm is that the alignments obtained depend on the choice of a scoring system for comparing character pairs and penalty scores for gaps.

A

True

B

False

Which of the following is untrue regarding dynamic programming algorithm?

A

The method compares every pair of characters in the two sequences and generates an alignment

B

The output alignment will include matched and mismatched characters and gaps in the two sequences that are positioned so that the number of matches between identical or related characters is the maximum possible

C

The dynamic programming algorithm provides a reliable computational method for aligning DNA and protein sequences

D

This doesn’t allow making evolutionary predictions on the basis of sequence alignments

In dynamic programming, in ab initio methods, Often ________ base pairing and energy terms of the base pairing _____ incorporated into the scoring process.

A

G-C, are

B

G–U, are not

C

G–U, are also

D

G-C, are not

The scoring of gaps in a MSA (Multiple Sequence Alignment) has to be performed in a different manner from scoring gaps in a pair-wise alignment.

A

True

B

False

The scoring team kicks off to restart game play after scoring.

A

Fact

B

Fiction

Which of the following declaration is illegal? = “Best C programming classes by Sanfoundry”; c) char str = “Best C programming classes by Sanfoundry”; d) char str = “Best C programming classes by Sanfoundry”;

A

char *str = “Best C programming classes by Sanfoundry”;

B

char str[

To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. For implementing dynamic loading ____________

A

special support from operating system is essential

B

special support from hardware is required

C

user programs can implement dynamic loading without any special support from hardware or operating system

D

special support from both hardware and operating system is essential

Which of the following is untrue regarding the scoring system used in dynamic programming?

Related Questions