Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Aboveallplayer
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Aboveallplayer
0
votes
0
answers
1
IIIT Allahabad Query
if i opt for a integrated Phd in IIIT-A 1.will i also get a Mtech after completion of the degree?or only phd? 2.what will i miss ?(apart from the fact that i will miss a chance of phd from IIT)) given:Placement is not my concern
if i opt for a integrated Phd in IIIT-A1.will i also get a Mtech after completion of the degree?or only phd?2.what will i miss ?(apart from the fact that i will miss a ch...
434
views
asked
Mar 27, 2017
0
votes
3
answers
2
gate 2017 cs just doubt
does Random page replacement algorithm suffers from belady's anomaly?
does Random page replacement algorithm suffers from belady's anomaly?
3.1k
views
asked
Feb 11, 2017
0
votes
1
answer
3
Throughput of memory system---urgent
How to calulate the Throughput of memory system when average access time is given
How to calulate the Throughput of memory system when average access time is given
368
views
asked
Feb 10, 2017
CO and Architecture
memory-management
computer-networks
+
–
0
votes
1
answer
4
YACC-
in case of shift-reduce and R-R conflict, which is favored by YACC?
in case of shift-reduce and R-R conflict, which is favored by YACC?
473
views
asked
Feb 3, 2017
Compiler Design
compiler-design
parsing
lr-parser
descriptive
+
–
1
votes
1
answer
5
Time Complexity
main() { int (b=1;b<=n;b*=2) { for(i=0;i<b;i++) { for(j=0;j<n;j+=2) { sum+=j; } for(j=0;j<n;j*=2) { sum*=j; } } } what is the complexity? }
main(){int (b=1;b<=n;b*=2){ for(i=0;i<b;i++) { for(j=0;j<n;j+=2) { sum+=j; } ...
1.5k
views
asked
Jan 29, 2017
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
0
votes
1
answer
6
TOC grammar
we know that for every RE language,there exist an unrestricted grammar...can we claim the opposite also?? (i.e for every Unrestcd grammar,there exist a RE)?
we know that for every RE language,there exist an unrestricted grammar...can we claim the opposite also??(i.e for every Unrestcd grammar,there exist a RE)?
385
views
asked
Jan 27, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
7
TOC Language Property Discussion
Here are some fundamental questions that i am a bit doubtful 1.Regular languages are closed under a)infinite Union b)infinite intersection or not? 2.what is the intersection of CFL and a Regular Language
Here are some fundamental questions that i am a bit doubtful1.Regular languages are closed under a)infinite Union b)infinite intersection or not?2.what is the intersecti...
304
views
asked
Jan 27, 2017
1
votes
1
answer
8
Binary search tree construction Doubt
What is the worst case time complexity to construct a binary search tree.??? Now i know ,that if a BST is left or right-skewed, searching an element takes O(n) time.so suppose i want to insert 10,25,30,35,40 in a bst.. it will be completely right skewed.. So when ... so overall work =0+1+2+...+(n-1)=N(n-1)/2= O(n2) Am i correct here?? or it is O(nlogn)
What is the worst case time complexity to construct a binary search tree.???Now i know ,that if a BST is left or right-skewed, searching an element takes O(n) time.so sup...
2.2k
views
asked
Jan 24, 2017
DS
binary-search-tree
data-structures
+
–
0
votes
0
answers
9
Toc decidability
which of the following is decidable? a)the set of TM whose language contains 0* b) the set of all TM who accept same string after visiting atmost 100 distinct Tape cell c)set of Tm that generate same language answer given A; now my question is why B is not decidable???(i dont think it is same as equivalence of TM)
which of the following is decidable?a)the set of TM whose language contains 0*b) the set of all TM who accept same string after visiting atmost 100 distinct Tape cellc)...
224
views
asked
Jan 22, 2017
Theory of Computation
theory-of-computation
decidability
bad-question
+
–
0
votes
1
answer
10
MadeEasy Subject Test: Operating System - Process Schedule
I.waiting time gets longer if short process,falls behind long process II.it is always not good for time sharing system,where each process gets equal time share write true/false my question is 2nd one may not be true,if arrival time ... does not matter everyone is getting a share in slice so my answer is TF, is it correct answer given TT
I.waiting time gets longer if short process,falls behind long processII.it is always not good for time sharing system,where each process gets equal time sharewrite true/f...
291
views
asked
Jan 21, 2017
Operating System
made-easy-test-series
operating-system
process-scheduling
+
–
12
votes
1
answer
11
C programming
#include <stdio.h> int f(int *a,int b) { b = b-1; if(b == 0) return 1; else { *a = *a+1; return *a + f(a,b) ; } } int main() { int X = 5; printf("%d\n",f(&X,X)); } Predict the output If the return statement was return f(a,b)+ *a ; What would have been the output here ? Explain why there is change in output (if any)
#include <stdio.h int f(int *a,int b) { b = b-1; if(b == 0) return 1; else { *a = *a+1; return *a + f(a,b) ; } } int main() { int X = 5; printf("%d\n",f(&X,X)); }Predict ...
3.4k
views
asked
Jan 20, 2017
Programming in C
programming-in-c
+
–
1
votes
1
answer
12
MadeEasy Subject Test: Algorithms - Time Complexity
A program takes input of a binary tree with N nodes and computes a function f(x)=max height of left subtree-max height of right subtree what is the time complexity?
A program takes input of a binary tree with N nodes and computes a function f(x)=max height of left subtree-max height of right subtreewhat is the time complexity?
897
views
asked
Jan 19, 2017
DS
data-structures
binary-tree
time-complexity
made-easy-test-series
+
–
1
votes
1
answer
13
Floating point number
what is the hexadecimal representation of the floating point number (-48.625) in single precision, after rounding off and normalisation
what is the hexadecimal representation of the floating point number (-48.625) in single precision, after rounding off and normalisation
1.8k
views
asked
Jan 18, 2017
CO and Architecture
floating-point-representation
co-and-architecture
ieee-representation
number-representation
+
–
5
votes
2
answers
14
Testbook
int x=0; int A(n) { statement //takes O(1) time if(n==1) return 1; else { $X+=8.A\left ( \frac{n}{2}\right )+n^3$; } return X; } What is the time complexity f the above code?
int x=0;int A(n){ statement //takes O(1) time if(n==1) return 1; else { $X+=8.A\left ( \frac{n}{2}\right )+n^3$; } return X;}What is the time com...
1.5k
views
asked
Jan 15, 2017
Algorithms
time-complexity
algorithms
testbook-test-series
+
–
3
votes
6
answers
15
Testbook Test Series: Computer Networks - Sliding Window
packets are being transmitted using GB5 and here every 4th packet is lost.How many packets need to be transmitted to transmit 10 packets? my answr 18 given :20
packets are being transmitted using GB5 and here every 4th packet is lost.How many packets need to be transmitted to transmit 10 packets?my answr 18 given :20
2.3k
views
asked
Jan 15, 2017
Computer Networks
computer-networks
testbook-test-series
sliding-window
+
–
3
votes
1
answer
16
Time Complexity
what is the tightest upper bound of T(n)=T(n-1)+2n
what is the tightest upper bound of T(n)=T(n-1)+2n
1.6k
views
asked
Jan 8, 2017
Algorithms
algorithms
recurrence-relation
+
–
2
votes
2
answers
17
Combinatorics Doubt
A box contain 10 screws out of which 3 are defective.If two screws are drawn at random WITH REPLACEMENT.What is the probability that no screw is defective? Answer given as 7c2/10C2 my question is ,as its given With Replacement. So why not it is (7/10)*(7/10)
A box contain 10 screws out of which 3 are defective.If two screws are drawn at random WITH REPLACEMENT.What is the probability that no screw is defective?Answer given as...
1.1k
views
asked
Jan 4, 2017
1
votes
1
answer
18
Time Complexity
What is the time complexity of this? for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) {temp=temp+i;} }
What is the time complexity of this?for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) {temp=temp+i;}}
217
views
asked
Jan 4, 2017
Algorithms
time-complexity
+
–
1
votes
0
answers
19
Recurrence Relation-Counting technique
How to solve this equation an+2-5an+1+6an=2 where a0=1 and a1=2 i know how to solve if it is 0 in RHS, but how to take care of this 2?
How to solve this equationan+2-5an+1+6an=2 where a0=1 and a1=2i know how to solve if it is 0 in RHS, but how to take care of this 2?
302
views
asked
Jan 1, 2017
2
votes
1
answer
20
UNIX i-node3
consider a unix file system impleneted with i-node,that resides on a disk of size 512GB.Each i-node has atotal of 15 block addresses,consisting of direct and indirect block adresses. suppose we configure a file system to use a block size of 32KB.How many bytes are needed to store all 15 block addresses in an i-node? a)15byte b)29byte c)45byte d)75byte
consider a unix file system impleneted with i-node,that resides on a disk of size 512GB.Each i-node has atotal of 15 block addresses,consisting of direct and indirect bl...
979
views
asked
Dec 31, 2016
Operating System
inode
unix
operating-system
+
–
Page:
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register