1
Consider the following statements : Auto increment addressing mode is useful in creating self-relocating code. If auto increment addressing mode is included in an instruction set architecture, then an additional ALU is required for effective address calculation. In auto incrementing addressing mode, the ... above statements is/are true? (i) and (ii) only (ii) and (iii) only (iii) only (ii) only
1 vote
2
TRUE/FALSE 1.STATIC STORAGE ALLOCATION DOES NOT SUPPORT DYNAMIC DATA STRUCTURE. 2.STACK STORAGE ALLOCATION DOES NOT SUPPORT DYNAMIC DATA STRUCTURE.
3
No. of BST possible with 12 keys , when 1,2,....12 are inserted into empty BST with a condition that 4 is the root and 8 is the immediate right child of 4 are....?? pls tell me why my approach is wrong?? since 4 is the root so 4 should come first in all sequence. since 8 ... now rest of the element 5,6,7,9,10,11,12 they can also come in order , s0 it becomes = 7! =5040 TOTAL WAYS = 24*5040=120960
4
5
int arr[2][3][2]; print(arr[1]-arr[0],arr[1][0]-arr[0][0]) P.s :Sorry i can't able to paste the question but this is main Context.
6
If f (n), g(n) and h(n) are non-decreasing complexity functions. if f(n) ∈ O(h(n)), what is the relation between f(n) and (g ◦ h(n) + c), for any constant c ≥ 0, where a ◦ b is the composite function of a and b. A f(n) ∈ O(g ◦ h(n) + c), B f(n) ∈ $\Theta$(g ◦ h(n) + c), C f(n) ∈$\Omega$(g ◦ h(n) + c), D none ?
7
Consider a hypothetical machine which supports the following data types: unsigned char :1 Byte unsigned short : 2 Bytes int :4 Bytes Consider the following function red() int red (unsigned char a, unsigned short b) { if (a==0) return b; else { a=a+1; b=b*2; ... that what will be the output of the program. Because according to me it should be 32768, but in madeeasy solution it is given as output 0.
1 vote
8
Here directly dependency not given. Which normal form it doesnot hold , how to eliminate it? I got here 1:m, or 1:1 dependency. Is it any value to ans this question?
9
please explain the memory allocation of statement , means how it works register int a= 10;
1 vote
10
1) C,C++,JAVA are finite language or not 2) Every finite language are regular .it is true 3) All regular language are Finite
1 vote
11
The number of ways can three 0’s, three 1’s and three 2’s be arranged, so that no three adjacent digits are the same in an arrangement is ________
1 vote
12
Degree of multiprogramming is controlled by Long-term scheduler? Why? It just moves jobs from Secondary Memory to MM?
1 vote
13
Consider the following DFA D. The number of states in the minimization of D is __________.
14
What is CROSS JOIN with an empty table ??
15
find the number of trivial substring in "SAME1234".
16
What will be the minimal cover of given FD's?
17
halting problem for turing machine is undecidable it is clear but what about halting problem of total turing mchine???
18
Identify in the list below a sentence of length 6 that is generated by thr grammar S -> (S) S | ε
1 vote
19
Consider a Context Free Grammar G I - if G is not Suitable for Top Down Parser then it is also not suitable for LR parsers Family. II - if G is not Suitable for Top Down Parser then it may work for Operator Precedence parsers. III- .if G is suitable for LR parsers Family then it will surely work for Top Down Parser a) I and II correct b) II and III correct. c) only II correct d) all are correct