325
views
1 answers
0 votes
377
views
1 answers
1 votes
let a functionf(x) =$n^3$+$n^4$+1so which are true1. θ($n^4$)2. θ($n^5$)3. θ(1)4. θ($n^3$)5. Ω ($n^4$)6. Ω ($n^5$)7. Ω (1)8. Ω ($n^3$)9. O ($n^4$)10. O ($n^5$)11....
8.0k
views
3 answers
1 votes
Let I take n=8 ,or 7. Can any one illustrate me this defination clearly .
258
views
0 answers
0 votes
The bipartite graph G = (V ,E) with bipartition (V1, V2) has a complete matching from V1 to V2 if and only if |N(A)| ≥ |A| for all subsetsA of V1.
7.0k
views
1 answers
2 votes
What does it means ?An undirected graph has an even number of vertices of odd degree. But let a 4 vertex cycle graph if it not complete having even vertex and even degree...
406
views
1 answers
0 votes
Consider the following first order logic formula in which R is a binary relation symbol.∀x∀y (R(x, y) = R(y, x))Only need to describe the question.@bikram sir.
503
views
1 answers
2 votes
What is meant by antisymmetric , asymmetric ? Any clear difference regarding symmetric, antisymmetric nd asymmetric regarding graph nd example?
309
views
1 answers
0 votes
A. Combinational CircuitB. Sequential CircuitC. NoneD. In Both A & B
224
views
0 answers
1 votes
Pls Explain Steps
193
views
0 answers
0 votes
If a up-down counter counts from 0-8 then it will count from 0 to -8 in down counting ?
199
views
0 answers
0 votes
Can any one describe from starting following thingsIs CPU generate virtual bits and cache bits ?How virtual bits are used to get mapping of cache bits & vice versa?
351
views
0 answers
0 votes
409
views
1 answers
0 votes
Without the TLB, in the paging every data/instruction access requires two memory accessesOne for the page table and one for the data / instruction .Can any one explain it...
339
views
0 answers
0 votes
statepage tablefiles openprocess id ..?
8.6k
views
1 answers
2 votes
601
views
1 answers
2 votes
in a 6 bit ripple counter, the MOD of UP couting is 14 , the MOD of down counting is........?
275
views
0 answers
0 votes
To implement a5 bit binary adder , minimum num of half adders required is .....I think answer is 10 ?
644
views
0 answers
0 votes
A 1-bit full adder takes 20ns to generate carry out bit and 40ns to the sum bit. When four 1-bit full adders are cascaded , then the total time for additions is