ISRO 2009 Computer Science (CS) questions with solution

# Recent questions tagged isro2009

1
Process is A program in high level language kept on disk Contents of main memory A program in execution A job in secondary memory
2
Which of the following contains complete record of all activity that affected the contents of a database during a certain period of time? Transaction log Query language Report writer Data manipulation language
3
Activities which ensure that the software that has been built, is traceable to customer requirement is covered as part of Verification Validation Maintenance Modeling
4
If the pdf of a Poisson distribution is given by $f(x) = \frac{e^{-2} 2^x}{x!}$ then its mean is $2^x$ $2$ $-2$ $1$
5
If the mean of a normal frequency distribution of 1000 items is 25 and its standard deviation is 2.5, then its maximum ordinate is $\frac{1000}{\sqrt{2 \pi} } e^{-25}$ $\frac{1000}{\sqrt{2 \pi} }$ $\frac{1000}{\sqrt{2 \pi} } e^{-2.5}$ $\frac{400}{\sqrt{2 \pi} }$
6
If A, B, C are any three matrices, then A'+B'+C' is equal to a null matrix A+B+C (A+B+C)' -(A+B+C)
7
If $\begin{vmatrix} 3 && 3 \\ x && 5 \end{vmatrix} =3$ then the value of $x$ is 2 3 4 5
8
If two adjacent rows of a determinant are interchanged, the value of the determinant becomes zero remains unaltered becomes infinitive becomes negative of its original value
9
A square matrix A is called orthogonal if A'A= I A -A -I
10
A simple graph ( a graph without parallel edge or loops) with $n$ vertices and $k$ components can have at most $n$ edges $n-k$ edges $(n-k) (n-k+1)$ edges $(n-k) (n-k+1)/2$ edges
11
In a graph G there is one and only one path between every pair of vertices then G is a Path Walk Tree Circuit
12
A graph in which all nodes are of equal degree, is known as Multigraph Non regular graph Regular graph Complete graph
13
If G is a graph with e edges and n vertices the sum of the degrees of all vertices in G is e e/2 e$^2$ 2 e
14
The formula $P_k = y_0 + k \triangledown y_0+ \frac{k(k+1)}{2} \triangledown ^2 y_0 + \dots + \frac{k \dots (k+n-1)}{n!} \triangledown ^n y_0$ is Newton's backward formula Gauss forward formula Gauss backward formula Stirling's formula
15
The value of $x$ at which $y$ is minimum for $y=x^2 -3x +1$ is -3/2 3/2 0 -5/4
16
$x=a \cos(t), y=b \sin(t)$ is the parametric form of Ellipse Hyperbola Circle Parabola
17
The cubic polynomial $y(x)$ which takes the following values: $y(0)=1, y(1)=0, y(2)=1$ and $y(3)=10$ is $x^3 +2x^2 +1$ $x^3 +3x^2 -1$ $x^3 +1$ $x^3 -2x^2 +1$
18
The formula $\int\limits_{x0}^{xa} y(n) dx \simeq h/2 (y_0 + 2y_1 + \dots +2y_{n-1} + y_n) - h/12 (\triangledown y_n - \triangle y_0)$ $- h/24 (\triangledown ^2 y_n + \triangle ^2 y_0) -19h/720 (\triangledown ^3 y_n - \triangle ^3 y_0) \dots$ is called Simpson rule Trapezoidal rule Romberg's rule Gregory's formula
19
The shift operator $E$ is defined as $E [f(x_i)] = f (x_i+h)$ and $E'[f(x_i)]=f (x_i -h)$ then $\triangle$ (forward difference) in terms of $E$ is $E-1$ $E$ $1-E^{-1}$ $1-E$
20
The feature in object-oriented programming that allows the same operation to be carried out differently, depending on the object, is Inheritance Polymorphism Overfunctioning Overriding
21
A full binary tree with $n$ leaves contains $n$ nodes $\log_2 n$ nodes $2n-1$ $2^n$ nodes
22
The infix expression $A+(B-C)^*D$ is correctly represented in prefix notation as $A+B-C^*D$ $+A^*-BCD$ $ABC-D^*+$ $A+BC-D^*$
23
Consider the following boolean function of four variables $f(w,x,y,z) = \Sigma(1,3,4,6,911,12,14)$, the function is Independent of one variable Independent of two variables Independent of three variables Dependent on all variables
24
Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below: Process Priority Arrival Time (in ms) CPU Time Needed Priority P1 0 10 5 P2 0 5 2 P3 2 3 1 P4 5 20 4 P5 10 2 3 (smaller the number, higher the priority) If the CPU scheduling policy is priority scheduling without pre-emption, the average waiting time will be 12.8 ms 11.8 ms 10.8 ms 09,8 ms
25
A page fault Occurs when a program accesses an available page on memory is an error in a specific page is a reference to a page belonging to another program occurs when a program accesses a page not currently in memory
26
The correct matching of the following pairs is (A) Disk check (1) Round robin (B) Batch processing (2) Scan (C) Time sharing (3) LIFO (D) Stack operation (4) FIFO A B C D a 3 4 2 1 b 4 3 2 1 c 3 4 1 2 d 2 4 1 3
27
Which of the following is a MAC address? 192.166.200.50 00056A:01A01A5CCA7FF60 568, Airport Road 01:A5:BB:A7:FF:60