Time Left - 15:00 mins

Solution for ISRO live Quiz session 10/04/2018

Attempt now to get your rank among 522 students!

Question 1

Find the time complexity of following-
main()
{
for (i =1; i ≤ n; i++)
{
for (j =1 ; j ≤ i; j++)
{
for(k=1; k ≤

; k++)
{
x = y + z;
}
}
}
}

Question 2

Which of the following is not type of intermediate code generation.

Question 3

Which header is present in the both request and response message and provides information about the message.

Question 4

How many times does the processor need to access the memory when it executes an indirect address of instruction?

Question 5

Let T be a binary search tree with 14 nodes and 60 as the external path length. Then the internal path length will be

Question 6

Find the highest normal form of a relation
R(A,B,C,D,E) with FD set {A->D, B->A, BC->D, AC->BE}

Question 7

A twisted ring counter is implemented using 4 D-flip flops. If each FF has 40nsec of delay, what is the maximum usable clock frequency which ensures that there are no timing violations?

Question 8

Let (Q,+) be a group where Q is set of rational numbers. Which of the following is a subgroup of Q.

Question 9

If a coin is tossed n-times, what is the probability that head will appear odd number of items?

Question 10

How many data structures are used in the Banker’s algorithm?

Question 11

The cyclomatic complexity metric provides the designer with information regarding the number of ____ in the program.

Question 12

Which of the following statements are false ?
(I) Given two arbitrary context free grammars G1 , G2 and it is undecidable whether
L (G1) = L (G2)
(II) Given two regular grammars G1 , G2 and it is undecidable whether L (G1) = L (G2)
(III) All recursive enumerable languages would be recursive, if halting problem is
decidable.
(IV) For any CFG, it is undecidable whether or not a particular non-terminal "X‟ in G
is reachable.

522 attempts
8 upvotes
5 comments

Tags :

GATE & PSU CS General

Oct 7GATE & PSU CS