Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
sushmita
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by sushmita
0
votes
0
answers
1
compiler conceptual doubt
WHAT IS A VALID ITEM FOR A VIABLE PREFIX? CAM SOMEONE EXPLAIN IN EASY WAY.
WHAT IS A VALID ITEM FOR A VIABLE PREFIX?CAM SOMEONE EXPLAIN IN EASY WAY.
390
views
asked
Dec 31, 2018
Compiler Design
compiler-design
parsing
lr-parser
+
–
3
votes
2
answers
2
gatebook test
Suppose the functions F and G can be computed in 8 and 3 nanoseconds by functional units UF and UG, respectively. Given three instances of UF and three instances of UG, it is required to implement the computation F(G(Xi)) for 1 ≤ i ≤ 13. A control Unit selects next task/s ... this computation is ( in nanoseconds): (A) 28 (B) 33 (C) 43 (D) 49 my answer is 43 but gatebook answer is 49.
Suppose the functions F and G can be computed in 8 and 3 nanoseconds by functional units UF and UG, respectively. Given three instances of UF and three instances of UG, i...
640
views
asked
Dec 18, 2018
CO and Architecture
gatebook
co-and-architecture
pipelining
+
–
2
votes
3
answers
3
gatebook COA test
Consider a program being run on a processor. A modification in processor design caused 30% of the program to speed up by ten times while three fourth of the remaining program has a speed up of 80 and 40% of the remaining part of the program performs poorer ... by 50%. The remaining program has a speedup of 1. The overall speedup of the program exact to two decimal places is:-
Consider a program being run on a processor. A modification in processor design caused 30% of the program to speed up by ten times while three fourth of the remaining pro...
606
views
asked
Dec 18, 2018
CO and Architecture
co-and-architecture
gatebook
speedup
+
–
1
votes
0
answers
4
https://gateoverflow.in/753/gate2001-12?show=279851#c279851
doubt in this gate question- https://gateoverflow.in/753/gate2001-12?show=279851#c279851 In instruction I3 how is it getting the value of r2 which is computed in I1 instruction?? Can memory access stage read the value of updated register values of write back stage?? please resolve my doubt.
doubt in this gate question- https://gateoverflow.in/753/gate2001-12?show=279851#c279851In instruction I3 how is it getting the value of r2 which is computed in I1 instru...
421
views
asked
Dec 18, 2018
CO and Architecture
co-and-architecture
pipelining
operand-forwarding
+
–
0
votes
1
answer
5
general doubt on pipelining
we do forwarding from WB stage to EX or from WB to MEM stage??
we do forwarding from WB stage to EX or from WB to MEM stage??
400
views
asked
Dec 17, 2018
CO and Architecture
co-and-architecture
pipelining
operand-forwarding
+
–
0
votes
1
answer
6
https://gateoverflow.in/14480/formula-write-back-write-through-access-time-parallel-serial
In this question can someone plz explain to me the write back part? Why are we taking write back time only for cache misses? Why not for hits? How to know when a block is going to be replaced and when to consider write back time.
In this question can someone plz explain to me the write back part? Why are we taking write back time only for cache misses? Why not for hits? How to know when a block i...
747
views
asked
Dec 12, 2018
CO and Architecture
cache-memory
co-and-architecture
write-through
+
–
0
votes
0
answers
7
General doubt.
I am unable to understand the memory access time for hierarchical and simultaneous access using write back policy even after reading from go sources. Can someone plz explain?
I am unable to understand the memory access time for hierarchical and simultaneous access using write back policy even after reading from go sources. Can someone plz expl...
254
views
asked
Dec 12, 2018
CO and Architecture
computer
co-and-architecture
cache-memory
effective-memory-access
+
–
0
votes
0
answers
8
conceptual doubt
in case of hierarchical memory organization when there is a miss in cache , we need to bring the entire block from main memory to cache so in the formula- AMAT= H1*T1+(1-H1(T1+T2)) T1- cache access time/word T2= memory access time/word T2 ... in some cases we just take word access time of main memory. also please tell me what should be T2 in case of simultaneous organization?
in case of hierarchical memory organization when there is a miss in cache , we need to bring the entire block from main memory to cache so in the formula-AMAT= H1*T1+(1-H...
514
views
asked
Dec 12, 2018
CO and Architecture
co-and-architecture
cache-memory
effective-memory-access
multilevel-cache
+
–
1
votes
1
answer
9
computer networks general
Which book is good for numerical problems for computer networks for GATE?
Which book is good for numerical problems for computer networks for GATE?
442
views
asked
Oct 15, 2018
Computer Networks
computer-networks
gate-preparation
+
–
2
votes
0
answers
10
MIT assignment
A geosynchronous satellite has a half-duplex channel with a transmission rate of 10 kbps and a propagation delay of 0.25 sec each way. With a data packet size of 1000 bits and a loss probability p of 0.001 ,(A) what is the expected transmission time of ... parameters are the same as part (a), what is the longest channel propagation delay for which we can still use stop-and-wait?
A geosynchronous satellite has a half-duplex channel with a transmission rate of 10 kbps and a propagation delay of 0.25 sec each way. With a data packet size of 1000 bit...
984
views
asked
Oct 15, 2018
Computer Networks
computer-networks
network-flow
flow-control-methods
stop-and-wait
data
data-link-layer
+
–
0
votes
1
answer
11
https://gateoverflow.in/3838/gate2005-it-75 self doubt
In a TDM medium access control bus LAN, each station is assigned one time slot per cycle for transmission. Assume that the length of each time slot is the time to transmit 100bits plus the end-to-end propagation delay. Assume ... division multiple access as only one station uses the medium in its slot? please if someone can clear this doubt.
In a TDM medium access control bus LAN, each station is assigned one time slot per cycle for transmission. Assume that the length of each time slot is the time to transmi...
435
views
asked
Oct 14, 2018
Computer Networks
computer-networks
ethernet
transmission-media
+
–
0
votes
0
answers
12
cormen 7th edition counting
How many ways are there for a horse race with three horses to finish if ties are possible?(Note: Two or three horses may tie) My answer is 9 but correct answer is 13. In the solution they have even considered the case of all three horses tying ... is it possible that in 3 horses race all three tie at third position? How can we get third without getting first and second?
How many ways are there for a horse race with three horses to finish if ties are possible?(Note: Two or three horses may tie)My answer is 9 but correct answer is 13.In th...
516
views
asked
Oct 4, 2018
Combinatory
combinatory
discrete-mathematics
counting
+
–
5
votes
3
answers
13
recurrence relation MIT
$T(n)=\sqrt{n} T(\sqrt{n})+100n$ Please solve this.
$T(n)=\sqrt{n} T(\sqrt{n})+100n$Please solve this.
2.1k
views
asked
Oct 4, 2018
Algorithms
recurrence-relation
algorithms
time-complexity
discrete-mathematics
+
–
2
votes
1
answer
14
general doubt on breadth first search
While doing BFS , at any time in queue suppose there are r vertices v1,v2,v3.....vr with v.d as the distance from the source. Then according to me at any time in a queue, v1.d=v2.d or v2.d=v1.d+1 But in cormen its written that v2.d<=v1.d+1 Can someone please explain?
While doing BFS , at any time in queue suppose there are r vertices v1,v2,v3.....vr with v.d as the distance from the source.Then according to me at any time in a queue,v...
569
views
asked
Oct 3, 2018
DS
breadth-first-search
data-structures
graph-algorithm
+
–
0
votes
1
answer
15
C programming
What is the interpretation of following C declaration: char *(*(**foo[][8])())[]; (A) foo is array of 8 pointer to pointer to function returning pointer to array of pointer to char. (B) foo is array of array of 8 pointer to pointer to function returning ... of char. (C) foo is array of array of 8 pointer to pointer to function returning pointer to array of pointer to char. (D) None
What is the interpretation of following C declaration:char *(*( foo[][8])())[];(A) foo is array of 8 pointer to pointer to function returning pointer to array of pointer ...
696
views
asked
Sep 30, 2018
Programming in C
output
programming-in-c
programming
pointers
+
–
1
votes
1
answer
16
C programming
The following is a C code- int main(void) { char buff[10]; memset(buff,0,sizeof(buff)); gets(buff); printf(" The buffer entered is [%s] ",buff); return 0; } (A) The program assigns a memory area to buff successfully and works fine. ... may not compile properly. (C) The program is compiled but it may lead to buffer over overflow sometimes. (D) The program has no issue
The following is a C code-int main(void) { char buff[10]; memset(buff,0,sizeof(buff)); gets(buff); printf(" The buffer entered is [%s] ",buff); return 0; }(A) The program...
6.0k
views
asked
Sep 29, 2018
Programming in C
programming-in-c
output
programming
+
–
0
votes
1
answer
17
C programming
What is the output of this program? int main(void) { int a = 10, b = 20, c = 30; printf(" %d..%d..%d ", a+b+c, (b = b*2), (c = c*2)); return 0; } (A) 60..40..60 (B) 110..40..60 (C) 110..20..30 (D) 60..20..30 does sequence point comes into picture here?
What is the output of this program?int main(void){int a = 10, b = 20, c = 30;printf(" %d..%d..%d ", a+b+c, (b = b*2), (c = c*2));return 0;}(A) 60..40..60(B) 110..40..60(C...
735
views
asked
Sep 29, 2018
Programming in C
programming-in-c
programming
pointers
+
–
1
votes
2
answers
18
rosen
How many strings of six lowercase letters from the English alphabet contain a) the letter a? b) the letters a and b? c) the letters a and b in consecutive positions with a preceding b, with all the letters distinct? d) the letters a and b, where a is somewhere to the left of b in the string, with all the letters distinct?
How many strings of six lowercase letters from the English alphabet containa) the letter a?b) the letters a and b?c) the letters a and b in consecutive positions with a p...
1.9k
views
asked
Sep 29, 2018
Combinatory
discrete-mathematics
combinatory
+
–
0
votes
1
answer
19
time complexity
If both of the algorithms A and B need O(nlogn) time then they both are equally efficient and finish in same amount of time. TRUE OR FALSE
If both of the algorithms A and B need O(nlogn) time then theyboth are equally efficient and finish in same amount of time.TRUE OR FALSE
575
views
asked
Sep 28, 2018
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
0
votes
1
answer
20
MIT assignment
Find the complexity of the following code fragment: int i = 1; for(; i <= n logn; i++) { for(i++; i <= n; i++) { printf("1") } }
Find the complexity of the following code fragment:int i = 1; for(; i <= n logn; i++) { for(i++; i <= n; i++) { printf("1") } }
846
views
asked
Sep 28, 2018
Algorithms
time-complexity
algorithms
mit-quiz
+
–
Page:
1
2
3
4
5
6
7
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register