Register
Filter

Recent questions in Engineering Mathematics

0 votes
0 answers
3401
made easy
ACCORDING TO ME , ANSWER SHOULD BE 1!!
ACCORDING TO ME , ANSWER SHOULD BE 1!!
User Avatar
0 votes
1 answer
3402
Mathematics: GATE-ME-2018
User Avatar
0 votes
1 answer
3403
Mathematics: GATE-ME-2018
User Avatar
1 votes
1 answer
3404
GATEBOOK-Combinatorics
How many license plates with 3 decimal digits followed by 3 letters do not contain both the number 0 and the letter O?
How many license plates with 3 decimal digits followed by 3 letters do not contain both the number 0 and the letter O?
User Avatar
1 votes
1 answer
3405
proposition logic
CONVERT IN TO LOGIC No one who loves some one is not loved by anyone lets S(x):x is somebody L(x,y):x loves y
CONVERT IN TO LOGICNo one who loves some one is not loved by anyonelets S(x):x is somebodyL(x,y):x loves y
User Avatar
0 votes
0 answers
3406
self doubt
isomorphism and planarity is removed from Gate CSE syllabus or not? please response as soon as possible. Thank you.
isomorphism and planarity is removed from Gate CSE syllabus or not?please response as soon as possible.Thank you.
User Avatar
0 votes
0 answers
3407
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
1 votes
0 answers
3408
SELF DOUBT
https://gateoverflow.in/39595/gate2016-2-28 CONSIDER THE FIRST SOLUTION IT EXPLAINS FOR 2ND AT LAST AND CONCLUDED THAT ATLEAST ONE VERTEX SHOULD BE OF ODD DEGREE BUT WHAT IF ALL WILL BE OF ODD ?? WILL IT BE NOT THE CASE LIKE 1.??
https://gateoverflow.in/39595/gate2016-2-28 CONSIDER THE FIRST SOLUTION IT EXPLAINS FOR 2ND AT LAST AND CONCLUDED THAT ATLEAST ONE VERTEX SHOULD BE OF ODD DEGREE BUT WHA...
User Avatar
0 votes
1 answer
3409
linear algebra
The Eigen Vectors of the Matrix $A=\begin{bmatrix} 3 &4 \\ 4 &-3 \end{bmatrix}$ are $\begin{bmatrix} a\\ 1 \end{bmatrix},\begin{bmatrix} 1\\ b \end{bmatrix}$ the $a+b=?$ Answer is given (a+b)=0 how ?????
The Eigen Vectors of the Matrix $A=\begin{bmatrix} 3 &4 \\ 4 &-3 \end{bmatrix}$ are $\begin{bmatrix} a\\ 1 \end{bmatrix},\begin{bmatrix} 1\\ b \end{bmatrix}$ the $a+b=?$...
User Avatar
0 votes
2 answers
3410
Permutation and combination
9 different books are to be arranged on a bookshelf. 4 of these books were written by Shakespeare, 2 by Dickens, and 3 by Conrad. How many possible permutations are there if the books by Conrad must be separated from one another?
9 different books are to be arranged on a bookshelf. 4 of these books were written by Shakespeare, 2 by Dickens, and 3 by Conrad. How many possible permutations are there...
User Avatar
0 votes
1 answer
3411
Cool 6-Digit Numbers
Let us call a -digit number cool if each of its digits is no less than the preceding digit. How many cool $6-$digit numbers are there? Details And Assumptions: For example, $,112446 is cool. 233043 isn't cool.
Let us call a -digit number cool if each of its digits is no less than the preceding digit. How many cool $6-$digit numbers are there?Details And Assumptions:For example,...
User Avatar
0 votes
1 answer
3412
Permutation with distinct words
How many distinct words of any (nonzero) length can be formed using the letters of $KEPLER$ at most once each? (Clarification: such a word can have two Es, but can't have duplicates of any other letter.)
How many distinct words of any (nonzero) length can be formed using the letters of $KEPLER$ at most once each?(Clarification: such a word can have two Es, but can't have ...
User Avatar
0 votes
1 answer
3413
Permutation with standard deck of cards
Given a standard deck of cards, there $52!$ are different permutations of the cards. Given two identical standard decks of cards, how many different permutations are there?
Given a standard deck of cards, there $52!$ are different permutations of the cards. Given two identical standard decks of cards, how many different permutations are ther...
User Avatar
0 votes
0 answers
3414
#math book
How many 3 digits number between 111 to 850 can be made with the digits 0,1,2,3,4,5,6,7,8,9? 1.digits are not repeated 2.digits are repeated
How many 3 digits number between 111 to 850 can be made with the digits 0,1,2,3,4,5,6,7,8,9?1.digits are not repeated2.digits are repeated
User Avatar
0 votes
0 answers
3415
Combinatorics
I think the correct answer must be (C). Please let me know what's correct. Inclusion-exclusion principle is used.
I think the correct answer must be (C). Please let me know what's correct.Inclusion-exclusion principle is used.
User Avatar
0 votes
0 answers
3416
Indistinguishable fair coin
When $6$ indistinguishable fair coins are thrown, how many different outcomes are there? Details and Assumptions: Two outcomes are the same if they contain the same number of heads.
When $6$ indistinguishable fair coins are thrown, how many different outcomes are there?Details and Assumptions: Two outcomes are the same if they contain the same number...
User Avatar
0 votes
1 answer
3417
Positive Divisors
How many positive divisors does $2000$ have? $A)12$ $B)20$ $C)30$ $D)15$
How many positive divisors does $2000$ have?$A)12$ $B)20$ $C)30$ $D)15$
User Avatar
0 votes
0 answers
3418
combinatory doubt
3 jars red colored with 5 balls, green colored with 25 balls ,blue colored with 8 balls . Find out the number of ways to select 20 balls such that selection has 2 red balls and 1 green ball? please do it with generating function ? does the solution differ if green balls are made unlimited?
3 jars red colored with 5 balls, green colored with 25 balls ,blue colored with 8 balls .Find out the number of ways to select 20 balls such that selection has 2 red ball...
User Avatar
0 votes
0 answers
3419
self doubt
How many nonisomorphic simple graphs are there with five vertices and three edges? is there is any formula for n vertices and m edges. thankyou.
How many nonisomorphic simple graphs are there with five vertices and three edges? is there is any formula for n vertices and m edges.thankyou.
User Avatar
1 votes
0 answers
3420
self doubt
How many nonisomorphic simple graphs are there with n vertices, when n is a) 2? b) 3? c) 4?
How many nonisomorphic simple graphs are there with n vertices, when n is a) 2? b) 3? c) 4?
User Avatar
Page: