InterviewSolution
Saved Bookmarks
InterviewSolution
This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your ISRO knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
G is an undirected graph with vertex set {v1, v2, v3, v4, v5, v6, v7} and edge set {v1v2, v1v3, v1v4, v2v4, v2v5, v3v4, v4v5, v4v6, v5v6, v6v7}. A breadth first search of the graph is performed with v1 as the root node. Which of the following is a tree edge ?(A) v2v4(B) v1v4(C) v4v5(D) v3v4 |
| Answer» | |
| 2. |
Convert the pre-fix expression to in-fix–* + ABC* – DE + FG (A)(A – B)*C + (D*E) – (F + G)(B)(A + B)*C – (D – E)*(F – G)(C)(A + B – C)*(D – E))*(F + G)(D)(A + B)*C – (D*E) – (F + G)(E) None |
| Answer» None | |
| 3. |
Properties of ‘DELETE’ and ‘TRUNCATE’ commands indicate that(A) After the execution of ‘TRUNCATE’ operation, COMMIT and ROLLBACK statements cannot be performed to retrieve the lost data, while ‘DELETE’ allow it.(B) After the execution of ‘DELETE’ and ‘TRUNCATE’ operation retrieval is easily possible for the lost data.(C) After the execution of ‘DELETE’ operation, COMMIT and ROLLBACK statements can be performed to retrieve the lost data, while TRUNCATE do not allow it.(D) After the execution of ‘DELETE’ and ‘TRUNCATE’ operation no retrieval is possible for the lost data. |
| Answer» | |
| 4. |
Of the following sort algorithms, which has execution time that is least dependent on initial ordering of the input ?(A) Insertion sort(B) Quick sort(C) Merge sort(D) Selection sort |
| Answer» | |
| 5. |
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 system to execute 100 instructions. (If an average, every five cycles, a bubble due to data hazard has to be introduced in the pipeline.).(A) 5(B) 4.03(C) 4.81(D) 4.17 |
| Answer» None | |
| 6. |
A given grammar is called ambiguous if(A) two or more productions have the same non-terminal on the left hand side(B) a derivation tree has more than one associated sentence(C) there is a sentence with more than one derivation tree corresponding to it(D) brackets are not present in the grammar |
| Answer» | |
| 7. |
Checksum field in TCP header is(A) ones complement of sum of header and data in bytes(B) ones complement of sum of header, data and pseudo header in 16 bit words(C) dropped from IPv6 header format(D) better than md5 or sh1 methods |
| Answer» | |
| 8. |
For the distributions given below :Which of the following is correct for the above distributions ?(A) Standard deviation of A is significantly lower than standard deviation of B(B) Standard deviation of A is slightly lower than standard deviation of B(C) Standard deviation of A is same as standard deviation of B(D) Standard deviation of A is significantly higher than standard deviation of B |
| Answer» | |
| 9. |
If x + 2y = 30, then (2y/5 + x/3) + (x/5 + 2y/3) will be equal to(A) 8(B) 16(C) 18(D) 20 |
| Answer» None | |
| 10. |
The hardware implementation which provides mutual exclusion is(A) Semaphores(B) Test and set instruction(C) Both options(D) None of the options |
| Answer» | |
| 11. |
Regression testing is primarily related to(A) Functional testing(B) Development testing(C) Data flow testing(D) Maintenance testing |
| Answer» | |
| 12. |
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 immediate operand of unsigned integer type. Maximum value of the immediate operand that can be supported by the processor is 8191. How many registers the processor has ?(A) 32(B) 64(C) 128(D) 16 |
| Answer» | |
| 13. |
What is the availability of the software with following reliability figures.Mean Time Between Failures (MTBF) is 20 daysMean Time To Repair (MTTR) is 20 hours (A) 90%(B) 96%(C) 24%(D) 50% |
| Answer» None | |
| 14. |
A stack is implemented with an array of ‘A[0…N – 1]’ and a variable ‘pos’. The push and pop operations are defined by the following code.push (x) A[pos] ← x pos ← pos – 1end pushpop ( ) pos ← pos + 1 return A[pos]end pop Which of the following will initialize an empty stack with capacity N for the above implementation ?(A) pos ← –1(B) pos ← 0(C) pos ← 1(D) pos ← N – 1 |
| Answer» | |
| 15. |
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 what condition Z will be 1 ?(A) X > Y(B) X < Y(C) X = Y(D) X! = Y |
| Answer» None | |
| 16. |
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(C) 3.0 defects per million lines of code(D) 3.4 defects per million lines of code |
| Answer» | |
| 17. |
Given thatB(a) means “a is a bear”F(a) means “a is a fish” andE(a, b) means “a eats b” Then what is the best meaning of∀x[F(x) ⇒ ∀y(E(y, x) ⇒ B(y))] (A) Every fish is eaten by some bear(B) Bears eat only fish(C) Every bear eats fish(D) Only bears eat fish |
| Answer» None | |
| 18. |
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) Difference equation of a full subtractor |
| Answer» None | |
| 19. |
Statements associated with registers of a CPU are given. Identify the false statement.(A) The program counter holds the memory address of the instruction in execution.(B) Only opcode is transferred to the control unit.(C) An instruction in the instruction register consists of the opcode and the operand.(D) The value of the program counter is incremented by 1 once its value has been readto the memory address register. |
| Answer» | |
| 20. |
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 addition is 90 ns, find time taken by each full adder to find carry.(A) 6 ns(B) 7 ns(C) 10 ns(D) 8 ns |
| Answer» None | |
| 21. |
Following declaration of an array of struct, assumes size of byte, short, int and long are 1, 2, 3 and 4 respectively. Alignment rule stipulates that n-byte field must be located at an address divisible by n. The fields in a struct are not rearranged, padding is used to ensure alignment. All elements of array should be of same size.Struct complx Short s Byte b Long l Int iEnd complxComplx C[10] Assuming C is located at an address divisible by 8, what is the total size of C, in Bytes ?(A) 150(B) 160(C) 200(D) 240 |
| Answer» None | |
| 22. |
The Master theorem(A) assumes the subproblems are unequal sizes(B) can be used if the subproblems are of equal size(C) cannot be used for divide and conquer algorithms(D) cannot be used for asymptotic complexity analysis |
| Answer» None | |
| 23. |
Which of the following affects the processing power assuming they do not influence each other.Data bus capability 1.Addressing schemeClock speed 3.(A) 3 only(B) 1 and 3 only(C) 2 and 3 only(D) 1, 2 and 3 |
| Answer» | |
| 24. |
The immediate addressing mode can be used forLoading internal registers with initial values 1.Perform arithmetic or logical operation on data contained in instructions 2.Which of the following is true ?(A) Only 1(B) Only 2(C) Both 1 and 2(D) Immediate mode refers to data in cache |
| Answer» None | |
| 25. |
If A = {x, y, z} and B = {u, v, w, x}, and the universe is {s, t, u, v, w, x, y, z}. Then (A U B’) ∩ (A ∩ B) is equal to(A) {u, v, w, x}(B) { }(C) {u, v, w, x, y, z}(D) {u, v, w}(E) None of these |
| Answer» None | |
| 26. |
What is the in-order successor of 15 in the given binary search tree ?(A) 18(B) 6(C) 17(D) 2 |
| Answer» None | |
| 27. |
The minimum height of an AVL tree with n nodes is(A) Ceil (log2 (n + 1))(B) 1.44 log2 n(C) Floor (log2 (n + 1))(D) 1.64 log2 n |
| Answer» None | |
| 28. |
A magnetic disk has 100 cylinders, each with 10 tracks of 10 sectors. If each sector contains 128 Bytes, what is the maximum capacity of the disk in kilobytes ?(A) 1,280,000(B) 1280(C) 1250(D) 128,000 |
| Answer» None | |
| 29. |
A non-pipelined CPU has 12 general purpose registers (R0, R1, R2, ….. R12). Following operation are supported:ADD Ra, Rb, Rr Add Ra to Rb and store the result in RrMUL Ra, Rb, Rr Multiply Ra to Rb and store the result in Rr MUL operations takes two clock cycles, ADD takes one clock cycle.Calculate minimum number of clock cycles required to compute the value of the expression XY + XYZ + YZ. The variables X, Y, Z are initially available in registers R0, R1 and R2 and contents of these registers must not be modified.(A) 5(B) 6(C) 7(D) 8 |
| Answer» None | |
| 30. |
Which of the following is true ?(A) Every subset of a regular set is regular(B) Every finite subset of non-regular set is regular(C) The union of two non-regular set is not regular(D) Infinite union of finite set is regular |
| Answer» | |
| 31. |
The SQL querySELECT columnsFROM TableARIGHT OUTER JOIN TableBON A.columnName = B.columnNameWHERE A.columnName IS NULL returns the following:(A) All rows in Table B, which meets equality condition above and, none from Table A, which meets the condition(B) All rows in Table A, which meets equality condition above and none from Table B, which meets the condition(C) All rows in Table B, which meets equality condition(D) All rows in Table A, which meets equality condition(E) None of these |
| Answer» | |
| 32. |
If every non-key attribute functionally dependent on the primary key, then the relation will be in(A) First normal form(B) Second normal form(C) Third normal form(D) Fourth normal form |
| Answer» | |
| 33. |
To send same bit sequence, NRZ encoding require(A) Same clock frequency as Manchester encoding(B) Half the clock frequency as Manchester encoding(C) Twice the clock frequency as Manchester encoding(D) A clock frequency which depend on number of zeros and ones in the bit sequence |
| Answer» | |
| 34. |
The persist timer is used in TCP to(A) To detect crashes from the other end of the connection(B) To enable retransmission(C) To avoid deadlock condition(D) To timeout FIN_Wait1 condition |
| Answer» | |
| 35. |
An array of 2 two byte integers is stored in big endian machine in byte address as shown below. What will be its storage pattern in little endian machine ?Address Data0 × 104 780 × 103 560 × 102 340 × 101 12 (A)0 × 104 120 × 103 560 × 102 340 × 101 78 (B)0 × 104 120 × 103 340 × 102 560 × 101 78 (C)0 × 104 560 × 103 780 × 102 120 × 101 34 (D)0 × 104 560 × 103 120 × 102 780 × 101 34 |
| Answer» None | |
| 36. |
Context free languages are closed under(A) union, intersection(B) union, kleene closure(C) intersection, complement(D) complement, kleene closure |
| Answer» | |
| 37. |
What is the output of the following ‘c’ code assuming it runs on a byte addressed little endian machine?#include <stdio.h>int main( ){int x; char *ptr;x = 622,100,101;printf("%d", (*(char *)&x) * (x % 3));return 0;}(A) 622(B) 311(C) 22(D) 110 |
| Answer» None | |
| 38. |
What is the output in a 32 bit machine with 32 bit compiler ?#include <stdio.h>rer(int **ptr2, int **ptr1){int* ii;ii = *ptr2;*ptr2 = *ptr1;*ptr1 = ii;**ptr1 *= **ptr2;**ptr2 += **ptr1;}void main( ){int var1 = 5, var2 = 10;int *ptr1 = &var1, *ptr2 = &var2;rer(&ptr1, &ptr2);printf(“%d %d “, var2, var1);}(A) 60 70(B) 50 50(C) 50 60(D) 60 50 |
| Answer» None | |
| 39. |
A new flip flop with inputs X and Y, has the following property.Which of the following expresses the next state in terms of X, Y, current state ?(A) X’Q’ + Y’Q(B) X’Q + Y’Q’(C) XQ’ + YQ(D) XQ’ + Y’Q |
| Answer» None | |
| 40. |
Consider product of three matrices M1, M2 and M3 having w rows and x columns, x rows and y columns, and y rows and z columns. Under what condition will it take less time to compute the product as (M1M2)M3 than to compute M1(M2M3) ?(A) Always take the same time(B) (1/x + 1/z) < (1/w + 1/y)(C) x > y(D) (w + x) > (y + z) |
| Answer» None | |
| 41. |
Which of the following is an efficient method of cache updating ?(A) Snoopy writes(B) Write through(C) Write within(D) Buffered write |
| Answer» | |
| 42. |
In a columnar transposition cipher, the plain text is “the tomato is a plant in the night shade family”, keyword is “TOMATO”.The cipher text is(A) “TINESAX / EOAHTFX / HTLTHEY / MAIIAIX / TAPNGDL / OSTNHMX”(B) “TINESAX / EOAHTFX / MAIIAIX / HTLTHEY / TAPNGDL / OSTNHMX”(C) “TINESAX / EOAHTFX / HTLTHEY / MAIIAIX / OSTNHMX / TAPNGDL”(D) “EOAHTFX / TINESAX / HTLTHEY / MAIIAIX / TAPNGDL / OSTNHMX” |
| Answer» None | |
| 43. |
Avalanche effect in cryptography refers(A) Large changes in cipher text when the keyword is changed minimally(B) Large changes in cipher text when the plain text is changed(C) Large impact of keyword change to length of the cipher text(D) None of the above |
| Answer» | |