Register
Filter

Answers by saxena0612

5 votes
41
Doubt
If the edge weight of minimum spanning tree are given and edge weight of each edge is distinct, then the minimum value of sum (a, b, c, d, e, f, g) is __________.
If the edge weight of minimum spanning tree are given and edge weight of each edge is distinct, then the minimum value of sum (a, b, c, d, e, f, g) is __________.
0 votes
42
test series
Arrange the following functions in asymptotically increasing order f1(n) = n0.999999 log n f2(n) = 10000000n Please explain your solution. Thanks
Arrange the following functions in asymptotically increasing orderf1(n) = n0.999999 log nf2(n) = 10000000nPlease explain your solution. Thanks
4 votes
43
Ace Test Series: Compiler Design - Parsing
S-> Aa A-> Ab A-> c Which of the following item is present in LR(1) item with S'->. S, $ a) A->. Ab,$ b) A->. Ab,a c) A->. Ab,a/b d) None
S- AaA- AbA- cWhich of the following item is present in LR(1) item with S'->. S, $a) A->. Ab,$b) A->. Ab,ac) A->. Ab,a/bd) None
29 votes
44
GATE CSE 1987 | Question: 10d
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
1 votes
45
operating system
Consider the following codes for critical section problem and set of statements I) CODE 1 guarantees Mutual Exclusion II) CODE 2 guarantees Mutual Exclusion III) CODE 2 leads to Deadlock Which of the above statements are TRUE I and III only I and II only All I,II and III II and III only
Consider the following codes for critical section problem and set of statements I) CODE 1 guarantees Mutual ExclusionII) CODE 2 guarantees Mutual ExclusionIII) CODE 2 lea...
1 votes
46
me test series
Consider a bit-string of length 10 containing only 0 and 1. The number of string contain exactly 3 0’s or exactly 31’s are ________
Consider a bit-string of length 10 containing only 0 and 1. The number of string contain exactly 3 0’s or exactly 31’s are ________
3 votes
47
Control memory
A vertical microprogrammed CU supports 256 instructions. The system is using 8 flag conditions and contains 48 control signals. Each instruction on an avg requires 16 micro-operations. What is the approx. size of control memory in bytes?
A vertical microprogrammed CU supports 256 instructions. The system is using 8 flag conditions and contains 48 control signals. Each instruction on an avg requires 16 mi...
2 votes
48
Control memory
Consider a CU having 48 control signals and its supporting 8 flag conditions. If the size of the control word is 64 bits then the size of the control memory is ______ KB.( Assume horizontal implementation)
Consider a CU having 48 control signals and its supporting 8 flag conditions. If the size of the control word is 64 bits then the size of the control memory is ______ KB....
2 votes
49
Made_easy Tst
i have done it like this..... (1/8)3+ 7/(8)3=8-2 .....how this is wrong...???
i have done it like this.....(1/8)3+ 7/(8)3=8-2 .....how this is wrong...???
4 votes
51
c programming
0 votes
52
made-easy
Consider the following productions along with their semantic rules Here ⋅ i and ⋅ s corresponds to inherited and synthesized attributes respectively. The value for expression 3 ∗ 4 __________.
Consider the following productions along with their semantic rulesHere ⋅ i and ⋅ s corresponds to inherited and synthesized attributes respectively. The value for exp...
1 votes
54
LL1 grammer
9 votes
58
Generating Function
Q.find number of 7 digit number with sum of digits equal to 11 and formed using digits 1 ,2 ,3 Can we do this with help of generating functions.
Q.find number of 7 digit number with sum of digits equal to 11 and formed using digits 1 ,2 ,3 Can we do this with help of generating functions.
4 votes
61
Suppose that cache access time is 7 ns, main memory access time is 50 ns and disk space access time is 1200 ns.
Suppose that cache access time is 7 ns, main memory access time is 50 ns and disk space access time is 1200 ns. If the hit rate of cache is 60% and of main memory hier...
9 votes
65
GATE CSE 1988 | Question: 6ii
Below figure is the flow-chart corresponding to a program to calculate the $\gcd$ of two integers, $M$ and $N$ respectively, $(M, N >0).$ Use assertions at the cut point $C_1$, $C_2$ and $C_3$ to prove that the flow-chart is correct.
Below figure is the flow-chart corresponding to a program to calculate the $\gcd$ of two integers, $M$ and $N$ respectively, $(M, N >0).$ Use assertions at the cut point ...
3 votes
66
GATE CSE 1988 | Question: 13iv
Solve the recurrence equations: $T(n)= T( \frac{n}{2})+1$ $T(1)=1$
Solve the recurrence equations:$T(n)= T( \frac{n}{2})+1$$T(1)=1$
0 votes
68
execution time
A particular parallel program computation requires 100ns when executed on a single processor . If 20% of this computation is sequential then execution time for this program running with 4 processors is
A particular parallel program computation requires 100ns when executed on a single processor . If 20% of this computation is sequential then execution time for this pro...
0 votes
69
B + tree
Following parameters to construct B+ tree search key - 15B block size - 512B record pointer - 9B block pointer - 8B Max num of keys that can be accomodated in each non leaf node of the tree is
Following parameters to construct B+ treesearch key - 15Bblock size - 512Brecord pointer - 9Bblock pointer - 8BMax num of keys that can be accomodated in each non leaf no...
Page: