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
Recent activity by Kabir5454
3
answers
1
GATE CSE 2024 | Set 2 | Question: 34
Let $x$ and $y$ be random variables, not necessarily independent, that take real values in the interval $[0,1]$. Let $z=x y$ and let the mean values of $x, y, z$ be $\bar{x}, \bar{y}, \bar{z}$ ... $\bar{z} \leq \bar{x} \bar{y}$ $\bar{z} \geq \bar{x} \bar{y}$ $\bar{z} \leq \bar{x}$
Let $x$ and $y$ be random variables, not necessarily independent, that take real values in the interval $[0,1]$. Let $z=x y$ and let the mean values of $x, y, z$ be $\bar...
2.7k
views
commented
Feb 19
Probability
gatecse2024-set2
probability
random-variable
+
–
4
answers
2
GATE CSE 2024 | Set 2 | Question: 5
Let $\text{T(n)}$ be the recurrence relation defined as follows: \[ \begin{array}{l} T(0)=1, \\ T(1)=2, \text { and } \\ T(n)=5 T(n-1)-6 T(n-2) \text { for } n \geq 2 \end{array} \] Which one of the following statements is TRUE? $T(n)=\Theta\left(2^{n}\right)$ $T(n)=\Theta\left(n 2^{n}\right)$ $T(n)=\Theta\left(3^{n}\right)$ $T(n)=\Theta\left(n 3^{n}\right)$
Let $\text{T(n)}$ be the recurrence relation defined as follows:\[\begin{array}{l}T(0)=1, \\T(1)=2, \text { and } \\T(n)=5 T(n-1)-6 T(n-2) \text { for } n ...
2.4k
views
answered
Feb 16
Algorithms
gatecse2024-set2
algorithms
recurrence-relation
asymptotic-notation
+
–
3
answers
3
GATE DS&AI 2024 | GA Question: 4
The sum of the following infinite series is \[ 2+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{8}+\frac{1}{9}+\frac{1}{16}+\frac{1}{27}+\cdots \] $11 / 3$ $7 / 2$ $13 / 4$ $9 / 2$
The sum of the following infinite series is\[2+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{8}+\frac{1}{9}+\frac{1}{16}+\frac{1}{27}+\cdots\]$11 / 3$$7 ...
1.5k
views
answered
Feb 16
Quantitative Aptitude
gate-ds-ai-2024
quantitative-aptitude
sequence-series
+
–
4
answers
4
GATE DS&AI 2024 | GA Question: 3
How many $4$-digit positive integers divisible by $3$ can be formed using only the digits $\{1,3,4,6,7\}$, such that no digit appears more than once in a number? $24$ $48$ $72$ $12$
How many $4$-digit positive integers divisible by $3$ can be formed using only the digits $\{1,3,4,6,7\}$, such that no digit appears more than once in a number?$24$$48$$...
2.0k
views
answered
Feb 16
Quantitative Aptitude
gate-ds-ai-2024
quantitative-aptitude
permutation-and-combination
+
–
2
answers
5
ISRO 2024
Which of the following are true? In a graph G with ‘n’ vertices and ‘e’ edges, sum of degrees of vertices = 2*e. Eccentricity of a connected graph can never be equal to radius of the graph Girth of a graph is the shortest cycle of the graph Graph with equal degree for all vertices is multigraph (i), (ii), (iii) (ii), (iii), (iv) (i), (iii), (iv) None of the above
Which of the following are true?In a graph G with ‘n’ vertices and ‘e’ edges, sum of degrees of vertices = 2*e.Eccentricity of a connected graph...
453
views
commented
Jan 9
Graph Theory
isro-2024
discrete-mathematics
graph-theory
+
–
3
answers
6
ISRO 2024
In a priority queue, insertion and deletion can be done at Front back Middle Any position
In a priority queue, insertion and deletion can be done atFrontbackMiddleAny position
476
views
commented
Jan 9
DS
isro-2024
priority-queue
data-structures
+
–
2
answers
7
ISRO 2024
In a producer-consumer scenario, also known as Bounded-Buffer problem, what would be the most appropriate synchronization primitive to ensure that the consumer waits when the buffer is empty? Spinlock Mutex lock Semaphore Monitors
In a producer-consumer scenario, also known as Bounded-Buffer problem, what would be the most appropriate synchronization primitive to ensure that the consumer waits when...
434
views
commented
Jan 7
Operating System
isro-2024
operating-system
process-synchronization
+
–
3
answers
8
ISRO-DEC2017-17
If $C$ is a skew-symmetric matrix of order $n$ and $X$ is $n\times 1$ column matrix, then $X{^T} CX$ is a scalar matrix null matrix unit matrix matrix will all elements $1$
If $C$ is a skew-symmetric matrix of order $n$ and $X$ is $n\times 1$ column matrix, then $X{^T} CX$ is ascalar matrixnull matrixunit matrixmatrix will all elements $1$
2.7k
views
commented
Jan 3
Linear Algebra
isrodec2017
matrix
+
–
0
answers
9
#self doubt
Telephone calls arrive at an exchange according to the Poisson process at a rate λ= 2/min. Calculate the probability that exactly two calls will be received during each of the first 5 minutes of the hour. the given solution is: Assume that N is the number of calls received during 1 ... 5) = 32 x e-10 P(M =5) = 0.00145, where e is a constant, which is approximately equal to 2.718.
Telephone calls arrive at an exchange according to the Poisson process at a rate λ= 2/min. Calculate the probability that exactly two calls will be received during each ...
536
views
commented
Dec 30, 2023
Probability
probability
+
–
1
answer
10
A tree has 2n vertices of degree 1, 3n vertices of degree 2 and n vertices of degree 3. Determine the number of vertices and edges in the tree.
281
views
commented
Dec 29, 2023
Graph Theory
graph-connectivity
+
–
5
answers
11
ISRO2020-47
How many total bits are required for a direct-mapped cache with $128$ KB of data and $1$ word block size, assuming a $32$-bit address and $1$ word size of $4$ bytes? $2$ Mbits $1.7$ Mbits $2.5$ Mbits $1.5$ Mbits
How many total bits are required for a direct-mapped cache with $128$ KB of data and $1$ word block size, assuming a $32$-bit address and $1$ word size of $4$ bytes?$2$ M...
6.2k
views
answer edited
Dec 20, 2023
CO and Architecture
isro-2020
co-and-architecture
cache-memory
direct-mapping
normal
+
–
1
answer
12
GATE Data Science and Artificial Intelligence 2024 | Sample Paper | Question: 34
The function $f(x)=1+2 x+3 x^{2}+\cdots+2026 x^{2025}$. Which of the following statement is true? $f(x)$ has global minimum $f(x)$ has global maximum $f(x)$ does not have global minimum None of the above
The function $f(x)=1+2 x+3 x^{2}+\cdots+2026 x^{2025}$. Which of the following statement is true?$f(x)$ has global minimum$f(x)$ has global maximum$f(x)$ does not have gl...
1.3k
views
commented
Nov 4, 2023
Others
gateda-sample-paper-2024
+
–
7
answers
13
GATE CSE 2018 | Question: 26
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$. Consider the following statements. P does not have an inverse P has a repeated eigenvalue P cannot be diagonalized Which one of the ... III are necessarily true Only II is necessarily true Only I and II are necessarily true Only II and III are necessarily true
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$.Consider the following statements.P does not have an inverseP has ...
27.5k
views
commented
Oct 20, 2023
Linear Algebra
gatecse-2018
linear-algebra
matrix
eigen-value
normal
2-marks
+
–
0
answers
14
Made Easy Test Series 2024
please anyone explain this question .?
please anyone explain this question .?
368
views
commented
Oct 14, 2023
Calculus
made-easy-test-series
made-easy-booklet
calculus
linear-algebra
made-easy-test-series-2024
+
–
0
answers
15
If I register as OBC NCL in Gate but I fail to submit my category certificate at the time of councelling ( because it requires latest certificate) , so will they consider me in general category or they will disqualify me???
If I register as OBC NCL in Gate but I fail to submit my category certificate at the time of councelling ( because it requires latest certificate) , so will they consider...
412
views
commented
Sep 10, 2023
Written Exam
query
admission
+
–
0
answers
16
Expectation of Random Variable
Consider a quiz where a person is given two questions and he must decide which question to answer first. Question 1 will be answered correctly with probability of 0.8 and the person will then receive as prize \ ... we sum P(X=0) + P(X=100) + P(X= 200) + P(X=300) = 2 Where I am getting wrong?
Consider a quiz where a person is given two questions and he must decide which question to answer first. Question 1 will be answered correctly with probability of 0.8 and...
368
views
commented
May 11, 2023
Mathematical Logic
probability
expectation
random-variable
engineering-mathematics
+
–
1
answer
17
Planar Graphs | Graph Theory | Selfdoubt
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
519
views
answered
May 4, 2023
Graph Theory
self-doubt
graph-planarity
graph-theory
+
–
0
answers
18
(x+k)^m=O(x^m) is true or false for x and k being constants?
242
views
commented
Apr 25, 2023
Algorithms
algorithms
asymptotic-notation
+
–
1
answer
19
TIFR CSE 2023 | Part B | Question: 9
Fix a positive integer $n$, and let $n=p_{1}^{e_{1}} p_{2}^{e_{2}} \cdots p_{k}^{e_{k}}$ be the prime factorization of $n$. Here, $p_{1}, \ldots, p_{k}$ are prime numbers and $e_{i} \geq 1$ for all $1 \leq i \leq k$ ... None of the above
Fix a positive integer $n$, and let $n=p_{1}^{e_{1}} p_{2}^{e_{2}} \cdots p_{k}^{e_{k}}$ be the prime factorization of $n$. Here, $p_{1}, \ldots, p_{k}$ are prime numbers...
313
views
commented
Apr 18, 2023
Quantitative Aptitude
tifr2023
quantitative-aptitude
number-system
+
–
1
answer
20
Byju's graph theory coloring question
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ . The find the minimum number of colours required ot edge-colour is ?
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ...
479
views
closed
Apr 15, 2023
Graph Theory
graph-coloring
graph-theory
byjus-practice-book
+
–
2
answers
21
Database ER model
An ER diagram is having two strong entities E1 and E2. The relationship between the entities ‘R’ is having partial participation from E1 side and total participation from E2 side with 1:1 cardinality. The entities E1 and E2 are having one multivalued attribute each. How many numbers of relations are required to represent the ER model into the relational model?
An ER diagram is having two strong entities E1 and E2. The relationship between the entities ‘R’ is having partial participation from E1 side and total participation ...
979
views
commented
Apr 13, 2023
Databases
databases
er-diagram
relational-model
+
–
1
answer
22
TIFR CSE 2023 | Part A | Question: 14
Let $f(x)=a x^{3}+b x^{2}+c x+d$ be a polynomial, where $a, b, c, d$ are unknown real numbers. It is further given that $f(1)=1, f(2)=2, f(3)=9$, and $f^{\prime}(1)=0$. Then, the value of $f^{\prime}(2)$ must be $1$ $2$ $3$ $4$ $f^{\prime}(2)$ cannot be determined uniquely from the information given in the question.
Let $f(x)=a x^{3}+b x^{2}+c x+d$ be a polynomial, where $a, b, c, d$ are unknown real numbers. It is further given that $f(1)=1, f(2)=2, f(3)=9$, and $f^{\prime}(1)=0$. T...
498
views
answered
Apr 9, 2023
Calculus
tifr2023
calculus
differentiation
+
–
1
answer
23
TIFR CSE 2023 | Part A | Question: 4
Let $\mathbb{R}$ be the set of all real numbers. Consider the relation $T$ defined as \[ T=\{(x, y) \in \mathbb{R} \times \mathbb{R} \text { such that } 4+x y>0\} \] $($Recall that ... but not symmetric an equivalence relation reflexive and symmetric but not transitive symmetric but not reflexive and not transitive symmetric and transitive but not reflexive
Let $\mathbb{R}$ be the set of all real numbers. Consider the relation $T$ defined as\[T=\{(x, y) \in \mathbb{R} \times \mathbb{R} \text { such that } 4+x y>0\}\]$($Recal...
429
views
answered
Apr 9, 2023
Set Theory & Algebra
tifr2023
set-theory&algebra
relations
+
–
1
answer
24
Database: Relational Algebra
Let R be a relation of degree 5 then the total number of projections possible on R is ___?
Let R be a relation of degree 5 then the total number of projections possible on R is ___?
906
views
comment moved
Apr 8, 2023
Databases
relational-algebra
databases
+
–
1
answer
25
TIFR CSE 2023 | Part B | Question: 11
Let $m=2877426671$. It is known that $p=5754853343=2 m+1$ is a $10$ -digit prime number. What is $16^{m}(\bmod p)$ ? $1$ $4$ $16$ $2877426671$ $5754853342 \;($ which is actually $-1(\bmod p))$
Let $m=2877426671$. It is known that $p=5754853343=2 m+1$ is a $10$ -digit prime number. What is $16^{m}(\bmod p)$ ?$1$$4$$16$$2877426671$$5754853342 \;($ which is actua...
396
views
answered
Apr 6, 2023
Quantitative Aptitude
tifr2023
quantitative-aptitude
modular-arithmetic
+
–
1
answer
26
GO Classes CS/DA 2025 | Weekly Quiz 4 | Linear Algebra | Question: 19
Let $A$ be a $2 \times 3$-matrix and $b$ a vector in $\mathbb{R}^2$. Consider the following two statements: $(\text{P}1)\; A$ has at most two pivots, $(\text{P2})$ Assuming $A x=b$ has a solution, then it ... $\text{P1}$ is correct. Statement $\text{P1}$ and Statement $\text{P2}$ are correct.
Let $A$ be a $2 \times 3$-matrix and $b$ a vector in $\mathbb{R}^2$.Consider the following two statements:$(\text{P}1)\; A$ has at most two pivots,$(\text{P2})$ Assuming ...
564
views
commented
Apr 5, 2023
Linear Algebra
goclasses2025_csda_wq4
goclasses
linear-algebra
system-of-equations
1-mark
+
–
1
answer
27
TIFR CSE 2023 | Part B | Question: 6
What is the solution to the following recurrence? \[ T(n)=\left\{\begin{array}{ll} 1 & \text { if } n \leq 10, \\ \sqrt{n} \cdot T(\sqrt{n})+n & \text { if } n>10. \end{array}\right. \] $T(n)=\Theta\left(n^{2}\right)$ $T(n)=\Theta(n \log n)$ $T(n)=\Theta(n \sqrt{\log n})$ $T(n)=\Theta(n \log \log n)$ None of the above
What is the solution to the following recurrence?\[T(n)=\left\{\begin{array}{ll}1 & \text { if } n \leq 10, \\\sqrt{n} \cdot T(\sqrt{n})+n & \text { if } n>10.\end{array}...
579
views
answered
Apr 3, 2023
Algorithms
tifr2023
algorithms
recurrence-relation
time-complexity
+
–
1
answer
28
TIFR Mathematics 2023 | Part A | Question: 20
Let ... $A$ is infinite. $A$ is empty. $A$ is singleton. $A$ is finite, but neither empty nor singleton.
Let $$\begin{align} & A=\left\{(\alpha, \beta) \in \mathbb{Z}^{2} \mid \text { the roots } r_{1}, r_{2}, r_{3}\right. \text { of the polynomial } \\ & \qquad \left.p(x)=x...
311
views
commented
Mar 30, 2023
Others
tifrmaths2023
+
–
0
answers
29
Admissions
I have given GATE CSE 2 times (2022 & 2023) and unfortunately, I got the same Score in both 2022 & 2023 but the rank get decreased this year( decreased means poor as compared to last year) So, My question is which gate scorecard should I used in the admission process (2022 with better rank but same score says ‘X’ or 2023 with the poor rank but some score ‘X’).
I have given GATE CSE 2 times (2022 & 2023) and unfortunately, I got the same Score in both 2022 & 2023 but the rank get decreased this year( decreased means poor as comp...
608
views
commented
Mar 28, 2023
IISc/IITs
gate-2023
admissions
coap
+
–
0
answers
30
discrete mathematics
The maximum number of edges possible in a graph G with 9 vertices which is 3 colourable is equal to A 24 B 27 C 36 D None of the above
The maximum number of edges possible in a graph G with 9 vertices which is 3 colourable is equal toA 24B 27C 36D None of the above
503
views
commented
Mar 27, 2023
Graph Theory
graph-theory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register