Register

Recent questions tagged discrete

0 votes
0 answers
2
TIFR System Science 2018 Question 1
Consider a discrete-time system which in response to input sequence x[n] (n integer) outputs the sequence y[n] such that $y[n] = 0, n = −1, −2, −3,...$ and $y[n]=2 (y[n − 1] + nx[n]), n = 0, 1, 2,...$. Find out if the system is linear and time-invariant.
Consider a discrete-time system which in response to input sequence x[n] (n integer)outputs the sequence y[n] such that$y[n] = 0, n = −1, −2, −3,...$and $y[n]=2 (y[...
User Avatar
0 votes
1 answer
3
Discrete mathematics #TEST_BOOK
I Have doubt about the language. Is it asking about the sum of elements if we make the GBL set for the given lattice .
I Have doubt about the language. Is it asking about the sum of elements if we make the GBL set for the given lattice .
User Avatar
0 votes
0 answers
4
Discrete Mathematics
I doubt Whether (a,b)R(b,c) is symmetric or antisymmetric or reflexive relation And how to approach this type of sums?
I doubtWhether (a,b)R(b,c) is symmetric or antisymmetric or reflexive relationAnd how to approach this type of sums?
User Avatar
0 votes
0 answers
6
#Combinations
Number of ways of splitting 10 people into 2 teams of 6 and 4 people respectively. Answer- $^{10}c_{6}$ Number of ways of splitting 10 people into 2 teams of 5 people each. Answer – $^{10}c_{5} /2$ Please explain why we divide by 2?
Number of ways of splitting 10 people into 2 teams of 6 and 4 people respectively. Answer- $^{10}c_{6}$Number of ways of splitting 10 people into 2 teams of 5 people each...
User Avatar
0 votes
1 answer
9
#Graph Theory Any Simple way to prove this ?
A connected graph ‘G’ may have at most (n–2) cut vertices.
A connected graph ‘G’ may have at most (n–2) cut vertices.
User Avatar
0 votes
1 answer
10
MCQs in Computer Science - Timothy Williams
The $n^{th}$ order difference of a polynomial of degree $n$ is zero one some constant undefined Please explain the solution.
The $n^{th}$ order difference of a polynomial of degree $n$ iszeroonesome constantundefinedPlease explain the solution.
User Avatar
1 votes
1 answer
12
questions
User Avatar
1 votes
1 answer
14
Discrete
What is the upper bound for the Chromatic Number given by Brooks' theorem for the Petersen graph? (a) 2 (b) 3 (c) 4 (d) None of the above
What is the upper bound for the Chromatic Number given by Brooks' theorem for the Petersen graph? (a) 2 (b) 3 (c) 4 (d) None of the above
User Avatar
0 votes
0 answers
15
Discrete
If G is a Cubic Hamiltonian graph, then χ′(G)= (a) 3 (b) 4 (c) 5 (d) None of the above
If G is a Cubic Hamiltonian graph, then χ′(G)=(a) 3 (b) 4 (c) 5 (d) None of the above
User Avatar
0 votes
1 answer
16
Discrete
Find the Chromatic Index of the graph G given below. (a) 3 (b) 4 (c) 2 (d) None of the above
Find the Chromatic Index of the graph G given below. (a) 3 (b) 4 (c) 2 (d) None of the above
User Avatar
0 votes
1 answer
17
Discrete
Find the chromatic number of the graph G below (a) 3 (b) 4 (c) 5 (d) None of the above
Find the chromatic number of the graph G below (a) 3 (b) 4 (c) 5 (d) None of the above
User Avatar
0 votes
1 answer
18
Discrete
Consider the graph G given below. The graph G is (a) planar (b) non- planar
Consider the graph G given below. The graph G is (a) planar (b) non- planar
User Avatar
1 votes
1 answer
20
#GroupTheory #TestBook
Plz explain this question
Plz explain this question
User Avatar
2 votes
3 answers
22
Made easy
What is the chromatic number of following graphs? 1) 2)
What is the chromatic number of following graphs?1)2)
User Avatar
0 votes
2 answers
24
Discrete Mathematics
Determine whether (p ∧ ( p → q )) → q is Tautology , Contradiction or Contingency.
Determine whether (p ∧ ( p → q )) → q is Tautology , Contradiction or Contingency.
User Avatar
To see more, click for the full list of questions or popular tags.