Skip to content

Category Archives: ISRO

Following Multiplexer circuit is equivalent to (A) Sum equation of full adder (B) Carry equation of full adder (C) Borrow equation for full subtractor (D)… Read More
In a 8-bit ripple carry adder using identical full adders, each full adder takes 34 ns for computing sum. If the time taken for 8-bit… Read More
Consider a 32-bit processor which supports 70 instructions. Each instruction is 32 bit long and has 4 fields namely opcode, two register identifiers and an… Read More
Consider a 5-segment pipeline with a clock cycle time 20 ns in each sub operation. Find out the approximate speed-up ratio between pipelined and non-pipelined… Read More
What is the defect rate for Six sigma ? (A) 1.0 defect per million lines of code (B) 1.4 defects per million lines of code… Read More
What is the availability of the software with following reliability figures. Mean Time Between Failures (MTBF) is 20 days Mean Time To Repair (MTTR) is… Read More
The following circuit compares two 2-bit binary numbers, X and Y represented by X1X0 and Y1Y0 respectively. (X0 and Y0 represent Least Significant Bits) Under… Read More
Of the following sort algorithms, which has execution time that is least dependent on initial ordering of the input ? (A) Insertion sort (B) Quick… Read More
Regression testing is primarily related to (A) Functional testing (B) Development testing (C) Data flow testing (D) Maintenance testing Answer: (A) Explanation: Major Functional Testing… Read More
Consider the following C program #include main() { float sum = 0.0, j =1.0, i = 2.0; while(i/j > 0.001) { j = j +… Read More
Let P be a procedure that for some inputs calls itself (i.e. is recursive). If P is guaranteed to terminate, which of the following statement(s)… Read More
In multi-programmed systems, it is advantageous if some programs such as editors and compilers can be shared by several users. Which of the following must… Read More
The time complexity of computing the transitive closure of binary relation on a set of n elements is known to be (A) O(n) (B) O(n… Read More
Let us assume that transaction T1 has arrived before transaction T2. Consider the schedule S=r1(A); r2(B) ; w2(A); w1(B) Which of the following is true?… Read More
The set of attributes X will be fully functionally dependent on the set of attributes Y if the following conditions are satisfied. (A) X is… Read More

Start Your Coding Journey Now!