GATE CSE 2017 SET-1


Q31.

Consider the following intermediate program in three address code p= a -b q= p *c p= u * v q= p + q Which one of the following corresponds to a static single assignment form of the above code?
GateOverflow

Q32.

Consider the C code fragment given below. typedef struct node { int data; node* next ; } node; void join (node* m, node* n) { node* p=n ; while (p->next ! =NULL){ p = p -> next ; } p-> next = m; } Assuming that m and n point to valid NULL- terminated linked lists, invocation of join will
GateOverflow

Q33.

Let c_{1}....c_{n} be scalars, not all zero, such that \sum_{i=1}^{n}c_{i}a_{i}=0 where a_{i} are column vectors in R^{n}. Consider the set of linear equations Ax = b where A=a_{1}....a_{n} and b=\sum_{i=1}^{n}a_{i}. The set of equations has
GateOverflow

Q34.

Let A be nxn real valued square symmetric matrix of rank 2 with \sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij}=50. Consider the following statements. (I) One eigen value must be in [-5, 5] (II) The eigen value with the largest magnitude must be strictly greater than 5. Which of the above statements about eigen values of A is/are necessarily CORRECT?
GateOverflow

Q35.

Recall that Belady's anomaly is that the pages-fault rate may increase as the number of allocated frames increases. Now consider the following statements: S1: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's anomaly S2: LRU page replacement algorithm suffers from Belady's anomaly Which of the following is CORRECT ?
GateOverflow

Q36.

Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive and distinct. Consider the following statements: (I) Minimum spanning tree of G is always unique. (II) Shortest path between any two vertices of G is always unique. Which of the above statements is/are necessarily true?
GateOverflow

Q37.

Consider the language L given by the regular expression (a+b )* b (a+b ) over the alphabet {a, b}. The smallest number of states needed in a deterministic finite-state automation (DFA) accepting L is ___________.
GateOverflow

Q38.

In a RSA cryptosystem a participant A uses two prime numbers p=13 and q=17 to generate her public and private keys. If the public key of A is 35. Then the private key of A is __________.
GateOverflow

Q39.

A sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario, one or more of the following security violations can take place. I. S can launch a birthday attack to replace m with a fraudulent message. II. A third party attacker can launch a birthday attack to replace m with a fraudulent message III. R can launch a birthday attack to replace m with a fraudulent message. Which of the following are possible security violations?
GateOverflow

Q40.

The n-bit fixed-point representation of an unsigned real number real X uses f bits for the fraction part. Let i=n-f. The range of decimal values for X in this representation is
GateOverflow