Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
parulk
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by parulk
0
answers
1
expectation doubt
Given a stick with n joints. The stick is dropped from certain height. During the fall, each joint breaks with probability p independent of other joints. What is the expected number of pieces into which the stick breaks ? Also, what is expected number of substicks of length =3.
Given a stick with n joints. The stick is dropped from certain height. During the fall, each joint breaks with probability p independent of other joints. What is the expe...
351
views
asked
Aug 16, 2018
Probability
probabilityexpectation
+
–
3
answers
2
#cds-sampleTest
One in two hundred people in a population have a particular disease. A test is developed for the disease. The test gives a false positive $3\%$ of the time (i.e. reports that a person has the disease even when he/she does not), and a false ... disease even when he/she does). Rahul takes the test and the report comes positive. What is the probability that Rahul has the disease?
One in two hundred people in a population have a particular disease. A test is developed for the disease. The test gives a false positive $3\%$ of the time (i.e. reports ...
889
views
commented
May 17, 2018
Probability
engineering-mathematics
probability
+
–
1
answer
3
#csa#written_test
If A3 =0 , then det of A-3I = ?
If A3 =0 , then det of A-3I = ?
206
views
asked
May 11, 2018
2
answers
4
testseries
U and V are two independent zero mean Gaussian random variables of variances 1/4 and 1/ 9. The probability P(3V 2U) is
U and V are two independent zero mean Gaussian random variables of variances 1/4 and 1/ 9. The probability P(3V 2U) is
3.6k
views
answered
Feb 1, 2018
9
answers
5
GATE CSE 2017 Set 1 | Question: 51
Consider a $2$-way set associative cache with $256$ blocks and uses $\text{LRU}$ replacement. Initially the cache is empty. Conflict misses are those misses which occur due to the contention of multiple blocks for the same cache set. Compulsory ... $10$ times. The number of conflict misses experienced by the cache is _________ .
Consider a $2$-way set associative cache with $256$ blocks and uses $\text{LRU}$ replacement. Initially the cache is empty. Conflict misses are those misses which occur d...
38.4k
views
commented
Jan 21, 2018
CO and Architecture
gatecse-2017-set1
co-and-architecture
cache-memory
conflict-misses
normal
numerical-answers
+
–
0
answers
6
made easy test series
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n). Then [f (n) . g(n)] + h(n) is _______. a.Ω(n) b.Ο(n) c.θ(n) d.None of these
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n).Then [f (n) . g(n)] + h(n) is _______.a.Ω(n)b.Ο(n)c.θ(n)d.None of these
366
views
commented
Jan 17, 2018
2
answers
7
test series
extern int i; int i=5; i=10; int main() { printf("\ni=%d",i); return 0; } output is?
extern int i;int i=5;i=10;int main(){ printf("\ni=%d",i); return 0;}output is?
1.1k
views
commented
Jan 11, 2018
Programming in C
programming-in-c
extern
variable-scope
+
–
1
answer
8
MadeEasy Test Series: Operating System - Disks
A disk rotates at a speed of 3600 rpm. It has 4000 cylinders, 16 surface and 206 sectors per tracks. Track storage capacity is 2048 bytes. What is the average latency time (in msec) and data transfer rate (in kbps) respectively. A 16.66, 12.28 B 8.33, 196.48 C 16.66, 196.48 D 8.33, 12.28 Given answer is d, but i got 8.33 , 960Kbps
A disk rotates at a speed of 3600 rpm. It has 4000 cylinders, 16 surface and 206 sectors per tracks. Track storage capacity is 2048 bytes. What is the average latency tim...
1.3k
views
commented
Dec 26, 2017
Operating System
made-easy-test-series
operating-system
disk
+
–
2
answers
9
Dbms #weak-entity
Which of the following statements are true for weak entity sets: 1. A weak entity set cannot have a primary key. 2. A weak entity set must have a local attribute in primary key. 3. A weak entity must borrow an attribute from another entity sey to form a primary key. a) 1 and 2 b) 2 and 3 c) 3 only d) none of these
Which of the following statements are true for weak entity sets:1. A weak entity set cannot have a primary key.2. A weak entity set must have a local attribute in primary...
1.3k
views
asked
Nov 23, 2017
Databases
weak-entity
+
–
2
answers
10
Test by Bikram | Computer Networks | Test 1 | Question: 16
In a token bucket network transmission spreed is $20^*(10^6)$ bps and maximum rate can only be sent for at most $10$ sec at a time, and at most $150$ Mb can be sent over any $15$ sec window, then the value for token input rate is _________ mbps
In a token bucket network transmission spreed is $20^*(10^6)$ bps and maximum rate can only be sent for at most $10$ sec at a time, and at most $150$ Mb can be sent over...
1.2k
views
comment reshown
Nov 23, 2017
Computer Networks
tbb-cn-1
numerical-answers
+
–
9
answers
11
GATE CSE 2013 | Question: 45
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$
Consider an instruction pipeline with five stages without any branch prediction:Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (...
47.5k
views
commented
Oct 8, 2017
CO and Architecture
gatecse-2013
normal
co-and-architecture
pipelining
+
–
5
answers
12
GATE CSE 2008 | Question: 69
Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the following functional dependencies: $\text{Title Author }\rightarrow\text{ Catalog_no}$ ... $\text{2NF}$ and Collection in $\text{3NF}$ Both Book and Collection are in $\text{2NF}$ only
Consider the following relational schemes for a library database:Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no)with the fo...
27.8k
views
commented
Sep 21, 2017
Databases
gatecse-2008
databases
database-normalization
normal
+
–
4
answers
13
GATE CSE 1990 | Question: 1-iv-a
A $32$-bit floating-point number is represented by a $7$-bit signed exponent, and a $24$-bit fractional mantissa. The base of the scale factor is $16,$ The range of the exponent is ___________
A $32$-bit floating-point number is represented by a $7$-bit signed exponent, and a $24$-bit fractional mantissa. The base of the scale factor is $16,$The range of the ex...
7.8k
views
commented
Sep 11, 2017
Digital Logic
gate1990
digital-logic
number-representation
floating-point-representation
fill-in-the-blanks
+
–
4
answers
14
Tanenbaum NAK and Retransmission
Compute the fraction of the bandwidth that is wasted on overheads(headers and retransmission ) for protocol 6 on a heavily loaded 50 kbps satellite channel with data frames consisting of 40 headers and 3960 data bits.Assume that the signal propagation time ... for data frames is 1%, and the error rate for NAK frames is negligible.The sequence numbers are 8 bits.
Compute the fraction of the bandwidth that is wasted on overheads(headers and retransmission ) for protocol 6 on a heavily loaded 50 kbps satellite channel with data fram...
3.2k
views
commented
Sep 10, 2017
Computer Networks
tanenbaum
computer-networks
+
–
3
answers
15
Test by Bikram | Operating Systems | Test 2 | Question: 24
Suppose the page table for the process currently executing looks like the following. All numbers are decimal, everything is numbered starting from zero, and all addresses are memory byte addresses. The page size is $1024$ ... --- , $379$ $7196$, --------- , $5120$ -------, $2221$, --------
Suppose the page table for the process currently executing looks like the following.All numbers are decimal, everything is numbered starting from zero, and all addresses ...
1.2k
views
commented
Aug 30, 2017
Operating System
tbb-os-2
+
–
1
answer
16
Test by Bikram | Operating Systems | Test 2 | Question: 12
A certain computer provides its users with a virtual-memory space of $2^{32}$ bytes. The computer has $2^{18}$ bytes of physical memory. The virtual memory is implemented by paging, and the page size is $4,096$ bytes or $4K$ bytes. A user process ... $0001 \ 0001 \ 0001 \ 0010 \ 0011$ $0010 \ 0011 \ 0100 \ 0101 \ 0110$ $0100 \ 0101 \ 0110$
A certain computer provides its users with a virtual-memory space of $2^{32}$ bytes. The computer has $2^{18}$ bytes of physical memory. The virtual memory is implemented...
849
views
commented
Aug 30, 2017
Operating System
tbb-os-2
+
–
1
answer
17
Test by Bikram | Algorithms | Test 2 | Question: 30
The cost of optimal binary search tree for the identifier set $(a1, a2, a3) =$ (do, if, while) with $p(1) = 0.3, \ p(2) = 0.2, $ $p(3) = 0.15, q (0) = 0.05, q(1) = 0.15, q(2)= 0.1, q(3) = 0.05$ is: $1.65$ $1.95$ $1.8$ $2.1$
The cost of optimal binary search tree for the identifier set $(a1, a2, a3) =$ (do, if, while) with $p(1) = 0.3, \ p(2) = 0.2, $ $p(3) = 0.15, q (0) = 0.05, q(1) = 0.15...
464
views
comment edited
Jul 12, 2017
Algorithms
tbb-algorithms-2
+
–
3
answers
18
GATE CSE 1991 | Question: 03,vi
Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph $G$ with $n$ vertices and $m$ edges has the time complexity of: $O(n^{2})$ $O(mn)$ $O(m+n)$ $O(m \log n)$ $O(m^2)$
Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph $G$ with $n$ vertices and $m$ edges has the time complexity of:$O(n^{2})$$O(mn)$$O(m+n)$$O(m...
13.8k
views
commented
Jun 28, 2017
Algorithms
gate1991
algorithms
graph-algorithms
spanning-tree
minimum-spanning-tree
time-complexity
multiple-selects
+
–
1
answer
19
Combinatory
How many ordered quadruples $\left ( x_{1},x_{2},x_{3},x_{4} \right )$ of odd positive integers satisfy $x_{1}+x_{2}+x_{3}+x_{4}=98?$
How many ordered quadruples $\left ( x_{1},x_{2},x_{3},x_{4} \right )$ of odd positive integers satisfy$$x_{1}+x_{2}+x_{3}+x_{4}=98?$$
370
views
asked
Jun 24, 2017
Combinatory
combinatory
+
–
1
answer
20
#time-complexity#daa
What will be time complexity for the following algo where n is a Prime number? main() { for(i=1; i<=n; i=2*i) for(j=1; j<=n; j++) { if(n%i == 0) while(k<=n) { a=b+c k=k+1 } } }
What will be time complexity for the following algo where n is a Prime number?main(){for(i=1; i<=n; i=2*i) for(j=1; j<=n; j++) { if(n%i == 0) while(k<=n...
285
views
commented
Jun 3, 2017
Algorithms
time-complexity
+
–
1
answer
21
Rosen Exercise
Let S(x) be the predicate “x is a student,” F(x) the predicate “x is a faculty member,” and A(x, y) the predicate “x has asked y a question,” where the domain consists of all people associated with your school. Express the following sentence using quantifiers: Some student has asked every faculty member a question.
Let S(x) be the predicate “x is a student,” F(x) the predicate“x is a faculty member,” and A(x, y) the predicate“x has asked y a question,” where the domain c...
392
views
comment edited
May 27, 2017
3
answers
22
Test by Bikram | Mock GATE | Test 2 | Question: 18
Which of the following statements is/are true? Floating point addition is always associative. Shifting a twos-complement integer right by one bit, and filling from the left with $0$, is always equivalent to dividing by $2$. An integer's ones ... twos-complement representation. I and II only II and III only All are false I, II, and III all are true
Which of the following statements is/are true?Floating point addition is always associative.Shifting a twos-complement integer right by one bit, and filling from the left...
724
views
commented
Feb 6, 2017
GATE
tbb-mockgate-2
co-and-architecture
floating-point-representation
+
–
1
answer
23
Basic doubt in B+ Tree Indexing
Q : One basic doubt that is coming to my mind is whether number of splits in the process of insertion in B+ Tree indexing going to change if we consider left biasing and right biasing approach.Plz present any example to show if possible..
Q : One basic doubt that is coming to my mind is whether number of splits in the process of insertion in B+ Tree indexing going to change if we consider left biasing and ...
1.1k
views
commented
Jan 24, 2017
Databases
databases
b-tree
indexing
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register