Register

Search results for isro2017

35 votes
6 answers
3
GATE CSE 1994 | Question: 1.4, ISRO2017-2
Let $A$ and $B$ be any two arbitrary events, then, which one of the following is TRUE? $P (A \cap B) = P(A)P(B)$ $P (A \cup B) = P(A)+P(B)$ $P (A \mid B) = P(A \cap B)P(B)$ $P (A \cup B) \leq P(A) + P(B)$
Let $A$ and $B$ be any two arbitrary events, then, which one of the following is TRUE?$P (A \cap B) = P(A)P(B)$$P (A \cup B) = P(A)+P(B)$$P (A \mid B) = P(A \cap B)P(B)$$...
User Avatar
9 votes
4 answers
5
ISRO2017-24
When two $n$-bit binary numbers are added the sum will contain at the most $n$ bits $n + 2$ bits $n + 3$ bits $n + 1$ bits
When two $n$-bit binary numbers are added the sum will contain at the most$n$ bits$n + 2$ bits$n + 3$ bits$n + 1$ bits
User Avatar
15 votes
5 answers
6
ISRO2017-51
Wha is the output of the following program? main() { int a = 10; if(fork()) == 0)) a++; printf("%d\n",a); } 10 and 11 10 11 11 and 11
Wha is the output of the following program?main() { int a = 10; if(fork()) == 0)) a++; printf("%d\n",a); }10 and 11101111 and 11
User Avatar
66 votes
8 answers
7
GATE IT 2005 | Question: 23, ISRO2017-67
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are $5$ $4$ $3$ $2$
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes tha...
User Avatar
8 votes
3 answers
8
ISRO2017-3
Using Newton-Raphson method, a root correct to 3 decimal places of $x^3 - 3x -5 = 0$ 2.222 2.275 2.279 None of the above
Using Newton-Raphson method, a root correct to 3 decimal places of $x^3 - 3x -5 = 0$2.2222.2752.279None of the above
User Avatar
10 votes
3 answers
10
ISRO2017-21
A cache memory needs an access time of $30$ ns and main memory $150$ ns, what is average access time of CPU (assume hit ratio $= 80\%)?$ $60$ ns $30$ ns $150$ ns $70$ ns
A cache memory needs an access time of $30$ ns and main memory $150$ ns, what is average access time of CPU (assume hit ratio $= 80\%)?$$60$ ns$30$ ns$150$ ns$70$ ns
User Avatar
6 votes
1 answer
11
ISRO2017-59
The best data structure to check whether an arithmetic expression has balanced parenthesis is a: Queue Stack Tree List
The best data structure to check whether an arithmetic expression has balanced parenthesis is a:QueueStackTreeList
User Avatar
4 votes
3 answers
12
ISRO2017-26
Advantage of synchronous sequential circuits over asynchronous one is : Lower hardware requirement Better noise immunity Faster operation All of the above
Advantage of synchronous sequential circuits over asynchronous one is :Lower hardware requirementBetter noise immunityFaster operationAll of the above
User Avatar
5 votes
4 answers
13
ISRO2017-44
Which of the following is associated with objects? State Behavior Identity All of the above
Which of the following is associated with objects?StateBehaviorIdentityAll of the above
User Avatar
6 votes
3 answers
14
ISRO2017-8
Which symbol denote derived attributes in ER Model? Double ellipse Dashed ellipse Squared ellipse Ellipse with attribute name underlined
Which symbol denote derived attributes in ER Model?Double ellipseDashed ellipseSquared ellipseEllipse with attribute name underlined
User Avatar
11 votes
3 answers
15
ISRO2017-1
If $\text{A}$ is a skew symmetric matrix then $\text{A}^t$ is Diagonal matrix $\text{A}$ $0$ $-\text{A}$
If $\text{A}$ is a skew symmetric matrix then $\text{A}^t$ isDiagonal matrix $\text{A}$$0$$-\text{A}$
User Avatar
5 votes
3 answers
17
ISRO2017-70
We use malloc and calloc for: Dynamic memory allocation Static memory allocation Both dynamic memory allocation and static memory allocation None of these
We use malloc and calloc for:Dynamic memory allocationStatic memory allocationBoth dynamic memory allocation and static memory allocationNone of these
User Avatar
10 votes
8 answers
19
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
Which of the following data structure is useful in traversing a given graph by breadth first search?StackQueueListNone of the above
User Avatar
9 votes
2 answers
20
ISRO2017-7
... Employee, Department from Overtime_allowance) natural join (select Department, OT_allowance from Overtime_allowance) as T); $16$ $4$ $8$ None of the above
$\begin{array}{|l|l|l|l|l|} \hline \textbf{Employee} & \textbf{Department} & \textbf{OT_allowance} \\ \hline \text{RAMA} & \text{Mechanical} & \text{5000} \\\hline \text{...
User Avatar
Page: