Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Nithish
0
votes
1
GATE CSE 1999 | Question: 17
Consider the following program fragment in the assembly language of a certain hypothetical processor. The processor has three general purpose registers $R1, R2$and $R3$. The meanings of the instructions are shown by comments (starting with ;) after the instructions. ... the values n, 0, and 0 respectively. What is the final value of $R3$ when control reaches $Z$?
Consider the following program fragment in the assembly language of a certain hypothetical processor. The processor has three general purpose registers $R1, R2$and $R3$. ...
6.0k
views
answered
Sep 9, 2020
CO and Architecture
gate1999
co-and-architecture
machine-instruction
normal
descriptive
+
–
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?
328
views
answered
Apr 29, 2017
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...
941
views
answered
Jan 17, 2017
0
votes
4
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
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 combi...
602
views
answered
Jan 14, 2017
Theory of Computation
decidability
theory-of-computation
+
–
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)...
665
views
answered
Jan 12, 2017
Theory of Computation
theory-of-computation
decidability
+
–
0
votes
6
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
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 levelb) All the nodes of the tree ...
945
views
answered
Jan 12, 2017
DS
data-structures
tree
+
–
2
votes
7
Addressing Mode
623
views
answered
Jan 10, 2017
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.6k
views
answered
Jan 10, 2017
1
votes
9
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.
Consider the following languages:Lne={〈M〉│L(M)≠ф }Le={〈M〉│L(M)=ф }where 〈M〉 denotes encoding of a Turning machine MThen which one of the following is ...
620
views
answered
Jan 9, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
10
MadeEasy Subject Test: Programming & DS - Hashing
True Or False.....? Explain...?
True Or False.....? Explain...?
567
views
answered
Jan 9, 2017
DS
made-easy-test-series
data-structures
hashing
+
–
0
votes
11
What we should consider NFA or DFA while they ask 'Finite Autpmata' in question?
333
views
answered
Jan 9, 2017
Theory of Computation
general
finite-automata
+
–
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_______________.
24.6k
views
answered
Jan 5, 2017
Graph Theory
gatecse-2015-set1
graph-theory
graph-connectivity
normal
graph-planarity
numerical-answers
+
–
0
votes
13
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 :)
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 cau...
2.4k
views
answered
Jan 4, 2017
Algorithms
algorithm-design-technique
+
–
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...
725
views
answered
Jan 4, 2017
Databases
databases
+
–
0
votes
15
Doubt
Whether a given regular grammar is ambiguous is decidable ?
Whether a given regular grammar is ambiguous is decidable ?
233
views
answered
Jan 3, 2017
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.4k
views
answered
Jan 3, 2017
DS
linked-list
data-structures
time-complexity
+
–
0
votes
17
MadeEasy Subject Test: Computer Networks - Sliding Window
In list II , the 2nd point and 4th point both are correct for GBN according to me.
In list II , the 2nd point and 4th point both are correct for GBN according to me.
508
views
answered
Jan 3, 2017
Computer Networks
made-easy-test-series
computer-networks
sliding-window
+
–
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.5k
views
answered
Jan 2, 2017
Operating System
operating-system
threads
process
+
–
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?
287
views
answered
Dec 14, 2016
Theory of Computation
theory-of-computation
+
–
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?
392
views
answered
Nov 28, 2016
Operating System
operating-system
+
–
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.3k
views
answered
Nov 23, 2016
Set Theory & Algebra
set-theory&algebra
group-theory
generators
+
–
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 ...
709
views
answered
Nov 18, 2016
Computer Networks
computer-networks
subnetting
+
–
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.2k
views
answered
Oct 14, 2016
Algorithms
algorithms
time-complexity
+
–
1
votes
24
Algorithms
1.2k
views
answered
Oct 14, 2016
Algorithms
algorithms
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register