Math Problem Statement
Question 34
Not yet answered
Marked out of 1.00
Flag question
Question text
Study the following arguments:
(i) Anne is smart if she knows discrete mathematics. She doesn't know discrete mathematics. Therefore, she is not smart.
(ii) All parrots like fruit. My pet bird is not a parrot. Therefore, my pet bird does not like fruit.
Then (i) is ... and (ii) is ...
Select one:
a.
logical, illogical
b.
illogical, logical
c.
illogical, illogical
d.
logical, logical
Clear my choice
Question 35
Not yet answered
Marked out of 1.00
Flag question
Question text
Given the adjacency matrix of an undirected graph
abc
a
2
1
3
b
1
1
1
c
3
1
0
How many paths of length 3 are there from the vertex b to the vertex a in this graph?
Select one:
a.
33
b.
18
c.
27
d.
21
e.
None of these
Clear my choice
Question 36
Not yet answered
Marked out of 1.00
Flag question
Question text
Match a with b so that a is congruent to b modulo 7.
a = 17
Answer 1Choose...b = -3b = -5b = -4
a = 11
Answer 2Choose...b = -3b = -5b = -4
a = 23
Answer 3Choose...b = -3b = -5b = -4
Question 37
Not yet answered
Marked out of 1.00
Flag question
Question text
The function f(x) = x3 + 2x is ___
Select one:
a.
None of these
b.
O(x2)
c.
O(x3)
d.
O(3x)
Clear my choice
Question 38
Not yet answered
Marked out of 1.00
Flag question
Question text
Study the function f (k) satisfying
f(k) = 3f(k-1) - f(k-2), and f (1) = 1, f(2) = 2.
Find f(5).
Select one:
a.
15
b.
19
c.
None of the others
d.
18
e.
21
Clear my choice
Question 39
Not yet answered
Marked out of 1.00
Flag question
Question text
How many 1s are there in the adjacency matrix representing the graph K6?
Select one:
a.
15
b.
5
c.
30
d.
36
Clear my choice
Question 40
Not yet answered
Marked out of 1.00
Flag question
Question text
A full binary tree with 31 vertices has height at most ___
Select one:
a.
16
b.
None of tthese
c.
15
d.
30
e.
5
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Logic
Graph Theory
Modulo Arithmetic
Recurrence Relations
Asymptotic Notation
Formulas
Matrix Exponentiation
Theorems
Modus Tollens
Denying the Antecedent
Suitable Grade Level
Advanced Undergraduate
Related Recommendation
Analyzing Logical Arguments: Price, Availability, and Relationship
Logical Equivalence Problems Involving Propositional Logic and Boolean Algebra
Solving Logic Puzzle: Logicians' Hat Numbers
Understanding Logical Arguments and Functions in Mathematics
Solving Problems Using Truth Tables, Mathematical Induction, and Euclid's Algorithm