Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Gyanu
0
votes
1
TIFR CSE 2018 | Part A | Question: 14
Let $A$ be an $n\times n$ invertible matrix with real entries whose row sums are all equal to $c$. Consider the following statements: Every row in the matrix $2A$ sums to $2c$. Every row in the matrix $A^{2}$ sums to $c^{2}$. Every row in ... and $(2)$ are correct but not necessarily statement $(3)$ all the three statements $(1), (2),$ and $(3)$ are correct
Let $A$ be an $n\times n$ invertible matrix with real entries whose row sums are all equal to $c$. Consider the following statements:Every row in the matrix $2A$ sums to ...
3.5k
views
answered
Oct 21, 2020
Linear Algebra
tifr2018
matrix
linear-algebra
+
–
1
votes
2
UGC NET CSE | December 2006 | Part 2 | Question: 32
Which of the following is the most general phase-structured grammar ? Regular Context-sensitive Context free Syntax tree
Which of the following is the most general phase-structured grammar ?RegularContext-sensitiveContext freeSyntax tree
611
views
answered
Sep 23, 2020
Compiler Design
ugcnetcse-dec2006-paper2
+
–
1
votes
3
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 11
Synthesized attribute can easily be simulated by an LL grammar ambiguous grammar LR grammar none of the above
Synthesized attribute can easily be simulated by anLL grammarambiguous grammarLR grammarnone of the above
1.3k
views
answered
Sep 23, 2020
Compiler Design
nielit2017oct-assistanta-cs
compiler-design
syntax-directed-translation
+
–
1
votes
4
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 10
Consider an $\varepsilon$-tree CFG. If for every pair of productions $A\rightarrow u$ and $A\rightarrow v$ If $\text{FIRST(u)} \cap \text{FIRST(v)}$ is empty then the CFG has to be $LL(1).$ If the CFG is $LL(1)$ then $\text{FIRST(u)} \cap \text{FIRST(v)}$ has to be empty. Both $(A)$ and $(B)$ None of the above
Consider an $\varepsilon$-tree CFG. If for every pair of productions $A\rightarrow u$ and $A\rightarrow v$If $\text{FIRST(u)} \cap \text{FIRST(v)}$ is empty then the CFG ...
3.2k
views
answered
Sep 23, 2020
Compiler Design
nielit2017oct-assistanta-cs
compiler-design
context-free-grammar
first-and-follow
+
–
0
votes
5
Probability # Distribution
A traffic office imposes on an average 5 number of penalities daily on traffic violators.Assume that the number of the penalties on different days is independent and follows a Poisson distribution.The probability that there will be less than 4 penalties in a day is _______________ ?
A traffic office imposes on an average 5 number of penalities daily on traffic violators.Assume that the number of the penalties on different days is independent and foll...
1.3k
views
answered
Aug 18, 2020
Mathematical Logic
probability
engineering-mathematics
discrete-mathematics
+
–
1
votes
6
coin
A fair coin is tossed n times .find probability of difference between head and tails is n-3
A fair coin is tossed n times .find probability of difference between head and tails is n-3
4.1k
views
answered
Aug 18, 2020
Probability
probability
easy
+
–
6
votes
7
TIFR CSE 2013 | Part B | Question: 3
How many $4 \times 4$ matrices with entries from ${0, 1}$ have odd determinant? Hint: Use modulo $2$ arithmetic. $20160$ $32767$ $49152$ $57343$ $65520$
How many $4 \times 4$ matrices with entries from ${0, 1}$ have odd determinant?Hint: Use modulo $2$ arithmetic.$20160$$32767$$49152$$57343$$65520$
4.6k
views
answered
Aug 14, 2020
Linear Algebra
tifr2013
linear-algebra
matrix
+
–
1
votes
8
Doubt
How many distinct unlabeled graphs are there with 4 vertices and 3 edges?
How many distinct unlabeled graphs are there with 4 vertices and 3 edges?
557
views
answered
Jun 13, 2019
0
votes
9
Zeal Test Series 2019: Graph Theory - Graph Connectivity
928
views
answered
Jun 12, 2019
Graph Theory
zeal
graph-theory
graph-connectivity
zeal2019
+
–
1
votes
10
GB DL - Test 1 - Question 7
The Gray code representation of 11710 is: (A) 1111001 (B) 1001111 (C) 1110110 (D) 1110101
The Gray code representation of 11710 is: (A) 1111001 (B) 1001111 (C) 1110110 (D) 1110101
1.3k
views
answered
Nov 27, 2018
Digital Logic
gatebook
digital-logic
+
–
3
votes
11
ISRO-2017-Q4
The function f:[0,3]->[1,29] defined by f(x)=2*X^3 -15*X^2+36*X+1 is a) injective and surjective b) injective but not surjective c) injective but not surjective d) neither injective nor surjective
The function f:[0,3]->[1,29] defined by f(x)=2*X^3 -15*X^2+36*X+1 isa) injective and surjectiveb) injective but not surjectivec) injective but not surjectived) neither in...
2.0k
views
answered
Oct 12, 2018
15
votes
12
TIFR CSE 2015 | Part A | Question: 11
Suppose that $f(x)$ is a continuous function such that $0.4 \leq f(x) \leq 0.6$ for $0 \leq x \leq 1$. Which of the following is always true? $f(0.5) = 0.5$. There exists $x$ between $0$ and $1$ such that $f(x) = 0.8x$. There exists $x$ between $0$ and $0.5$ such that $f(x) = x$. $f(0.5) > 0.5$. None of the above statements are always true.
Suppose that $f(x)$ is a continuous function such that $0.4 \leq f(x) \leq 0.6$ for $0 \leq x \leq 1$. Which of the following is always true?$f(0.5) = 0.5$.There exists $...
2.8k
views
answered
Aug 15, 2018
Calculus
tifr2015
maxima-minima
calculus
+
–
87
votes
13
GATE CSE 2017 Set 1 | Question: 31
Let $A$ be $n\times n$ real valued square symmetric matrix of rank $2$ with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} = 50.$ Consider the following statements. One eigenvalue must be in $\left [ -5,5 \right ]$ The eigenvalue ... than $5$ Which of the above statements about eigenvalues of $A$ is/are necessarily CORRECT? Both I and II I only II only Neither I nor II
Let $A$ be $n\times n$ real valued square symmetric matrix of rank $2$ with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} = 50.$ Consider the following statements.One eigenvalu...
49.6k
views
answered
Jul 20, 2018
Linear Algebra
gatecse-2017-set1
linear-algebra
eigen-value
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register