search
Log In

Recent questions tagged self-doubt

0 votes
0 answers
1
Self doubt--Hello i am preparing for gate on my own reading textbooks. There is a very detailed garbage collection part in runtime environments part in Aho ullman.. How much to read from there.. Any past gate rankers and fellow gate aspirants kindly reply.
asked Dec 14, 2017 in Compiler Design Tridhara Chakrabarti 154 views
0 votes
0 answers
2
1 vote
0 answers
3
Balanced Binary Tree vs Complete Tree Insertion and Deletion is faster in which of the above 2 structures?
asked Dec 8, 2017 in Algorithms VS 211 views
1 vote
1 answer
4
1) I know that turing decidable means recursive language. But does is also means its decidable? So basically i want to know if REC imples decidability and RE implies undecidability or not. I got confused with word decidable in "turing decidable" 2) http://www. ... ? If they have same expressive power why can't we use DTM in NP decision problems? Thanks for being patient and reading doubt.
asked Nov 29, 2017 in Theory of Computation ♥_Less 313 views
0 votes
1 answer
5
Please explain below query step by step and what does it mean?
asked Nov 29, 2017 in Databases learner_geek 197 views
0 votes
0 answers
7
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 Network Layer ? Since IP is an unreliable protocol,it does not guarantee the delivery of a datagram to its destination, how application layer data in ensured reliability @ this Network level ?
asked Nov 25, 2017 in Computer Networks Salazar 79 views
1 vote
0 answers
8
Whenever I see SQL queries , I find them very difficult to decode , especially questions related to nested queries , HAVING,GROUP BY , ANY etc . So suggest me sources from where I can get the basics right and have a good practice .
asked Nov 19, 2017 in Study Resources Parshu gate 753 views
2 votes
0 answers
9
does turing machine accept null? if not then those set of languages that are accepted by turing machine shoud not generate null string??
asked Nov 18, 2017 in Theory of Computation gari 392 views
0 votes
0 answers
10
Is Bellman ford considered as Greedy Algorithm or Dynamic programming? If both then please explain approaches in both methods. Thanks
asked Nov 18, 2017 in Algorithms Ashwin Kulkarni 150 views
8 votes
1 answer
11
How to find DPDA’s that accept by null stack? Someone explain the prefix property for DPDA,How can we use this property?
asked Nov 2, 2017 in Theory of Computation set2018 1.2k views
1 vote
1 answer
12
For every deterministic Turing machine, there exists an equivalent deterministic Non Deterministic Turing machine. I know, other way is correct i.e for every DTM there exist a NDTM, but is above TRUE/FALSE. Thank you!
asked Nov 1, 2017 in Theory of Computation iarnav 295 views
1 vote
1 answer
13
What is the best way to understand/decode correlated nested queries. I have read all the concept of Keywords/Functions such as EXISTS, NOT EXISTS, IN, EXCEPT, UNIQUE, UNION etc. I also solved question based on queries. I'm able to solve or extract the meaning ... doesn't talk about correlated nested query. It is easy to write query but little hard to understand meaning of query written by others.
asked Oct 29, 2017 in Databases Rohit Gupta 8 575 views
0 votes
0 answers
14
Example# 3 from Part-1 Rice's Theorem from https://gatecse.in/rices-theorem/ states as follows (3) L(M) is recognized by a TM having even number of states Sol: This is a trivial property. This set equals the set of recursively enumerable languages. According to the ... property then? Can someone give me an example for which TYES and TNO cannot be found and let me know if my approach is correct ?
asked Oct 28, 2017 in Theory of Computation Salazar 261 views
2 votes
1 answer
15
A thread running in critical section may get context switch .Correct or not?
asked Oct 27, 2017 in Operating System set2018 58 views
3 votes
1 answer
16
1 vote
0 answers
17
I have read that T.M does not accept ε , but then in questions I have read T.M taking input ε ? Well, if T.M can't accept ε then why we are giving T.M the input ε ? Thank you!
asked Oct 17, 2017 in Theory of Computation iarnav 286 views
1 vote
2 answers
18
0 votes
0 answers
19
what is the correct way to design synchronous counter ?for any arbitrary sequence like 7,3,1,2,5,4,6,7,3,1,2,4,5,6 I simply using state table diagram and by minimization it is easy to design circuit.Also to identify minimum number of flip flop in synchronous counter I just calculating number of bits used in counter . pls tell correct approach to solve these type of problems
asked Oct 2, 2017 in Digital Logic set2018 104 views
0 votes
1 answer
20
0 votes
0 answers
21
If the identifying relationship set has a descriptive attribute, then the movement of an attribute will be on weak entity side? pls explain with proper reference
asked Sep 25, 2017 in Databases set2018 147 views
0 votes
0 answers
22
R(ABC) Find out all functional dependencies by these two A----->B , B------>C ACCORDING TO KORTH ,Since a set of size n has 2n subsets, there are a total of 2 × 2n = 2n+1 possible functional dependencies, where n is the number of attributes in R someone explain this pls
asked Sep 16, 2017 in Databases set2018 131 views
0 votes
1 answer
23
A host is sending 100 datagrams to another host. If the identification number of the first datagram is 1024, what is the identification number of the last (in IPv4)? my doubt in IPV4, identification number is same for all the datagram that is 1024 . but see The ... field is incremented for each non-fragmented datagram. If the first is 1024, then the last is 1024 + 99 = 1123 pls clear this
asked Sep 9, 2017 in Computer Networks set2018 829 views
1 vote
1 answer
24
The first address of a block should be exactly divisible by no. Of address of a block Explain with example
asked Sep 5, 2017 in Computer Networks air1ankit 68 views
1 vote
0 answers
25
I am good with the basics of C and able to solve 25-30% previous year gate question but in majority of them i am able to run in my rough copy and get answer but most of times it is not in option or if it is there then that is not answer and ... it next time (i feel comfortable while solving pointers and static storage kind of problem but most the time answer is wrong or just missing some logic)
asked Sep 2, 2017 in Study Resources nikunj 122 views
1 vote
1 answer
26
IN these questions , in T1 it will read value of A from hard disk or local buffer and W(A) when execute it will make change in local buffer or hard disk , are w(A) and commit are same because commit means we stored data in hard disk anyone explain plz in detail
asked Aug 20, 2017 in Databases sumit goyal 1 162 views
1 vote
2 answers
27
what is booth recoded multiplier value for this binary number ? 001110
asked Aug 8, 2017 in Digital Logic set2018 139 views
1 vote
0 answers
28
L = {M|M is a TM that accepts all even numbers} For the above language i can have Tyes machine which has all even numbers.And Tno as machine whose language is empty.So i can say it is undecidable. But to show it is Not RE. What should be my Tno,so that ... Tno machine?I am assuming here that the property of the language as "Only all even numbers",i guess the same has been given in the question.
asked Aug 5, 2017 in Theory of Computation rahul sharma 5 257 views
1 vote
0 answers
29
How to find properties as trivial and Non-trivial in turing machine ?
asked Aug 4, 2017 in Theory of Computation set2018 38 views
1 vote
0 answers
30
If TM takes only a linear space (in terms of length of input string), then L is CSL. otherwise its just recursive pls explain this point
asked Aug 3, 2017 in Theory of Computation set2018 57 views
...