Register
Filter

Questions by srestha

0 votes
0 answers
102
Branch Address
To get branch address, do we need base register value or Program Counter value?
To get branch address, do we need base register value or Program Counter value?
0 votes
0 answers
103
Self doubt- Turing machine
$1)L=M$ is a turing machine $M$ accepts two strings of different length $2)L=M$ is a turing machine $M$ accepts atleast two strings of different length Which one RE? Which one REC? How to compute the different length string?
$1)L=M$ is a turing machine $M$ accepts two strings of different length $2)L=M$ is a turing machine $M$ accepts atleast two strings of different length Which one RE? Whic...
0 votes
0 answers
104
Made Easy Test Series :TOC1
$(a,b,c)$ represents by reading input $a$, it replaces $a$ by $b$ and moved to $c$ direction. Which of the following language accepted by TM? My question is what $y$ is accepting in TM? I mean why $y$ is needed? What language is accepted ?
$(a,b,c)$ represents by reading input $a$, it replaces $a$ by $b$ and moved to $c$ direction. Which of the following language accepted by TM?My question is what $y$ is ac...
1 votes
1 answer
106
Allen Career Institute:Regular Expression
The regular expression 0*(10*)* denote the same set as (1) (1*0)*1* (2) 0+(0+10)* (3) (0+1)*10(0+1)* (4) None of these Isnot 1) as same as given expression?
The regular expression 0*(10*)* denote the same set as(1) (1*0)*1*(2) 0+(0+10)*(3) (0+1)*10(0+1)*(4) None of theseIsnot 1) as same as given expression?
0 votes
0 answers
107
Allen Carrer Institute: TOC1
How many no. of states in DFA for the following required expression? $(a + b + c) (a + b + c) (a + b + c) (a + b + c) ……… (n – 2)$ times $(a + b + c)^{+}$ $(1) $ $n – 1$ $(2) $ $n$ $(3) $ $n + 1$ $(4) $ $n + 2$ Plz confirm me the answer . Is it $(n-1)$ or $n ?$
How many no. of states in DFA for the following required expression?$(a + b + c) (a + b + c) (a + b + c) (a + b + c) ……… (n – 2)$ times $(a + b + c)^{+}$$(1) $$n ...
0 votes
0 answers
108
Allen Carrer Institute: Algorithm
Using best first search for a shortest path from A to Z, the order in which nodes are considered best for the path is (Note :- that these are node orders not full paths.) (1) A < C < F < D < E (2) A < C < E < B (3) A < C < F < E < B (4) A < C < D < F
Using best first search for a shortest path from A to Z, the order in which nodes are considered best for the path is (Note :- that these are node orders not full paths.)...
0 votes
0 answers
109
Allen Career Institute: Algorithm
Identify the algorithm which works on the principle that locally optimal solutions are globally optimal. $\left ( A \right )$ Divide and Conquer $\left ( B \right )$ Greedy $\left ( C \right )$ Dynamic Programming $\left ( D \right )$ All of the above
Identify the algorithm which works on the principle that locally optimal solutions are globally optimal.$\left ( A \right )$ Divide and Conquer$\left ( B \right )$ Greedy...
1 votes
0 answers
110
Made Easy Test Series : Doubt on Automata
$\left \{ a^{n}.b^{n+k}\mid n\geq 0,k\geq 1 \right \}\cup \left \{ a^{n+k}.b^{n}\mid n\geq 0,k\geq 3 \right \}$ is DCFL Is it true? As we know union of two DCFL cannot be DCFL
$\left \{ a^{n}.b^{n+k}\mid n\geq 0,k\geq 1 \right \}\cup \left \{ a^{n+k}.b^{n}\mid n\geq 0,k\geq 3 \right \}$ is DCFLIs it true? As we know union of two DCFL cannot be ...
1 votes
0 answers
111
Stack-DS(Conceptual Doubt)
Is it TRUE or FALSE? Stack allocation can allocate and deallocate dynamic variables and can manage runtime storage
Is it TRUE or FALSE?Stack allocation can allocate and deallocate dynamic variables and can manage runtime storage
0 votes
0 answers
114
Self Doubt
What is control input and control output ? Is in SR output changes with control input and control output?
What is control input and control output ?Is in SR output changes with control input and control output?
0 votes
0 answers
115
General Query: Self doubt(Math+Automata)
Can somebody explain What is identity permutation?
Can somebody explainWhat is identity permutation?
0 votes
2 answers
116
Allen Career Institute:General Aptitude
Select the best alternative Motorcycle : Battery : : Life : ? (1) Star (2) Moon (3) Sun (4) Earth I given answer as (4), but correct one is (3) why?
Select the best alternative Motorcycle : Battery : : Life : ?(1) Star(2) Moon(3) Sun(4) EarthI given answer as (4), but correct one is (3) why?
1 votes
1 answer
119
Allen Career Institute:Graph Theory
If G be connected planar graph with 12 vertices of deg 4 each. In how many regions can this planar graph be partitioned?
If G be connected planar graph with 12 vertices of deg 4 each. In how many regions can this planar graph be partitioned?
Page: