1 votes
1
Which of the following heap memory allocation strategies is likely to exploit spatial locality of memory accesses in a program, the most?Best FitFirst FitNext FitLast Fit...
0 votes
2
Convert this language to Push Down Automata – {a^n u | u ∈ {a, b}*, |u| = n, n ≥ 0}
2 votes
4
Can anyone explain this how this implication is valid with an example∃x (Px ⊕ Qx) < ∃xPx ⊕ ∃xQx
0 votes
7
0 votes
8
In a DFA, does every state have to have a transition for each of the symbols?
0 votes
10
A database relation has10 attributes {A,BCD,E,F,J} “CDEF” is known to be a candidate key of relation . There may be other candidate keys, which are unknown. What is t...
3 votes
13
0 votes
14
can a matrix have more than one echelon form??
1 votes
16
Consider a relation R(ABCDEFGH). How many superkey will be there in relation Rif candidate key for relation are {A, BC, CDE, EF}?
2 votes
21
0 votes
22
not getting the answer by 3*3 eigen value formula – (x^3-trace(a)*x^2+sum of minors of a(x)+|a|)eigen values are given as -2,3,6
0 votes
23
What will be the output of the following $\text{‘C’}$ program?void count(int n) { static int d = 1; printf(" %d", n); printf(" %d", d); d++; if (n>1) count (n - 1); p...