# Recent questions tagged engineering-maths

Hi I need other resource for calculus cause I doing now mitocw David jerison calculus course as I on 10th video I realized this course is way too far for gate exam or psu exams cause this course give detailed proof and solution for every formula for differentiation like ... can follow kreatyrx? Please help me I am very confused ? As I give this week to complete engg maths full please reply fast
Hi There is 2 book for graph theory so which book is followed because is rosen is short for graph theory and deo is very detailed so for gate which book is followed ? in rosen so there is complete detail for graph theory so if i read rosen so can i make gate related questions or not ? thank you
hi so what is least resource for calculus mainly for gate only, cause mit video is very long it is very time consuming
The function RAND() returns a positive integer from the uniform distribution lying between 1 and 100 (including both 1 and 100). Write an algorithm (in pseudo-code) using the given function RAND() to return a number from the binomial distribution with parameters (100, 1/4).
The value of ‘x’ for which all the eigen values of the matrix given below are real is 10 5+j 4 x 20 2 4 2 -10 5+j b. 5-j c.1-5j d.1+5j
Say in GATE instead of 65 questions there are 61 questions from 11 subjects where 10 subjects contain $6$ questions each and the remaining one contain $1$ question only. In how many ways the paper can be set to satisfy this constraint? Ans should be 11 right? as we need have $11\choose1$ ways
Can some one please provide the solution to the problem given in the link: https://gateoverflow.in/49479/isro2007-09 Thank you
If the mean of a normal frequency distribution of 1000 items is 25 and its standard deviation is 2.5, then its maximum ordinate is : I am getting → 1 / (2.5 * sqrt (2 * pie)) , but option seems none , I am not able to get why answer here include multiply by 1000 : https://gateoverflow.in/50517/isro2009-65
For the following set of simultaneous equations 1.5x – 0.5y +z =2 4x + 2y + 3z =9 7x + y +5z =10 The solution is unique infinitely many solutions exist the equations are incompatible finite many solutions exist Anyone please clarify.
If we consider a group (G,*) and consider two elements g and f that belongs to G then how can we define (g * f)^3? Is it like (g * f)(g * f )(g * f)? Anyone please clarify,
Is it necessary to read Convergence and Divergence and their related tests of Improper Integrals,Volume of solids of revolution,length of arc of a curve for GATE ? It seems there are no questions in these from past few years. Anyone please clarify.
What if I have a function "X" and it's inverse "Y" can I guaranteed say that the function X is bijective? Or in simple terms can I say inverse of a function exists if and only if it's bijective?
The number of onto function possible from set A={1,2,3,4,5,6} to set B={a,b,c,d} Such that f(1)=a and f(2) is not b?
Let $f(x) = 2x$ and $g(x) = sinx$. The domain and range of the composite function $gof$ is Domain is all real x and range is −1 ≤ y ≤ 1 Domain is all real x and range is −2 ≤ y ≤2 Domain is −1 ≤ y ≤ 1 and range is −1 ≤ y ≤ 1 d. Domain is all positive real values and range is -½ <= x<= ½
Hi Can someone please explain the answer to question in the below link . I am not able to understand it . Thank You https://gateoverflow.in/135069/mathematics-gate-ee-17
A Set S has 20 elements.A Subset P of S is selected at random.After inspecting the elements the elements are put back in to S and then a subset Q is selected at random.Then the probability that P and Q are disjoint is _______ (1/3)^20 (1/2)^20 (2/3)^20 (3/4)^20 Anyone please clarify.
If a Graph G have n vertices and all but one of odd degree,then no. of vertices of odd degree in G’ is ____ Assume G is a simple connected graph. Anyone please clarify.
It is given “A complete bipartite graph Km,n is planar iff m<=2 or n<=2” But it has to be m<=2 and n<=2 right? Anyone please clarify.
Can anyone explain how to identify distinct Hamiltonian edge cycles in a graph with some example? Here distinct implies w.r.t structure or w.r.t order? Suppose if we consider K3, if we consider any order like 1-2-3-1 or 1-3-2-1 or 2-3-1-2 or 2-1-3-2 or 3-1-2-3 or 3-2-1-3. All these have same structures and some are obtained by reversing some of the orders. Please clarify.
How many simple graphs are possible with n vertices and m edges (m < C(n,2))? Anyone please clarify.
How many simple non-ismorphic trees pairwise are possible with 5 vertices
Statement 1 : ∀x ∃y P(x,y) Statement 2 : ∃y ∀x P(x,y) Which of these statements implies the other and why?
Of 30 Personal Computers owned by faculty members in a certain university department,20 run windows,eight have 21 inch monitors,25 have CD-ROM drives.20 have atleast two of these features and 6 have all the three features. How many PC’s have atleast one of these features? How many have none of these features? How many have exactly one feature? Anyone please clarify.
Both $B$ and $D$ are correct, right?
Consider P(x):x is a politician and S(x): x is a sportsman In ∀x(P(x) → S(x)) we have all politicians who are sportsman and also we can have others who are non politicians but sportsman,who are non politicians and non sportsman right? Please clarify.
Is this function $y=x^{2}$ bounded between $\left [ -1,1 \right ]$? What bounded actually represents?
How to approach these kind of sums? A9 means $A^9$
If $Adj$ $A=\begin{bmatrix} -18 &-11&-10 \\ 2 & 14 &-4 \\ 4 & 5 & -8 \end{bmatrix}$, then absolute value of determinant of $A$ is __________
Find value infinite series $1+4/7+9/7^{2}+16/7^{3}+25/7^{4}+.........$
Let $S=\left \{ a,b,c,d \right \}$, and a relation $R$ on $S$ is defined by $R=\left \{ (a,b),(a,c),(a,d),(b,b),(c,a),(d,b),(d,c) \right \}.$ The number of ordered pair in transitive closure of R is ______________ Is $\left ( d,d \right )$ should be transitive closure?
Which of the following statement is valid? $A)\left \{ \forall \left \{ P\left ( x \right )\vee Q\left ( x \right ) \right \}, \forall x Q\left ( x \right ) \right \}\Rightarrow \exists x P\left ( x \right )$ ... We cannot solve it putting simple logic, We need to use propositional formula here, right?
The maximum number of edges possible in a simple graph with $15$ vertices, and degree of each vertex is atmost $5$ is _______ My ans $55$, using $\frac{\left ( n-k \right )\left ( n-k+1 \right )}{2}$ and given ans $37$ using $degree\times V\geq 2E$ Which one correct?
Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the longer stick is ________ My ans is $0.75$ Is this correct?
Why is $(II)$ not a poset?