Register
Filter

Recent questions without a selected answer

287
views
0 answers
0 votes
Addressing Mode
Consider the following expression used to execute on a stack CPU X = (A × B)+C, where all the variables are in the memory. What is the number of zero and one address instructions are required respectively to evaluate the expression?
User Avatar
508
views
0 answers
0 votes
Self Derivation
I want to derive a formula that, with n nodes how many AVL trees can possible.we know that, with 0 ==> 1,with 1 ==> 1, with 2 ==> 2, with 3 ==> ... right nodes atmost differ by 1.Can we simplify further.... i am not able to do further...
User Avatar
990
views
2 answers
1 votes
what is the expected number of comparisons made before the algorithm terminates ?
User Avatar
1.8k
views
1 answers
1 votes
Made Easy Workbook - Computer Network
The round trip propagation delay for a 100Mbps Ethernet having 48-bit jamming signal is 64 ms. What is the minimum frame size (in bytes)?
User Avatar
369
views
1 answers
0 votes
Self doubt
Join of two 3NF relations may be yeilds a 3NF relation True/False? If true explain with example?If false explain why?
User Avatar
1.0k
views
1 answers
0 votes
#OS Process Synchronisation GATE2015 Self User Doubt
Original Question - https://gateoverflow.in/8405/gate2015-3-10 Answer is A) Yes, there's no ME (That's fine) Also there's no Deadlock, but for no ... 's no dependency there. And hence No deadlock? Is this reasoning for deadlock valid?
User Avatar
133
views
0 answers
0 votes
Self Doubt
TLB hit ratio = 80%Memory access time = 75 nsSwap page time = 500,000 ns50% of pages are dirtyOS uses a single level page tableWhat is the effective access ... TLB, the page table, and the frame table (if needed) is negligibleAns. 15110
User Avatar
582
views
1 answers
0 votes
self doubt
Consider a byte addressable computer that has a physical address space of 512 bytes. The computeruses a simple, one level virtual memory system. The page table is ... bits of the virtual page number are used to index intothe cache?Ans. 4
User Avatar
476
views
2 answers
0 votes
self doubt
Suppose a file F of size 16KB is shared by 100 processes, each process read the entire F 10 timessequentially, disk uses linked allocation policy to store both ... related to access thefile F in executing all the 100 processes is :Ans. 34
User Avatar
145
views
0 answers
0 votes
Parsing
doubtGrammerS -> XaX -> AbB | 2A -> 2B -> 2This Grammer is not accepted by SLR(1)but after simplification for this grammerS -> XaX -> 2b2 ... this happen?It is because simplification reduces the readability of Grammer or any other factor??
User Avatar
311
views
0 answers
0 votes
SELF DOUBT MADEEASY TEST SERIES
https://gateoverflow.in/195902/made-easy-test-series-os THE REASON FOR 2ND ONE FALSE IS THAT...... BECZ CPU TAKES CARE TO SEND SIGNAL TO OS TO LOAD THE REQUIRED PAGE NO NEED OF PROGRAMMER ..????? CORRECT OR NOT???
User Avatar
5.6k
views
1 answers
3 votes
Introduction to software engineering
Which one among the following is not a software service type of project?a. Software maintenanceb. Software customizationc. Outsourced software developmentd. Software product development
User Avatar
449
views
1 answers
0 votes
#idempotent #matrix
If Matrix A and B are of same size and AB=B and BA=A. Then the value of $(A+B)^{5}$ is _____________?
User Avatar
756
views
0 answers
1 votes
DE - Counters
Q) Which statements are true and also give reason ? 1) Clock cycle time in johnson counter is equal to delay of one flip flop. 2) Clock cycle time in Ring counter is equal to (delay of one flip flop)*(no. of flip flops).
User Avatar
396
views
1 answers
0 votes
flow control protocol
for stop and wait ARP,for n data packets sent ___acknowledgements needed.
User Avatar
248
views
1 answers
0 votes
Ace Algorithms
The number of comparisons that are necessary and sufficient for finding both the largest and smallest element in a set of n elements is?a) (3n/2) - 2b) 2n-2c) (3n/2) -1d) None of these
User Avatar
565
views
1 answers
0 votes
Ace Algorithms
If given numbers are 12,7,15,8,19,20,17,21,5,3 in _______ passes of quick sort element 5 will be in sorted position. (Considering last element as pivot)
User Avatar
847
views
1 answers
1 votes
Ace Algorithms
Suppose A is a sorted array and some of the elements are duplicates. What is the best upper bound to find out the number of elements that are equal to a given key 'k'a) O(log n)b) O(n)c) O(nlogn)d) O(n2)
User Avatar
436
views
1 answers
0 votes
Ace Algorithms
If k is a positive constant, then the following divide and conquer recurrence evaluates to?T(n) = k ; n=1T(n) = 3 T (n/2) + kn ;n>1a)T(n)= 3kn2-knb)T(n)=3kn log23 - 2knc)T(n)=3knlog23 - knd)T(n)=3kn2-2knlog23
User Avatar
304
views
0 answers
0 votes
Discrete mathematics
Is Isomorphism is in gate 2019 syllabus for discrete mathematics ?
User Avatar
223
views
0 answers
0 votes
TOC - Turing Machine
is it true that:-1) turing decidable languages are recursive languages.2) turing recognizable languages are recursive enumerable.
User Avatar
2.3k
views
3 answers
2 votes
Memory Management and Virtual Memory GATE - 2004
Consider a system with a two level paging scheme in which a regular memory access takes 150 ns, and servicing a page fault takes 8 ms. An average instruction ... average instruction execution time?a) 645 nsb) 1050 nsc) 1215 nsd) 1230 ns
User Avatar
200
views
1 answers
0 votes
TOC - Turing Machine
If M is turing Machine Then what is L(M) denoting here??1) is it denoting Language generated by turing machineor2) encoding of turing machine(in 0's and 1's) as a language?
User Avatar
207
views
1 answers
0 votes
TOC - CFG
is grammar CFG = S->AS/epsilon A->aA/ain Chomsky Nomal form ?
User Avatar
936
views
2 answers
0 votes
Output of 4 x 1 MUX
What will be the output "Y" of the mux?
User Avatar
282
views
2 answers
0 votes
ACE volume 1
which of the following is not a strict schedule?A) R1(A),R2(A),W1(A),Abort1,W2(A),Commit2B) R1(A),R2(A),W1(A),Commit1,W2(A),Abort2C) R1(A),R2(A),W2(A),Commit2,W1(A),Commit1D) R1(A),W2(A),W1(A),Commit1,W2(A),Commit2
User Avatar
279
views
1 answers
0 votes
Give the output
int P=O;for(i=0;i<2n;i++){For(j=1;j<=n;j++){ If(j<i)P=P+1;}}Printf("%d",P);What is the output in terms of n:a. (4n^2-n)/2b. (3n^2-n)/2c. (n^2-4n)/2d.(n^2-3n)/2
User Avatar
151
views
0 answers
0 votes
Self doubt
What is edge disjoint spanning trees?
User Avatar
2.2k
views
1 answers
0 votes
SELF DOUBT OS MADEEASY TEST SERIES
CONSIDER A SYSTEM USING PAGING AND SEGMENTATION .THE VIRTUAL ADDRESS SPACE CONSIST OF UP TO 8 SEGMENTS AND EACH SEGMENT IS 229 BYTE ... IN THE VIRTUAL ADDRESS SPECIFY THE PAGE NUMBER?A)4 bitsb)5 bitsc)16 bitsd)21 bits
User Avatar
414
views
1 answers
0 votes
#Test series
User Avatar
Page: