CS-6105 - Discrete Mathematics oed answer key
Showing 261 to 280 of 326 total answers.
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
A graph F is a ___if and only if between any pair of vertices in F there is at most ___
Answer
forest - one path
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
Which of the following is does not make use of discrete mathematics in its application?
Answer
None of these
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
Injective function is a function where in no two elements are mapped into the same image
Answer
True
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
A bijective function is a function wherein no two elements are mapped into the same image
Answer
False
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
Indicate which, if any, of the following graphs G = (V, E, φ), |V | = 5, is not connected.
Answer
φ = ( a {1,2} b {2,3} c {1,2} d {1,3} e {2,3} f {4,5} )
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
Relations may exist between objects of the same set or between objects of two or more sets
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
A Tautology is a formula which is always true for every value of its propositional variables
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
In the function f: A →B,f is the function while A is called the domain and B is the codomain
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be formed?
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
This is about considering the meaning and personal value of a product in a particular culture
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
For a function f : N → N, a ______ definition consists of an ________ together with a _________
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
When a connected graph can be drawn without any edges crossing, it is called ________________ .
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
A Contradiction is a formula which is always true for every value of its propositional variables
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
An argument is said to be valid if the conclusion must be true whenever the premises are all true.
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
This is an application of discrete mathematics that defines the rules by which a computer operates
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
Two statements are said to be logically equivalent if their truth tables have the same truth values
#CS-6105
Awesome StudentQuestion • Discrete Mathematics
A is a subset of B, if A is contained in B or every element of A is in B This type of set is called a
#CS-6105
Awesome StudentQuestion • Discrete Mathematics