unit-5 test-1

unit-5 test-1

Professional Development

15 Qs

quiz-placeholder

Similar activities

Python Quiz For Starters

Python Quiz For Starters

3rd Grade - Professional Development

17 Qs

Tout savoir sur WINDOWS Quizz 1

Tout savoir sur WINDOWS Quizz 1

Professional Development

20 Qs

TRIVIA CIBERSEGURIDAD MINTEL

TRIVIA CIBERSEGURIDAD MINTEL

Professional Development

10 Qs

Kuis Webinar Cerdas Bertelekomunikasi OTP Fraud

Kuis Webinar Cerdas Bertelekomunikasi OTP Fraud

6th Grade - Professional Development

10 Qs

Adopt me

Adopt me

KG - Professional Development

14 Qs

Microsoft 365 for Teachers

Microsoft 365 for Teachers

Professional Development

10 Qs

Introduction to AI - Healthcare & Business

Introduction to AI - Healthcare & Business

University - Professional Development

10 Qs

SEC+ Ch.8 Review Test

SEC+ Ch.8 Review Test

Professional Development

15 Qs

unit-5 test-1

unit-5 test-1

Assessment

Quiz

Computers

Professional Development

Practice Problem

Hard

Created by

PRASHANT ATMAKURI

Used 1+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex t at a distance four from the root. If t is the n-th vertex in this BFS traversal, then the maximum possible value of n is ___________.

29

30

31

32

2.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image

Consider the following directed graph:

The number of different topological orderings of the vertices of the graph is ________________.

5

6

7

8

3.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time of Depth First Search on G, when G is represented as an adjacency matrix?

O(n log n)
O(n!)
O(m^2)
O(n^2)

4.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Media Image

Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.

17

18

19

20

5.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing

longest paths from the source node to all other nodes in the graph
paths from all nodes to the source node in the graph
random paths from the source node to all other nodes in the graph
shortest paths from the source node to all other nodes in the graph

6.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

In a depth-first traversal of a graph G with n vertices,k edges are marked as tree edges. The number of connected components in G is

n - k + 1
n / k
n - k
n + k + 1

7.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Media Image

Consider the following graph among the following sequences
I. a b e g h f
II. a b f e h g
III. a b f h g e
IV. a f g h b e

I. II.

I. III. IV.

II. III. IV.

I. II. III. IV

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?