Register
Filter

Hot questions in Engineering Mathematics

0 votes
0 answers
4531
GATE 2016 MA Limits
User Avatar
1 votes
0 answers
4533
Ace test series
A medical student has to work in a hospital for five days in january.However,he is not allowed to work two consecutive days in the hospital.in how many different ways can he choose the five days he will work in the hospital? A)C(27,5) B)C(26,5) C)C(27,4) D)C(26,4)
A medical student has to work in a hospital for five days in january.However,he is not allowed to work two consecutive days in the hospital.in how many different ways can...
User Avatar
0 votes
0 answers
4534
Made easy
User Avatar
3 votes
1 answer
4535
Graph Coloring
A vertex colouring with four colours of a graph G = (V, E) is a mapping V → {R, G, B, Y }. So that any two adjacent vertices does not same colour. Consider the below graphs: The number of vertex colouring possible with 4 colours are _________.
A vertex colouring with four colours of a graph G = (V, E) is a mapping V → {R, G, B, Y }. So that any two adjacent vertices does not same colour. Consider the below gr...
User Avatar
0 votes
0 answers
4536
Self Doubt
If you do every problem in this book, then you will learn discrete mathematics. You learned discrete mathematics. Therefore, you did every problem in this book. The above argument is A Valid and Satisfiable B Valid but not satisfiable C Invalid D Tautology
If you do every problem in this book, then you will learn discrete mathematics. You learned discrete mathematics. Therefore, you did every problem in this book.The above ...
User Avatar
0 votes
0 answers
4537
How to do such questions
Find the largest integer value of x satisfying the inequality ${10 \choose x-1}$ < 2${10 \choose x}$
Find the largest integer value of x satisfying the inequality ${10 \choose x-1}$ < 2${10 \choose x}$
User Avatar
0 votes
0 answers
4538
Functions Question
Let f: A -> B be a function and S and T be subsets of B. Consider the following statements about image(range): $S_2$: $f^{-1}(S\cup T)= f^-{1} (S) U f^{-1}(T)$ $S_2: f^{-1} (S \cap T ) = f^{-1}(S)\cap f^{-1}(T)$ Which of the following is equivalence relation? A $ Only R_1$ B $Only R_2$ C $Both R_1 and R_2$
Let f: A - B be a function and S and T be subsets of B. Consider the following statements about image(range): $S_2$: $f^{-1}(S\cup T)= f^-{1} (S) U f^{-1}(T)$$S_2: f^{-1}...
User Avatar
1 votes
0 answers
4541
ACE test series
A medical student has to work in a hospital for five days in January. However, he is not allowed to work two consecutive days in the hospital. In how many different ways can he choose the five days he will work in the hospital? (A) C (27, 5). (B) C(26, 5) (C) C(27, 4) (D) C(26, 4)
A medical student has to work in a hospital for five days in January.However, he is not allowed to work two consecutive days in thehospital. In how many different ways ca...
User Avatar
0 votes
0 answers
4543
Group Theory
Lets S1 and S2 be two algebric structure : S1 : {0,1,2,3,4,….,m-1},+m-1 S2 : {0,1,2,3,4,….,m-2},+m-1 +m is the addition modulo m. Which of the following are Groups ?
Lets S1 and S2 be two algebric structure :S1 : {0,1,2,3,4,….,m-1},+m-1S2 : {0,1,2,3,4,….,m-2},+m-1+m is the addition modulo m. Which of the following are Groups ?
User Avatar
0 votes
0 answers
4544
Consider an undirected random graph of eight vertices.
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\large \frac{1}{2}$. What is the probability that graph contains exactly 2 cycles of length 3?
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\large \frac{1}{2}$. What is the probability t...
User Avatar
0 votes
0 answers
4545
GATE 2012 MA Group Theory
User Avatar
0 votes
1 answer
4546
This question is from graph theory
What is the total number of vertices in a tree if there are 3n vertices of degree 2 and 2n vertices of degree n?
What is the total number of vertices in a tree if there are 3n vertices of degree 2 and 2n vertices of degree n?
User Avatar
1 votes
1 answer
4547
GATE 2008 MA LU Decomposition
User Avatar
0 votes
0 answers
4548
Doubt : ACE ots 3
Answer : Option A Doubt : 0 repeated n-1 times and a single 1 , then how <0,n> ?
Answer : Option A Doubt : 0 repeated n-1 times and a single 1 , then how <0,n ?
User Avatar
0 votes
0 answers
4550
Zeal Test Series 2019: Combinatory - Permutations And Combinations
in this type question i am finding difficulty to solve please tell me the approach with proper explanation
in this type question i am finding difficulty to solve please tell me the approach with proper explanation
User Avatar
Page: