Questions 11–20 of 35. Imported answers require independent review unless marked reviewed.

Topic practice 35 questionsPage 2 of 4

Question 17

Open question
CSMCQ1 markNeeds review
Let

be the adjacency matrix of a simple undirected graph

. Suppose

is its own inverse. Which one of the following statements is always TRUE?
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 32

Open question
CS1NAT1 markNeeds review
Let

and

be non-empty finite sets such that there exist one-to-one and onto functions (i) from

to

and (ii) from

to

. The number of possible values of

is __________

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 34

Open question
CS1NAT1 markNeeds review
The number of spanning trees in a complete graph of 4 vertices labelled A, B, C, and D is __________

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 34

Open question
CSNAT1 markNeeds review
Let

be the partial order defined on the set

as follows

The number of total orders on

that contain

is ________

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 51

Open question
CS1MSQ2 marksNeeds review
The chromatic number of a graph is the minimum number of colours used in a proper coloring of the graph. Let

be any graph with

vertices and chromatic number

. Which of the following statements is/are always TRUE?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 52

Open question
CS1MSQ2 marksNeeds review
Consider the operators ◊ and □ defined by

,

, for positive integers. Which of the following statements is/are TRUE?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 60

Open question
CSNAT2 marksNeeds review
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is ________
Diagram for Computer Science and Information Technology question 60


Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 63

Open question
CSNAT2 marksNeeds review
Let

be the group of integers

with addition modulo

as the group operation. The number of elements in the group

that are their own inverses is ________

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 7

Open question
CSMCQ1 markNeeds review
Let p and q be two propositions. Consider the following two formulae in propositional logic.
S₁ : (¬p ∧ (p ∨ q)) → q
S₂ : q → (¬p ∧ (p ∨ q))
Which one of the following choices is correct?
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 11

Open question
CSMSQ1 markNeeds review
Consider the following sets, where

:

: Set of all

matrices with entries from the set



: Set of all functions from the set

to the set

Which of the following choice(s) is/are correct?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer