Recent questions without answers

427
views
0 answers
1 votes
In a compact single dimensional array represented for lower triangular matrices (i.e, all the elements above the diagonal are zero )of size n*n non zero ... (i,j)th element of the lower triangular matrix in the new representation is
205
views
0 answers
0 votes
Can we use synchronous counter to divide frequency?
1.1k
views
0 answers
1 votes
Hi Guys, I think $S_{1}$ is not TRUE because input could be copied in other part of tape. So power of TM will not reduce. What is your opinion ?
672
views
0 answers
0 votes
Why in DPDA acceptance by empty stack and acceptance by final state is not equivalent ? How this prefix property plays important role ?
559
views
0 answers
0 votes
FTP and HTTP need underlying layers for Reliability Service and hence TCP is used at the Transport Layer, what protocol will FTP and HTTP use at ... destination, how application layer data in ensured reliability @ this Network level ?
280
views
0 answers
0 votes
Suppose their is a many to one relation from A to B. And, the relationship set AB has descriptive attributes.1. Can we merge AB relationship set with A ... when AB has descriptive attributes?2. What if participation of A in AB is partial?
245
views
0 answers
0 votes
Suppose that the clock-driven scheme for generating initial sequence numbers is used with a 15-bit wide clock counter. The clock ticks once every $100msec$, and the ... the worst case? (b) when the data consumes $240$ sequence numbers/min?
581
views
0 answers
2 votes
In any of the deadlock prevention schemes, is it possible that the request will be granted even if it leaves the system to an unsafe state (but not in deadlock state)?
566
views
0 answers
1 votes
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$ ($n > k$). The implementation of the resource request logic of ... free? If not, what is the minimum value of $n + k$ for which deadlock is possible?
591
views
0 answers
2 votes
Consider a CPU that executes at a clock rate of 200 MHz(5ns per cycle) with a single level cache.CPI execution i.e. CPI with ideal memory is 1.1 ... ,How much faster is this machine,assuming similar miss rate,instruction mix as give above ?
442
views
0 answers
1 votes
A ripple counter is made with three positive edge triggered flip-flops. If the output of previous lower significant bit flip-flop is used as a triggering ... of the next higher significant bit flip-flop, then the resultant counter is a
295
views
0 answers
4 votes
State True of FalseS1 :If L is regular,then the language = {uv u $\epsilon$ L ,v $\epsilon$ LR} is Regular.S2:If w $\epsilon$ L, where L is regular than the language {wwR;w$\epsilon$ L} is Regular.
799
views
0 answers
1 votes
consider:T1: {A11, A12, A13} - key is A11T2: {A21, A22, A11} - key is A21T3: {A21, A23} - key is {A21 A23}T1, T2, T3 all are ... ) BCNFFUNCTIONAL DEPENDENCIES ARE NOT MENTIONED. SO, PLEASE EXPLAIN HOW TO CHECK NORMAL FORM FOR THE RELATION?
605
views
0 answers
0 votes
Please explain this.I am unable to understand this. If someone can share the source,from where shud i study to solve such type of problems.Answer given is B.
1.3k
views
0 answers
2 votes
Which one is TRUE? Give explaination1)The main reason to have multilevel page to speed up address translation2)The main reason to have hardware TLB to speed up address translation
326
views
0 answers
0 votes
CAM (Content addressable memory or Associative memory) is faster than Cache Memory?? If someone knows it. .please explain.
246
views
0 answers
0 votes
Hi mates, Show that it is ambiguous grammar TIAS->aAB/bBAA->bS/aB->aS/b
239
views
0 answers
1 votes
https://gateoverflow.in/683/gate2000-12Can you please explain the meaning of the highlighted portion of the text. This is an explanation by Arjun Sir
616
views
0 answers
0 votes
Consider a B-tree with the following specifications: Page size c = 2 kB; Size of key γ = 32 bytes; Size of pointer η = 8 bytes. What is the order m of the B+- ... given solution is2*1024>=32*m+8(m+1)+8*m=42.2=42please guide where i am wrong
320
views
0 answers
0 votes
Deletion in B+ tree, unable to get the underflow condition when we deal with http://home.iitj.ac.in/~ramana/ch10-stHow grouping is done during underflow in B+, IN B we see the most populous sibling and do grouping and merge it.
382
views
0 answers
1 votes
Let Memory access time=20nsDisk Access time is=10msNo TLB is used.Page size=4KB and PTES=64 bytes.Assume that the processes are referenced such that each of its page ... a process of size 10MB, compute TAT using 2 level and 3 level Paging.
4.7k
views
0 answers
0 votes
Draw a Turing machine for the following." Concatenate two strings w1 and w2 , where each string is generated over {a,b}"Can anyone tell me whether this solution is correct or not ?If not plz provide a alternative solution.
509
views
0 answers
3 votes
https://gateoverflow.in/?qa=blob&qa_blobid=6856287731579574233someone plz tell ??
604
views
0 answers
0 votes
Hello,The gate 2018 syllabus explicitly mentions regular languages, context free languages and turing machines. It does not say anything about context sensitive ... much of these topics should i study?..definitions? closure properties?
1.4k
views
0 answers
2 votes
Suppose blocks hold either three records, or Ten (Key,pointer) pairs. As a function of n, the number of records, for dense index.How many levels of index as is appropriate ... of index has only one block?a) n/3^nb) log3nc) n/4^nd)log10n
929
views
0 answers
1 votes
External fragmentation occurs when enough memory space is available but we are not able to allocate that memory space because the memory space available is ... segment can be allocated contiguously only.Please help me with this doubt.
710
views
0 answers
0 votes
The number of 3 digit numbers which are neither multiples of 11 nor 13 area) 456b) 562c) 662d) 756
839
views
0 answers
0 votes
608
views
0 answers
1 votes
Comment on Statement:Operator precedence parser is a SR parser. :Thoughts:Though it uses Stack to evaluate input string is it this the reason we can call it as shift reduce or something else or we can`t call it SR parser?