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 saurabh111
0
votes
1
Calculate sum of (WAR, RAW and WAW) dependencies instructions.
Consider the following instructions. I 1 : R 1 = 100 I 2 : R 1 = R 2 + R 4 I 3 : R 2 = R 4 + 25 I 4 : R 4 = R 1 + R 3 I 5 : R 1 = R 1 + 30 Calculate sum of (WAR, RAW and WAW) dependencies the above instructions. (a) 10 (c) 6 (b) 12 (d) 8
Consider the following instructions.I 1 : R 1 = 100I 2 : R 1 = R 2 + R 4I 3 : R 2 = R 4 + 25I 4 : R 4 = R�...
5.4k
views
answered
Dec 23, 2020
CO and Architecture
data-dependency
data-hazards
+
–
0
votes
2
MadeEasy material
How storage mapping is done by compilers ? Even though actual loading of program in memory is done by loader. PS: This is the exact question as given in book, but i think it is memory mapping ?
How storage mapping is done by compilers ?Even though actual loading of program in memory is done by loader.PS: This is the exact question as given in book, but i think i...
998
views
answered
Nov 3, 2020
Compiler Design
compiler-design
runtime-environment
descriptive
made-easy-booklet
+
–
0
votes
3
fast retransmit and fast recovery mechanism
Consider the following plot of TCP window size as a function of time. Assume TCP is operating with slow start, congestion avoidance, fast retransmit and fast recovery mechanism. What is the time interval where the slow start ... value of threshold. It starts congestion avoidance phase again. Please explain in more details about the concept underlying?
Consider the following plot of TCP window size as a function of time. Assume TCP is operating with slow start, congestion avoidance, fast retransmit and fast recovery mec...
2.0k
views
answered
Sep 26, 2019
Computer Networks
computer-networks
tcp
congestion-control
+
–
0
votes
4
MadeEasy Test Series: Compiler Design - Intermediate Code
a x b x c + d - a + e x f - g + h order of precedence : x>+>- ; with x is left associative and +, - as right. Min number of variables required in TAC? Should'nt the expression be expressed as : ((a x b) x c) + d - a + (e x f) - g + h (((a x b) x c) + (d - (a + (e x f)) - (g + h)))
a x b x c + d - a + e x f - g + horder of precedence : x>+>- ; with x is left associative and +, - as right.Min number of variables required in TAC?Should'nt the expressi...
1.1k
views
answered
Sep 22, 2019
Compiler Design
made-easy-test-series
compiler-design
intermediate-code
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
