Register
Filter

Recent activity by sid1221

2 answers
1
Arun Sharma # progression
In an infinite geometric progression ,each term is equal to $2$ times the sum of the terms that follow . If the first term of the series is $8$ ,find the sum of the series?
In an infinite geometric progression ,each term is equal to $2$ times the sum of the terms that follow . If the first term of the series is $8$ ,find the sum of the serie...
3 answers
3
ISRO2018-54
The set of attributes $X$ will be fully functionally dependent on the set of attributes $Y$ if the following conditions are satisfied. $X$ is functionally dependent on $Y$ $X$ is not functionally dependent on any subset of $Y$ Both (a) and (b) None of these
The set of attributes $X$ will be fully functionally dependent on the set of attributes $Y$ if the following conditions are satisfied.$X$ is functionally dependent on $Y$...
1 answer
4
Mathematical logic
How to solve these Question.
How to solve these Question.
2 answers
5
GATE CSE 1999 | Question: 2.25
Which of the following is/are correct? An SQL query automatically eliminates duplicates An SQL query will not work if there are no indexes on the relations SQL permits attribute names to be repeated in the same relation None of the above
Which of the following is/are correct?An SQL query automatically eliminates duplicatesAn SQL query will not work if there are no indexes on the relationsSQL permits attri...
1 answer
7
Hamiltonian Graph
A complement of a cyclic graph on 5 vertices , has an Hamiltonian circuit . (True/False)
A complement of a cyclic graph on 5 vertices , has an Hamiltonian circuit . (True/False)
4 answers
8
GATE CSE 1994 | Question: 2.9
The Hasse diagrams of all the lattices with up to four elements are ________ (write all the relevant Hasse diagrams)
The Hasse diagrams of all the lattices with up to four elements are ________ (write all the relevant Hasse diagrams)
4 answers
11
GATE CSE 1987 | Question: 2d
State whether the following statements are TRUE or FALSE: The union of two equivalence relations is also an equivalence relation.
State whether the following statements are TRUE or FALSE:The union of two equivalence relations is also an equivalence relation.
3 answers
12
GATE IT 2006 | Question: 24
What is the cardinality of the set of integers $X$ defined below? $X=\{n \mid 1 \leq n ≤ 123, n$ is not divisible by either $2$, $3$ or $5\}$ $28$ $33$ $37$ $44$
What is the cardinality of the set of integers $X$ defined below?$X=\{n \mid 1 \leq n ≤ 123, n$ is not divisible by either $2$, $3$ or $5\}$$28$$33$$37$$44$
4 answers
16
GATE CSE 1992 | Question: 14a
If $G$ is a group of even order, then show that there exists an element $a≠e$, the identity in $G$, such that $a^2 = e$.
If $G$ is a group of even order, then show that there exists an element $a≠e$, the identity in $G$, such that $a^2 = e$.
0 answers
21
Maths: Probability
Consider that, there are 365 days in a year, what is the probability that exactly two out of ten people are born on the same day?
Consider that, there are 365 days in a year, what is the probability that exactly two out of ten people are born on the same day?
0 answers
26
c programming
#include<stdio.h> int main() { char arr[5][7][6]; char *p[5][7][6]; printf("%d\t", (unsigned)(arr+1)-(unsigned)arr); printf("%d", (unsigned)(p+1)-(unsigned)p); }
#include<stdio.h>int main(){char arr[5][7][6];char *p[5][7][6];printf("%d\t", (unsigned)(arr+1)-(unsigned)arr);printf("%d", (unsigned)(p+1)-(unsigned)p);}
0 answers
27
Congestion control
Consider the effect of using slow start on a line with a 10-msec round-trip time and no congestion. The receive window is 24KB and the maximum segment size is 2KB. How long does it take before the first full window can be sent?
Consider the effect of using slow start on a line with a 10-msec round-trip time and no congestion. The receive window is 24KB and the maximum segment size is 2KB. How lo...
1 answer
28
Congestion Control
Please Confirm whether 10 MSS is correct or not ?
Please Confirm whether 10 MSS is correct or not ?
0 answers
29
decidability
2 answers
30
GATE2011 GG: GA-6
The number of solutions for the following system of inequalities is $X_1≥ 0$ $X_2 ≥ 0$ $X_1+ X_2 ≤ 10$ $2X_1+ 2X_2 ≥ 22$ $0$ infinite $1$ $2$
The number of solutions for the following system of inequalities is$X_1≥ 0$$X_2 ≥ 0$$X_1+ X_2 ≤ 10$$2X_1+ 2X_2 ≥ 22$$0$infinite$1$$2$