Register
Filter

Recent activity by monika7537

2 answers
1
minimization of circuit
2 answers
3
asked in psu exam
a transparent dbms a. canot hide sensitive information from users b.keep it's logical structure hidden from users c. keep it'd physical structure hidden from users d. both b and c
a transparent dbmsa. canot hide sensitive information from usersb.keep it's logical structure hidden from usersc. keep it'd physical structure hidden from users d. both b...
0 answers
4
#file structure
Q. suppose the order of b-tree is 23. then how many index records will be stored in level 4(including root as level 1)
Q. suppose the order of b-tree is 23. then how many index records will be stored in level 4(including root as level 1)
1 answer
6
self doubt
question has something wrong or is any logic i dont know please verify??
question has something wrong or is any logic i dont know please verify??
1 answer
7
C Expression evaluation query
How does the following expression evaluate to if suppose n=2 n=2; a[++n]=n++;
How does the following expression evaluate to if suppose n=2n=2; a[++n]=n++;
4 answers
10
TIFR CSE 2017 | Part A | Question: 5
How many distinct ways are there to split $50$ identical coins among three people so that each person gets at least $5$ coins? $3^{35}$ $3^{50}-2^{50}$ $\binom{35}{2}$ $\binom{50}{15} \cdot 3^{35}$ $\binom{37}{2}$
How many distinct ways are there to split $50$ identical coins among three people so that each person gets at least $5$ coins?$3^{35}$$3^{50}-2^{50}$$\binom{35}{2}$$\bino...
8 answers
11
GATE CSE 2007 | Question: 22
Let $\text{ Graph}(x)$ be a predicate which denotes that $x$ is a graph. Let $\text{ Connected}(x)$ be a predicate which denotes that $x$ ... $\forall x \, \Bigl ( \text{ Graph}(x) \implies \lnot \text{ Connected}(x) \Bigr )$
Let $\text{ Graph}(x)$ be a predicate which denotes that $x$ is a graph. Let $\text{ Connected}(x)$ be a predicate which denotes that $x$ is connected. Which of the follo...