JT(IT) 2018 PART-B Computer Science

Question 1

Which of the following numerical values is NOT a valid constant in C language?

A
12345L
B
018CDF
C
9.3e12
D
0XBCF
Question 1 Explanation: 
→ 12345L integer long is valid integer
→ 018CDF starts with 0 means octal number but actually we are given decimal and hexa numbers. So it is not a valid constant.
→ 9.3e12 float number
→ 0XBCF is hexa number. Valid constant.
Question 2

Let P, Q and R be three atomic prepositional assertions, and

    X : (P ∨ Q) → R
    Y : (P → R) ∨ (Q → R)

Which one of the following is a tautology?

A
X → Y
B
Y → X
C
X ≣ Y
D
~Y → X
Question 2 Explanation: 
Question 3

Which of the following is NOT a symmetric key algorithm?

A
Ellipse Curve Cryptography
B
Advanced Encryption standard
C
Data Encryption Standard
D
Blowfish
Question 3 Explanation: 
Question 4

Which of the following statements is FALSE?

A
The long term scheduler controls the degree of multiprogramming
B
Multiple process of a single program cannot exist
C
Ready queue of the processes resides in main memory
D
A process can have multiple sub processes
Question 4 Explanation: 
→ Long term scheduler controls the degree of multiprogramming.
→ Ready queue of the processes resides in main memory.
→ A process can have multiple sub processes.
→ Multiple process of a single program cannot exist because each program can have only one process.
Question 5

Which of the following Boolean equations is/are correct?

X(X'+ Y) = XY'
X + XY = X
X + X'Y = X + Y
A
only (iii)
B
only (ii)
C
only (i)
D
Both (ii) and (iii)
Question 5 Explanation: 
Question 6

With respect to compiler design, "recursive descent" is a ____ parsing technique that reads the inputs from ____.

A
top-down, right to left
B
top-down, left to right
C
bottom up, right to left
D
bottom up, left to right
Question 6 Explanation: 
A recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent) where each such procedure implements one of the nonterminals of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes.
→ Top down parsers reads the input from left to right and bottom up parsers are reads the input from left to right and reverse.
Question 7

Which of the following statements is/are FALSE?

    (i) XML element names are case sensitive
    (ii) In XML, empty element can be represented as
    (iii) XML element names can contain spaces
A
only (iii)
B
only (ii) and (iii)
C
only (i) and (iii)
D
only (ii)
Question 7 Explanation: 
An element can contain
1. text
2. attributes
3. other elements or a mix of the above
Note: XML element names cannot contain spaces.
Question 8

For what values of k, the points(-k+1, 2k),(k, 2-2K) and (-4-k, 6-2k) are collinear?

A
0, 1
B
-1, 1
C
-1, 1/2
D
1/2, -1/2
Question 8 Explanation: 
There is a restrictions for 3 points to be colLinear and that is
1/2[X1(Y2 - Y3) + X2(Y3 - Y1) + X3(Y1 - Y2)] = 0
Here, X1 = -k + 1, Y1 = 2k, X2 = k, Y2 = 2 – 2k, X3 = -4 - k, Y3 = 6 – 2k
1/2[-k + 1(2 – 2k - 6 + 2k) + k(6 – 2k - 2k) - 4 -k(2k - 2 + 2k)] = 0
1/2[-k + 1(-4) + k(6 - 4k) -4 - k(4k - 2)] = 0
1/2[4k - 4 + 6k - 4k2 - 16k + 8 - 4k2 + 2k)] = 0
1/2(-8k2 - 4k + 4) = 0
-8k2 - 4k + 4 = 0
-8k2 - 8k + 4k + 4 = 0
-8K(k + 1) + 4(k + 1) = 0
(k + 1) (4 - 8k) = 0
k + 1 = 0
k = -1
4 - 8k = 0
k = 4/8
k = 1/2
So, the value of k is -1 and 1/2 .
Question 9

If a connected graph G has planar embedding with 4 faces and 4 vertices, then what will be the number of edges in G?

A
7
B
6
C
4
D
3
Question 9 Explanation: 
Euler's Formula for Planar Graphs:
For any(connected) planar graph with v vertices, e edges and faces, we have
V - E + F = 2
= 4 - E + 4 =2
E = 4 - 2 + 4
E = 6
Question 10

What is the area bounded by the parabola 2y = x2 and the line x = y - 4?

A
18
B
36
C
72
D
6
Question 10 Explanation: 
Given parabola 2y = x2 --- (1)
and the line x = y – 4 ------ (2)
Then y = x+4
Now, Substitute Y value in Equation-(1)
x2 = 2 ( x + 4 ) ------ (3)
Solving equation-3 we get x = 4, - 2.
Place Values of x in equation (1) and (2) we will get y = 8, 2.
Then the points of intersection are (8, 4), (2, –2).

After solving the integration, we will get 18.
Question 11

The following circuit represents the function of a 2–input __________ logic gate.

 
A
Exclusive-OR
B
Exclusive-NOR
C
NAND
D
NOR
Question 11 Explanation: 
Step-1: A⊕B = (A’⊕B’)
Step-2:

Step-3: We have to apply not operation then we are getting Ex-NOR.
Question 12

What is the possible number of reflexive relations on a set of 5 elements?

A
225
B
215
C
210
D
220
Question 12 Explanation: 
Step-1: To find number of reflexive relation we have standard formula is 2(n2-n)
Step-2: The possible number of reflexive relations on a set of 5 elements 2(n2-n) which is 220 for n=5.
Question 13

XML documents form a ___ structure.

A
Binary tree
B
Tree
C
Linear list
D
Graph
Question 13 Explanation: 
→ The document entity serves as the root of the entity tree and a starting-point for an XML processor.
→ This specification does not specify how the document entity is to be located by an XML processor; unlike other entities, the document entity has no name and might well appear on a processor input stream without any identification at all.
Question 14

Banker’s algorithm is used for:

A
Deadlock avoidance
B
Deadlock recovery
C
Deadlock resolution
D
Deadlock prevention
Question 14 Explanation: 
Banker’s algorithm is used for Deadlock avoidance.
Question 15

Which one of the following is most affected by the presence of outliers in sample data?

A
Variance
B
Mean
C
Median
D
Mode
Question 15 Explanation: 
Let's examine what can happen to a data set with outliers.
For the sample data set:
1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4
We find the following mean, median, mode, and standard deviation:
Mean = 2.58
Median = 2.5
Mode = 2
Standard Deviation = 1.08
If we add an outlier to the data set:
1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4, 400
The new values of our statistics are:
Mean = 35.38
Median = 2.5
Mode = 2
Standard Deviation = 114.74
Note: Outliers often has a significant effect on your mean and standard deviation.
Question 16

Consider the matrix A defined as follows:

What is the eigenvalue of 3A+ 5A- 6A + 21, where I is an identity matrix?

A
4, 110, 10
B
1, 27, -8
C
1, 9, 4
D
4, 27, 9
Question 16 Explanation: 
The eigenvalues of A are 1, 3, –2 ( ∵ The given matrix is upper triangular)
Eigenvalues of A3 are 1, 27 and –8.
Eigenvalues of A2 are 1, 9 and 4.
Eigenvalues of A are 1, 3 and –2.
Eigenvalues of I are 1, 1 and 1.
∴ The eigenvalues of 3A3 + 5A2 – 6A + 2I.
First eigenvalue = 3(1) + 5(1) – 6(1) + 2(1) = 4
Second eigenvalue = 3(27) + 5(9) – 6(3) + 2(1) = 110
Third eigenvalue = 3(–8) + 5(4) – 6(–2) + 2(1) = 10
∴ The required eigenvalues are 4, 110, and 10.
Question 17

If A and B are sets and AUB = A∩B, then which of the following is correct?

A
A=B
B
A=∅
C
B=∅
D
A⊂B
Question 17 Explanation: 
For this let x belongs to A implies x belongs to A U B
= x belongs to A intersection B
= x belongs to A and x Belongs to B
= x belongs to B
so A subset of B --- (2)
Now we will let y belong to B which implies y belongs to A U B
= y belongs to A intersection B
= y belongs to A and y belongs to B
= y belongs to A
Therefore, B subset of A --- (3) from (2) and (3) we get A=B.
Question 18

What is the total number of spanning trees of a complete graph of 4 vertices (K4)?

A
16
B
8
C
4
D
15
Question 18 Explanation: 
To find total number of spanning trees for complete graph using standard formula
nn-2 = 42 = 16
Question 19

Considering 0-address instructions machine, what will be the top of the stack after executing the following sequence of instructions?

PUSH 15, PUSH 4, PUSH 6, MULT, PUSH 30, ADD, ADD

A
30
B
69
C
54
D
10
Question 19 Explanation: 
Initially stack is empty. We are using last in first out strategy.
Step-1: PUSH 15,PUSH 4 and PUSH 6 from bottom to top. Now top of the stack value is 6.
Step-2: Perform MULT operation. 6*4=24. Now present stack values are from bottom is 15 and 24.
Step-3: Next again PUSH 30. Now top of the stack is 30.
Step-4: Perform ADD operation. 30+24=54
Step-5: Now present stack values are from bottom is 15 and 54. Perform ADD operation.
Step-6: 15+54=69
Question 20

The maximum number of boolean functions that can be formed using 3 boolean variable is ____.

A
512
B
256
C
128
D