1 votes
85
given nine elements A,B,C,D,E,F,G,H,I.How many ways we can arrange them such that it must follow order 1)A-C-D-E,2) E-H-I (Meaning of 2) is h should not come before e an...
0 votes
86
(a^i)(b^j)(c^m)(d^n) where i+j=m+n what will be the CFG for this
1 votes
87
Can the given relation can be decomposed into BCNF with dependency preserving and lossless join decomposition R(ABCDEFG) : {AB → C, BC → A, AC → B, B ...
0 votes
88
Does this graph have Hamiltonian circuit?
0 votes
90
If we convert an n-digit number with base -2k into base-2,the resulting number of digits will be of what order?
0 votes
91
If a full mod counter having 10 flip-flops is initialized at 0, the count it holds after 2060 pulses will be ____________________a) 10b) 11c) 12d) 13
1 votes
92
In a binary tree if an element is it's own descendent(means 3 descendent of every node), then what is the number of descendent of leaf nodes?If there is any descendent of...
0 votes
94
how to decide maximum limit of virtual address space ? is it max disk space available?
3 votes
96
Number of rooted labeled trees(i.e. each node can be the root) with 6 vertices is:
4 votes
100
1 votes
101
how i delete my answer or comment in GO.
1 votes
102
What is total recursive function?
2 votes
103
the output of the following program isVoid main(){Int a= 10;If (fork()==0)a++;Print("%d", a);} 0,1010,1011,1011,11
2 votes
104
How to write recurrence relation for , possible binary sequence of size n ?
0 votes
105
16kB cache with line size 64B uses 4-way set associative mapping. Main memory is 8 MB and byte addressable.The size of extra space needed for storing tag information in b...
11 votes
107
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.
0 votes
108
Suppose that we draw a card from a deck of 52 cards and replace it before the next draw. In how many ways can 10 cards be drawn so that the tenth card is a repetition of ...
1 votes
109
1) What is the algorithm for reversing the singly linked list?2) How palindrome could be made with the help of this algo ?
3 votes
110
A binary tree $T$ has $n$ leaf nodes. The number of nodes of degree $2$ in $T$ is$\log_2 n$$n-1$$n$$2^n$