Complete the below given code (in line 1) to get the total number of triangular sub-graphs in any
given network. The input to the code is a networkx graph.
Four genes ‘e’, ‘f’, ‘g’ and ‘h’ are considered for studying the lethal phenotypes of a microbe. When
the genes are deleted separately, the microbe survives. But, when the genes ‘e’ and ‘h’ are deleted
together, the microbe dies. Similarly, when the genes ‘f’ and ‘g’ are deleted together, the microbe
dies. Which of the following are lethal phenotypes?
Task-specific labels are scarce during the training phase. The pretraining helps to develop a
general understanding of related tasks with abundant unlabelled data. Then, fine-tuning can be
performed for a downstream task of interest. For the molecular property prediction task, which of
the following are valid pretraining strategies.
6406531895071.
Reconstructing the adjacency matrix for each graph using an encoder-decoder
approach
6406531895072.
Mask nodes and predict the features of masked nodes during training
6406531895073.
Predict the structural similarity between different graphs
6406531895074.
Use subgraphs to predict surrounding graph structures
A published solution is not available for this question yet.
Dr. A has a hypothesis that betweenness centrality is a very good determiner of a node’s
importance in a network and that targeting top betweenness centrality nodes will be a successful
strategy to quickly disrupt a network. Can you suggest some computational experiments that Dr.
A should perform to test the validity of her hypothesis?
**NOTE:** Your answer should not exceed 150 words.
A published solution is not available for this question yet.
Consider a bipartite graph to study disease spread (GPL). One group of nodes indicate persons and
the other group indicate locations. Edge connecting a person with a locality indicate that the
person has been to the particular locality. Edge labels indicate at what time the person was
present in the given locality. Using this graph, devise a strategy to:
a) Impose time stratified lockdowns during a pandemic
b) Identify super spreader. (Super spreader is the person who can transmit a disease to a large
number of people)
c) Identify which road to block at what time to control the spread
**NOTE:** Your answer should not exceed 150 words.
A published solution is not available for this question yet.
Pattern lock is a commonly used security measure to protect Android devices. A typical pattern
lock has 9 nodes in it (Graph A). Any pattern drawn on these nodes is a graph and will have
following properties: 1) It has a single connected component 2) it is a directed graph 3) Only one
directed edge is possible between two nodes. Mr(s) AAA found that because of the given spatial
arrangement of nodes few combinations would be missed. For example, node ‘3’ cannot have an
edge with nodes ‘1’, ‘7’ and ‘9’ given that the path did not cover these nodes. Hence Mr(s) AAA
came up with a new spatial arrangement with a lesser number of nodes (Graph B). No three nodes
in Graph B lie on a same line. How can Mr(s) AAA prove that Graph B is more secure than Graph A.
Here, more secure refers to more possible combinations of nodes.
**NOTE:** Your answer should not exceed 150 words.
A published solution is not available for this question yet.
Elucidate the final sequence that is obtained using the following set of the k-mers: {‘ATCG’, ‘TACA’,
‘TCGG’, ‘CGGT’, ‘CAAC’, ‘GGTA’, ‘GTAC’, ‘ACAA’, ‘AACT’, ‘ACTC’}.
A published solution is not available for this question yet.
Highlight the differences between inductive and transductive node embedding and mention their
limitations.
**NOTE:** Your answer should not exceed 150 words.
A published solution is not available for this question yet.
Provide an overview for the graph classification problem
a) Describe the training dataset
b) Objective of graph classification
c) Loss function
d) Parameter learning
e) Key elements of the Graph Neural Network model
**NOTE:** Your answer should not exceed 150 words.
A published solution is not available for this question yet.
What is the best local alignment score for the sequences "GTACTG" and "TAGT" with the scoring
scheme: **matches** = +2, **mismatches** = -1, and a constant gap penalty = -10.
6406531895095.
3
6406531895096.
4
6406531895097.
5
6406531895098.
6
A published solution is not available for this question yet.
Consider the following statements:
**Assertion (A):** Eulerian Path algorithm is preferred over the Hamiltonian Path algorithm for the
genome assembly problem.
**Reason (R):** A Hamiltonian Path is defined as the path that passes through all the nodes of a
graph.
Now, which of the following options is true?:
6406531895100.
Both A and R are true and R is the correct explanation for A
6406531895101.
Both A and R are true and R is not the correct explanation for R
6406531895102.
A is true but R is false
6406531895103.
Both the statements are false
A published solution is not available for this question yet.
**Fin Forensics**
**Section Id :** 64065338436
**Section Number :** 9
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 41
**Number of Questions to be attempted :** 41
**Section Marks :** 40
**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.
