Recent questions without answers

155
views
0 answers
1 votes
Suppose we have 50 pages and LRU algorithm is used. find number of page faults for both row and column major orderfor (i=0; i <100; i++)for( j=0; j < 100 ; j++)A[i][j] = A[i][j] + A[j][i]Please explain
584
views
0 answers
1 votes
how to represent 0.623 in normalized form
304
views
0 answers
1 votes
Consider a base language B={01,10}, now from B a new language is constructed in which every 0 can be replaced with 010 and every 10 can be replaced ... +0(10∗)∗1+(10+)∗(01)++100∗Resulting language is not regular.Explanation is appreciated
264
views
0 answers
0 votes
A programming language not supporting either recursion or pointer type does not need the support of dynamic memory allocation ?
241
views
0 answers
0 votes
I am reading a local book on compilers. Author says that Memory required by data objects could be determined at compile time. if size is to be determined ... does above claim hold valid. I have doubt over his statement. Kindly comment.
1.2k
views
0 answers
0 votes
Can LL(k) and LR(k) gammer has null and unit productions?
4.6k
views
0 answers
4 votes
I read from Dragon Book that Syntax directed translation is used for type checking for instance where performing some reductions and other operation on the string ... could be Both because L attribute definition is both.Resolve my doubt !
548
views
0 answers
1 votes
Can any one say how to solve Z score questions like below1) P(1≤Z≤30) = ?2) P(z>2.5)=?3) P(z<=k) = 0.9 find k?Will they give any related values of Z-scores in exam ?
2.2k
views
0 answers
1 votes
L = {s ∈ (0 + 1)* d(s)mod5 = 2 or d(s)mod7 != 4} where d(s) is the decimal equivalent of the binary string s.How many states does the above DFA have? How many final states?Please explain your answer.
446
views
0 answers
4 votes
In the circuit shown in the figure, the value of input $P$ goes from $0$ to $1$ and that of $Q$ goes from $1$ to $0.$ Which output forms shown the in figure represents the output under a static hazard condition?
425
views
0 answers
2 votes
Greetings gate aspirants!..Does anyone have computer architecture--carl hamacher 5th edition or solution manual to 6th edition?...I am having the book of 6th edition ... not able to match anwsers..Please forward me link if you know...thanks
817
views
0 answers
2 votes
Question no:$1$ "Any problem whose domain is finite is always Decidable"lets take a TM,$M$ and finite domain of problem i.e. finite set of strings for ... by "Domain of a problem" and "single instance of turing machine's halting problem"?
509
views
0 answers
1 votes
Hi ,Can someone please explain the disjunctive normal form?At few websites, I found it is a disjunction of conjunction of literals.If that is the case, then A^B is not DNF .Also not(A+B) is not DNF. Please answer
242
views
0 answers
1 votes
Shouldn't the answer be 1 because it can be implemented using minimum 1 HA and 4 FA.and maximum with 9 HA.But the answer is 9.
1.3k
views
0 answers
1 votes
Let n=4, and (a1,a2,a3,a4) =(do,if,int,while).Let p (1 4) = (3,3,1,1) and q ( 0 4) =(2,3,1,1,1). If you construct ... what is the cost of the optimal binary search tree? And which is the root in the optimal cost binary search tree?
448
views
0 answers
1 votes
During context switching memory image of the processes are swapped or not ?
782
views
0 answers
1 votes
Match the following layers with their functionality.i. Encryptiona. Data-Link Layerii. Maintaining Synchronization Pointsb. Network Layeriii. Feedback Messagesc. Session Layeriv. Physical Addressing ...
275
views
0 answers
2 votes
Consider data frames consisting of $20$ header and $1980$ data bits. Assume headers and retransmissions are overhead, ACK frames are negligible and NAK frames are $20$ ... $A$ option and its correctMy approach was right?
162
views
0 answers
1 votes
is there any counter other than johnson can genrate gray code??
224
views
0 answers
1 votes
L={a^n b^n c^i | i<=n}L={a^n b^n c^i | i != n}why they are not cfl?
765
views
0 answers
1 votes
If a full modulus counter having 10 flipflops is initially at 0. After how many pulses it will count 0000001100 ?(A) 2060(B) 1036(C) 3048(D) ALL
202
views
0 answers
1 votes
347
views
0 answers
1 votes
1.3k
views
0 answers
1 votes
The output of moore machine will always have start state output as prefix? True/False?
246
views
0 answers
1 votes
How to generalize a given sequence using generating function?If there is a given series say :1,3,4,5,7,8,10.. how to generalize this sequence?@Habib Sir Please answer this doubt and give a general approach.
350
views
0 answers
1 votes
Assume there are 1024 men, each of distinct arm strength, In an arm wrestling match stronger arm always wins. Number of arm wrestling match required to find men with strongest and second strongest arm in worst case is _________
178
views
0 answers
1 votes
Which of the following is not true?(A) Generalization is the result of taking the union of two or more disjoint entity sets to produce a ... management component of the database is responsible for handling the concurrency control policies.
594
views
0 answers
3 votes
The rank of the matrix of coefficients of a homogeneous system of m linear equations in n unknowns is never less than the rank of the augmented matrix.(A) Always true(B) Sometimes true(C) False(D) None of the above
1.2k
views
0 answers
2 votes
Let G be a planar Graph Such that every phase is bordered by exactly 3 edges which of the following can never be value for X(G) a)2 b)3 C)4 d)none of these
237
views
0 answers
1 votes
1. Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1*a) €b) a*c) All of the mentionedd) None of the mentionedView Answer