Numerical Computation and Estimation - General Aptitude (GA) Previous Year Questions

1

2017 · General Aptitude (GA) · Numerical Computation and Estimation

Computer Science & Information Technology (CS) 2017 [Session 1]

Consider the following functions from positive integers to real numbers: \( 10, \sqrt{n}, n, \log_2 n, \frac{100}{n} \). The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is:

A

\(\log_2 n, \frac{100}{n}, 10, \sqrt{n}, n \)

B

\(\frac{100}{n}, 10, \log_2 n, \sqrt{n}, n \)

C

\(10, \frac{100}{n}, \sqrt{n}, \log_2 n, n \)

D

\(\frac{100}{n}, \log_2 n, 10, \sqrt{n}, n \)

Open complete paper

2

2017 · General Aptitude (GA) · Numerical Computation and Estimation

Computer Science & Information Technology (CS) 2017 [Session 1]

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

A

\(2^{-f} \) to \(2^i \)

B

\(2^{-f} \) to \((2^i - 2^{-f}) \)

C

0 to \(2^i \)

D

0 to \((2^i - 2^{-f}) \)

Open complete paper

3

2017 · General Aptitude (GA) · Numerical Computation and Estimation

Computer Science & Information Technology (CS) 2017 [Session 1]

Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it are given below.

EMP
EmpId	EmpName	DeptName
1	XYA	AA
2	XYB	AA
3	XYC	AA
4	XYD	AA
5	XYE	AB
6	XYF	AB
7	XYG	AB
8	XYH	AC
9	XYI	AC
10	XYJ	AC
11	XYK	AD
12	XYL	AD
13	XYM	AE

SELECT AVG(EC.Num) FROM EC WHERE (DeptName, Num) IN     (SELECT DeptName, COUNT(EmpId) AS         EC(DeptName, Num)      FROM EMP      GROUP BY DeptName)

The output of executing the SQL query is ______.

Check answer

Open complete paper

4

2017 · General Aptitude (GA) · Numerical Computation and Estimation

Computer Science & Information Technology (CS) 2017 [Session 1]

Consider a two-level cache hierarchy with L1 and L2 caches. An application incurs 1.4 memory accesses per instruction on average. For this application, the miss rate of L1 cache is 0.1; the L2 cache experiences, on average, 7 misses per 1000 instructions. The miss rate of L2 expressed correct to two decimal places is __________.

Check answer

Open complete paper

5

2017 · General Aptitude (GA) · Numerical Computation and Estimation

Computer Science & Information Technology (CS) 2017 [Session 1]

A computer network uses polynomials over GF(2) for error checking with 8 bits as information bits and uses x^3 + x + 1 as the generator polynomial to generate the check bits. In this network, the message 01011011 is transmitted as

A

01011011010

B

01011011011

C

01011011101

D

01011011100

Open complete paper

6

2017 · General Aptitude (GA) · Numerical Computation and Estimation

Computer Science & Information Technology (CS) 2017 [Session 1]

Let A be an array of 31 numbers consisting of a sequence of 0's followed by a sequence of 1's. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is __________.

Check answer

Open complete paper