Electronics Corporation of India Limited Computer Science last year papers

Will you please share with me the Electronics Corporation of India Limited Computer Science last year papers?

[Kiran Chandar]

As you want to get the Electronics Corporation of India Limited Computer Science last year papers so here it is for you:

Q.1 Which one of the following is NOT necessarily a property of a Group ?
(A) Commutatively
(B) Associatively
(C) Existence of inverse for every element
(D) Existence of identity

Q.2. What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle ? Assume n > 2.
(A) 2
(B)3
(C) n-1
(D) n

Q.3 Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices ?
(A) No two vertices have the same degree.
(B) At least two vertices have the same degree.
(C) At least three vertices have the same degree.
(D) All vertices have the same degree.

Q/4 Consider the binary relation R = {(JC, y), (x, z), (z. x), (z, y)} on the set {x. y, z). Which one of the following is TRUE ?
(A) R if symmetric but NOT antisymmetric.
(B) R is NOT symmetric but antisymmetric.
(C) R is both symmetric and antisymmetric.
(D) R is neither symmetric nor antisymmetric.

Q.5 (1217)n is equivalent to
(A) (1217)16
(B) (028F)16
(C) (2297)10
(D) (0B17)16

Q.6 What is the minimum number of gates required to implement the Boolean function (AB + C) if we have to use only 2-input NOR gates ?
(A) 2
(B) 3
(C) 4
(D) 5

Q.7 How many 32K x 1 RAM chips are needed to provide a memory capacity of 256 K-bytes ?
(A) 8
(B) 32
(C) 64
(D) 128

Q.8 A CPU generally handles an interrupt by executing an interrupt service routine
(A) as soon as an interrupt is raised.
(B) by checking the interrupt register at the end of fetch cycle.
(C) by checking the interrupt register after finishing the execution of the current instruction.
(D) by checking the interrupt register at fixed time intervals.

Q.9 In which one of the following page replacement policies. Belady’s anomaly may occur ?
(A) FIFO
(B) Optimal
(C) LRU
(D) MRU

Q.1O The essential content(s) in each entry of a page table is/are
(A) virtual page number.
(B) page frame number.
(C) both virtual page number and page frame number.
(D) access right information.

Q.11 What is the number of swaps required to sort n elements using selection sort, in the worst case ?
(A) Ө(n)
(B) Ө (n log n)
(C) Ө (n2)
(D) Ө (n2 log n)

Q.12 S —> aSa|bSb|a|b
The language generated by the above grammar over the alphabet {a, b} is the set of
(A) all palindromes.
(B) all odd length palindromes.
(C) strings that begin and end with the same symbol.
(D) all even length palindromes.

Q.13 Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm ?
P. Always finds a negative weighted cycle, if one exists.
Q. Finds whether any negative weighted cycle is reachable from the source.
(A) P only
(B) Q only
(C) both P and Q
(D) neither P nor Q
Q.14 Let pi(A) be a problem that belongs to the class NP. Then which one of the following is TRUE ?

(A) There is no polynomial time algorithm for pi(A)
(B) If pi(A) can be solved deterministically in polynomial time, then P = NP.
(C) If pi(A) is NP-hard. then it is NP-complete.
(D) pi(A) may be undecidable.

Q.15 Which one of the following languages over die alphabet {0,1} is described by the regular expression: (0+ 1)*0(0+ I)*0(0+1)*?
(A) The set of all strings containing the substring 00.
(B) The set of all strings containing at most two 0′s.
(C) The set of all strings containing at least two 0′s.
(D) The set of all strings that begin and end with either 0 or 1.

Q.16 Which one of the following is FALSE ?
(A) There is a unique minimal DFA for every regular language.
(B) Every NFA can be converted to an equivalent PDA.
(C) Complement of every context-free language is recursive.
(D) Every non deterministic PDA can be converted to an equivalent deterministic PDA.

Q.17 Match all items in Group 1 with correct options from those given in Group 2.
Group 1
P. Regular expression
Q. Pushdown automata
R. Dataflow analysis
S. Register allocation
Group 2
1. Syntax analysis
2. Code generation
3. Lexical analysis
4. Code Optimization
(A)P-4.Q-LR-2.S-3
(B)P-3,Q-l,R-4,S-2
(C)P-3,Q-4.R-l,S-2
(D)P-2,Q-l,R-4.S-3

Q. 18 Consider the program below:
#include <stdio.h>
int fun(int n, int *f_p)
{
int t, f;
if (n <= 1)
{
*f p = 1 ;
return 1 ;
}
t = fun (n-1, f_p) ;
f = t + *f_p ;
*f_P = t ;
return f ;
}
int main{)
{
int x – 15;
printf ("%dn", fun(5, &x));
return 0;
}

The value printed is :
(A) 6
(B) 8
(C) 14
(D) 15

Q.19 The coupling between different modules of a software is categorized as follows :
I. Content coupling
II. Common coupling
III. Control coupling
IV. Stamp coupling
V. Data coupling

Coupling between modules can be ranked in the order of strongest (least desirable) to weakest (most desirable) as follows:
(A) i – ii – m – rv – v
(B) v -rv- in- n-i
(C) i – in- v – ii – iv
(D) iv – n – v – iii-1

Q.20 Consider the HTML table definition given below :
<table border=l>
<tr> <td rowspan=2> ab </td> <td colspan=2> cd </td>
</tr>
<tr> <td> ef </td>
<td rowspan=2> gh. </td>
</tr>
<tr> <td colspan=2> ik </td>
</tr> </table>

The number of rows in each column and the number of columns in each row are :
(A) (2,2,3) and (2,3,2)
(B) (2.2,3) and (2,2,3)
(C) (2,3,2) and (2,3.2)
(D) (2,3,2) and (2,2,3)
Q.21 to Q. 60 carry two marks each.

Q.21 An unbalanced dice (with 6 faces, numbered from 1 to 6) is thrown. The probability that the face value is odd is 90% of the probability that the face value is even. The probability of getting any even numbered face is the same. If the probability that the face is even given that it is greater than 3 is 0.75. which one of the following options is closest to the probability that the face value exceeds 3 ?
(A) 0.453
(B) 0.468
(C) 0.485
(D) 0.492

Q.22 For the composition table of a cyclic group shown below

Which one of the following choices is correct ?
(A) a, b arc generators
(B) b, c arc generators
(C) c, d are generators
(D) d, a are generators

Q.23 Which one of the following is the most appropriate logical formula to represent the statement:
"Gold and silver ornaments are precious"
The following notations are used :
G(x): x is a gold ornament.
S{x): x is a silver ornament
P{x): x is precious.
(A) Vx(P(x) ->(G(x) A S(x)))
(B) Vx((G(X) A S(x)) -> P(x))
(C) Ex((G(x) AS(x)) -> P(x))
(D) Vx((G(x) v 5(A)) -> P(x))