Your browser does not support JavaScript!
AMA University Answers
Login Register

Discrete Mathematics

Showing 1-75 of 326 answers

( A' )' = empty set?
  • True
  • False Correct
(A ∪ B)' = A' ∩ B' is true based on the De Morgan law
  • True Correct
  • False
¬(P ∨ Q) is logically equal to which of the following expressions?
  • ¬P ∧ ¬Q. Correct
¬P ∨ Q is equivalent to :
  • P → Q Correct
10 The truth table Is a contradiction
  • True
  • False Correct
9 The truth table Is a tautology
  • True
  • False Correct
A ___ connected graph with no cycles. (If we remove the requirement that the graph is connected, the graph is called a forest.) The vertices in a tree with degree 1 are called __
  • Tree - leaves Correct
A ___ graph has two distinct groups where no vertices in either group connecting to members of their own group
  • bipartite Correct
A ____ is a ___which starts and stops at the same vertex.
  • Euler circuit - Euler path Correct
A ______ graph has no isolated vertices
  • connected Correct
A = {10,11,12,13} and B = {13,14,15} then (A−B) = {10,11,12}
  • True Correct
  • False
A = {10,11,12,13} and B = {13,14,15} then (B−A) = {10,11,12}
  • True
  • False Correct
A = {5,2,6} and B = {2,10,31} is considered a disjoint set
  • True
  • False Correct
A = {7,1,8} and B = {100,99,54} are considered equivalent sets
  • True Correct
  • False
A = {7,1,8} and B = {8,1,9} are considered equal sets
  • True
  • False Correct
A bijective function is a function wherein no two elements are mapped into the same image
  • True
  • False Correct
A bijective function is both injective and surjective
  • True Correct
  • False
A binary relation R on a single set B is a subset ofB×B
  • True Correct
  • False
A Bipartite graph is a graph for which it is possible to divide the vertices into two disjoint sets such that there are no edges between any two vertices in the same set.
  • True Correct
A Ç Æ = Æ
  • True Correct
  • False
A ÇA' = Æ
  • True Correct
  • False
A connected graph with no cycles.
  • tree Correct
A Contradiction is a formula which is always true for every value of its propositional variables
  • True
  • False Correct
A dimension is the size of a matrix
  • True Correct
  • False
A finite set is a collection of all elements in a particular context or application
  • True
  • False Correct
A Function assigns to each element of a set, exactly one element of a related set
  • True Correct
  • False
A function can be one to one, many to one, and one to many
  • True
  • False Correct
A function table is one way to describe a function
  • True Correct
  • False
A function which renames the vertices.
  • isomorphism Correct
A graph F is a ___if and only if between any pair of vertices in F there is at most ___
  • forest - one path Correct
A graph for which it is possible to divide the vertices into two disjoint sets such that there are no edges between any two vertices in the same set.
  • Bipartite graph Correct
A graph is an ordered pair G (V, E) consisting of a nonempty set V (called the vertices) and a set E (called the edges) of two-element subsets of V.
  • true Correct
A graph is complete if there is a path from any vertex to any other vertex.
  • false Correct
A graph T is a tree if and only if between every pair of distinct vertices of T there is a unique path.
  • true Correct
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
  • finite set
  • proper subset
  • subset Correct
  • proper subset
A path which visits every vertex exactly once
  • Hamilton Path Correct
A relation can be a subset of a Cartesian product
  • True Correct
  • False
A relation can be represented by a directed graph
  • True Correct
  • False
A relation can be written as R(x,y)
  • True Correct
  • False
A Relation is a term used in mathematics to express relationship between objects
  • True Correct
  • False
A relation is considered a function even if all of the elements of the domain are assigned to the same element of the range
  • True Correct
  • False
A sequence of vertices such that consecutive vertices (in the sequence) are adjacent (in the graph). A walk in which no edge is repeated is called a trail, and a trail in which no vertex is repeated (except possibly the first and last) is called a path
  • Walk Correct
A sequence of vertices such that every vertex in the sequence is adjacent to the vertices before and after it in the sequence
  • Walk Correct
A sequence that involves a common difference in identifying the succeeding terms
  • Arithmetic Progression Correct
A set of statements, one of which is called the conclusion and the rest of which are called premises.
  • argument Correct
A simple graph has no loops nor multiple edges.
  • True Correct
A spanning tree that has the smallest possible combined weight.
  • minimum spanning tree Correct
A statement which is true on the basis of its logical form alone.
  • Tautology Correct
A surjective function is a function that "reverses" another function
  • True
  • False Correct
A survey was conducted among a group of students and it was revealed that each of the students liked at least one of the following three fruits: apples, oranges, and watermelon 34 liked apples 30 liked oranges 33 liked watermelon 11 liked apples and oranges 15 liked oranges and watermelon 17 liked apple and watermelon 10 liked all three fruitsHow many students took part in the survey?
  • 55
  • 62 Correct
  • 97
  • 95
A Tautology is a formula which is always true for every value of its propositional variables
  • True Correct
  • False
A tree is the same as a forest.
  • False Correct
A universal set is denoted by the symbol U
  • True Correct
  • False
A Venn diagram can represent the relationship between sets
  • True Correct
  • False
Additive principle states that if given two sets A and B, we have |A × B| |A| · |B|.
  • False Correct
AÈ A = ⋃
  • True
  • False Correct
AÈÆ=Æ
  • True
  • False Correct
All graphs have Euler's Path
  • false Correct
Amusing to the designer but not the user?
  • gimmick Correct
  • the light-emitting diode on the underside of mouse
  • detects fluctuating alterations in reflected light intensity
  • less susceptible to dust and dirt
An argument form which is always valid.
  • deduction rule Correct
An argument is said to be valid if the conclusion must be true whenever the premises are all true.
  • true Correct
An element is a collection of sets
  • True
  • False Correct
An empty or null set is denoted by =E2=88=85
  • True Correct
  • False
An equivalent set are sets that have the same elements
  • True
  • False Correct
An undirected graph G which is connected and acyclic is called ____________.
  • tree Correct
Arithmetic progression is the sum of the terms of the arithmetic series.
  • false Correct
As soon as one vertex of a tree is designated as the ____, then every other vertex on the tree can be characterized by its position relative to the root.
  • root Correct
At a breakfast buffet, 93 people ordered regular coffee and 47 people ordered iced coffeeIf 25 people chose both How many people visited in the buffet?
  • 165
  • 115 Correct
  • 140
  • 77
Based on the involution law, the set (A')' is equivalent to
  • ⋃
  • A Correct
  • Æ
  • B
BÈÆ = B?
  • True Correct
  • False
Bijective means both Injective and Surjective together
  • True Correct
  • False
Binary relations relate the elements of one set with those of another set and even possibly with the same set
  • True Correct
  • False
Circuits start and stop at ___
  • same vertex Correct
Color, icons, sounds, graphical elements, and animations are used to make the 'look and feel' of an interface appealing?
  • Expressive interfaces Correct
  • Impressive Interfaces
  • friendly
  • layout to allow typewriters jamming
Commutative law and associative law mean the same thing
  • True
  • False Correct
All courses