Y11 EC Introduction to Graph Theory

Y11 EC Introduction to Graph Theory

11th Grade

10 Qs

quiz-placeholder

Similar activities

Understanding Graph Representation Techniques

Understanding Graph Representation Techniques

11th Grade

10 Qs

Coding - Computer Programming

Coding - Computer Programming

KG - University

10 Qs

ADV MODELING_1

ADV MODELING_1

9th - 12th Grade

16 Qs

ONE 6th FORM Understanding Graphs and Their Types

ONE 6th FORM Understanding Graphs and Their Types

11th Grade

10 Qs

Minimal Spanning Trees (Kruscal's Algorithm)

Minimal Spanning Trees (Kruscal's Algorithm)

11th - 12th Grade

9 Qs

Exploring Graphs and Trees Quiz

Exploring Graphs and Trees Quiz

11th Grade

10 Qs

88. OCR A Level (H446) SLR14 – 1.4 Data structures part 2 – Grap

88. OCR A Level (H446) SLR14 – 1.4 Data structures part 2 – Grap

11th Grade

15 Qs

ICT 11 - Q Quiz 1 2022

ICT 11 - Q Quiz 1 2022

11th Grade

15 Qs

Y11 EC Introduction to Graph Theory

Y11 EC Introduction to Graph Theory

Assessment

Interactive Video

Computers

11th Grade

Hard

Created by

Alex Song

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the term used for the points in a graph?

Vertices

Edges

Loops

Paths

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many vertices are there in a complete bipartite graph example discussed?

Eight

Four

Ten

Six

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What type of graph allows no edges to cross each other in its drawing?

Simple graph

Planar graph

Complete graph

Connected graph

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What real-world application of graph theory was mentioned related to the Ohio State campus?

Mapping of computer networks

Design of building layouts

Decoration with graph-based tiles

Scheduling of classes

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the degree of a vertex that has three edges connected to it?

One

Three

Four

Two

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What does it mean if a graph is connected?

It can be drawn in a plane without crossing edges.

There is a path between any two vertices.

All vertices have the same degree.

It contains no loops.

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What do we call an edge that connects a vertex to itself?

Loop

Multiple edge

Directed edge

Connecting edge

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?