Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Arjun
71
votes
1681
GATE CSE 2011 | Question: 25
An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array $A[0:n-1]$ is given below. Let $L_i$ ... The algorithm has a non-linear polynomial complexity and uses branch and bound paradigm The algorithm uses divide and conquer paradigm
An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array $A[0:n-1]$ is given below.Let $L_i$, denote the length of the long...
15.1k
views
answered
Dec 15, 2014
Algorithms
gatecse-2011
algorithms
easy
dynamic-programming
+
–
3
votes
1682
Minimum cost spanning tree
Please explain why the answer is a)
Please explain why the answer is a)
786
views
answered
Dec 14, 2014
Algorithms
algorithms
spanning-tree
minimum-spanning-tree
made-easy-test-series
+
–
55
votes
1683
GATE CSE 2000 | Question: 2.22
Suppose the time to service a page fault is on the average $10$ milliseconds, while a memory access takes $1$ microsecond. Then a $99.99\%$ hit ratio results in average memory access time of $1.9999$ milliseconds $1$ millisecond $9.999$ microseconds $1.9999$ microseconds
Suppose the time to service a page fault is on the average $10$ milliseconds, while a memory access takes $1$ microsecond. Then a $99.99\%$ hit ratio results in average m...
18.0k
views
answered
Dec 14, 2014
Operating System
gatecse-2000
operating-system
easy
virtual-memory
+
–
3
votes
1684
solve
Suppose that stacks and queues are provided as opaque data types, offering only operations to add elements, to remove elements, and to test for emptiness. Suppose that a programmer wants to count the number of elements in a given stack or queue $C$, which is currently in some state $t$, using only one ... queue and $D$ is a stack. None $1$ and $2$ only. $1$ and $3$ only. $1$, $2$ and $3$.
Suppose that stacks and queues are provided as opaque data types, offering only operations to add elements, to remove elements, and to test for emptiness. Suppose that a ...
1.6k
views
answered
Dec 14, 2014
DS
data-structures
stack
queue
+
–
0
votes
1685
What will be the output for f(p,p), if p is initialized to 4.
int f(int &x, int c) { c=c-1; if(c==0) return 1; x=x+1; return f(x,c) * x; } What will be the output for f(p,p), if p is initialized to 4.
int f(int &x, int c){c=c-1;if(c==0) return 1;x=x+1;return f(x,c) * x;}What will be the output for f(p,p), if p is initialized to 4.
317
views
answered
Dec 14, 2014
6
votes
1686
what is difference between deep binding and shallow binding? Explain with this code.
int x=5; void f() { x = x+50; } void g(h()) { int x=10; h(); print(x); } void main() { g(f()); print(x); } 1) what is output if code uses deep binding? 2)what is the output if code uses shallow binding?
int x=5; void f() { x = x+50; } void g(h()) { int x=10; h(); print(x); } void main() { g(f()); print(x); }1) what is output if code uses deep binding?2)what is the output...
13.1k
views
answered
Dec 14, 2014
Programming in C
programming
programming-in-c
+
–
72
votes
1687
GATE CSE 2000 | Question: 2.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
Consider the following functions$f(n) = 3n^{\sqrt{n}}$$g(n) = 2^{\sqrt{n}{\log_{2}n}}$$h(n) = n!$Which of the following is true?$h(n)$ is $O(f(n))$$h(n)$ is $O(g(n))$$g(n...
22.6k
views
answered
Dec 14, 2014
Algorithms
gatecse-2000
algorithms
asymptotic-notation
normal
+
–
17
votes
1688
TIFR CSE 2014 | Part B | Question: 7
Which of the following statements is TRUE for all sufficiently large $n$? $\displaystyle \left(\log n\right)^{\log\log n} < 2^{\sqrt{\log n}} < n^{1/4}$ $\displaystyle 2^{\sqrt{\log n}} < n^{1/4} < \left(\log n\right)^{\log\log n}$ ... $\displaystyle 2^{\sqrt{\log n}} < \left(\log n\right)^{\log\log n} < n^{1/4}$
Which of the following statements is TRUE for all sufficiently large $n$?$\displaystyle \left(\log n\right)^{\log\log n} < 2^{\sqrt{\log n}} < n^{1/4}$ $\displaystyle 2^{...
3.9k
views
answered
Dec 14, 2014
Algorithms
tifr2014
algorithms
time-complexity
+
–
70
votes
1689
GATE CSE 2000 | Question: 2.16
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited `in a postorder, inorder and preorder traversal respectively, of a complete binary tree. Which of the following is always true? LASTIN = LASTPOST LASTIN = LASTPRE LASTPRE = LASTPOST None of the above
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited in a postorder, inorder and preorder traversal respectively, of a complete binary tree. Which of the foll...
17.5k
views
answered
Dec 14, 2014
DS
gatecse-2000
data-structures
binary-tree
normal
+
–
4
votes
1690
What is the output, explain
int main(void) { char p[20]; char *s = "Gate015"; int length = strlen(s); int i=0; for(i=0;i<length;i++) p[i]=s[length-i]; printf("%s",p); return 0; }
int main(void) { char p[20]; char *s = "Gate015"; int length = strlen(s); int i=0; for(i=0;i<length;i++) p[i]=s[length-i]; printf("%s",p); return 0; }
347
views
answered
Dec 14, 2014
Programming in C
programming-in-c
+
–
48
votes
1691
GATE CSE 2002 | Question: 1.21
In $2's$ complement addition, overflow is flagged whenever there is carry from sign bit addition cannot occur when a positive value is added to a negative value is flagged when the carries from sign bit and previous bit match None of the above
In $2's$ complement addition, overflowis flagged whenever there is carry from sign bit additioncannot occur when a positive value is added to a negative valueis flagged w...
9.2k
views
answered
Dec 14, 2014
Digital Logic
gatecse-2002
digital-logic
number-representation
normal
+
–
1
votes
1692
plez tell me the correct approach and meaning of question
397
views
answered
Dec 14, 2014
49
votes
1693
GATE IT 2004 | Question: 49
A CPU has only three instructions $I1, I2$ and $I3,$ which use the following signals in time steps $T1-T5$: $I1 : T1$ : Ain, Bout, Cin $T2$ : PCout, Bin $T3$ : Zout, Ain $T4$ : Bin, Cout $T5$ : End $I2 : T1$ : Cin, Bout, Din $T2$ : Aout, Bin $T3$ : Zout, Ain $T4$ : Bin, ... $(T1 + T2 ).I1 + (T2 + T4).I3 + T3$ $(T1 + T2 ).I2 + (T1 + T3).I1 + T3$
A CPU has only three instructions $I1, I2$ and $I3,$ which use the following signals in time steps $T1-T5$:$I1 : T1$ : Ain, Bout, Cin $T2$ : PCout, Bin $T...
8.5k
views
answered
Dec 14, 2014
CO and Architecture
gateit-2004
co-and-architecture
microprogramming
normal
+
–
0
votes
1694
which of the following is false?
for an arbitrary CFG G, there exist an algorithm a) to check if L(G) contain infinite strings b) to check which variable appear in some sentential form c) to check which variable are nullable d) to check which variable are useless e) none of these
for an arbitrary CFG G, there exist an algorithm a) to check if L(G) contain infinite stringsb) to check which variable appear in some sentential formc) to check which va...
1.0k
views
answered
Dec 13, 2014
2
votes
1695
A fair coin is tossed 100 times. The Probability of getting 50 heads is close to one of the following numbers: a) 0.001 b)0.1 c)0.3 d)0.4
A fair coin is tossed 100 times. The Probability of getting 50 heads is close to one of the following numbers:a)0.001b)0.1c)0.3 d)0.4
1.4k
views
answered
Dec 13, 2014
Probability
engineering-mathematics
probability
+
–
15
votes
1696
GATE Overflow | Mock GATE | Test 1 | Question: 53
A class of first year B.tech students is composed of four batches A, B, C and D, each consisting of $30$ students. It is found that the sessional marks of students in Engineering Drawing in batch C have a mean of $6.6$ and standard deviation of $2.3$. ... this, the marks of a student in batch C are changed from $8.5$ to $8.75$ $7.45$ $9.27$ $8.97$
A class of first year B.tech students is composed of four batches A, B, C and D, each consisting of $30$ students. It is found that the sessional marks of students in Eng...
1.4k
views
answered
Dec 12, 2014
Probability
go-mockgate-1
engineering-mathematics
probability
statistics
+
–
0
votes
1697
plz answer..
810
views
answered
Dec 12, 2014
2
votes
1698
Consider the following C code
main() { int x, y= 100; float *P; P=&y; x=*P; printf("%d", x); } what is output? a) 100 b) 1 c) 0 d) none
main() { int x, y= 100; float *P; P=&y; x=*P; printf("%d", x); }what is output?a) 100b) 1c) 0d) none
315
views
answered
Dec 12, 2014
Programming in C
programming
non-gate
+
–
3
votes
1699
consider the program:
762
views
answered
Dec 12, 2014
Programming in C
programming
+
–
3
votes
1700
what is the output of foo(10)?
int foo(unsigned int n) { int c,x=0; while(n!=0) { if(n&01) x++; n>>=1; } return c; }
int foo(unsigned int n) { int c,x=0; while(n!=0) { if(n&01) x++; n>>=1; } return c; }
1.3k
views
answered
Dec 12, 2014
Programming in C
programming
recursion
+
–
6
votes
1701
Consider the following program
int i = 1; int main() { int a[]= { 0,1, 2} ; f(a[i], i); printf("%d", a[i]); } void f(int x, int y) { y++; x=5*i; } In above function f() uses " call by name" technique, what is the output printed? a) 2 b) 10 c) 5 d) 1
int i = 1; int main() { int a[]= { 0,1, 2} ; f(a[i], i); printf("%d", a[i]); } void f(int x, int y) { y++; x=5*i; }In above function f() uses " call by name" technique, w...
906
views
answered
Dec 12, 2014
Programming in C
programming
parameter-passing
+
–
2
votes
1702
use of unions in c
what are the reasons to use unions or not to use unions in C?why unions in ada are better than C implementation ?
what are the reasons to use unions or not to use unions in C?why unions in ada are better than C implementation ?
489
views
answered
Dec 12, 2014
4
votes
1703
plz answer...
318
views
answered
Dec 8, 2014
Theory of Computation
theory-of-computation
grammar
context-sensitive
+
–
2
votes
1704
ARP protocol belongs to which layer of OSI model.? According to me it is neither completely layer-3 (Network layer) nor completely layer-2(data link layer).Please clarify
729
views
answered
Dec 8, 2014
3
votes
1705
plz answer this..
270
views
answered
Dec 8, 2014
1
votes
1706
please answer this..
301
views
answered
Dec 8, 2014
5
votes
1707
plz answer...
297
views
answered
Dec 8, 2014
67
votes
1708
GATE CSE 2008 | Question: 76
Delayed branching can help in the handling of control hazards For all delayed conditional branch instructions, irrespective of whether the condition evaluates to true or false, The instruction following the conditional branch instruction in memory is ... The first instruction in the taken path is executed The branch takes longer to execute than any other instruction
Delayed branching can help in the handling of control hazardsFor all delayed conditional branch instructions, irrespective of whether the condition evaluates to true or f...
17.8k
views
answered
Dec 8, 2014
CO and Architecture
gatecse-2008
co-and-architecture
pipelining
normal
+
–
3
votes
1709
Deadlock
Consider a system consisting of n resources of same type being shared by 4 processes, 2 of which need at most 2 resources each and other need at most 3 resources each.The min value of n so that the system is deadlock free is ___________?
Consider a system consisting of n resources of same type being shared by 4 processes, 2 of which need at most 2 resources each and other need at most 3 resources each.Th...
1.7k
views
answered
Dec 7, 2014
5
votes
1710
Probability
10 men and their wives participate in a corporate mixed-doubles tennis championship. What is the probability that no couple play in the second game? 0.6222 0.3111 0.4285 0.2777
10 men and their wives participate in a corporate mixed-doubles tennis championship. What is the probability that no couple play in the second game?0.62220.31110.42850.27...
956
views
answered
Dec 7, 2014
Quantitative Aptitude
probability
+
–
Page:
« prev
1
...
52
53
54
55
56
57
58
59
60
61
62
...
70
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register