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 saurabh_shashi
7
answers
1
GATE CSE 2006 | Question: 24
Given a set of elements $N = {1, 2, ..., n}$ and two arbitrary subsets $A⊆N$ and $B⊆N$, how many of the n! permutations $\pi$ from $N$ to $N$ satisfy $\min(\pi(A)) = \min(\pi(B))$, where $\min(S)$ is the smallest integer in the set of integers $S$, and $\pi$(S) is the set of ... $n! \frac{|A ∩ B|}{|A ∪ B|}$ $\dfrac{|A ∩ B|^2}{^n \mathrm{C}_{|A ∪ B|}}$
Given a set of elements $N = {1, 2, ..., n}$ and two arbitrary subsets $A⊆N$ and $B⊆N$, how many of the n! permutations $\pi$ from $N$ to $N$ satisfy $\min(\pi(A)) = ...
11.3k
views
commented
Sep 29, 2020
Set Theory & Algebra
gatecse-2006
set-theory&algebra
normal
set-theory
+
–
4
answers
2
GATE CSE 2016 Set 1 | Question: 36
What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed? a = 3; void n(x) { x = x * a; print (x); } void m(y) { a = 1 ; a = y - a; n(a); print (a); } void main () { m(a); } $6,2$ $6,6$ $4,2$ $4,4$
What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed? a = 3; void n(x) { x = x * a; ...
24.1k
views
commented
Sep 4, 2020
Compiler Design
gatecse-2016-set1
parameter-passing
normal
+
–
7
answers
3
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number...
13.6k
views
commented
Jul 9, 2020
DS
gateit-2005
data-structures
normal
binary-search-tree
+
–
5
answers
4
GATE CSE 2004 | Question: 50
The relation scheme $\text{Student Performance (name, courseNo, rollNo, grade)}$ has the following functional dependencies: name, courseNo, $\rightarrow$ grade rollNo, courseNo $\rightarrow$ grade name $\rightarrow$ rollNo rollNo $\rightarrow$ name The highest normal form of this relation scheme is $\text{2NF}$ $\text{3NF}$ $\text{BCNF}$ $\text{4NF}$
The relation scheme $\text{Student Performance (name, courseNo, rollNo, grade)}$ has the following functional dependencies:name, courseNo, $\rightarrow$ graderollNo, cour...
18.5k
views
commented
Jun 25, 2020
Databases
gatecse-2004
databases
database-normalization
normal
+
–
4
answers
5
GATE IT 2005 | Question: 74
In a communication network, a packet of length $L$ bits takes link $L_1$ with a probability of $p_1$ or link $L_2$ with a probability of $p_2$. Link $L_1$ and $L_2$ have bit error probability of $b_1$ and $b_2$ respectively. The probability that the packet will be received without ... $[1 - (b_1 + b_2)^L]p_1p_2$ $(1 - b_1)^L (1 - b_2)^Lp_1p_2$ $1 - (b_1^Lp_1 + b_2^Lp_2)$
In a communication network, a packet of length $L$ bits takes link $L_1$ with a probability of $p_1$ or link $L_2$ with a probability of $p_2$. Link $L_1$ and $L_2$ have ...
8.9k
views
commented
May 30, 2020
Computer Networks
gateit-2005
computer-networks
error-detection
probability
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register