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

asked Mar 27, 2017 in Written Exam | 112 views

0 votes

3 answers

2

gate 2017 cs just doubt
does Random page replacement algorithm suffers from belady's anomaly?

asked Feb 11, 2017 in Operating System | 1.7k views

0 votes

1 answer

3

Throughput of memory system---urgent
How to calulate the Throughput of memory system when average access time is given

asked Feb 10, 2017 in CO & Architecture | 159 views

0 votes

0 answers

4

GATE 2017 EC-Aptitude
In a group of 6 people 3 Indian and 3 Chineese there.. How many subset of people can be made, where in each subset at least one indian is there?

asked Feb 6, 2017 in Verbal Ability | 641 views

0 votes

1 answer

5

YACC-
in case of shift-reduce and R-R conflict, which is favoured by YACC?

asked Feb 3, 2017 in Compiler Design | 115 views

+1 vote

1 answer

6

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? }

asked Jan 30, 2017 in Algorithms | 380 views

0 votes

1 answer

7

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)?

asked Jan 27, 2017 in Theory of Computation | 96 views

0 votes

1 answer

8

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

asked Jan 27, 2017 in Theory of Computation | 79 views

+1 vote

1 answer

9

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)

asked Jan 25, 2017 in Algorithms | 450 views

0 votes

0 answers

10

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)

asked Jan 22, 2017 in Theory of Computation | 67 views

0 votes

1 answer

11

ME doubt
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

asked Jan 21, 2017 in Operating System | 40 views

+9 votes

1 answer

12

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)

asked Jan 20, 2017 in Programming | 661 views

+1 vote

1 answer

13

Algorithm ME
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?

asked Jan 20, 2017 in Algorithms | 205 views

+1 vote

1 answer

14

Floating point number
what is the hexadecimal representation of the floating point number (-48.625) in single precision, after rounding off and normalisation

asked Jan 18, 2017 in CO & Architecture | 506 views

+4 votes

2 answers

15

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?

asked Jan 15, 2017 in Algorithms | 409 views

+3 votes

2 answers

16

Testbook
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

asked Jan 15, 2017 in Computer Networks | 543 views

0 votes

1 answer

17

Coefficient
Find the coeffiecient of X3 in the expansion of (1+X)3(2+x2)10 a)2^10 b)2^12 c)2^14 d)2^16

asked Jan 8, 2017 in Mathematical Logic | 74 views

+3 votes

1 answer

18

Time Complexity
what is the tightest upper bound of T(n)=T(n-1)+2n

asked Jan 8, 2017 in Algorithms | 217 views

+2 votes

2 answers

19

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)

asked Jan 4, 2017 in Combinatory | 420 views

+1 vote

1 answer

20

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;} }

asked Jan 4, 2017 in Algorithms | 59 views

+1 vote

0 answers

21

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?

asked Jan 1, 2017 in Combinatory | 93 views

+2 votes

1 answer

22

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

asked Dec 31, 2016 in Operating System | 381 views

0 votes

1 answer

23

UNIX i-node2
How large a file can be addressed by a double indirect block alone in a 64 bit system?minimum block entry size 8 byte and block size 8KB

asked Dec 31, 2016 in Operating System | 80 views

0 votes

0 answers

24

UNIX i-node
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 the implementation wants to support a file size upto 1GB using only direct & single ... .At least how many of those 15 block addresses,should be used as single indirect adresses? a)0 b)1 c)2 d)3

asked Dec 31, 2016 in Operating System | 169 views

0 votes

0 answers

25

DBMS conceptual
suppose i m making a website where i have 3 group of people G1,G2,G3 ..i need to perform various operation ,depending on groups..But operations will be on any one group(no inter group operation). For example there will be NO sql query like ... 3 records.then perform operation on them now second approach is more modular. But according to performance, speed Which one should i take?

asked Dec 27, 2016 in Databases | 62 views

+1 vote

0 answers

26

Made Easy doubt
A fair coin is tossed until the same result turns up in succession(two head or two tail).Find the probability the number of tosses neede are even.. my approach ..P={P(x=2)+P(x=4)+P(x=6)+...}=0.33 Me answer 2*{P(x=2)+P(x=4)+P(x=6)+...}=0.66 what is the reason of this 2 multiplication?

asked Dec 23, 2016 in Probability | 133 views

0 votes

1 answer

27

Testbook-TOC
what is the number of states in dfa of all language over {a,b} where n(a)mod3>=n(b)mod2 how to think in this kind of question ??

asked Dec 20, 2016 in Theory of Computation | 74 views

+1 vote

2 answers

28

operating syatem
system has 9 identical resources and N processes competing for them..Each process can request at most 4 resources what is the minimum possible value of n which will lead to a deadlock?

asked Dec 17, 2016 in Operating System | 152 views

+1 vote

1 answer

29

..BCNF
Which of the following is false when R is is in 3NF but not in BCNF a)R must contain at least two overlapped CK b)R must consist proper subset of CK determines proper subset of some other CK c)R must consist at most one compound CK and others are simple CK d)R must consists at most two compound CK

asked Dec 17, 2016 in Databases | 123 views

+1 vote

0 answers

30

computer networking
in a heavily loaded network,which one we should use a)pure aloha b)slotted aloha

asked Dec 11, 2016 in Computer Networks | 66 views