The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
GATE198814i
0
votes
107
views
Consider the following wellformed formula:
$\exists x \forall y [ \neg \: \exists z [ p (y, z) \wedge p (z, y) ] \equiv p(y)$
Express the above wellformed formula in clause form.
gate1988
descriptive
firstorderlogic
asked
Dec 20, 2016
in
Mathematical Logic
by
jothee
Veteran
(
115k
points)

107
views
answer
comment
Your identity must be verified before you can post a comment. Please wait if already uploaded identity proof or upload your proof
here
Please
log in
or
register
to answer this question.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
0
votes
0
answers
1
GATE198814ii
Consider the following wellformed formula: $\exists x \forall y [ \neg \exists z [ p (y, z) \wedge p (z, y) ] \equiv p(y)$ Show using resolution principle that the wellformed formula, given above, cannot be satisfied for any interpretation.
asked
Dec 20, 2016
in
Mathematical Logic
by
jothee
Veteran
(
115k
points)

140
views
gate1988
descriptive
firstorderlogic
+6
votes
1
answer
2
GATE19882vii
Define the validity of a wellformed formula(wff)
asked
Dec 18, 2016
in
Mathematical Logic
by
jothee
Veteran
(
115k
points)

331
views
gate1988
descriptive
mathematicallogic
propositionallogic
0
votes
0
answers
3
GATE198817iiiiii
The following table gives the cost of transporting one tonne of goods from the origins A, B, C to the destinations F, G, H. Also shown are the availabilities of the goods at the origins and the requirements at the destinations. The transportation problem ... i). For the solution of (ii) above, calculate the values of the duals and determine whether this is an optimal solution.
asked
Dec 20, 2016
in
Others
by
jothee
Veteran
(
115k
points)

115
views
gate1988
nongate
descriptive
linearprogramming
0
votes
0
answers
4
GATE198816iiiii
If $x \ \underline{x} \ \infty = 1< i^{max} < n \: \: max \: \: ( \mid x1 \mid ) $ for the vector $\underline{x} = (x1, x2 \dots x_n)$ ... using a known property of this norm. Although this norm is very easy to calculate for any matrix, explain why the condition number is difficult (i.e. expensive) to calculate.
asked
Dec 20, 2016
in
Linear Algebra
by
jothee
Veteran
(
115k
points)

130
views
gate1988
descriptive
matrices
outofsyllabusnow
0
votes
0
answers
5
GATE198816i
Assume that the matrix $A$ given below, has factorization of the form $LU=PA$, where $L$ is lowertriangular with all diagonal elements equal to 1, $U$ is uppertriangular, and $P$ is a permutation matrix. For $A = \begin{bmatrix} 2 & 5 & 9 \\ 4 & 6 & 5 \\ 8 & 2 & 3 \end{bmatrix}$ Compute $L, U,$ and $P$ using Gaussian elimination with partial pivoting.
asked
Dec 20, 2016
in
Linear Algebra
by
jothee
Veteran
(
115k
points)

198
views
gate1988
normal
descriptive
linearalgebra
matrices
+3
votes
0
answers
6
GATE198815
Consider the DFA $M$ and NFA M2 as defined below. Let the language accepted by machine $M$ be $L$. What language machine M2 accepts, if $F2=A$ ? $F2=B$ ? $F2=C$ ? $F2=D$ ? $M=(Q, \Sigma, \delta, q_0, F)$ $M2=(Q2, \Sigma, \delta_2, q_{00}, F2)$ ... $D=\{\langle p, q, r \rangle \mid p \in Q; q \in F\}$
asked
Dec 20, 2016
in
Theory of Computation
by
jothee
Veteran
(
115k
points)

183
views
normal
gate1988
descriptive
theoryofcomputation
+5
votes
5
answers
7
GATE198813iv
Solve the recurrence equations: $T(n)= T( \frac{n}{2})+1$ $T(1)=1$
asked
Dec 20, 2016
in
Algorithms
by
jothee
Veteran
(
115k
points)

418
views
gate1988
descriptive
algorithms
recurrence
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Challenge to GATE keys: Question 26, If you also want to challenge the same, as I did!
How to follow Standard Textbooks?
Gate contest link is now open
Official keys are out now.
JEST 2019 MEMORY BASED QUESTION PAPER
All categories
General Aptitude
1.5k
Engineering Mathematics
7.1k
Discrete Mathematics
4.9k
Mathematical Logic
1.9k
Set Theory & Algebra
1.3k
Combinatory
872
Graph Theory
802
Probability
1k
Linear Algebra
691
Calculus
493
Digital Logic
2.7k
Programming & DS
4.9k
Algorithms
4.2k
Theory of Computation
5.3k
Compiler Design
2.1k
Operating System
4k
Databases
4k
CO & Architecture
3.5k
Computer Networks
4k
Non GATE
1.4k
Others
1.5k
Admissions
559
Exam Queries
555
Tier 1 Placement Questions
23
Job Queries
69
Projects
18
Follow @csegate
Recent Blog Comments
It's good for a democracy to have different view...
Yes , I agree , peace , fighting all around
Let the GATE authority decides!!! we are the not...
Surely will . The other person who has got it...
47,919
questions
52,324
answers
182,340
comments
67,778
users