This page contains the reliably extracted subset, not the complete original paper.
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 27 published solutions
Question 142 MCQ · 4.0 marks
Given the data points in the previous question, let’s say we want to cluster them via (vanilla) soft k-
means instead of the hard k-means algorithm. Let the stiffness parameter β be 1. Then, in the first
iteration where the centroids are C1=(0,0) and C2=(4,4), what is C1’s and C2’s respective
responsibility for the data point P=(1,1)?
**BBN**
**Section Id :** 64065333978
**Section Number :** 8
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 27
**Number of Questions to be attempted :** 27
**Section Marks :** 50
**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.
Ms.AAA wants to identify in which of the three networks given below, the bi-fan subgraph is a
motif. For that, Ms. AAA generated hundreds of random graphs keeping the number of nodes,
edges and node degrees the same. The distribution of number of bi-fan subgraphs present in the
random networks is shown below in blue color and the vertical red line indicate the respective
network’s subgraph count. Based on your assessment of the distributions below, in which graph(s)
is the bi-fan subgraph a motif?
6406531739399.
Graph - A
6406531739400.
Graph - B
6406531739401.
Graph - C
6406531739402.
All of these
A published solution is not available for this question yet.
The number of stuck/blocked reactions in the microbes ‘**A**’, ‘**B**’ and ‘**C**’ respectively when grown
alone are 29, 18 and 24. When ‘**A**’ and ‘**B**’ are grown together the number of stuck reactions is
reduced to 25 for ‘**A**’ and 11 for ‘**B**’. Also, when all the microbes are grown together, ‘**A**’ has 24 stuck
reactions and ‘**B**’ has 9 stuck reactions. Which of the following statements is/are true?
We have a graph constructed by comparing n DNA sequences. If the two sequences can be
aligned with a final score greater than a threshold, there exists an edge between the two in the
graph. Given this, which of the following is true?
6406531739419.
Inserting a new node to the graph requires n comparisons
6406531739420.
Inserting a new node is a node level task
6406531739421.
If all the alignments have the same score, the resultant graph is a complete
graph
6406531739422.
There will be two connected components in the resultant graph
A published solution is not available for this question yet.
Consider the below given gene interaction networks for 4 conditions (2 normal and 2 diseased).
The housekeeping (HI) and the disease (DI) specific interactions of the given networks are
Given the two sequences “AGAGCTTA”, “AAGGTTGA”, and the scoring paradigm: **matches: “+2”,**
**mismatches: “-3”** and **gap: “-1”**, find the final score for the best global alignment between the two
sequences.
6406531739447.
10
6406531739448.
5
6406531739449.
2
6406531739450.
-8
A published solution is not available for this question yet.
