# Category Archives: ISRO

Consider the following C function: int f(int n) { static int i = 1; if(n >= 5) return n; n = n+i; i++; return f(n);… Read More
Consider the following Assembly language program MVIA 30 H ACI 30 H XRA A POP H After the execution of the above program, the contents… Read More
Relative to the program translated by a compiler, the same program when interpreted runs (A) Faster (B) Slower (C) At the same speed (D) May… Read More
An interrupt in which the external device supplies its address as well as the interrupt requests is known as (A) vectored interrupt (B) maskable interrupt… Read More
Embedded pointer provides (A) A secondary access path (B) A physical record key (C) An inverted index (D) A primary key Answer: (A) Explanation: Quiz… Read More
If a square matrix A satisfies AT = I, then the matrix, A is (A) Idempotent (B) Symmetric (C) Orthogonal (D) Hermitian Answer: (C) Explanation:… Read More
The join operation can be defined as (A) a cartesian product of two relations followed by a selection (B) a cartesian product of two relations… Read More
The network 198.78.41.0 is a (A) Class A network (B) Class B network (C) Class C network (D) Class D network Answer: (C) Explanation: In… Read More
The maximum number of edges in a n-node undirected graph without self loops is (A) n2 (B) n * (n-1)/2 (C) n – 1 (D)… Read More
The number of distinct simple graphs with up to three nodes is (A) 15 (B) 10 (C) 7 (D) 9 Answer: (C) Explanation: The number… Read More
Which of the following is not a valid rule of XOR? (A) 0 XOR 0 = 0 (B) 1 XOR 1 = 1 (C) 1… Read More
The output Y of the given circuit (A) 1 (B) 0 (C) X (D) X’ Answer: (B) Explanation: The above function is implemented using XOR… Read More
The logic operations of two combinational circuits in Figure-I and Figure-II are (A) entirely different (B) identical (C) complementary (D) dual Answer: (A) Explanation: The… Read More
In the expression A'(A’ + B’) by writing the first term A as A + 0, the expression is best simplified as (A) A +… Read More
The Boolean expression ( A + C’)(B’+ C’) simplifies to (A) C’ + AB’ (B) C’ (A’ + B) (C) B’C’ + AB’ (D) None… Read More