Answers by Nithish - GATE Overflow

0 votes

1

digital signature
can we use a secret symmetric key to both sign and verify a signature?

answered Apr 29, 2017 in Computer Networks | 91 views

+1 vote

2

****** test series
Which of the following statements is/are TRUE? S1: Suppose L is Turing recognizable but not Turing decidable. Then any Turing machine that recognizes L must fail to halt on an infinite number of strings. S2: The language A'TM={⟨M,w⟩ | M does not accept w} is Turing recognizable.

answered Jan 17, 2017 in Theory of Computation | 252 views

0 votes

3

TOC Decidability
Are the following problems decidable? 1.{⟨M⟩∣M is a TM and there exist an input whose length is less than 100, on which M halts} I think we can simulate all the combinations of strings whose length is less than 100,and if the machine halts for any of them ... these words are not accepted by machine,Can it hang the machine?Is it also RE but NOT REC Please correct if I am going wrong

answered Jan 14, 2017 in Theory of Computation | 151 views

0 votes

4

Decidable/Undecidable
Let A = {<M>|M is a TM and L(M) is regular}. Then A is _________ a) Decidable language and regular language b) Undecidable but partially decidable c) Totally not decidable d) Decidable language but not regular language

answered Jan 12, 2017 in Theory of Computation | 261 views

0 votes

5

DS-BST
If preorder of a BST is passed as an argument to the above function. Function returns 1 if, a)All the leaf nodes of the tree are at same level b) All the nodes of the tree have atmost 1 child c) True is a complete binary tree, where the nodes at each level are completely filled d) None of these

answered Jan 12, 2017 in DS | 163 views

+2 votes

6

Addressing Mode

answered Jan 10, 2017 in CO and Architecture | 308 views

0 votes

7

NCFL,CFL,PDA
L1={wlwR∣w∈{a,b}∗,l∈{a,b} } which type of language is this DCFL or NDCFL? (note that l∈{a,b} not {a,b}*) I feel its NDCFL can you also tell how PDA will look like?

answered Jan 10, 2017 in Theory of Computation | 201 views

+1 vote

8

turing machine
Consider the following languages: Lne={〈M〉│L(M)≠ф } Le={〈M〉│L(M)=ф } where 〈M〉 denotes encoding of a Turning machine M Then which one of the following is true? (a) Lne is r.e. but not recursive and Le is not r.e. (b) Both are not r.e. (c) Both are recursive (d) Le is r.e. but not recursive and Lne is not r.e.

answered Jan 9, 2017 in Theory of Computation | 108 views

0 votes

9

MadeEasy Subject Test: Programming & DS - Hashing
True Or False.....? Explain...?

answered Jan 9, 2017 in DS | 191 views

0 votes

10

What we should consider NFA or DFA while they ask 'Finite Autpmata' in question?

answered Jan 9, 2017 in Theory of Computation | 114 views

0 votes

11

graph
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.

answered Jan 5, 2017 in Graph Theory | 74 views

0 votes

12

geeks for geeks
In a village, people build houses in the same side of the road. A thief plans to loot the village. He wants maximum amount of money without having any risk of getting caught. By some means, the villagers know that their adjacent house is being looted ... ? (a) Brute force (b) Dynamic programming (c) Backtracking (d) Divide and conquer Please provide explanation to your solution :)

answered Jan 4, 2017 in Algorithms | 371 views

0 votes

13

B+ Tree
Consider a B+ Tree of height $h$ and order of root node $p$ and order of leaf node $q$. Find ? Time complexity to find a record in B+ Tree Minimum and Maximum number of records stored in B+ Tree

answered Jan 4, 2017 in Databases | 192 views

0 votes

14

Doubt
Whether a given regular grammar is ambiguous is decidable ?

answered Jan 3, 2017 in Theory of Computation | 40 views

+4 votes

15

Targate
The Answer given is A) I think the naswer should be B) as we have both the prev pointer and the next pointer available , it will take constant time to update the adjacent nodes pointers and delete the given node .?

answered Jan 3, 2017 in DS | 893 views

0 votes

16

MadeEasy Subject Test: Computer Networks - Sliding Window
In list II , the 2nd point and 4th point both are correct for GBN according to me.

answered Jan 3, 2017 in Computer Networks | 175 views

+1 vote

17

user and kernel mdoe
can anyone tell what are different activities that are performed in kernel mode user mode how to change frm user mode to kernel mode and vice-versa,,

answered Jan 2, 2017 in Operating System | 631 views

+2 votes

18

TOC Doubt
What is the approach to identify for such ambiguous grammar? any formula?

answered Dec 14, 2016 in Theory of Computation | 105 views

+2 votes

19

page replacement
Which one is better...Local page replacement or global page replacement?

answered Nov 28, 2016 in Operating System | 110 views

+4 votes

20

the number of generators of the group { 0,1,2........... 14} under the group operation addition modulu 15 is

answered Nov 23, 2016 in Set Theory & Algebra | 566 views

0 votes

21

Algorithms
Given n linearly ordered distinct elements. What is the worst case running time to find ith smallest element (1<=i<=n) from those n elements? a) O(log n) b) O(n) c) O(n log n) d) O(n2)

answered Oct 14, 2016 in Algorithms | 325 views

+1 vote

22

answered Oct 14, 2016 in Algorithms | 266 views

50,645 questions

56,587 answers

195,788 comments

101,841 users