menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Recent questions tagged isro2009

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts
ISRO 2009 Computer Science (CS) questions with solution

Recent questions tagged isro2009

3 votes
3 answers
1
ISRO2009-76
Process is A program in high level language kept on disk Contents of main memory A program in execution A job in secondary memory
Process is A program in high level language kept on disk Contents of main memory A program in execution A job in secondary memory
asked Jun 15, 2016 in Operating System jothee 1.6k views
4 votes
2 answers
2
ISRO2009-71
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
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
asked Jun 15, 2016 in Databases jothee 3.4k views
8 votes
4 answers
3
ISRO2009-67
Activities which ensure that the software that has been built, is traceable to customer requirement is covered as part of Verification Validation Maintenance Modeling
Activities which ensure that the software that has been built, is traceable to customer requirement is covered as part of Verification Validation Maintenance Modeling
asked Jun 15, 2016 in IS&Software Engineering jothee 2k views
4 votes
1 answer
4
ISRO2009-66
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$
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$
asked Jun 15, 2016 in Probability jothee 1.5k views
3 votes
1 answer
5
ISRO2009-65
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} }$
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} }$
asked Jun 15, 2016 in Probability jothee 2.1k views
5 votes
2 answers
6
ISRO2009-62
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)
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)
asked Jun 15, 2016 in Linear Algebra jothee 1.6k views
7 votes
1 answer
7
ISRO2009-61
If $\begin{vmatrix} 3 && 3 \\ x && 5 \end{vmatrix} =3$ then the value of $x$ is 2 3 4 5
If $\begin{vmatrix} 3 && 3 \\ x && 5 \end{vmatrix} =3$ then the value of $x$ is 2 3 4 5
asked Jun 15, 2016 in Linear Algebra jothee 1.2k views
8 votes
1 answer
8
ISRO2009-60
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
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
asked Jun 15, 2016 in Linear Algebra jothee 1.6k views
5 votes
2 answers
9
ISRO2009-59
A square matrix A is called orthogonal if A'A= I A -A -I
A square matrix A is called orthogonal if A'A= I A -A -I
asked Jun 15, 2016 in Linear Algebra jothee 1.4k views
6 votes
2 answers
10
ISRO2009-56
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
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
asked Jun 15, 2016 in Graph Theory jothee 1.7k views
6 votes
3 answers
11
ISRO2009-55
In a graph G there is one and only one path between every pair of vertices then G is a Path Walk Tree Circuit
In a graph G there is one and only one path between every pair of vertices then G is a Path Walk Tree Circuit
asked Jun 15, 2016 in Graph Theory jothee 2k views
7 votes
1 answer
12
ISRO2009-54
A graph in which all nodes are of equal degree, is known as Multigraph Non regular graph Regular graph Complete graph
A graph in which all nodes are of equal degree, is known as Multigraph Non regular graph Regular graph Complete graph
asked Jun 15, 2016 in Graph Theory jothee 2.3k views
6 votes
1 answer
13
ISRO2009-52
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
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
asked Jun 15, 2016 in Graph Theory jothee 1.5k views
3 votes
2 answers
14
ISRO2009-51
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
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
asked Jun 15, 2016 in Numerical Methods jothee 1.2k views
5 votes
1 answer
15
ISRO2009-50
The value of $x$ at which $y$ is minimum for $y=x^2 -3x +1 $ is -3/2 3/2 0 -5/4
The value of $x$ at which $y$ is minimum for $y=x^2 -3x +1 $ is -3/2 3/2 0 -5/4
asked Jun 15, 2016 in Calculus jothee 1.3k views
4 votes
1 answer
16
ISRO2009-49
$x=a \cos(t), y=b \sin(t)$ is the parametric form of Ellipse Hyperbola Circle Parabola
$x=a \cos(t), y=b \sin(t)$ is the parametric form of Ellipse Hyperbola Circle Parabola
asked Jun 15, 2016 in Calculus jothee 1.2k views
4 votes
2 answers
17
ISRO2009-48
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$
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$
asked Jun 15, 2016 in Numerical Methods jothee 1k views
3 votes
1 answer
18
ISRO2009-47
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
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
asked Jun 15, 2016 in Numerical Methods jothee 1.1k views
4 votes
1 answer
19
ISRO2009-46
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$
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$
asked Jun 15, 2016 in Numerical Methods jothee 1.7k views
4 votes
2 answers
20
ISRO2009-33
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
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
asked Jun 15, 2016 in Object Oriented Programming jothee 1.8k views
7 votes
3 answers
21
ISRO2009-31
A full binary tree with $n$ leaves contains $n$ nodes $\log_2 n$ nodes $2n-1$ $2^n$ nodes
A full binary tree with $n$ leaves contains $n$ nodes $\log_2 n$ nodes $2n-1$ $2^n$ nodes
asked Jun 14, 2016 in DS jothee 3.5k views
3 votes
2 answers
22
ISRO2009-28
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^*$
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^*$
asked Jun 14, 2016 in Compiler Design jothee 1.6k views
4 votes
2 answers
23
ISRO2009-20
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
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
asked Jun 14, 2016 in Digital Logic jothee 2.2k views
5 votes
2 answers
24
ISRO2009-17
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 ... 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
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
asked Jun 14, 2016 in Operating System jothee 4.3k views
3 votes
4 answers
25
ISRO2009-11
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
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
asked Jun 14, 2016 in Operating System jothee 1.6k views
4 votes
3 answers
26
ISRO2009-10
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
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
asked Jun 14, 2016 in Operating System jothee 1.8k views
3 votes
3 answers
27
ISRO2009-4
Which of the following is a MAC address? 192.166.200.50 00056A:01A01A5CCA7FF60 568, Airport Road 01:A5:BB:A7:FF:60
Which of the following is a MAC address? 192.166.200.50 00056A:01A01A5CCA7FF60 568, Airport Road 01:A5:BB:A7:FF:60
asked Jun 14, 2016 in Computer Networks jothee 2.1k views
4 votes
2 answers
28
ISRO2009-2
In networking, UTP stands for Unshielded T-connector port Unshielded twisted pair Unshielded terminating pair Unshielded transmission process
In networking, UTP stands for Unshielded T-connector port Unshielded twisted pair Unshielded terminating pair Unshielded transmission process
asked Jun 14, 2016 in Computer Networks jothee 1.2k views
6 votes
2 answers
29
ISRO2008-66, ISRO2009-15
The performance of Round Robin algorithm depends heavily on size of the process the I/O bursts of the process the CPU bursts of the process the size of the time quantum
The performance of Round Robin algorithm depends heavily on size of the process the I/O bursts of the process the CPU bursts of the process the size of the time quantum
asked Jun 13, 2016 in Operating System jothee 3.3k views
6 votes
2 answers
30
ISRO2007-16, ISRO2009-30, ISRO2014-43
The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is A B C D
The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is A B C D
asked Jun 10, 2016 in DS jothee 5.4k views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...