Let \(P(x, y)\) be a propositional function, then .................. is a tautology.
\(\exists x \forall y P(x, y) \rightarrow \forall y \exists x P(x, y)\)
Claim: \(\exists x \forall y P(x, y) \rightarrow \forall y \exists x P(x, y)\) is always true.
Assume the left side: some \(a\) has \(P(a, y)\) for every \(y\). Then for any \(y\), \(x = a\) gives \(P(x, y)\), so \(\forall y \exists x P(x, y)\) holds.
Counterexample for \(\exists x \forall y P(x, y) \rightarrow \forall y P(x0, y)\): take \(P(x, y): x = 0\) on integers and \(x0 = 1\); the left side is true, the right side false.
Counterexample for \(\exists x P(x, y0) \rightarrow \exists x \forall y P(x, y)\): \(P(x, y): x = y\); \(x = y0\) works but no single \(x\) equals every \(y\).
Counterexample for \(\exists x P(x, y0) \rightarrow \forall y P(x0, y)\): \(P(x, y): x = y\) again makes the left true and the right false.
Hence, \(\exists x \forall y P(x, y) \rightarrow \forall y \exists x P(x, y)\).
Let \(\varphi, \psi\) be the formula, \(\varphi \models \Psi\), if and only if \(\varphi \models \Psi\) is a :
Which of the following relations defined on X = {1, 2, 3} is an equivalent relation ?
A rod is divided into six segment is to be colored with one or more of 4 different colors. In how many ways can this be done ?
Consider the following linear programming problem : Maximize \(z = 5x_{1} + 2x_{2} + 3x_{3} - x_{4} + x_{5}\) Subject to : \(x_{1} + 2x_{2} + 2x_{3} + x_{4} = 8\), \(3x_{1} + 4x_{2} + x_{3} + x_{5} = 7\), \(x_{1}, x_{2}, x_{3}, x_{4}, x_{5} \geq 0\) What will be the basic feasible solution after iteration 1 ?
The thickness of a graph G is defined as minimum number of (edge-disjoint) planar subgraphs into which G can be decomposed. The thickness of G is defined as \(\theta(G)\). What is the thickness of planar graph ?
A committee is to be selected from 5 candidates a, b, c, d and e. The selection must satisfy all the following conditions :
• Either a or b must be included, but not both
• Either c or e or both must be included
• If d is included then b must be included
• Either a or c are included or neither is included.
• If e is included, then c and d must be included. How should selection be made ?
Let us consider the letters from a through h, and all 5 letters are made using these letters. (words are just strings of letters). How many of these words contain no repeated letters ?
Let us consider the following primal problem : Maximize \(z = 2x_{1} + x_{2}\) Subject to \(x_{1} - x_{2} \leq 4\), \(x_{1} - x_{2} \leq 2\), \(x_{1}, x_{2} \geq 0\) What will be its dual problem ?
Identify an appropriate operation sequence with respect to execution of a machine level language instruction.
The “instruction decode” phase in CPU’s instruction cycle is responsible to _____ .
.................... is a client server application that identifies each host on the internet with a unique user-friendly name.
Every OS has a ................ or .......... which primarily resides in the main memory of the computer to perform some of the basic functions of the OS.
(i) Kernel
(ii) Interface
(iii) Nucleus
(iv) Compiler
Codes:
Which of the following are referred to as low level language?
(i) Machine language
(ii) Assembly language
(iii) High level language
(iv) Natural language
Codes:
Match the following:
| List I | List II |
| (a) New York Public Library | (i) Shelv AR |
| (b) Miami University Augmented Research Group | (ii) Smart library |
| (c) Oula University Library | (iii) Wolf Walk |
| (d) North Carolina State University | (iv) Find the future |
Codes:
Which part of the QR code represents the encoded data?