Recent questions without answers

0 votes
0 answers
4111
How to find number of stall cycles and branch penalty & CPI in a branched instruction pipelining?
1 votes
0 answers
4113
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Co...
0 votes
0 answers
4114
0 votes
0 answers
4115
Which of the following is not true about Turing machine?(a) It can accept any palindrome(b) It can accept any context free language(c) It can accept {a^m b^n c^mn:m,n>=0(...
1 votes
0 answers
4116
Why does OS and DBMS have their own synchronisation mechanisms, when OS can alone do it and it sits at the bottom of DB?
0 votes
0 answers
4117
In second round of ccmt i got nit warangal cs-is and if i float again for third round i can get nit surathakal cs ,so for third round should i float or internal sliding f...
2 votes
0 answers
4120
0 votes
0 answers
4124
0 votes
0 answers
4126
Which of this is allowed by multiprogramming not by multitasking?A) New to readyB)Ready to RunningC) Waiting to runningD) Running to Waiting
1 votes
0 answers
4127
why do first sets can have epsilon symbol but follow sets don’t?P.S: I’ve a silly doubt :P
1 votes
0 answers
4128
Let $n,r\ $and$\ s$ be positive integers, each greater than $2$.Prove that $n^r-1$ divides $n^s-1$ if and only if $r$ divides $s$.
0 votes
0 answers
4129
T(n)=T(√n) + n I am finding it difficult to solve last step of this recurrence relation . Please help me with expansion of this recurrence relation.
2 votes
0 answers
4133
Which one of the following notations is most relevant for finding the best algorithm for a problem?(A) $o(f(n))$(B) $O(f(n))$(C) $\omega (f(n))$(D) $ \Omega (f(n))$
1 votes
0 answers
4134
0 votes
0 answers
4138
design a counter with the following binary sequence:0,4,2,1,6 and repeat use JK flip-flop
0 votes
0 answers
4140
how to write the query for natural join on three relations in SQL using the NATURAL JOIN clause?