Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent activity by user2525
User user2525
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User user2525
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
Selft doubt  Decidability
Given a TM, M accepts a set of 100 Strings is decidable?
commented
Dec 26, 2019
in
Theory of Computation

96
views
0
answers
Testbook Test Series  CO question
For the above question wont the answer be option b that is 18 ? My approach : At 1 time, no signal can be activated P0 = 100C0 = 1 At 1 time, 1 signal can be activated P1 = 100C1 = 100 At 1 time, 2 signals can be activated P2 = ... , they are taking the same method https://gateoverflow.in/2754/gate1996225 ? But here in testbook exam answer is given to be 21.
commented
Sep 7, 2019
in
CO & Architecture

40
views
control
computerarchitecture
1
answer
Digital Logic  Overflow question and self doubt
Overflow condition can be eliminated in : 1's complement. 2's complement. Signed magnitude. Which of the following is true regarding the above statement : Only i and ii. Only i. Only ii and iii. i,ii and iii. According to me it ... . The question has been asked to me by a local teacher, and not by any coaching institute, so dint mention the source.
commented
Aug 27, 2019
in
Digital Logic

60
views
digitallogic
numbersystem
1
answer
[GATEBOOK TESTSERIES] which of the following is true?
comment edited
Aug 27, 2019
in
Theory of Computation

124
views
theoryofcomputation
1
answer
Gateoverflow Question ( Source Gatebook )
https://gateoverflow.in/96566/viewserializable S1: R(A) W(A) W(B) S2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D ... conflictserializableschedules?show=77897#q77897 It is showing the question has been hidden. Can anyone explain to me the actual solution of the question ?
answer selected
Aug 27, 2019
in
Databases

148
views
databases
3
answers
Engg. Mathematics CS 2020 Gate Syllabus
In the CS 2020 gate syllabus, only the word integration is mentioned. So, do we just have to consider only Definite and Indefinite integrals or we should be studying on multiple integrals and gamma / beta integration too just like the ECE syllabus ?
commented
Aug 27, 2019
in
Calculus

103
views
1
answer
Polygraph test example 2 ( from gateoverflow )  Self Doubt
commented
Aug 27, 2019
in
Databases

43
views
databases
transactions
1
answer
Self doubtTuring machine
Every recursive language is Recursively enumerable, so can we say that : Recursive languages are Turing Recognizable
commented
Aug 26, 2019
in
Theory of Computation

47
views
turingmachine
0
answers
Polygraph Test for checking view serializability  Self doubt ( exmple frm gateoverflow )
commented
Aug 26, 2019
in
Databases

48
views
databases
transactions
1
answer
Self Doubt  Blind Writes in a Schedule
For the following schedule, how many blind writes are possible ? My answer is total 3 blind writes are possible which I have marked above. Is it correct ?
answer selected
Aug 26, 2019
in
Databases

58
views
databases
1
answer
Gateoverflow question on B+ tree  Self Doubt
https://gateoverflow.in/258022/dbmsbasictest1 Int the above question, as per the diagram, the leaves are supposed to be in level 4 and so the number of children in level 3 which equals to 27 as per calculation means the number of child pointers to level 4 that is the leaf node level is actually 27. Am I correct ?
commented
Aug 24, 2019
in
Databases

54
views
databases
btree
1
answer
Is hypercube graph is another name of regular graph??
commented
Aug 23, 2019
in
Mathematical Logic

42
views
engineeringmaths
discretemaths
graphtheory
0
answers
B tree and B+ tree  Made Easy / Gateoverflow
For the below question, https://gateoverflow.in/285557/madeeasytestseriesdatabasesbtree Can anyone explain option B and option D ? I mean what they actually mean to say ?
asked
Aug 23, 2019
in
Databases

29
views
databases
btree
indexing
1
answer
Foreign key  Self Doubt
When it comes to inserting something in a foreign key table, we cant put null values. But when it comes to deleting something from referenced table, we can perform ON DELETE SET NULL operation and make the foreign key value in a particular tuple as NULL. So, a foreign key can’t remain null while inserting but it can be null while deletion. Is my approach correct ?
commented
Aug 23, 2019
in
Databases

94
views
databases
normalization
1
answer
A wait operation on a semaphore should not occur within a critical section controlled by that semaphore because:
answer edited
Aug 21, 2019
in
Operating System

190
views
operatingsystem
semaphores
0
answers
View Serializability
Can someone write the entire steps and rules of polygraph test to check view serializability. P.S. : Kindly, dont give me links. Please write the rules in a stepwise manner if known.
asked
Aug 21, 2019
in
Databases

20
views
databases
transactions
0
answers
ACE Test Series  Normalization
Regarding statement Q, I don’t think it will violate 3NF because whatever be the R.H.S. if L.H.S. is superkey, then it is in BCNF and ultimately in 3NF. Therefore, it is allowed in 3NF and so the statement is supposed to be right. Is my approach correct ?
comment edited
Aug 21, 2019
in
Databases

29
views
databases
normalization
0
answers
Lossless Decomposition  Self Doubt
https://gateoverflow.in/208190/lossyorlossless In the above question : FDs are AB→C,AC→B,AD→E,B→D,BC→A,E→G. R1 ( ABC ) : AB → C AC → B BC → A R2 ( ACDE ) : AD → E R3 ( ADG ) has empty FDs. So, the above decomposition is not ... a key order to check lossless decomposition ? Do we have 2 consider the closure of original fds to prove AD as key for R3 ( ADG ) ?
edited
Aug 20, 2019
in
Databases

29
views
databases
normalization
0
answers
Self Doubt  3NF Decomposition
I know that BCNF may not satisfy dependency preserving but it should be lossless. So, when we are decomposing a relation for satisfying BCNF, we don’t care about the dependency preservation condition. But what about 3NF ? Is it compulsory to check for dependency preservation condition after a table has been decomposed to satisfy 3NF ?
asked
Aug 20, 2019
in
Databases

31
views
databases
normalization
0
answers
Definition of Non  trivial FD  DBMS Doubt
Consider the following FDs : Sid → Sname Sname → Age The above set of FD is not  non trivial. I knw da definition of non  trivial in FD is that there should be no common element between X and Y attribute sets in the FD X → Y. ... something in common that is Sname. That is why the set of FDs is not nontrivial. Is my perception towards the FDs correct ?
comment edited
Aug 19, 2019
in
Databases

59
views
normalization
databases
1
answer
Tuple Relational Calculus  Doubt
I know abt universal quantifier ∀ and existential quantifier ∃ . But in tuple relational calculus, how we will interpret by looking at the question when to use ∀ and when to use ∃ ? For example : in the below question, Find the names and ages of ... in the above question, we are using ∃ instead of ∀. My doubt is when shall we apply ∀ and ∃ inTRC questions ?
edited
Aug 16, 2019
in
Databases

53
views
1
answer
Relational Algebra  CSE Doubt
I know projection operator in relational algebra eliminates duplicates. But suppose a table contains 2 duplicate rows. Sql retains the duplicates. But what about selection operator in relational algebra. Does it eliminates duplicates ? Moreover ... operator in relational algebra eliminates duplicates or is there any exception too for operators in relational algebra ?
asked
Aug 16, 2019
in
Databases

66
views
0
answers
Multilevel Feedback Queue Scheduling  Gateoverflow question
comment edited
Aug 15, 2019
in
Operating System

149
views
scheduling
1
answer
Context free language
Is the given language CFL or not? Σ*L={a^n b^n a^n n>=1}
answer edited
Aug 14, 2019
in
Theory of Computation

31
views
theoryofcomputation
cfg
contextfreelanguages
1
answer
Self Doubt: POSET
I am unable to understand how Equality of Sets is a POSET? How can it satisfy antisymmetric property?
comment edited
Aug 14, 2019
in
Set Theory & Algebra

75
views
discretemaths
0
answers
Gateoverflow question machine instruction
https://gateoverflow.in/291233/calculatenumberoftimeszeroflagisreset Can someone explain to me the entire approach and ultimately the final answer ?
comment edited
Aug 14, 2019
in
CO & Architecture

33
views
coandarchitecture
0
answers
Gateoverflow question  doubt
https://gateoverflow.in/311001/deletionofuselesssymbolsfromagrammarselfdoubt In the above question aren’t we supposed to delete the production A → b because at the end after removing the useless symbols, A is unreachable from the start symbol S. So, wont be the answer S → a only after removing useless symbols ?
edited
Aug 13, 2019
in
Theory of Computation

40
views
theoryofcomputation
cfg
1
answer
Ambiguity of grammars
Consider the Language: L = {$a^{n}b^{n}c^{k}$, n,k ≥ 1} ⋃ {$a^{n}b^{k}c^{k}$, n,k≥ 1} Which is True? (a) All the Grammars generating L will be ambiguous. (b) There exists a G which is unambiguous. (c) Language L is unambiguous (d) None of the above
answered
Aug 13, 2019
in
Theory of Computation

27
views
theoryofcomputation
grammar
ambiguity
2
answers
Relation between A,B and C
Let A= (a + b)* ab (a + b)*, B= a*b* and C= (a + b)*. Then the relation between A, B and C: A. A+B= C B. $A^{R}+B^{R}=C$ C. $A^{R}$+B= C D. None of these
answered
Aug 12, 2019
in
Theory of Computation

67
views
theoryofcomputation
regularlanguages
1
answer
Deterministic FA
What are the number of final states in minimal DFA, where Σ= {a, b}, if every string starts with “aa” and length of string is not congruent to 0 (mod 4). A. 7 B. 6 C. 3 D. 5
comment edited
Aug 12, 2019
in
Theory of Computation

37
views
theoryofcomputation
finiteautomata
1
answer
TSPGECET2019CSE10
The value of $c$ of Cauchy’s mean value theorem for the function $f(x)=\frac{1}{x^{2}}$ and $g(x)=\frac{1}{x^{2}}$ in $[a,b]$ $\frac{2ab}{a+b}$ $\frac{2ab}{ab}$ $\frac{2}{ab}$ $\frac{2}{ab}$
answered
Aug 12, 2019
in
Others

23
views
tspgecetcse2019
2
answers
TSPGECET2019CSE11
Function $F$ finds maximum and minimum of $50$ numbers. Number of comparisons in this function are: $72$ $1225$ $147$ $50$
answered
Aug 12, 2019
in
Others

17
views
tspgecetcse2019
1
answer
TSPGECET2019CSE2
If $P(A) = \frac{1}{5}$ , $P(B) = \frac{2}{3}$ and $P(A\cap B) = \frac{1}{15}$, then $P(A\cap B^{^{c}}) =$ $\frac{2}{15}$ $\frac{3}{5}$ $\frac{4}{15}$ $\frac{14}{15}$
answered
Aug 12, 2019
in
Others

20
views
tspgecetcse2019
0
answers
ACE Workbook  Finite automata and Regular Language
asked
Aug 11, 2019
in
Theory of Computation

37
views
theoryofcomputation
regularlanguage
finiteautomata
1
answer
Self doubt: Digital logic 1
Is it a counter circuit?How to recognize ? If all flipflop are reset state at first, what is it’s output at Y after $5$ th clock pulse?
answered
Aug 11, 2019
in
Digital Logic

55
views
digitallogic
2
answers
Complement of Context Free Language
I have read that CFL is not closed under complementation. I read somewhere that complement of CFL is CSL. I am not sure if I remember it correctly. Answer is given as D here. Kindly clarify my doubt. Thank you.
answered
Aug 11, 2019
in
Theory of Computation

77
views
theoryofcomputation
1
answer
Regular expression doubt
Please explain the solution. Thank you.
answered
Aug 11, 2019
in
Theory of Computation

20
views
theoryofcomputation
1
answer
Epsilon NFA doubt
Please show the approach. I am not fully aware of how delta star works. Does it mean applying epsilon *, a, epsilon * on qo state? Kindly explain. Thank you.
answered
Aug 11, 2019
in
Theory of Computation

50
views
theoryofcomputation
finiteautomata
0
answers
Made Easy workbook  Finite Automata
While doing reversal of a Finite automata, we change the arrows and interchange the final and initial states. But if there are more than one final state in F.A. are we supposed to merge the final states into one final state and then do the reversal of the finite automata. Is it the correct procedure for reversal of finite automata wth multiple final states ?
asked
Aug 11, 2019
in
Theory of Computation

67
views
regularlanguage
theoryofcomputation
finiteautomata
1
answer
NFA with epsilon moves  Automata theory ( Testbook Test Series )
asked
Aug 11, 2019
in
Theory of Computation

37
views
theoryofcomputation
finiteautomata
regularlanguage
9,005
questions
3,135
answers
14,391
comments
95,818
users