Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
zambus
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by zambus
2
votes
1
GATE CSE 2008 | Question: 12
Some code optimizations are carried out on the intermediate code because They enhance the portability of the compiler to the target processor Program analysis is more accurate on intermediate code than on machine code The information from ... analysis cannot otherwise be used for optimization The information from the front end cannot otherwise be used for optimization
Some code optimizations are carried out on the intermediate code becauseThey enhance the portability of the compiler to the target processorProgram analysis is more accur...
14.9k
views
answered
Jan 4, 2016
Compiler Design
gatecse-2008
normal
code-optimization
compiler-design
+
–
3
votes
2
TCP
You are hired to design a reliable byte stream protocol that uses a sliding window protocol like TCP .The protocol will run over 1Gbps n/w. the RTT is 140 ns and maximum segment lifetime (MSL)is 60sec. How many bits would you require in the Advertise window field of TCP header to keep pipe full??
You are hired to design a reliable byte stream protocol that uses a sliding window protocol like TCP .The protocol will run over 1Gbps n/w. the RTT is 140 ns and maximum ...
3.8k
views
answered
Dec 30, 2015
Computer Networks
computer-networks
tcp
+
–
0
votes
3
Patterson Chap 2 Q 19
19. Suppose we want to transmit the message 1011 0010 0100 1011 and protect it from errors using the CRC8 polynomial x8+ x2+ x1 + 1. (a) Use polynomial long division to determine the message that should be transmitted. (b) Suppose the leftmost ... link. What is the result of the receiver’s CRC calculation? How does the receiver know that an error has occurred?
19. Suppose we want to transmit the message 1011 0010 0100 1011and protect it from errors using the CRC8 polynomialx8+ x2+ x1 + 1.(a) Use polynomial long division to dete...
5.3k
views
answered
Dec 16, 2015
Computer Networks
computer-networks
reference-book
difficult
crc-polynomial
+
–
0
votes
4
TIFR CSE 2011 | Part A | Question: 10
Let $m$, $n$ denote two integers from the set $\{1, 2,\dots,10\}$. The number of ordered pairs $\left ( m, n \right )$ such that $2^{m}+2^{n}$ is divisible by $5$ is. $10$ $14$ $24$ $8$ None of the above
Let $m$, $n$ denote two integers from the set $\{1, 2,\dots,10\}$. The number of ordered pairs $\left ( m, n \right )$ such that $2^{m}+2^{n}$ is divisible by $5$ is.$10$...
2.0k
views
answered
Dec 12, 2015
Set Theory & Algebra
tifr2011
set-theory&algebra
set-theory
+
–
2
votes
5
TIFR CSE 2011 | Part A | Question: 14
The limit $\lim_{x \to 0} \frac{d}{dx}\,\frac{\sin^2 x}{x}$ is $0$ $2$ $1$ $\frac{1}{2}$ None of the above
The limit $$\lim_{x \to 0} \frac{d}{dx}\,\frac{\sin^2 x}{x}$$ is$0$$2$$1$$\frac{1}{2}$None of the above
2.3k
views
answered
Dec 11, 2015
Calculus
tifr2011
calculus
limits
+
–
2
votes
6
TIFR CSE 2011 | Part B | Question: 32
Various parameter passing mechanisms have been in used in different programming languages. Which of the following statements is true? Call by value result is used in language Ada. Call by value result is the same as call by name. Call by value is the most robust. Call by reference is the same as call by name. Call by name is the most efficient.
Various parameter passing mechanisms have been in used in different programming languages. Which of the following statements is true?Call by value result is used in langu...
1.7k
views
answered
Dec 10, 2015
Programming in C
tifr2011
programming
parameter-passing
+
–
0
votes
7
TIFR2010-Maths-B-7
Number of solutions of the ordinary differential equation. $\frac{d^{2}y}{dx^{2}}-y=0, y(0)=0, y(\pi )=1$ is 0 is 1 is 2 None of the above
Number of solutions of the ordinary differential equation.$\frac{d^{2}y}{dx^{2}}-y=0, y(0)=0, y(\pi )=1$is 0is 1is 2None of the above
529
views
answered
Dec 9, 2015
Calculus
tifrmaths2010
calculus
+
–
0
votes
8
TIFR2010-Maths-B-6
Let $A, B$ be subsets of $\mathbb{R}$. Define $A + B$ to be the set of all sums $x +y$ with $x \in A$ and $y \in B$. Which of the following statements is false? If $A$ and $B$ are bounded, then $A + B$ is bounded If $A$ and $B$ are open, then $A + B$ is open If $A$ and $B$ are closed, then $A + B$ is closed If $A$ and $B$ are connected, then $A + B$ is connected
Let $A, B$ be subsets of $\mathbb{R}$. Define $A + B$ to be the set of all sums $x +y$ with $x \in A$ and $y \in B$. Which of the following statements is false?If $A$ and...
934
views
answered
Dec 8, 2015
Set Theory & Algebra
tifrmaths2010
set-theory&algebra
set-theory
+
–
9
votes
9
TIFR CSE 2010 | Part B | Question: 24
Consider the following program operating on four variables $u, v, x, y$, and two constants $X$ and $Y$. x, y, u, v:= X, Y, Y, X; While (x ≠ y) do if (x > y) then x, v := x - y, v + u; else if (y > x) then y, u:= y ... . The program prints $\frac1 2 \times \text{gcd}(X, Y)$ followed by $\frac1 2 \times \text{lcm}(X, Y)$. The program does none of the above.
Consider the following program operating on four variables $u, v, x, y$, and two constants $X$ and $Y$.x, y, u, v:= X, Y, Y, X; While (x ≠ y) do if (x y) then x, v := ...
1.7k
views
answered
Dec 3, 2015
Algorithms
tifr2010
algorithms
identify-function
+
–
4
votes
10
TIFR CSE 2010 | Part B | Question: 31
Consider the following computation rules. Parallel-outermost rule: Replace all the outermost occurrences of F (i.e., all occurrences of F which do not occur as arguments of other F's) simultaneously. Parallel - innermost rule: Replace all the innermost ... $0$ and $0$ respectively $w$ and $w$ respectively $w$ and $1$ respectively none of the above
Consider the following computation rules. Parallel-outermost rule: Replace all the outermost occurrences of F (i.e., all occurrences of F which do not occur as arguments ...
1.6k
views
answered
Dec 1, 2015
Programming in C
tifr2010
programming
recursion
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register