# Questions by Aboveallplayer

1
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
2
does Random page replacement algorithm suffers from belady's anomaly?
3
How to calulate the Throughput of memory system when average access time is given
4
in case of shift-reduce and R-R conflict, which is favoured by YACC?
1 vote
5
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? }
6
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)?
7
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
1 vote
8
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 inserting 10 i need 0 ... n-1) comparisons so overall work =0+1+2+...+(n-1)=N(n-1)/2= O(n2) Am i correct here?? or it is O(nlogn)
9
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)
10
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 is same,then order really does not matter everyone is getting a share in slice so my answer is TF, is it correct answer given TT
11
#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)
1 vote
12
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?
1 vote
13
what is the hexadecimal representation of the floating point number (-48.625) in single precision, after rounding off and normalisation
14
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?
15
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
16
Find the coefficient of X3 in the expansion of (1+X)3(2+x2)10 a)$2^{10}$ b)$2^{12}$ c)$2^{14}$ d)$2^{16}$
17
what is the tightest upper bound of T(n)=T(n-1)+2n