Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
Discrete Mathematics
Formative 3
| Question | Answer |
|---|---|
| State whether the given statement is true or false For some number x, Floor(x) <= x <= Ceil(x). a) True b) False | A) True |
| State whether the given statement is true or false For some integer n such that x < n < x + 1, ceil(x) < n . a) True b) False | b) False |
| Floor(2.4) + Ceil(2.9) is equal to : a) 4 b) 6 c) 5 d) none of the mentioned | c) 5 |
| State True or False. Let n be some integer greater than 1,then floor((n-1)/n) is 1. a) True b) False | b) False |
| If X = Floor(X) = Ceil(X) then : a) X is a fractional number b) X is a Integer c) X is less than 1 d) none of the mentioned | b) X is a Integer |
| A floor function map a real number to : a) smallest previous integer b) greatest previous integer c) smallest following integer d) none of the mentioned | b) greatest previous integer |
| If x, and y are positive numbers both are less than one, then maximum value of floor(x + y) is? a) 0 b) 1 c) 2 d) -1 | b) 1 |
| If x, and y are positive numbers both are less than one ,then maximum value of ceil(x + y) is? | c) 2 |
| A ceil function map a real number to : a) smallest previous integer b) greatest previous integer c) smallest following integer d) none of the mentioned | c) smallest following integer |
| State whether the given statement is true or false The range of function f(x) = sin(x) is (-∞, ∞). a) True b) False | b) False |
| A function is defined by mapping f : A -> B such that A contains m elements and B contains n elements and m>n then number of one one functions are : | c) 0 |
| function is defined by mapping f:A->B such that A contains m elements and B contains n elements and m > n then number of bijections are : | c) 0 |
| An injection is a function which is : | b) one-one |
| A function is defined by mapping f : A -> B such that A contains m elements and B contains n elements and 1≤n≤m then number of onto functions are: | a) r=1∑r=n nCr (-1)n-r rm |
| State whether the given statement is true or false For an onto function range is equivalent to codomain. | a) True |
| A function is defined by mapping f : A -> B such that A contains m elements and B contains n elements and m ≤ n then number of one one functions are : | a) nCm x m! |
| State whether the given statement is true or false Onto function are known as injection. | b) False |
| Set A has 3 elements and set B has 4 elements then number of injections defined from A to B are? | b) 24 |
| State True or False. A bijection is a function which is many-one and onto. | b) False |
| A mapping f : X -> Y is one one if : | b) If f(x1) = f(x2) then x1 = x2 for all x1, x2 in X. |
| The big-O notation for f(n) = 2log(n!) + (n2 + 1)logn is | d) n2logn |
| If f(x) = 3x2 + x3logx, then f(x) is | b) O(x3) |
| A function is said to be ______________ if and only if f(a) = f(b) implies that a = b for all a and b in the domain of f. | b) One-to-one |
| Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + 1 and g(x) = 3x + 4. Then the composition of f and g is ____________ | a) 6x + 9 |
| The function f(x)=x+1 from the set of integers to itself is onto. Is it True or False? | a) True |
| If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________ | a) (n*n-n-2*m)/2 |
| Which of the following statements for a simple graph is correct? | a) Every path is a trail |
| Vertex that is not connected to any other vertex | Isolated vertex |
| What is the maximum number of edges in a bipartite graph having 10 vertices? | c) 25 |
| State whether the given statement is true or false Codomain is the subset of range. a) True b) False | b) False |
| The little-o notation for f(x) = xlogx is a) x b) x3 c) x2 d) xlogx | c) x2 |
| The big-Omega notation for f(x) = 2x4 + x2 – 4 is | d) x4 |
| The value of ⌊1/2.⌊5/2⌋ ⌋ is ______________ | a) 1 |
| A function is said to be ______________ if and only if f(a) = f(b) implies that a = b for all a and b in the domain of f. | b) One-to-one |
| The g -1({0}) for the function g(x)= ⌊x⌋ is ___________ | d) {x | 0 ≤ x ≤ 1} |
| For the given graph(G), which of the following statements is true? | c) The vertex connectivity of the graph is 2 |
| Number of edges that have a specific vertex as an endpoint | Degree of Vertex |
| two vertices connected with an edge | adjacent |
| A path exist between each pair of vertices. | connected graph |
| What is the number of edges present in a complete graph having n vertices? | b) (n*(n-1))/2 |
| What is domain of function f(x)= x1/2 ? | c) [0, ∞) |
| The big-theta notation for function f(n) = 2n3 + n – 1 is | c) n3 |
| The function f(x) = x3 is bijection from R to R. Is it True or False? | a) True |
| A graph with all vertices having equal degree is known as a __________ | b) Regular Graph |
| Which of the following properties does a simple graph not hold? | a) Must be connected |
| If f1(x) is O(g(x)) and f2(x) is o(g(x)), then f1(x) + f2(x) is | a) O(g(x)) |
| The big-O notation for f(n) = (nlogn + n2)(n3 + 2) is | d) O(n5) |
| For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true? | b) v = e+1 |
| Which of the following is true? a) A graph may contain no edges and many vertices b) A graph may contain many edges and no vertices | b) A graph may contain many edges and no vertices |
| What is range of function f(x) = x-1 which is defined everywhere on its domain? | a) (-∞, ∞) |
| The big-omega notation for f(x, y) = x5y3 + x4y4 + x3y5 is | c) x3y3 |
| __________ bytes are required to encode 2000 bits of data. | b) 2 |
| The inverse of function f(x) = x3 + 2 is ____________ | b) f -1 (y) = (y – 2) 1/3 |
| The domain of the function that assign to each pair of integers the maximum of these two integers is ___________ | d) Z+ X Z+ |
| In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices. | False |
| An edge that connects a vertex to itself | loop |
| If f(x) = 2x then range of the function is : | c) (0, ∞) |
| If f(x) = (x3 – 1) / (3x + 1) then f(x) is | a) O(x2) |
| Which of the following function f: Z X Z → Z is not onto? | c) f(a, b) = |b| |
Created by:
xd-xdd