Register
Filter

Answers by Nithish

0 votes
2
digital signature
can we use a secret symmetric key to both sign and verify a signature?
can we use a secret symmetric key to both sign and verify a signature?
1 votes
3
ravula 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.
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 o...
0 votes
5
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
Let A = {<M>|M is a TM and L(M) is regular}. Then A is _________a) Decidable language and regular languageb) Undecidable but partially decidablec) Totally not decidabled)...
2 votes
7
Addressing Mode
0 votes
8
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?
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...
1 votes
12
GATE CSE 2015 Set 1 | Question: 54
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_______________.
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_______________.
0 votes
14
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
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+ TreeMinimum and Maximum number of rec...
0 votes
15
Doubt
Whether a given regular grammar is ambiguous is decidable ?
Whether a given regular grammar is ambiguous is decidable ?
4 votes
16
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 .?
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...
1 votes
18
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,,
can anyone tell what are different activities that are performed in kernel modeuser modehow to change frm user mode to kernel mode and vice-versa,,
2 votes
19
TOC Doubt
What is the approach to identify for such ambiguous grammar? any formula?
What is the approach to identify for such ambiguous grammar? any formula?
2 votes
20
page replacement
Which one is better...Local page replacement or global page replacement?
Which one is better...Local page replacement or global page replacement?
4 votes
21
the number of generators of the group { 0,1,2........... 14} under the group operation addition modulu 15 is
the number of generators of the group { 0,1,2........... 14} under the group operation addition modulu 15 is
3 votes
22
Broadcast Address.
Consider a subnet mask 255.255.255.42 for a network 192.198.191. A data packet has arrived with destination IP as 192.198.191.121. The Broadcasting address of the subnet to which the packet belongs to is _____
Consider a subnet mask 255.255.255.42 for a network 192.198.191. A data packet has arrived with destination IP as 192.198.191.121. The Broadcasting address of the subnet ...
1 votes
23
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)
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 lo...
1 votes
24
Algorithms