Opening the paper…

Mathematics for Data Science I, End Term

January 2023 term, 30 Apr 2023, Set QPF1-S1

Learning mode

Question 1

+3−0Numerical answer

Your answer

Report a problem

to report a problem with this question.

Choose a question

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 19

Discussion

Submit this paper?

You cannot change your answers after submitting.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 2

Instructions

The palette shows the status of every question. Pick a number to go straight to it.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 2

Save & Next moves to the next question. Answers are saved as you go.
Mark for Review & Next flags the question to come back to. A flagged answer still counts.
Clear Response removes your answer to the question on screen.
The ← and → keys move to the previous and next question.

Undirected graph on eight vertices for maximum independent set What is the weight of a minimum cost spanning tree of the given graph ? Weighted graph on vertices A to G An undirected graph *G* has 8 edges. If the degree of each vertex is 2, then find the number of vertices in *G*.