menu
search
Log In
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Sep 2019
  1. Satbir

    567 Points

  2. Bikram

    566 Points

  3. GAITONDE

    348 Points

  4. Vimal Patel

    87 Points

  5. Shaik Masthan

    38 Points

  6. BLACK_CLOUD

    14 Points

  7. sekhar_1621

    13 Points

  8. OgbeborBeatrice

    13 Points

  9. RAMYA.F

    9 Points

  10. vkw1111

    9 Points

Recent questions and answers

Recent questions and answers

0 votes
0 answers 21 views
Computer Organization , ROM
Can any body explain this question and provide a link to understand the ROM concept.
Can any body explain this question and provide a link to understand the ROM concept.
asked 14 hours ago in CO & Architecture Shawn Frost 6 points 21 views
0 votes
0 answers 12 views
ZEAL TEST SERIES: OPERATING SYSTEM
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. ... 11.6, 3.75, 80.6% 18.6, 3.375, 71.4% Shouldn't the average turn around time be $11.8$?
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$?
asked 16 hours ago in Operating System GAITONDE 567 points 12 views
0 votes
0 answers 22 views
#theory of computation
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
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
asked 16 hours ago in Theory of Computation IamSuraj 6 points 22 views
0 votes
0 answers 12 views
Self doubt in TOC
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?
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?
asked 16 hours ago in Theory of Computation aditya059 45 points 12 views
0 votes
0 answers 4 views
NPTEL, View Serialisability
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 ... 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?
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?
asked 16 hours ago in Databases goxul 109 points 4 views
1 vote
4 answers 53 views
Zeal question book
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
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
answered 18 hours ago in Theory of Computation Vimal Patel 199 points 53 views
0 votes
0 answers 10 views
Source : made easy test series DBMS
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
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
asked 19 hours ago in Databases karanvashisht1026 7 points 10 views
0 votes
0 answers 6 views
Slinding Window Protocol
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 ... receiver receives all the three frames correctly. But ACK's sent by receivers may be lost. a)4 b)7 c)6 d)5
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
asked 19 hours ago in Computer Networks indrani_sharma 6 points 6 views
0 votes
0 answers 5 views
SET operation in relational algebra.
Should names of attribute be same while applying SET operation in relational algebra?
Should names of attribute be same while applying SET operation in relational algebra?
asked 21 hours ago in Databases him0000 13 points 5 views
0 votes
1 answer 6 views
Most number of configurations of a Turing Machine
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...
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...
answered 1 day ago in Theory of Computation BLACK_CLOUD 14 points 6 views
0 votes
0 answers 3 views
Network - Packet Queuing
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}$ ... 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?
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?
asked 1 day ago in Computer Networks Amal 7 points 3 views
0 votes
0 answers 9 views
Self doubt-Essential Prime Implicants
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.
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.
asked 1 day ago in Digital Logic कुशाग्र गुप्ता 46 points 9 views
0 votes
1 answer 15 views
Algorithm: Made Easy
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..
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..
answered 1 day ago in Algorithms vizzard110 41 points 15 views
0 votes
0 answers 4 views
Algorithm :Virtual Gate
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 ... 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
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
asked 1 day ago in Algorithms srestha 182 points 4 views
0 votes
0 answers 10 views
Algo Measy 2020
asked 1 day ago in Algorithms GAITONDE 567 points 10 views
0 votes
0 answers 9 views
Algo Made easy : GATE 2020
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?
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?
asked 1 day ago in Algorithms GAITONDE 567 points 9 views
0 votes
0 answers 5 views
Algorithm: MADE EASY 2020
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?
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?
asked 1 day ago in Algorithms GAITONDE 567 points 5 views
0 votes
1 answer 8 views
gatebook_2020_test
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
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
answered 1 day ago in Theory of Computation Bikram 1.2k points 8 views
0 votes
2 answers 16 views
Kenneth Rosen exercise 1.4 ques 11
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 ... wrong in my answer and how kenneth rosen answer is correct. Please tellhttps://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=16705169279570597075
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
answered 1 day ago in Mathematical Logic Bikram 1.2k points 16 views
0 votes
2 answers 7 views
made easy test series quick sort time complexity
answered 1 day ago in Algorithms Bikram 1.2k points 7 views
0 votes
0 answers 5 views
madeeasy class notes(generating function)
get the generating function for x(1+x)(1-x)^3 .
get the generating function for x(1+x)(1-x)^3 .
asked 2 days ago in Combinatory eyeamgj 9 points 5 views
0 votes
1 answer 23 views
GATE 2009-39 (Re-visited Regarding a doubt)
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 ... T(n)=T(n-1) + O(1) + O(n) So isn't this the worst case where the complexity is $O(n^2)$ ?
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)$ ?
answered 2 days ago in Programming Bikram 1.2k points 23 views
0 votes
0 answers 16 views
Virtual Gate Test Series :Algorithm
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
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
asked 2 days ago in Algorithms srestha 182 points 16 views
0 votes
1 answer 8 views
max/min heap
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??
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??
answered 2 days ago in DS Bikram 1.2k points 8 views
0 votes
1 answer 19 views
selg doubt regarding PDA
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.
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.
answered 2 days ago in Theory of Computation Bikram 1.2k points 19 views
0 votes
2 answers 12 views
SELF - DOUBT
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 ... 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.
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.
answered 2 days ago in Theory of Computation Bikram 1.2k points 12 views
0 votes
1 answer 13 views
sakshi IIT JEE Combinatoric question.
answered 2 days ago in Mathematical Logic Bikram 1.2k points 13 views
0 votes
2 answers 9 views
Gatebook;DBMS
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. ... manager How to interpret this TRC expression? The y.name = e.manager =>x.sex=female part is troublesome.
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.
answered 2 days ago in Databases Bikram 1.2k points 9 views
0 votes
1 answer 7 views
Gatebook: DBMS
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
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
answered 2 days ago in Databases Vimal Patel 199 points 7 views
0 votes
0 answers 4 views
Gatebook; DBMS
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).
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).
asked 2 days ago in Databases Sambhrant Maurya 204 points 4 views
0 votes
0 answers 4 views
Gatebook:DBMS
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 ... passport number? eg I can assign 3 passport numbers to the same person Pinkman. Passport Number Name 101 Pinkman 102 Pinkman 103 Pinkman
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
asked 2 days ago in Databases Sambhrant Maurya 204 points 4 views
0 votes
0 answers 4 views
Data structures,recursion
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)?
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)?
asked 3 days ago in Programming Saikiran22 8 points 4 views
0 votes
0 answers 2 views
Self Doubt: Tree edge
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?
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?
asked 3 days ago in DS GAITONDE 567 points 2 views
0 votes
1 answer 8 views
OS ACE Test Series Test 13 Q7 Indexing
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 ) ... also not able to use the formula for https://www.geeksforgeeks.org/gate-gate-cs-2004-question-49/ Please help. Thank you.
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.
answered 3 days ago in Operating System GAITONDE 567 points 8 views
0 votes
0 answers 19 views
did a tiny mistake while filling gate form
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 ... ? Should i mail/call them ? As my application under scrutiny will they reject my application ? thank you.
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.
asked 3 days ago in GATE angry_coder_619 7 points 19 views
1 vote
0 answers 7 views
Maximum number of process required in one processor
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
asked 3 days ago in Operating System shivam001 9 points 7 views
0 votes
2 answers 11 views
Transactions, serializability and concurrency control
Which of the following statements are false ? a)if any schedule is neither conflict serializable nor view serializable then that schedule must be inconsistent b)Timestamp protocol ensures freedom from deadlock c)Strict Two phase locking protocol ensures cascadeless rollback d)Lock point of a schedule in two phase locking protocol indicates final lock of the schedule
answered 3 days ago in Databases RAMYA.F 9 points 11 views
0 votes
2 answers 9 views
Self Doubt: DSA CLRS
Assume an array A[1...n] has n elements, and there is NO constraint such that every element must be less than n. What is the time complexity to find the majority element?
Assume an array A[1...n] has n elements, and there is NO constraint such that every element must be less than n. What is the time complexity to find the majority element?
answered 3 days ago in Programming Bikram 1.2k points 9 views
0 votes
1 answer 5 views
[GATEBOOK TS] how many completely non trivial FD hold for the given instance?
im getting 5, but answer is not 5
answered 3 days ago in Databases GAITONDE 567 points 5 views
0 votes
4 answers 8 views
#TestSeries #IO
Consider a system that uses interrupt-driven I/O for a particular device which has an average data transfer rate of 10KBps.The processing of the interrupt which includes the time to jump to ISR,its execution and returning to the main program is 250 micro sec.The fraction of processor time consumed by IO device interrupts for every 2 byte(in %) is____.
Consider a system that uses interrupt-driven I/O for a particular device which has an average data transfer rate of 10KBps.The processing of the interrupt which includes the time to jump to ISR,its execution and returning to the main program is 250 micro sec.The fraction of processor time consumed by IO device interrupts for every 2 byte(in %) is____.
answered 3 days ago in CO & Architecture Bikram 1.2k points 8 views
To see more, click for the full list of questions or popular tags.
Dark theme
Muffin by Hélio Chun
Powered by Question2Answer
...