Consider the following logical inferences.
I_{1}: If it rains then the cricket match will not be played. The cricket match was played. Inference: There was no rain. I_{2}: If it rains then the cricket match will not be played. It did not rain. Inference: The cricket match was played.
Which of the following is TRUE?
What will be the output of the following C program segment?
char inChar = ‘A’ ; switch ( inChar ) { case ‘A’ : printf (“Choice A\ n”) ; case ‘B’ : case ‘C’ : printf (“Choice B”) ; case ‘D’ : case ‘E’ : default : printf ( “ No Choice” ) ; }
Assuming P ≠ NP, which of the following is TRUE?
The worst case running time to search for an element in a balanced binary search tree with n2^{n} elements is
The truth table
represents the Boolean function
The decimal value 0.5 in IEEE single precision floating point representation has
A process executes the code
fork(); fork(); fork();
The total number of child processes created is
Consider the function f(x) = sin(x) in the interval x $\in $$\left[\mathrm{\pi}/4,7\mathrm{\pi}/4\right]$. The number and location(s) of the local minima of this function are
The protocol data unit (PDU) for the application layer in the Internet stack is
Let A be the 2 × 2 matrix with elements a_{11} = a_{12} = a_{21} = +1 and a_{22} = −1. Then the eigenvalues of the matrix A^{19} are
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma $ = {a} and $\epsilon $ is the empty string.
What is the correct translation of the following statement into mathematical logic?
“Some real numbers are rational”
Given the basic ER and relational models, which of the following is INCORRECT?
Which of the following statements are TRUE about an SQL query?
P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause R : All attributes used in the GROUP BY clause must appear in the SELECT clause S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
The amount of ROM needed to implement a 4 bit multiplier is
Register renaming is done in pipelined processors