# Recent questions and answers 0 answers 21 views
Can any body explain this question and provide a link to understand the ROM concept.
0 answers 12 views
Suppose the following jobs are to be executed in a uni-processor system. Assume the overhead of context switching is one time unit. The average process turnaround time, the normalized turnaround time for process 2, and the processor efficiency using FCFS is, 12.8, 1.625, 83.3% 11.4, 2, 83.3% 11.6, 3.75, 80.6% 18.6, 3.375, 71.4% Shouldn’t the average turn around time be $11.8$?
0 answers 22 views
Set of all strings over Σ={a,b} in which (1) every 'a' must not followed by b. (2) 'a' is not followed by b. Are these (1) and (2) same ?? #TOC
0 answers 12 views
We know that kleene closure of cfl is cfl. L = {w c w^r x | w,x € {a,b}* } is cfl.how its kleene closure is cfl?
0 answers 4 views
Q7, from this assignment: https://nptel.ac.in/content/storage2/courses/106104135/assignment6.pdf S1 : r1(x),r2(x),w2(x),r3(x),w1(x), w2(y),r3(y),w3(x) S2 : r2(x),r1(x),w1(x),w2(x),w2(y),r3(x),w3(x),r3(y) Check whether they are view equivalent or not. ... read the initial value. In this case, initial value of x is read by T1 in S1, while in S2, it is read by T2. So are they view equivalent or not?
1 vote
4 answers 53 views
The language containing the set of stings over alphabet {0,1,2} where the number of 1s equals the numbar of 2s and every 0 is followed immediately by at least three 1 is: (1)Regular (2)Non Deterministic Context Free (3) Deterministic Context Free (4) Recursive
0 answers 10 views
Consider the following schedule. $T1$ $T2$ $T3$ $R(Y)$ $R(X)$ $R(X)$ $W(Y)$ $R(Z)$ $W(Z)$ $R(X)$ denotes the read operation on data item $X$ by transaction $T_{i}$. W(X) denotes the write operation on data item $X$ by transaction $T_{i}$.how many conflict serializable schedule are possible for the above schedule? 6 5 3
0 answers 6 views
In the sliding window protocol, assume a 3-bit sequence number field. A and B have windows, which has 3-bit sequence number.If A sends 3-frame and waits for all the three frames acknowledgements until timer expires. Which of the following could not be the sender's window ... . Assume receiver receives all the three frames correctly. But ACK's sent by receivers may be lost. a)4 b)7 c)6 d)5
0 answers 5 views
Should names of attribute be same while applying SET operation in relational algebra?
1 answer 6 views
Let m be the number of states in a turing machine M, and k be the size of the alphabet that M uses, and if M uses at most r squares of its tape, then there are at most m.r.k^r configurations please prove it..or explain it...
0 answers 3 views
Every Sec, 100 bit packet arrives to a queue at a rate of 1000 b/s. The maximum departure rate is 500 b/s. What is the average bit occupancy of the queue ? My answer Queue fills in 0.1 sec ($\frac{100 bit}{1000 bit/sec}$ ... and queue is empty for the remaining 0.8 sec . So average occupancy is (50 x 0.2) + (0 x 0.8) = 10 Bit Is this is correct?
0 answers 9 views
F=$\sum m(0,4,5,10,14,15)+d(7,13)$ No. of PI and EPI? By using Quine McCluskey Method this is what i am getting: PI=5, EPI=2 Please verify and if any changes need to be made, do tell.
1 answer 15 views
My ans is 14, but ME says 17.. Who is right? Will be awarded free visit in Guruji's Croatian ashram if u can help me..
0 answers 4 views
In the knapsack problem, we are given a set of n item, where each item i is specified by a size si and a value vi. We are also given a size bound S(the size of our knapsack). The goal is to find the subset of items of maximum total value such that sum of their sizes is ... place of XXXX in the algo? No statement needed, it is already a complete algo. a[S][n]=result a[n][S]=result a[n][n]=result
0 answers 10 views
0 answers 9 views
The Dimensions are A (5 x 10) , B(10 x 3) C(3 x12) D (12x3) My ans 303, ans given 405, which is right?
0 answers 5 views
While applying Dijkstra algorithm on given graph, it is already known that it is computing wrong path to some of the vertices. The number of wrong path computed are ________. My answer is 10 as all these paths→ C-A C-D C-F C-G E-A E-B E-C E-D E-F E-G are computer wrong due to negative edge weights encountered. Am i right?
1 answer 8 views
For instance, the grammar G with , P with start symbol S and rules Which of the following is true about L(G) ? (A) It is a regular language as G is a regular grammar (B) It is a non regular language as G is not a regular grammar (C) It is a non regular and G is a non-regular grammar (D) It is a regular language and G is not a regular grammar
2 answers 16 views
Let S(x) be the predicate "x is a student" F(x) be "x is a faculty member" And A(x,y) the predicate "x has asked y a question" where the domain consists of all people associated with your school. Use quantifier to express each of ... any student. What is wrong in my answer and how kenneth rosen answer is correct. Please tellhttps://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=16705169279570597075
2 answers 7 views
0 answers 5 views
get the generating function for x(1+x)(1-x)^3 .
1 answer 23 views
Say we have an array like this→ [2,4,1,19,6,18,20,5] Here the $(n/4)th$ smallest element is → 2nd smallest element since the array size is 8. In this array the second smallest element is $2$ Now if we divide it according to the pivot we have a recurrence relation like→ T(n)=T(n-1) + O(1) + O(n) So isn’t this the worst case where the complexity is $O(n^2)$ ?
0 answers 16 views
Consider the following pseudocode, that computes kth power of x func(x,k){ IF k=0 return 1 ELSE IF k is even return(func(x,k/2))*(func(x,k/2)) } The time complexity $T(k)$ and space complexity $S(k)$ are $(A)T(k)=T(k/2)+c$, $S(k)=O(logk)$ $(A)T(k)=2T(k/2)+c$, $S(k)=O(k)$ $(A)T(k)=2T(k/2)+c$, $S(k)=O(logk)$ (D)None of these
1 answer 8 views
Given a max and min heap consisting n elements, how much time required to merge them and creating : a min-heap a max heap note: temporary array size 2n is given. anyone please explain how to approach this??
1 answer 19 views
Suppose I’ve two pda, PDA accepts string by empty stack = $M_{1}$ PDA accepts string by final state = $M_{2}$ Now I can’t detect the reason why , In case of NPDA, $L(M_{1})$ = $L(M_{2})$ but incase of DPDA, $L(M_{1})\subset L(M_{2})$ please give me the explanation.
2 answers 12 views
L=a language M= a TM Lc= complement of L 1) L={<M> | M is a TM, encoded with some alphabet } ; L is recursive 2) L=set of all cfls generated by some cfg; => L is recursive enumerable but not recursive , Lc is not Recursive ... is Recursively Enumerable but Not Recursive I BELIEVE THE ABOVE STATEMENTS TO BE TRUE / CORRECT please somebody verify and reply please do reply ASAP THANKING YOU.
1 answer 13 views
2 answers 9 views
Consider the relation employee(name,sex,manager) with name as the key, manager gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce? A. Names of employees who have a female subordinate B. Names of ... one female manager How to interpret this TRC expression? The y.name = e.manager =>x.sex=female part is troublesome.
1 answer 7 views
Consider the following table Mystery A B 1 null 2 4 3 5 null 6 select count() from Mystery where A not in( select B from Mystery) What is the output of this query? (A) 1 (B) 0 (C) 4 (D) 3
0 answers 4 views
In translating from an entity-relationship (E-R) diagram to a relational schema, one piece of E-R logic that cannot be captured by primary keys, uniques, and foreign keys is (A) the weak entity. (B) any ternary relationship. (C) mandatory participation for one-time occurrence (that is, with the arrow). (D) mandatory participation for many-time occurrence (that is, without the arrow).
0 answers 4 views
Consider the following entity-relationship (ER) model For the following group of statements, which one does not coincide (Or not true) with the model ? (A) Each person has at most one e-mail address. (B) Each e-mail address belongs to exactly one person. ... 1 passport number? eg I can assign 3 passport numbers to the same person Pinkman. Passport Number Name 101 Pinkman 102 Pinkman 103 Pinkman
0 answers 4 views
Fib(n)=fib(n-1)+fib(n-2);if n>1 Fib(n)=1;If n=1 Fib(n)=0;If n=0 1) The value of Fibonacci(7)? 2) The no.of calls in Fibonacci(8)?
0 answers 2 views
According to the definition of tree edge → It is a edge which is present in tree obtained after applying DFS on the graph. All the edges marked in green are tree edges. My question is why isn’t $1-8$ also a tree edge? While doing DFS we can also take 1-8 edge right?
1 answer 8 views
I always face difficulties when solving this type of question so I am looking for a shortcut. I found a simple formula here, https://www.geeksforgeeks.org/gate-gate-cs-2019-question-51/. Using this formula for this problem, (4 KB/ 8 B )^2 * 2^11 I got 128 MB ... formula. I was also not able to use the formula for https://www.geeksforgeeks.org/gate-gate-cs-2004-question-49/ Please help. Thank you.
0 answers 19 views
Hello Sir, i did small mistake while submitting gate form . In Discipline of Qualifying Degree i have wrongly selected the "computer science and information technology" but my branch is "computer science and engg" as mentioned in degree certificate. please tell me what to do about it ? Should i mail/call them ? As my application under scrutiny will they reject my application ? thank you.
1 vote
0 answers 7 views
This question is from iisc assignment . If a computer system has one processor, then the maximum number of processes (including both user and system processes) that can be in state RUNNING at any time instant is a) 1 b) 2 c) no more than 1 user process, but any number of system processes d) any number of both user and system processes