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
Answers by saxena0612
4
votes
61
Suppose that cache access time is 7 ns, main memory access time is 50 ns and disk space access time is 1200 ns.
Suppose that cache access time is 7 ns, main memory access time is 50 ns and disk space access time is 1200 ns. If the hit rate of cache is 60% and of main memory hier...
1.3k
views
answered
Nov 18, 2017
Operating System
operating-system
memory-management
virtual-memory
+
–
4
votes
62
Test question on Pipelining
1.4k
views
answered
Nov 3, 2017
CO and Architecture
co-and-architecture
pipelining
clock-cycles
+
–
0
votes
63
Made Easy
I am getting answer as 88.6 time unit. using Total page service time = 250 x 0.94 + 0.06 x 450 = 262 time units Access time = p( page service time + m) + (1-p)(m) = p * page service time + m ( p is page fault rate) Substituting the values i got access time = 88.6 time unit. but the answer is 85.6 time unit. Please point where i am going wrong.
I am getting answer as 88.6 time unit. using Total page service time = 250 x 0.94 + 0.06 x 450 = 262 time unitsAccess time = p( page service time + m) + (1-p)(m) = p * p...
407
views
answered
Oct 30, 2017
2
votes
64
probability
310
views
answered
Oct 29, 2017
Mathematical Logic
probability
engineering-mathematics
+
–
9
votes
65
GATE CSE 1988 | Question: 6ii
Below figure is the flow-chart corresponding to a program to calculate the $\gcd$ of two integers, $M$ and $N$ respectively, $(M, N >0).$ Use assertions at the cut point $C_1$, $C_2$ and $C_3$ to prove that the flow-chart is correct.
Below figure is the flow-chart corresponding to a program to calculate the $\gcd$ of two integers, $M$ and $N$ respectively, $(M, N >0).$ Use assertions at the cut point ...
1.5k
views
answered
Oct 6, 2017
Programming in C
gate1988
normal
descriptive
loop-invariants
+
–
3
votes
66
GATE CSE 1988 | Question: 13iv
Solve the recurrence equations: $T(n)= T( \frac{n}{2})+1$ $T(1)=1$
Solve the recurrence equations:$T(n)= T( \frac{n}{2})+1$$T(1)=1$
3.3k
views
answered
Oct 6, 2017
Algorithms
gate1988
descriptive
algorithms
recurrence-relation
+
–
2
votes
67
MadeEasy Subject Test: Compiler Design - Parsing
EXPLAIN...
EXPLAIN...
496
views
answered
Oct 6, 2017
Compiler Design
made-easy-test-series
compiler-design
first-and-follow
parsing
+
–
0
votes
68
execution time
A particular parallel program computation requires 100ns when executed on a single processor . If 20% of this computation is sequential then execution time for this program running with 4 processors is
A particular parallel program computation requires 100ns when executed on a single processor . If 20% of this computation is sequential then execution time for this pro...
437
views
answered
Oct 5, 2017
0
votes
69
B + tree
Following parameters to construct B+ tree search key - 15B block size - 512B record pointer - 9B block pointer - 8B Max num of keys that can be accomodated in each non leaf node of the tree is
Following parameters to construct B+ treesearch key - 15Bblock size - 512Brecord pointer - 9Bblock pointer - 8BMax num of keys that can be accomodated in each non leaf no...
364
views
answered
Oct 5, 2017
1
votes
70
combinatorics
que- in how many way can 7 girl are seated at a round table so that 2 particular girl are seprated ???
que- in how many way can 7 girl are seated at a round table so that 2 particular girl are seprated ???
507
views
answered
Oct 4, 2017
Combinatory
combinatory
discrete-mathematics
general
+
–
2
votes
71
NIELIT 2017 July Scientist B (CS) - Section B: 13
For the graph shown, which of the following paths is a Hamilton circuit? $ABCDCFDEFAEA$ $AEDCBAF$ $AEFDCBA$ $AFCDEBA$
For the graph shown, which of the following paths is a Hamilton circuit?$ABCDCFDEFAEA$$AEDCBAF$$AEFDCBA$$AFCDEBA$
2.1k
views
answered
Oct 3, 2017
Graph Theory
nielit2017july-scientistb-cs
discrete-mathematics
graph-theory
+
–
0
votes
72
digital logic
A decimal number has 25 digits. The number of bits required for its equivalent binary representation is approximately 1)50 2)75 3)60 4)70
A decimal number has 25 digits. The number of bits required for its equivalent binary representation is approximately1)502)753)604)70
491
views
answered
Sep 29, 2017
1
votes
73
UGC NET CSE | June 2009 | Part 2 | Question: 16
Which of the following does not represent a valid storage class in ’c’? automatic static union extern
Which of the following does not represent a valid storage class in ’c’?automaticstaticunion extern
8.8k
views
answered
Sep 22, 2017
Programming in C
ugcnetcse-june2009-paper2
programming-in-c
storage-classes-in-c
+
–
1
votes
74
Function
How many onto function are there from a set with 5 element to a set with 4 elements? A. 340 B. 240 C. 440 D. 540
How many onto function are there from a set with 5 element to a set with 4 elements?A. 340 B. 240 C. 440 D. 540
339
views
answered
Sep 22, 2017
0
votes
75
mutual exclusion
Initial values of S1 ansd S2 are random assigned Method by P1 do { flag[i] = true; S1 = S2; while( flag[j]=true and S1 == S2); critical section flag[i]=false; remainder section }while(1); Method used by P2 do { flag[j]=true; S1=S2+1; while(flag[i]=true and S1!=S2); criticals ection flag[j]=false; remainder section } while(1); Does this gurantee mutual exclusion?
Initial values of S1 ansd S2 are random assignedMethod by P1do{flag[i] = true;S1 = S2;while( flag[j]=true and S1 == S2);critical sectionflag[i]=false;remainder section}w...
378
views
answered
Sep 21, 2017
4
votes
76
Bit stuffing
In bit stuffing protocol for frame synchronization, if stuff bit pattern is $01110$ then how many zero bits stuffed by transmitter white transmitting given frame (except start of transmission and end of transmission)? $\text{Data frame:} 1011101111011111110$
In bit stuffing protocol for frame synchronization, if stuff bit pattern is $01110$ then how many zero bits stuffed by transmitter white transmitting given frame (except ...
2.7k
views
answered
Sep 21, 2017
Computer Networks
bit-stuffing
computer-networks
+
–
0
votes
77
Deadlock detection
Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is A. 11 B. 12 C. 13 D. 14 I know the answer is 11.But how?
Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The mini...
431
views
answered
Aug 21, 2017
0
votes
78
Programming in C
#include <stdio.h> void f(int,int); int main(void){ int a = 5; f(a,a); printf("%d",a); } void f(int x, int y){ x--; y=y+15; } If copy-restore is used, then what will be the value of print(a)?
#include <stdio.h void f(int,int); int main(void){ int a = 5; f(a,a); printf("%d",a); } void f(int x, int y){ x ; y=y+15; }If copy-restore is used, then what will be the ...
737
views
answered
Aug 18, 2017
Programming in C
programming-in-c
pointers
output
+
–
0
votes
79
Computer Networks: Basic doubt in TCP operation
When we have a segment of say 100 bytes and my last ACK number is assume 4000, Now my current sequence number will be (4000-4099) for 100 bytes segment. This is what we generally use a notation. But in one segment we have only one field as sequence number.So how can we specify Range? Ip has length fields in Ipv4/V6/UDP but why not in TCP?
When we have a segment of say 100 bytes and my last ACK number is assume 4000,Now my current sequence number will be (4000-4099) for 100 bytes segment. This is what we ge...
644
views
answered
Aug 16, 2017
Computer Networks
computer-networks
network
+
–
2
votes
80
UPSC prelim test
A bag contains 20 balls. 8 balls are green, 7 are white and 5 are red. What is the minimum number of balls that must be picked up from the bag blind-folded (without replacing any of it) to be assured of picking atleast one ball of each colour? a) 15 b) 16 c) 17 d)18
A bag contains 20 balls. 8 balls are green, 7 are white and 5 are red. What is the minimum number of balls that must be picked up from the bag blind-folded (without repla...
2.7k
views
answered
Aug 14, 2017
Combinatory
pigeonhole-principle
discrete-mathematics
+
–
0
votes
81
Stack life
Let S be a stack size of 4>=1 and it is initially empty.Suppose we push the numbers 1,2,3,4 and then perform 4 pop operations.Let one push operation takes 5ns; one pop operation takes 5ns; the time between the end of one such stack operation and start of next operation is 2ns. ... ) from the stack.The average stack life of an element of this stack is........................(in ns).
Let S be a stack size of 4>=1 and it is initially empty.Suppose we push the numbers 1,2,3,4 and then perform 4 pop operations.Let one push operation takes 5ns; one pop op...
948
views
answered
Aug 8, 2017
Programming in C
data-structures
stack
+
–
0
votes
82
explain the output please.
#include <stdio.h> #include <string.h> void fun(char *arr) { int i; unsigned int n = sizeof(arr); printf("n = %d\n", n); for (i=0; i<n; i++) printf("%c ", arr[i]); } // Driver program int main() { char arr[] = {'k', 'h', 'u', 's', 'h', 'a', 'l'}; fun(arr); return 0; }
#include <stdio.h>#include <string.h>void fun(char *arr){int i;unsigned int n = sizeof(arr);printf("n = %d\n", n);for (i=0; i<n; i++) printf("%c ", arr[i]);}// Driver pro...
1.6k
views
answered
Aug 6, 2017
Programming in C
programming-in-c
+
–
0
votes
83
check this :)
can anyone tell me difference between dense and sparse matrix :))
can anyone tell me difference between dense and sparse matrix :))
437
views
answered
Aug 5, 2017
1
votes
84
Morris Mano exercise 1.6
The solution to the quadratic equation x^2-11x+22=0 are x=3 and x=6. What is the base of the numbers?
The solution to the quadratic equationx^2-11x+22=0 are x=3 and x=6. What is the base of the numbers?
6.6k
views
answered
Aug 3, 2017
3
votes
85
Probability
A box contains 4 red balls and 6 black balls .Three balls are selected randomly from the box one after another without replacement .The probability that the selected set contains one red ball and two black ball is A)1/20 B) 1/12 C) 3/10 D)1/2
A box contains 4 red balls and 6 black balls .Three balls are selected randomly from the box one after another without replacement .The probability that the selected set ...
2.3k
views
answered
Aug 2, 2017
Mathematical Logic
probability
engineering-mathematics
discrete-mathematics
+
–
1
votes
86
Probability
Consider the experiment of throwing a die, if a multiple of 3 comes up, throw the die again and if any other number comes, toss a coin. Find the conditional probability of the event ‘the coin shows a tail’, given that ‘at least one die shows a 3’
Consider the experiment of throwing a die, if a multiple of 3 comes up, throw thedie again and if any other number comes, toss a coin. Find the conditional probabilityof ...
571
views
answered
Aug 2, 2017
1
votes
87
SELF MADE
10 distinct accident occurs in a week.What is the probability that all accidents occured on the same day ?
10 distinct accident occurs in a week.What is the probability that all accidents occured on the same day ?
498
views
answered
Aug 2, 2017
0
votes
88
Asymptotic time complexity
If f(n)=O(g(n)). && g(n) != O(f(n)) g(n) = O(h(n)). && h(n) = O(g(n)) Check following statement are true/false? 1. f(n)+h(n)=theta(g(n)) 2. f(n)*h(n)=theta(g(n)*h(n)) 3. g(n)*f(n)=big omega(h(n)*f(n)) 4. h(n)+g(n) = O(f(n))
If f(n)=O(g(n)). && g(n) != O(f(n))g(n) = O(h(n)). && h(n) = O(g(n))Check following statement are true/false?1. f(n)+h(n)=theta(g(n))2. f(n)*h(n)=theta(g(n)*h(n))3. g...
543
views
answered
Aug 2, 2017
Algorithms
algorithms
asymptotic-notation
+
–
1
votes
89
Kenneth Rosen Edition 6th Exercise 7.4 Example 2 (Page No. 489)
Hi, following is a question from Kenneth H. Rosen : Find the smallest relation containing the relation R ={(a, b) | a>b} that is both reflexive and symmetric? The online solution given to the above problem ... closure(which should be reflexive and symmetric) of the given relation? Can someone please help me understand this question?
Hi, following is a question from Kenneth H. Rosen :Find the smallest relation containing the relation R ={(a, b) | a>b} that is both reflexive and symmetric?The online s...
933
views
answered
Aug 2, 2017
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
set-theory
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register