Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Michail
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Michail
0
votes
1
UGC_NET_2012 Find performance improvement on parallel execution
Suppose that a given application is run on a 64-processor machine and that 70 per cent of the application can be parallelized. Then the expected performance improvement is — (A) 4.22 (B) 3.22 (C) 3.32 (D) 3.52
Suppose that a given application is run on a 64-processor machine and that 70 per cent of the application can be parallelized. Then the expected performance improvement ...
956
views
answered
Jul 12, 2016
CO and Architecture
co-and-architecture
pipelining
+
–
0
votes
2
Self made
Which Languages from (regular, CSL, CFL, DCFL, recursive,REL) are closed under INFINITE UNION/ INFINITE INTERSECTION? Please answer with reason/proof.
Which Languages from (regular, CSL, CFL, DCFL, recursive,REL) are closed under INFINITE UNION/ INFINITE INTERSECTION? Please answer with reason/proof.
1.5k
views
answered
Jul 12, 2016
0
votes
3
GATE CSE 2003 | Question: 64
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume that Push and Pop operations take $X$ seconds each, and $Y$ seconds elapse between the end of one such ... S. The average stack-life of an element of this stack is $n(X+Y)$ $3Y+2X$ $n(X+Y)-X$ $Y+2X$
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume th...
30.7k
views
answered
Jul 12, 2016
DS
gatecse-2003
data-structures
stack
normal
+
–
0
votes
4
What Value Function Return ?
Consider the following C function: int f(int n) { static int r = 0; If (n < = 0) return 1; If (n > 3) { r = n; return f (n – 2) + 2; } return f(n – 1) + r; } What is the value of f(5)? (A) 3 (B) 7 (C) 9 (D) 18
Consider the following C function: int f(int n) { static int r = 0; If (n < = 0) r...
2.5k
views
answered
Jul 12, 2016
Programming in C
programming-in-c
functions
+
–
1
votes
5
Which of the following is a valid word of the language?
Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ? 10110010101 1010101010 000101010000 001010001010
Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ?101100101011010101010000101010000001010001010
621
views
answered
Jul 10, 2016
Theory of Computation
theory-of-computation
+
–
1
votes
6
MadeEasy Test Series: Computer Networks - Flow Control Methods
Station X needs to send a message consisting of 12 packets to station Y using a sliding window protocol (Window Size 4) and Go back n error control strategy. All packets are ready and immediately available for transmission. If every ... gets lost), then the number of packets that X will transmit for sending the message to Y are _____.
Station X needs to send a message consisting of 12 packets to station Y using a sliding window protocol (Window Size 4) and Go back n error control strategy. All packets ...
2.1k
views
answered
Jan 25, 2016
Computer Networks
made-easy-test-series
computer-networks
flow-control-methods
sliding-window
+
–
0
votes
7
Number of packets to be transmitted if every 6th is lost GBN?
Station A needs to send a message consisting of 15 packets to station B' using a sling window (window size 4) and go-back-N error control strategy. All packets are ready and immediately available for transmission. If every 6th packet that A' transmits ... A' will transmit for sending the message to B' ? (a) 29 (b) 33 (c) 27 (d) 25
Station A needs to send a message consisting of 15 packets to station ‘B’ using a sling window (window size 4) and go-back-N error control strategy. All packets are r...
7.1k
views
answered
Jan 25, 2016
Computer Networks
computer-networks
sliding-window
go-back-n
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register