Skip to content

Update Quiz 5 - Assessment Question on 'Practicing Graph Analytics'.md #8

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update Quiz 5 - Assessment Question on 'Practicing Graph Analytics'.md #8

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 10 additions & 10 deletions ...cs for Big Data/Quiz 5 - Assessment Question on 'Practicing Graph Analytics'.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,27 +3,27 @@
### 1. What is the number of nodes returned?

- 50,000
- 9656
- **9656
- 9756
- 8673

### 2. What’s the number of edges?

- 50,000
- 49,834
- 46,621
- **46,621
- None of the above

### 3. The number of loops in the graph is:

- 1035
- 1395
- 1221
- **1221
- 1243

### 4. The query match (n)-[r]->(m) where m <> n return distinct n, m, count(r) gives us

- the count of all non loop edges between every adjacent node pair.
- **the count of all non loop edges between every adjacent node pair.
- the count of all edges between every adjacent node pair.
- the count of all edges.
- None of the above
Expand All @@ -33,19 +33,19 @@
- a random edge
- the node with the maximum number of looping edges
- two neighboring nodes, each with a high outdegree
- the pair of nodes with the maximum number of multi-edges between them
- **the pair of nodes with the maximum number of multi-edges between them

### 6. The query match p=(n {Name:'BRCA1'})-[:AssociationType*..2]->(m) return p produces what?

- The neighbors of the node whose name is ‘BRCA1’
- The 2-neighborhood of the node whose name is ‘BRCA1’
- **The 2-neighborhood of the node whose name is ‘BRCA1’
- The neighbors’ neighbors of the node whose name is ‘BRCA1’
- The neighbors whose distance is greater than 1 and less than 2 of the node whose name is ‘BRCA1’

### 7. How many non-directed shortest paths are there between the node named ‘BRCA1’ and the node named ‘NBR1’?

- 8
- 9
- **9
- 10
- None of the above

Expand All @@ -54,11 +54,11 @@
- GRB2 and TP53
- EP300 and BRCA1
- MEPCE and EGFR
- SNCA and BRCA1
- **SNCA and BRCA1

### 9. Applying the example queries provided to you, create the degree histogram for the network. How many nodes in the graph have a degree of 3?

- 1351
- 821
- **821
- 675
- 512
- 512