Q. Let θ(x, y, z) be the statement “x + y = z” and let there be two quantifications given as

(i) ∀x ∀y  Z ∃ θ(x, y, z)
(ii) ∃Z ∀x ∀y θ(x, y, z)
 
Where x, y, z are real numbers. Then which one of the following is correct ?

View solution

Q. Let P(rn, n) be the statement if "m divides n" where the universe of discourse for both the variables is the set of positive integers. Determine the truth values of each of the-following propositions:

I. ∀m ∀n P(m,n)
II. ∃m  ∀n P(m,n)

View solution

Q. Big O estimate for
( f(x) = (x + 1) log(x2 + 1) +3x2 is given as

View solution

Q. How many edges are there in a forest of t-trees containing a total of n vertices?

View solution

Q. Let f and g be the functions from the set of integers to the set integers defined by

f(x) = 2x + 3 and g(x) = 3x + 2

Then the composition  of f and g and g and f is given as

View solution

Q. A graph is non-planar if and only if it contains a subgraph homomorphic to

View solution

Q. If the primal Linear Programming problem has unbounded  solution, then it's dual problem will  have

View solution

Q. Given the problem to maximize
            f(x), X =(x1, x2 ,..... .xn)
subject to m number of inequality constraints
  gi(x) ≤ bi  , i = 1, 2 ...... m
including the non-negativity constraints x ≥ 0
Which of the following conditions is a Kuhn-Tucker necessary condition for a local maxima at x  ?

View solution

Q. The following Linear Programming problem has :
Max                                   Z =x1 +x2
Subject to                         = x1-x2 ≥ 0                                  
                                             3x1 -x2 ≤ -3                                
      and                              xI , x2  ≥ 0

View solution

Q. Given a flow graph with 10 nodes,13 edges and one connected components, the number of regions and the number  of predicate (decision) nodes in the flow graph will be

View solution

Q. If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from the current node to the goal node, then A*algorithm gives an optimal solution if

View solution

Q. The recurrence relation T(n) = m T(n/2) tan2 is satisfied by

View solution

Q. A ___________ complete subgraph and a __________ subset of vertices of a graph G = (V, E) are a clique and a vertex cover respectively.

View solution

Q. A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph?

View solution

Q. Consider a set A {1, 2, 3,……… 1000}. How many members of A shall be divisible by 3 or by 5 or by both 3 and 5?

View solution

Q. A computer program selects an integer in the set {k : 1 < k < 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout at least once?

View solution

Q. Which one of the following is used to compute cyclomatic complexity?

View solution

Q. If we define the functions f, g and h that map R into R by :

f(x) = x4, g(x) = √x2 + 1, h(x) = x2 + 72,  then the value of the composite functions ho(gof) and (hog)of are given as

View solution

Q. Dijkstra algorithm, which solves the single-source shortest-paths problem, is a_______________, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a _____________.

View solution

Q. Equivalent logical expression for the Well Formed Formula (WFF), ~(∀ x)F[x] is

View solution