O GoConqr está de visual novo! Conte para nós o que você achou.

Quiz

Graphs

anisia molchanova 14 perguntas Atualizado em 6 abr 2017

Fazer o quiz

Este quiz tem tipos de pergunta que abrem no player de sempre.

Perguntas do quiz (14)

  1. 1Distinct edges that connect the same endpoints are called
    1. AComplete edges
    2. BMultiple edges
    3. CClosed edges
  2. 2What is the order of graph?
    1. AThe number of edges
    2. BThe number of nodes
    3. CNumber of paths
    4. DNumber of cycles
  3. 3The total number of edges containing the node u is called [blank_start]degree[blank_end] of a node u
    1. Adegree
  4. 4A graph where each vertex has he same number of neighbours (i.e. every node has the same degree) is called [blank_start]regular[blank_end] graph.
    1. Aregular
  5. 5A path is known as a [blank_start]closed[blank_end] path if the edge has the same end-points (i.e. v0 = vn)
    1. Aclosed
  6. 6In [blank_start]simple[blank_end] path all the nodes of the path are distinct with an exception that v0 may be equal to vn.
    1. Asimple
  7. 7A path in which the first and the last vertices are the same: [blank_start]cycle[blank_end]
    1. Acycle
  8. 8A graph in which there exists a path between any two nodes is called: [blank_start]connected[blank_end] graph
    1. Aconnected
  9. 9A graph G is called to be [blank_start]complete[blank_end] graph if all its nodes are fully connected.
    1. Acomplete
  10. 10A spanning tree of a weighted graph G, of minimum weight over all spanning trees of G is called: [blank_start]minimum spanning tree[blank_end]
    1. Aminimum spanning tree

Informações

Descrição
Quiz sobre Graphs, criado por anisia molchanova em 06-04-2017.
Idioma
English
Visualizações
0
Histórico
Criado em 6 abr 2017 · atualizado em 6 abr 2017
Avaliação
Ainda sem avaliações
Avalie este quiz
Avalie este quiz

Fale Conosco

Sobre o que é sua mensagem?

O que você acha do novo visual?

Você gostou?