Register
Filter

Recent questions without answers

0 votes
0 answers
4358
Discrete Mathematics [Self Doubt]
Is this statement valid: $(\exists x(P(x)\rightarrow Q(x)) )\rightarrow (\exists xP(x)\rightarrow \exists xQ(x))$
Is this statement valid:$(\exists x(P(x)\rightarrow Q(x)) )\rightarrow (\exists xP(x)\rightarrow \exists xQ(x))$
User Avatar
0 votes
0 answers
4362
Goldman Sachs Screening Test (Software Engineering)
Which SDLC model can be used based on Customers feedback Prototype Model RAD Model Iterative Model Waterfall Model Spiral Model Which SDLC model is better if the customer is also part of the development phase Prototype Model RAD Model Iterative Model Waterfall Model Spiral Model
Which SDLC model can be used based on Customers feedbackPrototype ModelRAD ModelIterative ModelWaterfall ModelSpiral Model Which SDLC model is better if the customer is a...
User Avatar
0 votes
0 answers
4363
Goldman Sachs Screening Test
In Matrix Multiplication Operation Code uses Temporal Locality and Data uses Spatial Locality Data uses Temporal Locality and Code uses Spatial Locality Both data and code uses Spatial Locality Both data and code uses Temporal Locality
In Matrix Multiplication Operation Code uses Temporal Locality and Data uses Spatial LocalityData uses Temporal Locality and Code uses Spatial LocalityBoth data and code ...
User Avatar
0 votes
0 answers
4366
Michael Sipser Edition 3 Exercise 0 Question 7 (Page No. 26)
For each part, give a relation that satisfies the condition. Reflexive and symmetric but not transitive Reflexive and transitive but not symmetric Symmetric and transitive but not reflexive
For each part, give a relation that satisfies the condition.Reflexive and symmetric but not transitiveReflexive and transitive but not symmetricSymmetric and transitive b...
User Avatar
0 votes
0 answers
4372
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...
User Avatar
0 votes
0 answers
4379
Ullman (TOC) Edition 3 Exercise 8.2 Question 5 (Page No. 337)
Consider the Turing machine $M=(\{q_{0},q_{1},q_{2},q_{f}\},\{0,1\},\{0,1,B\},\delta,q_{0},B,\{q_{f}\})$ Informally but clearly describe the language $L(M)$ if $\delta$ consists of the following sets of rules$:$ ...
Consider the Turing machine$M=(\{q_{0},q_{1},q_{2},q_{f}\},\{0,1\},\{0,1,B\},\delta,q_{0},B,\{q_{f}\})$Informally but clearly describe the language $L(M)$ if $\delta$ con...
User Avatar
Page: