TLS Online TPP Program

#Question id: 5708


If non-disjunction occurs in meiosis I, which of the following scenario is most likely to occur?

#Part-A Aptitude & General Biotechnology
  1. Two gametes will be n+1 and two will be n-1

  2. One gametes will be n+1, two will be ā€˜n’ and one will be n-1

  3. Two gametes will be normal and two will be n-1

  4. Two gametes will be normal and two will be n+1

More Questions
TLS Online TPP Program

#Question id: 14115

#Part-B Specialized Branches in Biotechnology

Which one of the following is a database of protein sequence motifs?

TLS Online TPP Program

#Question id: 14115

#Part-A Aptitude & General Biotechnology

Which one of the following is a database of protein sequence motifs?

TLS Online TPP Program

#Question id: 14116

#Part-B Specialized Branches in Biotechnology

Which of the following statements are CORRECT when a protein sequence database is searched using the BLAST algorithm? 
P. A larger E-value indicates higher sequence similarity 
Q. E-value < 10^-10 indicates sequence homology 
R. A higher BLAST score indicates higher sequence similarity 
S. E-value > 10^10 indicates sequence homology 

TLS Online TPP Program

#Question id: 14116

#Part-A Aptitude & General Biotechnology

Which of the following statements are CORRECT when a protein sequence database is searched using the BLAST algorithm? 
P. A larger E-value indicates higher sequence similarity 
Q. E-value < 10^-10 indicates sequence homology 
R. A higher BLAST score indicates higher sequence similarity 
S. E-value > 10^10 indicates sequence homology 

TLS Online TPP Program

#Question id: 14117

#Part-B Specialized Branches in Biotechnology

Identify the character based method used for the construction of a phylogenetic tree. 
P. Maximum parsimony 
Q. Neighbor joining 
R. Maximum likelihood 
S. Bootstrapping

TLS Online TPP Program

#Question id: 14117

#Part-A Aptitude & General Biotechnology

Identify the character based method used for the construction of a phylogenetic tree. 
P. Maximum parsimony 
Q. Neighbor joining 
R. Maximum likelihood 
S. Bootstrapping