Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Engineering Mathematics
0
votes
2
answers
7621
What is the probability of correctly choosing an unknown integer between 0 to 9 with three chances?
What is the probability of correctly choosing an unknown integer between 0 to 9 with three chances? A. 963/1000 B. 973/1000 C. 983/1000 D. NONE i think first 3 options are rubbish ans should be 3/10 correct me if wrong
Sanjay Sharma
asked
in
Probability
Jun 9, 2016
by
Sanjay Sharma
2.7k
views
0
votes
2
answers
7622
Kenneth Rosen Edition 6th Exercise 8.1 Question 6 (Page No. 510)
Find a recurrence relation for the number of strictly increasing sequences of positive integers that have 1 as their first term and n as their last term, where n is a positive integer. That is, sequences a1,a2,a3,a4....ak where a1 = 1, ak = n, and aj < aj+1 for j = 1,2,3,...k-1
dd
asked
in
Set Theory & Algebra
Jun 8, 2016
by
dd
1.8k
views
kenneth-rosen
discrete-mathematics
recurrence-relation
algorithms
relations
functions
0
votes
2
answers
7623
relations
1. If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is ________________. (i) Commutative (ii) transitive (iii) implicative (iv) equivalence (A) (i) and (ii) (B) (iii) (C) (i),(ii),(iii) and (iv) (D) None of these
Sanjay Sharma
asked
in
Mathematical Logic
Jun 8, 2016
by
Sanjay Sharma
2.4k
views
1
vote
4
answers
7624
IISC-CSA-Research-Test-10
A proper vertex colouring of a graph $G$ is a colouring of the vertices in $G$ in such a way that two vertices get different colours if they are adjacent. The minimum number of colours required for proper vertex colouring of $G$ is called the chromatic number of $G$. Then what is the chromatic number of the cycle graph on 149 vertices?
go_editor
asked
in
Graph Theory
Jun 8, 2016
by
go_editor
785
views
iisccsaresearch2016
descriptive
graph-theory
graph-coloring
iisc-interview
2
votes
1
answer
7625
IISC-CSA-Research-Test-8
Write the truth table for the connective: "If A then B"
go_editor
asked
in
Mathematical Logic
Jun 8, 2016
by
go_editor
337
views
iisccsaresearch2016
descriptive
mathematical-logic
iisc-interview
0
votes
1
answer
7626
IISC-CSA-Research-Test-1
What is the determinant of the following matrix? $\begin{matrix} 76 && 18 && 34 \\ 14 && 12 && 6 \\ 90 && 30 && 40 \end{matrix}$
go_editor
asked
in
Linear Algebra
Jun 7, 2016
by
go_editor
455
views
iisccsaresearch2016
descriptive
linear-algebra
matrix
0
votes
2
answers
7627
Combinations with Repetitions
Choose 4 letters from the word ' ARSUN SURESH ' ? My Approach A--1 R--2 S--3 U--2 N--1 E--1 H--1 11 letter word . case 1 : All 4 letters are different case2 : 2 letters same 2 letters different case 3 : 2 letters same , 2 letters same case 4 : ... R's C(2,2)* C(3,2) CASE 4 ---------- There are no enough letters . Therefore req no of ways for case4 is 0
pC
asked
in
Combinatory
Jun 7, 2016
by
pC
540
views
combinatory
0
votes
2
answers
7628
Placing n balls in r boxes(with a maximum of one ball per box)
How many ways are there to: Put n distinguishable balls in r distinguishable boxes? Put n indistinguishable balls in r distinguishable boxes? Put n distinguishable balls in r indistinguishable boxes? Put n indistinguishable balls in r indistinguishable boxes? Where, $r \geq n$
Pranav Kant Gaur
asked
in
Combinatory
Jun 7, 2016
by
Pranav Kant Gaur
905
views
combinatory
0
votes
0
answers
7629
Kenneth Rosen Edition 6th Exercise 2.3 Question 77 (Page No. 149)
Show that the polynomial f: Z+X Z+ $\rightarrow$ Z+ with f(m,n) = (m+n-2)(m+n-1)/2 + m is one to one and onto .
khushtak
asked
in
Set Theory & Algebra
Jun 6, 2016
by
khushtak
256
views
kenneth-rosen
discrete-mathematics
set-theory&algebra
descriptive
functions
1
vote
0
answers
7630
Kenneth Rosen Edition 6th Exercise 2.3 Question 68 (Page No. 148)
Suppose that F is a function from A to B ,where A and B are finite sets with |A| =|B|. Show that f is one to one if and only if it is onto. I want to know my proof is right or wrong? Proof: by contradiction f[A] is image of function f. ... f[A]| = |B| and not one to one : |B| < |A| (which contradicts |A|=|B|) so f is one to one
khushtak
asked
in
Set Theory & Algebra
Jun 6, 2016
by
khushtak
812
views
kenneth-rosen
discrete-mathematics
set-theory&algebra
functions
0
votes
1
answer
7631
Probability that none of men selects his own hat
Suppose that each of N men at a party throws his hat into the center of the room. The hats are first mixed up, and then each man randomly selects a hat. What is the probability that none of the men selects his own hat?
mk_15
asked
in
Probability
Jun 4, 2016
by
mk_15
2.9k
views
probability
engineering-mathematics
0
votes
2
answers
7632
Kenneth Rosen Edition 6th Exercise 2.1 Question 31 (Page No. 120)
31 Explain why A X B X C and ( A X B ) X C are not same.
khushtak
asked
in
Set Theory & Algebra
Jun 3, 2016
by
khushtak
3.7k
views
kenneth-rosen
discrete-mathematics
set-theory&algebra
set-theory
2
votes
1
answer
7633
Kenneth Rosen Edition 6th Exercise 2.2 Question 24 (Page No. 131)
Q-24 Let A,B and C be sets. Show that (A - B) -C = (A - C) - (B - C) and I think ( A - B) -C = (A - C) - B
khushtak
asked
in
Mathematical Logic
Jun 3, 2016
by
khushtak
472
views
kenneth-rosen
discrete-mathematics
set-theory&algebra
set-theory
0
votes
1
answer
7634
Number of ways of choosing K balls from A White,B Red and C Green Balls.
Is a generic solution possible to this problem
Utsab
asked
in
Mathematical Logic
Jun 3, 2016
by
Utsab
452
views
1
vote
2
answers
7635
ISI2011-PCB-CS-3c
A vertex cover of a graph $G = (V, E)$ is a set of vertices $V' \subseteq V$ such that for any edge $(u, v) \in E$, either $u$ or $v$\ (or both) is in $V'$. Write a linear time algorithm to find the minimum vertex cover of a given tree $T$. Establish its correctness.
go_editor
asked
in
Graph Theory
Jun 3, 2016
by
go_editor
582
views
descriptive
isi2011-pcb-cs
graph-theory
vertex-cover
2
votes
0
answers
7636
ISI2011-PCB-CS-3b
Let $T = (V, E)$ be a tree, and let $v \in V$ be any vertex of $T$. The $\text{eccentricity}$ of $v$ is the maximum distance from $v$ to any other vertex in $T$. The $\text{centre } C$ of $T$ is the set of vertices which have minimum eccentricity among all ... centre and centroid, each having two vertices (i.e. $C \cap \mathcal{C} = \not{O}$ and $|C| = |\mathcal{C}| = 2)$.
go_editor
asked
in
Graph Theory
Jun 3, 2016
by
go_editor
587
views
descriptive
isi2011-pcb-cs
graph-theory
graph-connectivity
1
vote
3
answers
7637
k 3,4 graph
The graph $K_{3,4}$ has 3 edges 4 edges 7 edges 12 edges
Sanjay Sharma
asked
in
Graph Theory
Jun 3, 2016
by
Sanjay Sharma
16.4k
views
2
votes
1
answer
7638
1000th power of a matrix
Find the 1000_th power of the matrix -
Himanshu1
asked
in
Linear Algebra
Jun 3, 2016
by
Himanshu1
1.4k
views
linear-algebra
matrix
10
votes
2
answers
7639
ISRO2009-63
$\begin{vmatrix} 265 && 240 && 219 \\ 240 && 225 && 198 \\ 219 && 198 && 181 \\ \end{vmatrix} = $ $779$ $679$ $0$ $256$
Desert_Warrior
asked
in
Linear Algebra
Jun 3, 2016
by
Desert_Warrior
3.5k
views
isro2009
linear-algebra
matrix
determinant
3
votes
1
answer
7640
ISRO2009- 45
Which of the following statement is correct $\triangle (U_k V_k) = U_k \triangle V_k + V_k \triangle U_k$ $\triangle (U_k V_k) = U_{k+1} \triangle V_k + V_{k+1} \triangle U_k$ $\triangle (U_k V_k) = V_{k+1} \triangle U_k + U_k \triangle V_k$ $\triangle (U_k V_k) = U_{k+1} \triangle V_k + V_k \triangle U_k$
Desert_Warrior
asked
in
Calculus
Jun 3, 2016
by
Desert_Warrior
2.0k
views
isro2009
calculus
vector-calculus
non-gate
Page:
« prev
1
...
377
378
379
380
381
382
383
384
385
386
387
...
520
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Discrete Mathematics
(7.1k)
Probability
(1.4k)
Linear Algebra
(1.1k)
Calculus
(792)
Optimization
(0)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions in Engineering Mathematics
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow