Recent questions and answers in Engineering Mathematics

+11 votes

3 answers

1

GATE2006-71
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of vertices of degree zero in $G$ is: $1$ $n$ $n + 1$ $2^n$

answered 15 hours ago in Graph Theory by Gate Ranker18 (489 points) | 1.4k views

0 votes

0 answers

2

Rosen: Relations
Draw the Venn Diagram Between Reflexive property, Symmetric property, and Anti-symmetric property?

asked 16 hours ago in Set Theory & Algebra by Shubhanshu Loyal (2.8k points) | 18 views

0 votes

1 answer

3

Tremblay and Manohar
S={2,a,{3},4} and R={{a},3,4,1} indicate whether the following are true or false 1) $\varnothing \subset R$ 2)$\varnothing \subseteq \left \{ \left \{ a \right \} \right \}\subseteq R\subseteq E$ E=Universal Set 3) $\left \{ \varnothing \right \}\subseteq S$ 4) $\varnothing \in R$ I think 1,2 are true and 3 is false and about 4 nothing is clear

answered 22 hours ago in Set Theory & Algebra by manu00x Loyal (3.2k points) | 15 views

+2 votes

6 answers

4

GATE2017-2-11
Let $p, q, r$ denote the statements It is raining , It is cold , and It is pleasant , respectively. Then the statement It is not raining and it is pleasant, and it is not pleasant only if it is raining and it is cold is represented by $(\neg p \wedge ... r) \vee ((p \wedge q) \rightarrow \neg r)$ $(\neg p \wedge r) \vee (r \rightarrow (p \wedge q))$

answered 1 day ago in Mathematical Logic by Pawan Kumar 2 (77 points) | 1.1k views

0 votes

0 answers

5

#gate
Any good resource on Generating function and recurrrence relations ?

asked 1 day ago in Combinatory by saxena0612 (59 points) | 7 views

0 votes

0 answers

6

Kenneth Rosen ,DM and its Application Exercise 1.5 Qn 35

asked 1 day ago in Mathematical Logic by Ali Jazib Mahmood (39 points) | 29 views

+3 votes

2 answers

7

TIFR2017-A-7
Consider the sequence $S_0, S_1, S_2, \dots$ defined as follows: $S_0=0, \: S_1=1 \: $ and $S_n=2S_{n-1} + S_{n-2}$ for $n \geq 2$. Which of the following statements is FALSE? for every $n \geq 1$, $S_{2n}$ is even for every $n \geq 1$, ... odd for every $n \geq 1$, $S_{3n}$ is multiple of 3 for every $n \geq 1$, $S_{4n}$ is multiple of 6 none of the above

answered 1 day ago in Combinatory by Gate Ranker18 (489 points) | 131 views

0 votes

2 answers

8

Discreate Random Variable (Rose_8th Edition)

answered 1 day ago in Combinatory by Abhisek Das (499 points) | 21 views

0 votes

1 answer

9

Set Theory Doubt
Want to verify let set $\left | A \right |=n$ and $\left | B \right |=m$ Then $max(m,n)\leq \left | A\cup B \right |\leq (m+n)$ $0\leq \left | A\cap B \right |\leq min(m,n)$ $0\leq \left | A- B \right |\ ... here $\bigoplus$ is symmetric difference $0\leq \left | \overline{A} \right |\leq U$ here $\overline{A}$ is compliment of A and U is universal Set

answered 1 day ago in Set Theory & Algebra by Soumya29 Active (1k points) | 19 views

0 votes

1 answer

10

#Rosen
Let P(x), Q(x), and R(x) be the statements x is a professor, x is ignorant, and x is vain, respectively. Express each of these statements using quantifiers; logical connectives; and P(x), Q(x), and R(x), where the ... a) No professors are ignorant. b) All ignorant people are vain. c) No professors are vain. Can someone explain each of the given Predicates?

answered 2 days ago in Mathematical Logic by manu00x Loyal (3.2k points) | 20 views

0 votes

1 answer

11

Calculate Eigen Vector And Eigen Value

answered 2 days ago in Linear Algebra by joshi_nitish Loyal (3.3k points) | 26 views

0 votes

1 answer

12

Find the last row of the Matrix

answered 2 days ago in Linear Algebra by manu00x Loyal (3.2k points) | 17 views

0 votes

1 answer

13

engineering mathematics
The minimum value of the function $f(x)=x^3/3-x$ occurs at x= 1 x= -1 x= 0 x= $\frac{1}{\sqrt[]{3}}$

answered 2 days ago in Linear Algebra by pawan kumarln Boss (5.4k points) | 15 views

0 votes

0 answers

14

State true/ false (with reason) For Linear Algebra

asked 2 days ago in Linear Algebra by Shubhanshu Loyal (2.8k points) | 14 views

0 votes

0 answers

15

Is Summation topic in GATE syllabus

asked 3 days ago in Combinatory by iarnav Active (1.5k points) | 8 views

0 votes

1 answer

16

Relations: Doubt About Composites (Conceptual)

answered 3 days ago in Set Theory & Algebra by Bikram Veteran (33.3k points) | 19 views

+1 vote

5 answers

17

is D36 distributive ?
In one text I read that , if n is square free it is DISTRIBUTIVE in other text I read that if n is square free it is BOOLEAN ALGEBRA . Which is most correct ? Here D36 is not square free then... what conclusion can I make ?

answered 3 days ago in Set Theory & Algebra by Bikram Veteran (33.3k points) | 263 views

+7 votes

3 answers

18

GATE 2016-1-2
Let $a_n$ be the number of $n$-bit strings that do NOT contain two consecutive $1$s. Which one of the following is the recurrence relation for $a_n$? $a_n = a_{n-1}+ 2a_{n-2}$ $a_n = a_{n-1}+ a_{n-2}$ $a_n = 2a_{n-1}+ a_{n-2}$ $a_n = 2a_{n-1}+ 2a_{n-2}$

answered 3 days ago in Combinatory by vijay_jr (171 points) | 1.1k views

+4 votes

2 answers

19

GATE2006-72
The $2^n$ vertices of a graph G corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The maximum degree of a vertex in G is: $\binom{n/2}{2}2^{n/2}$ $2^{n-2}$ $2^{n-3}\times 3$ $2^{n-1}$

answered 3 days ago in Graph Theory by shraddha priya Active (1.2k points) | 718 views

0 votes

1 answer

20

Two place predicate logic
How to solve these type of question:- ∀x ∀y (x+y = 0) ∀x ∃y (x+y = 0) ∃x ∀y (x+y = 0) ∃x ∃y (x+y = 0) ??

answered 3 days ago in Mathematical Logic by G.K.T Junior (907 points) | 20 views

+7 votes

4 answers

21

GATE1996_1.1
Let $A$ and $B$ be sets and let $A^c$ and $B^c$ denote the complements of the sets $A$ and $B$. The set $(A-B) \cup (B-A) \cup (A \cap B)$ is equal to $A \cup B$ $A^c \cup B^c$ $A \cap B$ $A^c \cap B^c$

answered 4 days ago in Set Theory & Algebra by akash.dinkar12 Boss (9.8k points) | 259 views

+5 votes

4 answers

22

GATE2008-2
If $P, Q, R$ are subsets of the universal set U, then $$(P\cap Q\cap R) \cup (P^c \cap Q \cap R) \cup Q^c \cup R^c$$ is $Q^c \cup R^c$ $P \cup Q^c \cup R^c$ $P^c \cup Q^c \cup R^c$ U

answered 4 days ago in Set Theory & Algebra by akash.dinkar12 Boss (9.8k points) | 442 views

+5 votes

3 answers

23

GATE2006-IT-23
Let P, Q and R be sets let Δ denote the symmetric difference operator defined as PΔQ = (P U Q) - (P ∩ Q). Using Venn diagrams, determine which of the following is/are TRUE? PΔ (Q ∩ R) = (P Δ Q) ∩ (P Δ R) P ∩ (Q ∩ R) = (P ∩ Q) Δ (P Δ R) I only II only Neither I nor II Both I and II

answered 4 days ago in Set Theory & Algebra by akash.dinkar12 Boss (9.8k points) | 446 views

+3 votes

3 answers

24

GATE2006-22
Let $E, F$ and $G$ be finite sets. Let $X = (E ∩ F) - (F ∩ G)$ and $Y = (E - (E ∩ G)) - (E - F)$. Which one of the following is true? $X ⊂ Y$ $X ⊃ Y$ $X = Y$ $X - Y ≠ \phi$ and $Y - X ≠ \phi$

answered 4 days ago in Set Theory & Algebra by akash.dinkar12 Boss (9.8k points) | 229 views

+3 votes

3 answers

25

TIFR2016-A-15
In a tournament with 7 teams, each team plays one match with every other team. For each match, the team earns two points if it wins, one point if it ties, and no points if it loses. At the end of all matches, the teams are ordered in ... the minimum total number of points a team must earn in order to be guaranteed a place in the next round? 13 12 11 10 9

answered 4 days ago in Combinatory by Gate Ranker18 (489 points) | 113 views

+1 vote

1 answer

26

Combination (Repetition)
A girl has to choose 4 items from a bucket which contains 3 red, 3 green, and 4 blue balls, now in how many ways she can do this?

answered 4 days ago in Combinatory by Rishabh Gupta 2 (129 points) | 33 views

0 votes

0 answers

27

Combination(Repetition) followed by Permutation(Repetition)

asked 5 days ago in Combinatory by Shubhanshu Loyal (2.8k points) | 14 views

0 votes

0 answers

28

rosen

asked 5 days ago in Mathematical Logic by Kanchan kumari (151 points) | 12 views

0 votes

0 answers

29

Rosen page no. 45 question no. 29 (c) section 1.3

asked 5 days ago in Mathematical Logic by Kanchan kumari (151 points) | 18 views

0 votes

0 answers

30

MIT Assignment: Preposition Logic

asked 5 days ago in Mathematical Logic by Shubhanshu Loyal (2.8k points) | 22 views

0 votes

0 answers

31

Preposition logic "At most" statement

asked 5 days ago in Mathematical Logic by Shubhanshu Loyal (2.8k points) | 24 views

0 votes

0 answers

32

suggestion
in gate few questions came frm generating functions how to solve them ????

asked 5 days ago in Mathematical Logic by sumit goyal 1 Junior (641 points) | 14 views

0 votes

1 answer

33

Relation between Tautology/ Contradiction/ Contingency/ Satisfiability

answered 6 days ago in Mathematical Logic by pawan kumarln Boss (5.4k points) | 24 views

+3 votes

2 answers

34

TIFR2013-A-3
Three candidates, Amar, Birendra and Chanchal stand for the local election. Opinion polls are conducted and show that fraction $a$ of the voters prefer Amar to Birendra, fraction $b$ prefer Birendra to Chanchal and fraction $c$ prefer Chanchal to Amar. Which of the following is impossible? ... 68, 0.68);$ $(a, b, c) = (0.49, 0.49, 0.49);$ None of the above.

answered 6 days ago in Mathematical Logic by Warrior Junior (603 points) | 239 views

+6 votes

2 answers

35

TIFR2011-A-12
The action for this problem takes place in an island of Knights and Knaves, where Knights always make true statements and Knaves always make false statements and everybody is either a Knight or a Knave. Two friends A and B lives in a house. The census ... Knave. A is a Knave and B is a Knight. Both are Knaves. Both are Knights. No conclusion can be drawn.

answered 6 days ago in Mathematical Logic by Warrior Junior (603 points) | 206 views

+6 votes

4 answers

36

GATE2015-2_3
Consider the following two statements. S1: If a candidate is known to be corrupt, then he will not be elected S2: If a candidate is kind, he will be elected Which one of the following statements follows from S1 and S2 as per sound inference rules of ... a person is kind, he is not known to be corrupt If a person is not kind, he is not known to be corrupt

answered 6 days ago in Mathematical Logic by Warrior Junior (603 points) | 717 views

+2 votes

2 answers

37

CMI2013-A-07
Consider the following two statements. There are infinitely many interesting whole numbers. There are finitely many uninteresting whole numbers. Which of the following is true? Statements 1 and 2 are equivalent. Statement 1 implies statement 2. Statement 2 implies statement 1. None of the above.

answered 6 days ago in Mathematical Logic by Warrior Junior (603 points) | 144 views

0 votes

2 answers

38

Kenneth Rosen Counting 6.5 Example 6

answered Jul 19 in Combinatory by Hemant Parihar Loyal (3.5k points) | 53 views

0 votes

0 answers

39

Maths
http://gateoverflow.in/?qa=blob&qa_blobid=3841640957822066036 Can someone show a step wise simplification for this

asked Jul 19 in Calculus by nick17india (43 points) | 31 views

0 votes

1 answer

40

rosen-eg. 2, section 1.2
How can this English sentence be translated into a logical expression? “You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old.” The qustion is given above and the answer in the book is: (r ∧¬s)→¬q but what if it was like: ¬q-->(r ∧¬s) i mean what if you change the left and right hand sides.

answered Jul 19 in Mathematical Logic by Kaluti Active (1.1k points) | 29 views

Recent questions and answers in Engineering Mathematics

Recent Posts

Recent Blog Comments