HackerRank Graph Quiz-1

Question 1

Time: 00:00:00
What are graphs in data structures?

mathematical structure-showing relationship between objects

mathematical structure-showing relationship between objects

flow structure-showing relationship between various objects

flow structure-showing relationship between various objects

collection of interconnected nodes having data 

collection of interconnected nodes having data 

all

all

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 2

Time: 00:00:00
Graphs are basically visualized by suing components such as:-

nodes and edges

nodes and edges

root node and leaf node

root node and leaf node

walk and trails

walk and trails

node,edges,leaf node,root node

node,edges,leaf node,root node

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 3

Time: 00:00:00
Which among the following is true?

i:)The root node does not have any ancestor  in a graph

ii:)Leaf nodes represent the nodes that do not have any successors. 

iii:)Leaf node can have any number of incoming edges but they will not have any outgoing edges.

i,ii,iii

i,ii,iii

i,ii

i,ii

i,iii

i,iii

ii,iii

ii,iii

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 4

Time: 00:00:00
How are graphs represented ?

Using Adjacency List,Linked List

Using Adjacency List,Linked List

Using Incidence Matrix,Adjacency Matrix

Using Incidence Matrix,Adjacency Matrix

Using Adjacency Matrix,Adjacency List

Using Adjacency Matrix,Adjacency List

Using Adjacency Matrix,Adjacency List,Incidence Matrix

Using Adjacency Matrix,Adjacency List,Incidence Matrix

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 5

Time: 00:00:00
What does the entries indicate in case of an incidence matrix?

whether the vertex at a column is incident to the edge at a column.

whether the vertex at a column is incident to the edge at a column.

whether the vertex at a row is incident to the edge at a column.

whether the vertex at a row is incident to the edge at a column.

whether the vertex at a column is incident to the edge at a row.

whether the vertex at a column is incident to the edge at a row.

whether the vertex at a row is incident to the edge at a row.

whether the vertex at a row is incident to the edge at a row.

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 6

Time: 00:00:00
What do you mean by adjacency in graphs?

A vertex is said to be adjacent to another vertex if there is an edge connecting them

A vertex is said to be adjacent to another vertex if there is an edge connecting them

A edge is said to be adjacent to another vertex if it is pointing inwards to the vertex

A edge is said to be adjacent to another vertex if it is pointing inwards to the vertex

A edge is said to be adjacent to another vertex if it is pointing outwards to the vertex

A edge is said to be adjacent to another vertex if it is pointing outwards to the vertex

A edge is said to be adjacent to another edge if it there is a self loop among them

A edge is said to be adjacent to another edge if it there is a self loop among them

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 7

Time: 00:00:00
A directed graph having an edge (a,b) :-

doesn’t mean that there is an edge(b,a) as well

doesn’t mean that there is an edge(b,a) as well

mean that there must be an edge(b,a) as well

mean that there must be an edge(b,a) as well

mean that an edge(b,a) must be pointing outwards

mean that an edge(b,a) must be pointing outwards

mean that an edge(b,a) must be pointing inwards

mean that an edge(b,a) must be pointing inwards

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 8

Time: 00:00:00
What is the disadvantage of using edge lookup in the adjacency matrix?

execution is really slow 

execution is really slow 

requires more space

requires more space

fails to execute for directed graphs

fails to execute for directed graphs

all

all

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 9

Time: 00:00:00
A graph make use of an adjacency list by using

arrays

arrays

linked list

linked list

arrays of linked list

arrays of linked list

all

all

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

Question 10

Time: 00:00:00
What types of edges are there in a directed graph?

bi-directional 

bi-directional 

unidirectional

unidirectional

unidirectional as well as bi-directional 

unidirectional as well as bi-directional 

all

all

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Start

["0","40","60","80","100"]
["Need more practice!","Keep trying!","Not bad!","Good work!","Perfect!"]