Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without answers
0
votes
0
answers
5041
Programming:Self Doubt
Can somebody explain this code line by line. I am unable to get and what will be it's output? #include<stdio.h> #include<stdlib.h> void transpose(int n, const double *A, double *B, const int *lda, int *perm) { } int transpose_equal(const double *A, ... , B, r_dim, r_perm); transpose_equal(A, B, total); free(A); free(B); free(B_trans); printf("\n"); } }
Can somebody explain this code line by line. I am unable to getand what will be it’s output?#include<stdio.h #include<stdlib.h void transpose(int n, const double *A, do...
srestha
515
views
srestha
asked
Apr 3, 2019
Programming in C
programming-in-c
output
+
–
0
votes
0
answers
5042
Morris Mano Edition 3 Exercise 5 Question 6 (Page No. 198)
(a) Redefine the carry propagate and carry generate as follows: $P _i = A _i + B _ i$ $G _i = A _iB _i$ ... circuit for this IC. [Hint: use the equation substitution method and AND-OR-INVERT funtion given in part (a) for $C _{i+1}$
(a) Redefine the carry propagate and carry generate as follows:$P _i = A _i + B _ i$$G _i = A _iB _i$Show that the output carry and output sum of a full adder becomes$C _...
ajaysoni1924
1.1k
views
ajaysoni1924
asked
Apr 3, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
adder
carry-generator
+
–
0
votes
0
answers
5043
Morris Mano Edition 3 Exercise 5 Question 5 (Page No. 198)
Using the AND-OR-Invert implementation procedure, show that the output carry in full adder can be expressed as $C _{i+1} = G _i + P _iC _i = (G _i'P _i + G _i'C _i')'$ IC type 74182 is a look-ahead carry generator MSI ... $C _1'$).
Using the AND-OR-Invert implementation procedure, show that the output carry in full adder can be expressed as $C _{i+1} = G _i + P _iC _i = (G _i’P _i + G _i...
ajaysoni1924
506
views
ajaysoni1924
asked
Apr 3, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
adder
carry-generator
+
–
1
votes
0
answers
5044
Morris Mano Edition 3 Exercise 5 Question 4 (Page No. 197)
The adder-subtractor circuit of figure has the following values for mode input M and data inputs A and B. In each case, determine the values of the outputs: $S _ 4 S _3 S _2 S _1$ and $C _5$. M A B 0 0111 0110 0 1000 1001 1 0101 1000 1 0000 1010
The adder-subtractor circuit of figure has the following values for mode input M and data inputs A and B. In each case, determine the values of the outputs: $S _ 4 S _3 S...
ajaysoni1924
3.4k
views
ajaysoni1924
asked
Apr 3, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
adder
digital-circuits
+
–
0
votes
0
answers
5045
Morris Mano Edition 3 Exercise 5 Question 3 (Page No. 197)
The adder-subtractor of the figure is used to subtract the following unsigned 4-bit number: 0110 – 1001(6 – 9) What are the binary values in the nine inputs of the circuit $?$ what are the binary values of the five outputs of the circuit$?$ Explain How the output is related to the operation of 6 – 9.
The adder-subtractor of the figure is used to subtract the following unsigned 4-bit number: 0110 – 1001(6 – 9) What are the binary values in the nine inputs of the ci...
ajaysoni1924
976
views
ajaysoni1924
asked
Apr 3, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
adder
digital-circuits
+
–
1
votes
0
answers
5046
Morris Mano Edition 3 Exercise 5 Question 2 (Page No. 197)
Construct a BCD-to-Excess-3-code converter with a 4-bit adder.remember that the Excess-3 code digits obtained by adding 3 to the corresponding BCD Digit. what must be done to change the circuit to an excess-3-to-BCD-code converter
Construct a BCD-to-Excess-3-code converter with a 4-bit adder.remember that the Excess-3 code digits obtained by adding 3 to the corresponding BCD Digit. what must be don...
ajaysoni1924
596
views
ajaysoni1924
asked
Apr 3, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
adder
digital-circuits
+
–
9
votes
0
answers
5047
Morris Mano Edition 3 Exercise 5 Question 1 (Page No. 197)
Construct a 16-bit parallel adder with four MSI circuits, each containing a four-bit parallel adder. Use a block diagram with 9 inputs and five outputs for each 4-bit adder. Show how the carries are connected between the MSI circuits.
Construct a 16-bit parallel adder with four MSI circuits, each containing a four-bit parallel adder. Use a block diagram with 9 inputs and five outputs for each 4-bit add...
ajaysoni1924
1.7k
views
ajaysoni1924
asked
Apr 3, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
adder
+
–
0
votes
0
answers
5048
Ullman (TOC) Edition 3 Exercise 2.3 Question 7 (Page No. 68)
In example $2.13$ we claimed that the $NFA$ $N$ is in state $q_{i},$ for $i=1,2,...n,$ after reading input sequence $w$ if and only if the $i^{th}$ symbol from the end of $w$ is $1.$Prove this claim.
In example $2.13$ we claimed that the $NFA$ $N$ is in state $q_{i},$ for $i=1,2,...n,$ after reading input sequence$w$ if and only if the $i^{th}$ symbol from the end ...
admin
365
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
finite-automata
+
–
0
votes
0
answers
5049
Ullman (TOC) Edition 3 Exercise 2.3.7 Problem 2.3.6 (Page No. 67)
admin
277
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
finite-automata
descriptive
+
–
0
votes
0
answers
5050
Ullman (TOC) Edition 3 Exercise 2.3 Question 5 (Page No. 67)
In the only-if portion of Theorem $2.12$ we omitted the proof by induction on $|w|$ that if $\delta_{D}(q_{0},w)=p$ then $\delta_{N}(q_{0},w)=\{p\}.$ Supply this proof.
In the only-if portion of Theorem $2.12$ we omitted the proof by induction on $|w|$ that if $\delta_{D}(q_{0},w)=p$ then $\delta_{N}(q_{0},w)=\{p\}.$ Supply this proof.
admin
282
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
finite-automata
descriptive
+
–
0
votes
0
answers
5051
Ullman (TOC) Edition 3 Exercise 2.3 Question 4 (Page No. 66 - 67)
Give non-deterministic finite automata to accept the following languages$.$Try to take advantage of non-determinism as much as possible$.$ The set of strings over the alphabet $\{0,1,.....,9\}$ such that the final digit has ... number of positions that is a multiple of $4.$ Note that $0's$ is an allowable multiple of $4.$
Give non-deterministic finite automata to accept the following languages$.$Try to take advantage of non-determinism as much as possible$.$The set of strings over the alph...
admin
515
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
finite-automata
+
–
0
votes
0
answers
5052
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.9 (Page No. 54)
admin
268
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
0
votes
0
answers
5053
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.8 (Page No. 54)
admin
263
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
0
votes
0
answers
5054
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.7 (Page No. 54)
admin
194
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
4
votes
0
answers
5055
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.6 (Page No. 54)
Give DFA's accepting the following languages over the alphabet $\{0,1\}$ $a)$ The set of all strings beginning with a $1$ that $,$ when interpreted as a binary integer $,$ is a multiple of $5$ For example $,$ ... binary integer $,$ is divisible by $5.$ Examples of strings in the language are $0,10011,1001100,$ and $0101.$
Give DFA's accepting the following languages over the alphabet $\{0,1\}$$a)$ The set of all strings beginning with a $1$ that $,$ when interpreted as a binary integer $,$...
admin
1.9k
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
0
votes
0
answers
5056
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.5 (Page No. 53 - 54)
Give DFA's accepting the following languages over the alpabet $\{0,1\}:$ $a)$ The set of all strings such that each block of ve consecutive symbols contains atleat two $0's.$ $b)$ The set of all strings whose tenth ... number of $0's$ is divisible by five $,$ and the number of $1's$ is divisible by $3.$
Give DFA's accepting the following languages over the alpabet $\{0,1\}:$$a)$ The set of all strings such that each block of ve consecutive symbols contains atleat two $0'...
admin
458
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
1
votes
0
answers
5057
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.3 (Page No. 53)
Show that for any state $q,$ string $x,$ and input symbol $a,$
Show that for any state $q,$ string $x,$ and input symbol $a,$
admin
252
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
0
votes
0
answers
5058
Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.6 (Page No. 36)
The binary string $X$ [shown on-line by the Gradiance systems] is a member of which of the following problems$?$Remember$,$a $"$problem$"$ is a language whose strings represent the cases of a problem ... palindromes$,$ which are strings that are identical when reversed$,$like $0110110,$ regardless of their numerical value$.$
The binary string $X$ [shown on-line by the Gradiance systems] is a member of which of the following problems$?$Remember$,$a$"$problem$"$ is a language whose strings repr...
admin
172
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
0
votes
0
answers
5059
Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.5 (Page No. 35)
What is the concatenation of $X$ and $Y?$ [shown on-line by the Gradiance system from a stock of choices] is$:$
What is the concatenation of $X$ and $Y?$ [shown on-line by the Gradiance system from a stock of choices] is$:$
admin
112
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
0
votes
0
answers
5060
Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.4 (Page No. 35)
The length of the string $X$ [shown on-line by the Gradiance system from a stock of choices] is$:$
The length of the string $X$ [shown on-line by the Gradiance system from a stock of choices] is$:$
admin
159
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
0
votes
0
answers
5061
Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.3 (Page No. 35)
Suppose we want to prove the statement $S(n):$ $"$If $n\geq 2,$ the sum of the integers $2$ through $n$ is $\frac{(n+2)(n-1)}{2}"$ by induction on $n.$ To prove the inductive step$,$ we can make use of the fact ... $,$ in the list below an equality that we may prove to conclude the inductive part.
Suppose we want to prove the statement $S(n):$ $"$If $n\geq 2,$ the sum of the integers $2$ through $n$ is $\frac{(n+2)(n-1)}{2}"$by induction on $n.$ To prove the induct...
admin
128
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
1
votes
0
answers
5062
Morris Mano Edition 3 Exercise 4 Question 24 (Page No. 151)
Derive the truth table for the output of each NOR gate in the given figure.
Derive the truth table for the output of each NOR gate in the given figure.
ajaysoni1924
434
views
ajaysoni1924
asked
Apr 2, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
circuit-output
+
–
0
votes
0
answers
5063
Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.2 (Page No. 35)
To prove $A$ $AND$ $(NOT$ $B)\rightarrow C$ $OR$ $(NOT$ $D)$ by contradiction$,$which of the statements below would we prove$?$Note$:$ each of the choices is simplified by pushing $NOT's$ down until they apply only to atomic statements $A$ through $D.$
To prove $A$ $AND$ $(NOT$ $B)\rightarrow C$ $OR$ $(NOT$ $D)$ by contradiction$,$which of the statements below would we prove$?$Note$:$ each of the choices is simplified b...
admin
171
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
0
votes
0
answers
5064
Morris Mano Edition 3 Exercise 4 Question 28 (Page No. 151)
Design a combinational Circuit that converts a 4-bit gray code number to a 4-bit straight binary number. Implement the circuit with Exclusive OR gates.
Design a combinational Circuit that converts a 4-bit gray code number to a 4-bit straight binary number. Implement the circuit with Exclusive OR gates.
ajaysoni1924
338
views
ajaysoni1924
asked
Apr 2, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
code-c
digital-circuits
+
–
0
votes
0
answers
5065
Morris Mano Edition 3 Exercise 4 Question 29 (Page No. 151)
Design a circuit of a three-bit parity generator and the circuit of the four-bit parity checker using an odd parity bit.
Design a circuit of a three-bit parity generator and the circuit of the four-bit parity checker using an odd parity bit.
ajaysoni1924
273
views
ajaysoni1924
asked
Apr 2, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
digital-circuits
+
–
1
votes
0
answers
5066
Peter Linz Edition 4 Exercise 3.2 Question 8 (Page No. 87)
Consider the following generalized transition graph. (a) Find an equivalent generalized transition graph with only two states. (b) What is the language accepted by this graph?
Consider the following generalized transition graph.(a) Find an equivalent generalized transition graph with only two states.(b) What is the language accepted by this gra...
Naveen Kumar 3
753
views
Naveen Kumar 3
asked
Apr 2, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-expression
regular-language
+
–
0
votes
0
answers
5067
Peter Linz Edition 4 Exercise 3.2 Question 7 (Page No. 87)
Find the minimal dfa that accepts $L(a^*bb) ∪ L(ab^*ba)$.
Find the minimal dfa that accepts $L(a^*bb) ∪ L(ab^*ba)$.
Naveen Kumar 3
161
views
Naveen Kumar 3
asked
Apr 2, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
regular-expression
+
–
0
votes
0
answers
5068
Ullman (TOC) Edition 3 Exercise 1.7 Problem 1.1 (Page No. 35)
Find in the list below the expression that is the contrapositive of $A$ $AND$ $(NOT$ $B)\rightarrow C$ $OR$ $(NOT$ $D).$ Note: the hypothesis and conclusion of the choices in the list below may have some simple logical rules applied to them, in order to simplify the expression.
Find in the list below the expression that is the contrapositive of $A$ $AND$ $(NOT$ $B)\rightarrow C$ $OR$ $(NOT$ $D).$Note: the hypothesis and conclusion of the choices...
admin
204
views
admin
asked
Apr 2, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
1
votes
0
answers
5069
Peter Linz Edition 4 Exercise 3.2 Question 6 (Page No. 87)
Find an nfa for all strings not containing the substring 101. Use this to derive a regular expression for that language.
Find an nfa for all strings not containing the substring 101. Use this to derive a regular expression for that language.
Naveen Kumar 3
229
views
Naveen Kumar 3
asked
Apr 2, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
regular-expression
+
–
0
votes
0
answers
5070
Peter Linz Edition 4 Exercise 3.2 Question 4 (Page No. 87)
Find dfa's that accept the following languages. (a) $L (aa^* + aba^*b^*)$. (b) $L (ab (a + ab)^* (a + aa))$. (c) $L ((abab)^* + (aaa^* + b)^*)$. (d) $L (((aa^*)^* b)^*)$.
Find dfa's that accept the following languages.(a) $L (aa^* + aba^*b^*)$.(b) $L (ab (a + ab)^* (a + aa))$.(c) $L ((abab)^* + (aaa^* + b)^*)$.(d) $L (((aa^*)^* b)^*)$.
Naveen Kumar 3
247
views
Naveen Kumar 3
asked
Apr 2, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-expression
regular-language
+
–
Page:
« prev
1
...
164
165
166
167
168
169
170
171
172
173
174
...
593
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register