## ISRO-2017 May

Question 1 |

If A is a skew-symmetric matrix, then A

^{T}diagonal matrix | |

A | |

-A | |

0 |

Question 1 Explanation:

→ In mathematics, particularly in linear algebra, a skew-symmetric (or antisymmetric or antimetric) matrix is a square matrix whose transpose equals its negative, that is, it satisfies the condition.

→ If A is skew symmetric matrix then A

→ In terms of the entries of the matrix, if a

→ If A is skew symmetric matrix then a

→ If A is skew symmetric matrix then A

^{T}= -A→ In terms of the entries of the matrix, if a

_{ij}denotes the entry in the i^{th}row and j^{th}column, then the skew-symmetric condition is equivalent to→ If A is skew symmetric matrix then a

_{ji}=-a_{ij}Question 2 |

If A and B be two arbitrary events, then

P(A∩B) = P(A)P(B) | |

P(A∪B) = P(A) + P(B) | |

P(A|B) = P(A ∩ B) + P(B) | |

P(A∪B) <= P(A) + P(B) |

Question 2 Explanation:

(A) Happens when A and B are independent.

(B) Happens when A and B are mutually exclusive.

(C) Not happens.

(D) P(A∪B) ≤ P(A) + P(B) is true because P(A∪B) = P(A) + P(B) - P(A∩B).

(B) Happens when A and B are mutually exclusive.

(C) Not happens.

(D) P(A∪B) ≤ P(A) + P(B) is true because P(A∪B) = P(A) + P(B) - P(A∩B).

Question 3 |

Using Newton Raphson method, a root correct to 3 decimal places of the equation x

^{3}– 3x – 5 = 0 2.222 | |

2.275 | |

2.279 | |

None of the above |

Question 3 Explanation:

Here f(x)= x

The Newton-Raphson iterative formula is

Since x

^{3}-3x-5 and f^{1}(x) = 3x^{2}-3The Newton-Raphson iterative formula is

Since x

_{3}and x_{4}are identical upto 3 places of decima,we take x_{4}=2.279 as the required root, correct to three places of the decimal.Question 4 |

What does the data dictionary identify?

Field names | |

Field Formats | |

Field Types | |

All of these |

Question 4 Explanation:

→ A data dictionary(or) metadata repository, as defined in the IBM Dictionary of Computing, is a "centralized repository of information about data such as meaning, relationships to other data, origin, usage, and format".

→ Oracle defines it as a collection of tables with metadata. The term can have one of several closely related meanings pertaining to databases and database management systems (DBMS)

1. A document describing a database or collection of databases

2. An integral component of a DBMS that is required to determine its structure

3. A piece of middleware that extends or supplants the native data dictionary of a DBMS

→ Oracle defines it as a collection of tables with metadata. The term can have one of several closely related meanings pertaining to databases and database management systems (DBMS)

1. A document describing a database or collection of databases

2. An integral component of a DBMS that is required to determine its structure

3. A piece of middleware that extends or supplants the native data dictionary of a DBMS

Question 5 |

Which of the following concurrency control protocol ensures both conflict serializability and free from deadlock?

Timestamp ordering | |

2 Phase Locking | |

Both (a) and (b) | |

None of the above |

Question 5 Explanation:

→ Two-phase locking protocol (2PL) ensures the conflict serializable schedule but it may not free from deadlock.

→ Timestamp ordering protocol ensures conflict serializability and free from deadlock.

→ Timestamp ordering protocol ensures conflict serializability and free from deadlock.

Question 6 |

ACID properties of a transactions are

Atomicity, consistency, isolation, database | |

Atomicity, consistency, isolation, durability | |

Atomicity, consistency, integrity, durability | |

Atomicity, consistency, integrity, database |

Question 6 Explanation:

Atomicity: Execute the all the operations or none of them

→ Responsible for Transaction Manager

Consistency: Database should be consistent before and after the execution of the transaction

→ Responsible for user/application manager

Isolation: Each transaction Tie must be executed without knowing what is happening with other transactions. Responsible for Concurrency control manager

Durability: All updates done by a transaction must become permanent.

→ Responsible for recovery manager

→ Responsible for Transaction Manager

Consistency: Database should be consistent before and after the execution of the transaction

→ Responsible for user/application manager

Isolation: Each transaction Tie must be executed without knowing what is happening with other transactions. Responsible for Concurrency control manager

Durability: All updates done by a transaction must become permanent.

→ Responsible for recovery manager

Question 7 |

Database table by name overtime_allowance is given below

What is the output of the following SQL query?

select count(*) from ((select Employee, Department from Overtime_allowance) as S

natural join (select Department, OT_allowance from Overtime_allowance) as T);

What is the output of the following SQL query?

select count(*) from ((select Employee, Department from Overtime_allowance) as S

natural join (select Department, OT_allowance from Overtime_allowance) as T);

16 | |

4 | |

8 | |

None of the above |

Question 7 Explanation:

Common attributes in both the table column are the department. So, we apply natural join, it will give the output as common tuples in both the table S and R.

Question 8 |

Which symbol denote derived attributes in the ER Model?

Double ellipse | |

Dashed ellipse | |

Squared ellipse | |

An ellipse with attribute name underlined |

Question 8 Explanation:

Derived attributes are depicted by dashed ellipse.

Example:

Example:

Question 9 |

The symmetric difference of sets A = {1, 2, 3, 4, 5, 6, 7, 8} and B = {1, 3, 5, 6, 7, 8, 9} is

{1, 3, 5, 6, 7, 8} | |

{2, 4, 9} | |

{2, 4} | |

{1, 2, 3, 4, 5, 6, 7, 8, 9} |

Question 9 Explanation:

Symmetrical Difference of A and B=(A–B)∪(B–A)

Question 10 |

The problems 3-SAT and 2-SAT are

Both NP-complete | |

Both in P | |

NP-complete and in P, respectively | |

Undecidable and NP-complete, respectively |

Question 10 Explanation:

→ 2-SAT is the first non polynomial problem is solved in polynomial time.

→ 3-SAT problem is NP- complete problem

→ 3-SAT problem is NP- complete problem

Question 11 |

Given the following statements:

S1 : Every context-sensitive language L is recursive

S2 : There exists a recursive language that is not context-sensitive

Which statements are true?

S1 : Every context-sensitive language L is recursive

S2 : There exists a recursive language that is not context-sensitive

Which statements are true?

Only S1 is correct | |

Only S2 is correct | |

Both S1 and S2 are not correct | |

Both S1 and S2 are correct |

Question 11 Explanation:

According to the Chomsky hierarchy, both the statements are correct.

Question 12 |

Which one of the following is FALSE?

There is a unique minimal DFA for every regular language | |

Every NFA can be converted to an equivalent PDA | |

The complement of every context-free language is recursive | |

Every non-deterministic PDA can be converted to an equivalent deterministic PDA |

Question 12 Explanation:

→ NPDA is more powerful than DPDA because

1. DPDA accept only a proper subset of CFL's ie. LL grammars.

2. NPDA can accept any CFL, which makes them more powerful over DPDA

3. Every NPDA can not be converted to an equivalent DPDA

1. DPDA accept only a proper subset of CFL's ie. LL grammars.

2. NPDA can accept any CFL, which makes them more powerful over DPDA

3. Every NPDA can not be converted to an equivalent DPDA

Question 13 |

In some programming languages, an identifier is permitted to be a letter followed by any number of letters or digits. If L and D denotes the set of letters and digit respectively. Which of the following expression defines an identifier?

(L + D)* | |

(L.D)* | |

L(L + D)* | |

L(L.D)* |

Question 13 Explanation:

Option C is correct because it indicates L followed by (L + D)* where * means 0 or more occurences of L or D.

Question 14 |

The recurrence relation that arises in relation with the complexity of binary search is:

T(n)=2T(n/2)+k , where k is constant | |

T(n)=T(n/2) +k, where k is constant | |

T(n)=T(n/2)+logn | |

T(n)=T(n/2)+n |

Question 14 Explanation:

__Binary search in a sorted array__

The time to search in an array of ‘n’ elements is equal to the time to search in an array of n/2 elements plus k comparison.

T(n)=T(n/2)+k // k is constant

Question 15 |

Which one of the following in-place sorting algorithms needs the minimum number of swaps?

Insertion Sort | |

Quick Sort | |

Heap Sort | |

Selection Sort |

Question 15 Explanation:

Selection sort requires minimum number of swaps i.e O(n)

Question 16 |

Given two statements:

(i) Insertion of an element should be done at the last node in a circular list

(ii) Deletion of an element should be done at the last node of the circular list

(i) Insertion of an element should be done at the last node in a circular list

(ii) Deletion of an element should be done at the last node of the circular list

Both are true | |

Both are false | |

First is false and second is true | |

None of the above |

Question 16 Explanation:

There are three situation for inserting element and deleting an element in Circular linked list.

1.Insertion at the front of Circular linked list.

2.Insertion in the middle of the Circular linked list.

3.Insertion at the end of the Circular linked list.

1.Insertion at the front of Circular linked list.

2.Insertion in the middle of the Circular linked list.

3.Insertion at the end of the Circular linked list.

Question 17 |

Which of the following data structure is useful in traversing a given graph by breadth-first search?

Stack | |

List | |

Queue | |

None of the above |

Question 17 Explanation:

Question 18 |

How many 128×8 bit RAMs are required to design 32K×32 bit RAM?

512 | |

1024 | |

128 | |

32 |

Question 18 Explanation:

Step-1: RAM size required is 32Kx32 bits

= 32x1024x32 bits. [Note: 1k=1024 bytes]

Step-2: Given RAM chip capacity is 128x8 bits

Step-3: Required size/Given size

=(32*1024*32) / (128*8)

=1024

= 32x1024x32 bits. [Note: 1k=1024 bytes]

Step-2: Given RAM chip capacity is 128x8 bits

Step-3: Required size/Given size

=(32*1024*32) / (128*8)

=1024

Question 19 |

The most appropriate matching for the following pairs :

X − 3, Y − 2, Z −1 | |

X − 2, Y − 3, Z −1 | |

X − 3, Y −1, Z − 2 | |

X − 2, Y −1, Z − 3 |

Question 19 Explanation:

**Indirect addressing:**Indirect addressing means that the address of the data is held in an intermediate location so that the address is first 'looked up' and then used to locate the data itself.

**Immediate addressing:**Immediate Addressing. An immediate operand has a constant value or an expression. When an instruction with two operands uses immediate addressing, the first operand may be a register or memory location, and the second operand is an immediate constant.

__can be one by using loops.__

**Auto increment or decrements:**Question 20 |

Which interrupt in 8085 Microprocessor is unmaskable?

RST 5.5 | |

RST 7.5 | |

TRAP | |