Recent questions without answers

485
views
0 answers
2 votes
In a paging-based memory management system, the page table for a process contains the physical addresses of the pages in that process' address space. ... besides the physical address of the corresponding frame) in each page table entry?
209
views
0 answers
0 votes
A computer consists of a CPU and an I/O device D connected to main memory M via a shared bus with a data bus width of one word (16-bits). The CPU can execute a maximum of ... checking time] ? 2.15 x 106 3.15 x 106 1.15 x 106 4.15 x 106
710
views
0 answers
0 votes
How to solve this problem ?? Is the given solution correct?
298
views
0 answers
0 votes
476
views
0 answers
0 votes
428
views
0 answers
0 votes
Plz someone tell the answer of this question
161
views
0 answers
0 votes
289
views
0 answers
0 votes
State whether these statements are true or false give reasoning behind your logic. Condition of Deadlock can be prevented in case ofMutual exclusion by spooling everything.No premption by Taking resources away.
306
views
0 answers
1 votes
Consider CSMA/CD LAN with bandwidth 10 Mbps and propagation delay of 5 μsec. Repeaters are not allowed in this system. Data frames are 512 bits long, including ... (Upto 2 decimal places)Here I am getting 5.98Mbps,can anyone confirm this.
309
views
0 answers
1 votes
If a process releases all its resources before requesting a new resource, then deadlock is possible.(True/False)
436
views
0 answers
1 votes
https://gateoverflow.in/1269/gate2007-71 there is an ambiguity between the answer personally i feel it should be 11 because one MOV instruction there is not for ... with any valid reasoning for a chosen answer ....arjun sir please help
332
views
0 answers
0 votes
703
views
0 answers
0 votes
Assume that letters p, q, r, s, t and q have probabilities 1/2, 1/4, 1/8, 1/16, 1/32 and 1/32 respectively. The difference in the average length of the message without and with using Huffman’s coding is ______ . (upto 2 decimal places)
371
views
0 answers
0 votes
S:Deadlock prevention, to prevent deadlock all resources requested by the process are given to it before start of its execution i.e. by eliminating hold and wait ... if there is any deadlock or not basically we see the safe sequence their
393
views
0 answers
0 votes
Which of the following represents the total number of attributes in the minimized relation of above ER diagram ?A. 12B. 15C.16D.17
982
views
0 answers
0 votes
#include<stdio.h> int reverse(int); int main() { int num=4; reverse(num); return 0; } int reverse(num) { if(num==0) return 0; else printf("%d",num); reverse(num--); }What is the output ?
177
views
0 answers
0 votes
check this link , how he is finding coefficient of x^8 when x^8 will never generate ??https://www.youtube.com/watch?v=IcsFX3VoPXc&index=20&list=PL62C294AAC3D59DCE
544
views
0 answers
0 votes
Subset of Regular Language is REL or not ?PLz Explain with an Example.
237
views
0 answers
0 votes
the function f(A,B,C,D)=∑M(0,1,4,6,7,8,10,14,15) THE number of prime implecant and essential prime implecantA)6,1 ... D) 7,2I THINK THERE ARE 7 PRIME IMPLECANT AND ESSENTIAL PRIME IS 2. please correct me if i wrong
1.3k
views
0 answers
0 votes
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of n variables. What is the minimum size of the multiplexer ... 1 lineFor this option C is the answerWhat if inverter was not provided ?
402
views
0 answers
0 votes
In some Test series one theorm is used if G is a simple graph and having p vertices and if min degree of graph>=(p-1)/2 than G must be connected but i am not found any reference.
395
views
0 answers
2 votes
Q1) If a user is active, at least one networks link will be available.how to write in predicate logic?
303
views
0 answers
0 votes
Professor Arjun develops an algorithm to multiply two square matrix that is asymptotically faster than strasssen's algorithm using divide and conquer method.Arjun's ... running time becomes:Then the largest value of P' is _______.
281
views
0 answers
0 votes
Consider the following languages: L1= {a^n b^ n (n ≥ 0)} L2= Complement (L1) Choose appropriate options regarding languages L1 and L2A. L1& L2 are context freeB. L1 is CFL but L2 is RLC. L1 is CFL and L2 is CSLD. None
149
views
0 answers
0 votes
Let ∑= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8).A. 8B. 9C. 7D. 4
345
views
0 answers
0 votes
The number of permutations can be obtained in the output using stack assuming that input contains elements 1, 2, 3, 4, 5, 6 in any order such that 3 ... stack at 3rd position are _______ (assume one element enter in stack only one time)
335
views
0 answers
0 votes
#include<stdio.h> int main() { int a[2][2][2]={10,2,3,4,5,6,7,8}; int *p,*q; p=&a[1][1][1]; q=(int*)a; //Please explain this line printf ... p,*q); return 0; }Why we are doing typecasting here and what will be returned after type cast to q?
1.5k
views
0 answers
3 votes
7.14 A pipeline processor uses the delayed branch technique. You are asked to recommend one of the two possibilities for the design of this processor. In the first ... , the compiler is able to fill the second slot 25 percent of the time.
676
views
0 answers
0 votes
ans is given directly 6.... can someone convert it into GBN ...? thanks in advance
311
views
0 answers
0 votes
Won't it become CSL ?