A major design consideration in a microarray experiment is the incorporation of replicates. Which
**one** of the following statements is most appropriate in stating the consequence(s) of not including
replicates in your experiment?
6406531564690.
The number of false-positive errors in detecting differentially expressed genes
will increase
6406531564691.
The number of false-negative errors in detecting differentially expressed
genes will increase
6406531564692.
No statistical analysis of the significance of the observed changes will be
possible
6406531564693.
All of these
A published solution is not available for this question yet.
Imagine you are designing an experiment to measure gene expression in the blood of patients
who have been treated with a new drug. You want to measure expression of all genes in the
genome and may want to use the data to identify novel transcripts (e.g. miRNAs) in the future.
Which method would you choose?
6406531564694.
Real-time PCR
6406531564695.
ChiP-seq
6406531564696.
Microarray analysis
6406531564697.
RNA-seq
A published solution is not available for this question yet.
Which one of the following is most appropriate option?
6406531564702.
Frameshift mutation involves the insertion or deletion of a single base in a
DNA molecule
6406531564703.
Mutagen is a substance or energy form that can cause a mutation in DNA
6406531564704.
Point Mutation involves substitution of a single nucleotide in a DNA molecule
6406531564705.
Frameshift mutation involves the insertion or deletion of a single base in a
DNA molecule, Mutagen is a substance or energy form that can cause a mutation in DNA and
Point Mutation involves substitution of a single nucleotide in a DNA molecule
6406531564706.
None of these
A published solution is not available for this question yet.
A connected graph is said to have an Eulerian path if it has zero or two vertices with odd degrees.
Given the degree distribution of the two connected graphs, Graph-A and Graph-B, find if any of
the graphs has the Eulerian path.
6406531564715.
Only Graph A
6406531564716.
Only Graph B
6406531564717.
Both Graph A and Graph B
6406531564718.
Neither of them
A published solution is not available for this question yet.
There are four connected components in a graph of 10 nodes. The number of nodes in each of
them is 2,2,3 and 3. What is the minimum number of possible edges in the graph?
6406531564735.
3
6406531564736.
10
6406531564737.
8
6406531564738.
6
A published solution is not available for this question yet.
Let ‘**A**’ be the adjacency matrix of a fully connected bi-partite graph with seven nodes. Five nodes
belong to one group, and the other two belong to the other. The matrix ‘**A**’ has rows and columns
arranged so that the first five rows (and columns) denote the nodes from one particular group. Let
n be the number of non-zero elements in the graph. Which of the following are true? Select all the
correct options.
6406531564771.
The maximum value of n is 20
6406531564772.
n is always an even number
6406531564773.
The number of non-zero elements in A[:5 , :5] is 10
6406531564774.
The minimum value of n is 10
A published solution is not available for this question yet.
The average clustering coefficient of the given network is
6406531564807.
0.66
6406531564808.
0.33
6406531564809.
0.86
6406531564810.
0.46
**Fin Forensics**
**Section Id :** 64065330381
**Section Number :** 10
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 23
**Number of Questions to be attempted :** 23
**Section Marks :** 25
**Display Number Panel :** Yes
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
Yes
**Clear Response :**
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.
