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 Sukannya
5
answers
1
ISI2017-MMA-21
There are four machines and it is known that exactly two of them are faulty. They are tested one by one in a random order till both the faulty machines are identified. The probability that only two tests are required is $\left(\dfrac{1}{2}\right)$ $\left(\dfrac{1}{3}\right)$ $\left(\dfrac{1}{4}\right)$ $\left(\dfrac{1}{6}\right)$
There are four machines and it is known that exactly two of them are faulty. They are tested one by one in a random order till both the faulty machines are identified. Th...
2.8k
views
commented
Mar 28, 2018
Probability
isi2017-mma
engineering-mathematics
probability
+
–
1
answer
2
ISI2017-MMA-17
Suppose that $X$ is chosen uniformly from $\{1,2,\ldots,100\}$ and given $X =x$, $Y$ is chosen uniformly from $\{1,2,\ldots,x\}. $Then $P(Y = 30)=$ $\dfrac{1}{100}$ $\dfrac{1}{100} \times \left(\dfrac{1}{30} + \ldots+\dfrac{1}{100}\right)$ $\dfrac{1}{30}$ $\dfrac{1}{100} \times \left(\dfrac{1}{1} + \ldots +\dfrac{1}{30}\right)$
Suppose that $X$ is chosen uniformly from $\{1,2,\ldots,100\}$ and given $X =x$, $Y$ is chosen uniformly from $\{1,2,\ldots,x\}. $Then $P(Y = 30)=$$\dfrac{1}{100}$$\dfrac...
1.5k
views
answered
Mar 28, 2018
Probability
isi2017-mma
engineering-mathematics
probability
uniform-distribution
+
–
3
answers
3
Compiler Design SDT
Is it Possible that any SDT can be L-attributed and S-attributed both in the same question?
Is it Possible that any SDT can be L-attributed and S-attributed both in the same question?
1.6k
views
commented
Mar 28, 2018
Compiler Design
syntax-directed-translation
compiler-design
parsing
+
–
0
answers
4
Gate EC 2014
An unbiased coin is tossed up an infinite numbers of time.The probability that the fourth head appears at the tenth toss $.067$ $.073$ $.082$ $.091$
An unbiased coin is tossed up an infinite numbers of time.The probability that the fourth head appears at the tenth toss$.067$$.073$$.082$$.091$
540
views
commented
Mar 28, 2018
2
answers
5
Gradeup Test series
Suppose prim’s algorithm is implemented using array as queue for a graph $G(V,E)$. Then what is the time complexity of Prim’s algorithm? $O (E \hspace{0.1cm}log\hspace{0.1cm} V)$ $O (V^2 \hspace{0.1cm}log\hspace{0.1cm} V)$ $O(V^2)$ $O(VE)$
Suppose prim’s algorithm is implemented using array as queue for a graph $G(V,E)$. Then what is the time complexity of Prim’s algorithm?$O (E \hspace{0.1cm}log\hspace...
1.4k
views
commented
Mar 27, 2018
Algorithms
test-series
prims-algorithm
time-complexity
+
–
3
answers
6
Probability
If events $B$ and $C$ are dependent on event $A$ and $P(A \hspace{0.1cm}and\hspace{0.1cm} B) = 0.30$, $P(A\hspace{0.1cm} and\hspace{0.1cm} C) = 0.20$ and the dependent events $B$ and $C$ are mutually exclusive and collectively exhaustive, then $P(C/A)$ is equal to ________ ?
If events $B$ and $C$ are dependent on event $A$ and $P(A \hspace{0.1cm}and\hspace{0.1cm} B) = 0.30$, $P(A\hspace{0.1cm} and\hspace{0.1cm} C) = 0.20$ and the dependent ev...
2.3k
views
answered
Mar 25, 2018
Probability
engineering-mathematics
probability
conditional-probability
+
–
1
answer
7
Memory interfacing
A memory constructed with 2B words and capacity of memory $2^{18}$ bits. Number of decoder required and type of decoder if memory built using $1K\times 4$ RAM chips? (if possible give some reference and diagram)
A memory constructed with 2B words and capacity of memory $2^{18}$ bits. Number of decoder required and type of decoder if memory built using $1K\times 4$ RAM chips?(if p...
1.1k
views
comment edited
Mar 24, 2018
CO and Architecture
co-and-architecture
memory-interfacing
memory-management
+
–
3
answers
8
GATE CSE 1999 | Question: 8
Let $A$ be an $n \times n$ matrix such that the elements in each row and each column are arranged in ascending order. Draw a decision tree, which finds $1$st, $2$nd and $3$rd smallest elements in minimum number of comparisons.
Let $A$ be an $n \times n$ matrix such that the elements in each row and each column are arranged in ascending order. Draw a decision tree, which finds $1$st, $2$nd and $...
5.2k
views
commented
Mar 24, 2018
Algorithms
gate1999
algorithms
sorting
normal
descriptive
+
–
5
answers
9
GATE CSE 1992 | Question: 02,ix
Following algorithm(s) can be used to sort $n$ in the range $[1\ldots n^3]$ in $O(n)$ time Heap sort Quick sort Merge sort Radix sort
Following algorithm(s) can be used to sort $n$ in the range $[1\ldots n^3]$ in $O(n)$ timeHeap sortQuick sortMerge sortRadix sort
16.7k
views
commented
Mar 22, 2018
Algorithms
gate1992
easy
algorithms
sorting
multiple-selects
+
–
2
answers
10
Self_doubt
C1: For DFA (ϕ, Ʃ, δ, qo, F), if F = ϕ, then L = Ʃ* C2: For NFA (ϕ, Ʃ, δ, qo, F), if F = ϕ, then L = Ʃ* Where F = Final states set ϕ = Total states set Choose the correct option ? Both are true Both are False $C1$ is true, $C2$ is false $C1$ is false, $C2$ is true What is the answer and also explain that?
C1: For DFA (ϕ, Ʃ, δ, qo, F), if F = ϕ, then L = Ʃ* C2: For NFA (ϕ, Ʃ, δ, qo, F), if F = ϕ, then L = Ʃ* Where F = Final states set ϕ = Total states setChoose t...
287
views
answered
Mar 22, 2018
Theory of Computation
theory-of-computation
context-free-language
+
–
1
answer
11
Barc for a gate disqualified student
I have opted for both online test and through GATE exam score...but I couldn't qualify GATE ..that's my misfortune. If I cn qualify barc, can I get a call for interview? Looking for a quick response.
I have opted for both online test and through GATE exam score...but I couldn't qualify GATE ..that's my misfortune. If I cn qualify barc, can I get a call for interview?...
1.3k
views
commented
Mar 21, 2018
5
answers
12
ISRO2017-51
Wha is the output of the following program? main() { int a = 10; if(fork()) == 0)) a++; printf("%d\n",a); } 10 and 11 10 11 11 and 11
Wha is the output of the following program?main() { int a = 10; if(fork()) == 0)) a++; printf("%d\n",a); }10 and 11101111 and 11
8.8k
views
commented
Mar 21, 2018
Operating System
isro2017
operating-system
fork-system-call
+
–
1
answer
13
ISI CSB 2017
The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes: $\text{D K E F B G L M H I J C A.}$ For each node of $T$ ... $T$.
The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes:$$\text{D K E F B G L M H I J C A.}$$For each node of $T$, the deg...
472
views
answer edited
Mar 20, 2018
Algorithms
isi
+
–
3
answers
14
Ace Test Series: Algorithms - Time Complexity & Array
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$. $O(n^2) $ $O(1)$ $O(n)$ $O(logn)$
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$...
1.2k
views
commented
Mar 20, 2018
Algorithms
algorithms
ace-test-series
time-complexity
array
+
–
0
answers
15
ISI CSB 2017
Consider the Boolean function $F(x_1,x_2,......,x_{10})$ realised by the following combinational circuit. $\text{Determine the number of input combinations for which the output function F realised by }$ $\text{ the circuit becomes true (logic 1)}$ I'm getting $940$ Input combinations
Consider the Boolean function $F(x_1,x_2,......,x_{10})$ realised by the following combinational circuit.$\text{Determine the number of input combinations for which the o...
443
views
commented
Mar 20, 2018
Digital Logic
isi
digital-logic
+
–
2
answers
16
Minimum Spanning Tree Problem
2.1k
views
commented
Mar 19, 2018
Algorithms
minimum-spanning-tree
graph-algorithms
test-series
+
–
2
answers
17
Derivatives in real life (Mooculus)
A light on the ground is 30 feet away from a building. A 4 foot tall man is walking from the light to the building at a rate of 3 feet per second. He is casting a shadow on the side of the building. At what rate is his shadow shrinking when he is 5 feet from the building?
A light on the ground is 30 feet away from a building. A 4 foot tall man is walking from the light to the building at a rate of 3 feet per second.He is casting a shadow o...
664
views
commented
Mar 19, 2018
Calculus
maths
engineering-mathematics
calculus
+
–
1
answer
18
Daa........
What is the ans and give reason
What is the ans and give reason
705
views
commented
Mar 19, 2018
Algorithms
sorting
algorithm-design-technique
test-series
+
–
2
answers
19
ISI-2014-06
The sum of an infinite geometric series of real numbers is $14$, and the sum of the cubes of the terms of this series is $392$. Then the first term of the series is $-14$ $10$ $7$ $-5$
The sum of an infinite geometric series of real numbers is $14$, and the sum of the cubes of the terms of this series is $392$. Then the first term of the series is$-14$$...
666
views
commented
Mar 18, 2018
Mathematical Logic
number-series
+
–
1
answer
20
Computer Networks
A $64000-byte$ message is to be transmitted over a $2-hop$ path in a store- and-forward packet-switching network. The network limits packets to a maximum size of $2032 bytes$ including a $32-byte$ header. The trans- mission lines in the ... delays at the intermediate node are negligible. How long does it take to deliver the entire message from the source to the destination?
A $64000-byte$ message is to be transmitted over a $2-hop$ path in a store- and-forward packet-switching network. The network limits packets to a maximum size of $2032 by...
371
views
commented
Mar 15, 2018
Computer Networks
computer-networks
+
–
0
answers
21
program in c
suppose i have declared array int a[5] = { 1,2,3,4,5} ; and i want to print output as : a[0] = 1 a[1] = 2 a[2] = 3 a[3] = 4 a[4] =5 can anyone write program in c displaying this output .
suppose i have declared arrayint a[5] = { 1,2,3,4,5} ;and i want to print output as :a[0] = 1a = 2a = 3a[3] = 4a[4] =5can anyone write program in c displaying this...
525
views
commented
Mar 15, 2018
0
answers
22
GATE CSE 1997 | Question: 16
In this GATE ques- Part a) For Size balanced tree the recurrence (max height) is T(h)=T(h-1) +T(h-2) +1, solving which we get T(0)=1, T(1)=2,T(2)=1+2+1=4, T(3)=4+2+1=7 Here, T(0),T(1),T(2) are of the form 2h but T(3) is not equal to 23 then how can we claim that "size-balance binary tree of height 'h' contain at least 2h nodes." ?
In this GATE ques- Part a) For Size balanced tree the recurrence (max height) is T(h)=T(h-1) +T(h-2) +1, solving which we getT(0)=1, T(1)=2,T(2)=1+2+1=4, T(3)=4+2+1=7Here...
1.1k
views
commented
Mar 14, 2018
DS
gate1997
data-structures
binary-tree
+
–
1
answer
23
Doubt regarding recognizing a language
Please can anyone tell how to find whether a given language is regular or not?
Please can anyone tell how to find whether a given language is regular or not?
573
views
commented
Mar 12, 2018
1
answer
24
test series
601
views
commented
Mar 10, 2018
1
answer
25
Peter Linz Edition 4 Derivation Trees Definition 5.3 (Page No. 130)
Which of the following is false for derivation tree of CFG- $G (V, T, P, S)$ ? The root is labeled $S$. Every leaf has a label from $V ⋃ T ⋃ \{ λ \}$. A vertex with a child labeled $λ$ can only have it as the rightmost child. $\text{1 & 3}$ $\text{1 & 2}$ $\text{2 & 3}$ $\text{Only 2}$
Which of the following is false for derivation tree of CFG- $G (V, T, P, S)$ ?The root is labeled $S$.Every leaf has a label from $V ⋃ T ⋃ \{ λ \}$.A vertex with a ...
751
views
commented
Mar 10, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
context-free-grammar
derivation-tree
+
–
1
answer
26
TEST_SERIES
ANSWER IS CORRECT BU I HAVE DOUBT IN A -> .Ab, a/b I think it must be A -> .Ab ,a
ANSWER IS CORRECT BU I HAVE DOUBT IN A - .Ab, a/bI think it must be A - .Ab ,a
314
views
commented
Mar 10, 2018
Compiler Design
compiler-design
parsing
lr-parser
ace-test-series
+
–
2
answers
27
SWP OPTIMAL WINDOW SIZE
940
views
commented
Mar 9, 2018
Computer Networks
computer-networks
sliding-window
+
–
1
answer
28
Fork System Call
#include<stdio.h> #include<stdlib.h> void main() { int a =100; if(fork()==0) { a=a+5; printf("%d %d \n",a,&a ); } } How many parent and child process will be created?
#include<stdio.h #include<stdlib.h void main() { int a =100; if(fork()==0) { a=a+5; printf("%d %d \n",a,&a ); } }How many parent and child process will be created?
2.5k
views
commented
Mar 9, 2018
Operating System
operating-system
fork-system-call
+
–
5
answers
29
Combinatorics
Three ladies have each brought a child for admission to a school. The head of the school wishes to interview the six people one by one, taking care that no child is interviewed before its mother. In how many different ways can the interviews be arranged? $6$ $36$ $72$ $90$
Three ladies have each brought a child for admission to a school. The head of the school wishes to interview the six people one by one, taking ca...
1.1k
views
answered
Mar 8, 2018
Combinatory
combinatory
+
–
1
answer
30
Printing elements of linked-list using recursion.
Can anyone check this program? I got some warning. #include<stdio.h> #include<stdlib.h> void func(struct node *); struct node { int data; struct node *next; }; int main() { struct node *head=(struct node *)malloc(sizeof(struct node)); ... void func(struct node *p) { if(p) { printf("\n%d",p->data); func(p->next); } }
Can anyone check this program?I got some warning.#include<stdio.h>#include<stdlib.h>void func(struct node *); struct node{ int data; struct node *next;}; int ...
570
views
comment edited
Mar 6, 2018
Programming in C
programming-in-c
recursion
linked-list
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register