A graph is made up of:, Arrays, Vertices and Edges, Trees, Queues, A graph with no cycles is called:, Acyclic Graph, Complete Graph, Directed Graph, Dense Graph, Vertices are connected by:, Nodes, Edges, Arrays, Trees, A connected component is:, A maximal set of connected vertices, A queue, A graph with cycles, A binary tree, Number of edges in a spanning tree with n vertices is:, n − 1, 2n, n +1, n, A spanning tree contains:, cycles, Only edges, half the vertics, All vertices without cycles, In an undirected graph, the adjacency matrix is:, Diagonal, Symetric, Random, Circular, BFS stands for:, Breadth First Search, Binary First Search, Branch First Search, Basic First Search, Which graph representation is most memory-efficient for a sparse graph?, Adjacency Matrix, Adjacency List, Incidence Matrix, Edge Matrix, A connected graph with no cycles is called, Trees, Forest, complete graph, Directed Graph, which data structure is primarily used?, Stack, Queue, priority Queue, Linked List, In a graph represented using an adjacency list, the total number of adjacency entries in an undirected graph is:, v, v+E, 2E, E, A connected component is:, A maximal set of connected vertices, queue, Binary Tree, A graph with cycles, If a graph contains a cycle, then:, BFS cannot be performed, DFS cannot be performed, raph cannot be represented using an adjacency list, Topological sorting is not possible, Which graph representation provides O(1) time to check whether an edge exists between two vertices?, Adjacency List, Adjacency Matrix, Edge list, Linked list, A complete graph with 8 vertices contains how many edges?, 24, 32, 28, 56, Which statement is FALSE?, Every complete graph is connected., Every tree is connected., Every null graph has zero edges, Every connected graph is complete., A multigraph differs from a simple graph because it:, Has directed edges only, Allows parallel (multiple) edges, Has no vertices, Has weighted edges only, A simple graph with n vertices can have at most:, n² edges, n(n−1)/2 edges, n−1 edges, 2n edges, A complete graph Kn has 45 edges. Find the number of vertices., 9, 10, 11, 12, A Complete Graph is always:, Connected, Disconnected, Null, empty, Which graph has the minimum number of edges, Completed Graph, Multi Graph, Null Graph, Directed Graph, Which graph contains only one edge between any two vertices?, Multi graph, Simple graph, Null graph, Completed graph, Which algorithm can detect a cycle in a directed graph during topological sorting?, BFS, DFS, Kahn's Algorithm, Prim's Algorithm, What is the time complexity of DFS using adjacency list?, O(v²), O(E²), O(V+E), O(log V)

Graph quiz

by
Print
Embed

Leaderboard

Visual style

Options

Switch template

Continue editing: ?