Register
Filter

Recent questions without answers

0 votes
0 answers
5079
Peter Linz Edition 5 Exercise 10.4 Question 4 (Page No. 272)
$\text{Exercise 3:}$ Sketch a Turing machine program that enumerates the set {0,1}+{0,1}+ in proper order. $\text{Exercise 4:}$ What is the index of $0^i1^j$ in Exercise 3$?$
$\text{Exercise 3:}$ Sketch a Turing machine program that enumerates the set {0,1}+{0,1}+ in proper order.$\text{Exercise 4:}$ What is the index of $0^i1^j$ in Exercise 3...
User Avatar
0 votes
0 answers
5089
Peter Linz Edition 4 Exercise 3.1 Question 23 (Page No. 77)
For the case of a regular expression $r$ that does not involve $λ$ or $Ø$, give a set of necessary and sufficient conditions that $r$ must satisfy if $L(r)$ is to be infinite.
For the case of a regular expression $r$ that does not involve $λ$ or $Ø$, give a set of necessary and sufficient conditions that $r$ must satisfy if $L(r)$ is to be in...
User Avatar
0 votes
0 answers
5094
self doubt
In this answer, how is the number of conflict equivalent schedule equal to T1->T2 equal to 1(How is it being calculated). And how is the number of conflict equivalent schedule equal to T2->T1 being calculated??It is very confusing please Help!!!!!
In this answer, how is the number of conflict equivalent schedule equal to T1->T2 equal to 1(How is it being calculated). And how is the number of conflict equivalent sch...
User Avatar
0 votes
0 answers
5095
Self doubt
The time complexity required to find the number of cut vertex in a undirected simple graph is?If adjacency list representation is given? Is O(V+E) OR O(E)
The time complexity required to find the number of cut vertex in a undirected simple graph is?If adjacency list representation is given? Is O(V+E) OR O(E)
User Avatar
1 votes
0 answers
5097
Morris Mano Edition 3 Exercise 4 Question 19 (Page No. 151)
Draw the NAND Gate Logic Diagram for each of the following Expressions using multilevel NAND gate Circuits. (AB’ + CD’)E + BC(A + B) w(x + y + z) + xyz
Draw the NAND Gate Logic Diagram for each of the following Expressions using multilevel NAND gate Circuits.(AB’ + CD’)E + BC(A + B)w(x + y + z) + xyz
User Avatar
2 votes
0 answers
5098
Morris Mano Edition 3 Exercise 4 Question 17,18 (Page No. 150)
Analyze the two output combinational circuit shown in the figure. find the boolean fi=unction for the two outputs as the function of the three inputs and explain the circuit operation. derive the truth table of the circuit shown in the figure.
Analyze the two output combinational circuit shown in the figure. find the boolean fi=unction for the two outputs as the function of the three inputs and explain the circ...
User Avatar
Page: