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. |
Which of these is not a feature of WAP 2.0(A) Push and Pull Model(B) Interface to a storage device(C) Multimedia messaging(D) Hashing |
| Answer» | |
| 2. |
Let X be the adjacency matrix of a graph G with no self loops. The entries along the principal diagonal of X are(A) all zeros(B) all ones(C) both zeros and ones(D) different |
| Answer» | |
| 3. |
Which of the following RAID level provides the highest Data Transfer Rate (Read/Write)(A) RAID 1(B) RAID 3(C) RAID 4(D) RAID 5 |
| Answer» | |
| 4. |
Which of the following is correct with respect to Two phase commit protocol?(A) Ensures serializability(B) Prevents Deadlock(C) Detects Deadlock(D) Recover from Deadlock |
| Answer» | |
| 5. |
The Fibonacci sequence is the sequence of integers(A) 1, 3, 5, 7, 9, 11, 13(B) 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55(C) 0, 1, 3, 4, 7, 11, 18, 29, 47(D) 0, 1, 3, 7, 15 |
| Answer» None | |
| 6. |
Selection sort algorithm design technique is an example of(A) Greedy method(B) Divide-and-conquer(C) Dynamic Programming(D) Backtracking |
| Answer» | |
| 7. |
By using an eight bit optical encoder the degree of resolution that can be obtained is (approximately)(A) 1.8o(B) 3.4o(C) 2.8o(D) 1.4o |
| Answer» | |
| 8. |
The principal of the locality of reference justifies the use of(A) virtual memory(B) interrupts(C) main memory(D) cache memory |
| Answer» | |
| 9. |
Consider the following pseudo-codex:=1;i:=1;while (x <= 1000)begin x:=2^x; i:=i+1;end;What is the value of i at the end of the pseudo-code?(A) 4(B) 5(C) 6(D) 7 |
| Answer» None | |
| 10. |
Round Robin schedule is essentially the pre-emptive version of(A) FIFO(B) Shortest job first(C) Shortest remaining time(D) Longest remaining time |
| Answer» | |
| 11. |
The number of digit 1 present in the binary representation of3 × 512 + 7 × 64 + 5 × 8 + 3(A) 8(B) 9(C) 10(D) 12 |
| Answer» None | |
| 12. |
Assume that each character code consists of 8 bits. The number of characters that can be transmitted per second through an synchronous serial line at 2400 baud rate, and with two stop bits is(A) 109(B) 216(C) 300(D) 219 |
| Answer» | |
| 13. |
If the bandwidth of a signal is 5 kHz and the lowest frequency is 52 kHz, what is the highest frequency(A) 5 kHz(B) 10 kHz(C) 47 kHz(D) 57 kHz |
| Answer» | |
| 14. |
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) A(B) B(C) C(D) D |
| Answer» | |
| 15. |
Phase transition for each bit are used in(A) Amplitude modulation(B) Carrier modulation(C) Manchester encoding(D) NRZ encoding |
| Answer» | |
| 16. |
An Ethernet hub(A) functions as a repeater(B) connects to a digital PBX(C) connects to a token-ring network(D) functions as a gateway |
| Answer» | |
| 17. |
Study the following program://precondition: x>=0public void demo(int x){System.out.print(x % 10);if (x % 10 != 0){demo(x/10);}System.out.print(x%10);}Which of the following is printed as a result of the call demo(1234)?(A) 1441(B) 3443(C) 12344321(D) 43211234 |
| Answer» | |
| 18. |
Bit stuffing refers to(A) inserting a 0 in user stream to differentiate it with a flag(B) inserting a 0 in flag stream to avoid ambiguity(C) appending a nipple to the flag sequence(D) appending a nipple to the use data stream |
| Answer» | |
| 19. |
BCNF is not used for cases where a relation has(A) Two (or more) candidate keys(B) Two candidate keys and composite(C) The candidate key overlap(D) Two mutually exclusive foreign keys |
| Answer» | |
| 20. |
In the Big-Endian system, the computer stores(A) MSB of data in the lowest memory address of data unit(B) LSB of data in the lowest memory address of data unit(C) MSB of data in the highest memory address of data unit(D) LSB of data in the highest memory address of data uni |
| Answer» | |
| 21. |
On a system using non-preemptive scheduling, processes with expected run times of 5, 18, 9 and 12 are in the ready queue. In what order should they be run to minimize wait time?(A) 5, 12, 9, 18(B) 5, 9, 12, 18(C) 12, 18, 9, 5(D) 9, 12, 18, 5 |
| Answer» | |
| 22. |
Consider a computer system that stores a floating-point numbers with 16-bit mantissa and an 8-bit exponent, each in two’s complement. The smallest and largest positive values which can be stored are(A) 1 × 10 -128and 215× 1015(B) 1 × 10 -256and 215× 10255(C) 1 × 10 -128and 215× 10127(D) 1 × 10 -128and 215– 1 × 10127 |
| Answer» | |
| 23. |
Consider a job scheduling problem with 4 jobs J1, J2, J3, J4 and with corresponding deadlines: ( d1, d2, d3, d4) = (4, 2, 4, 2). Which of the following is not a feasible schedule without violating any job schedule?(A) J2, J4, J1, J3(B) J4, J1, J2, J3(C) J4, J2, J1, J3(D) J4, J2, J3, J1 |
| Answer» | |
| 24. |
Range of IP Address from 224.0.0.0 to 239.255.255.255 are(A) Reserved for loopback(B) Reserved for broadcast(C) Used for multicast packets(D) Reserved for future addressing |
| Answer» | |
| 25. |
IEEE 802.11 is standard for(A) Ethernet(B) Bluetooth(C) Broadband Wireless(D) Wireless LANs |
| Answer» | |
| 26. |
Djikstra’s algorithm is used to(A) Create LSAs(B) Flood an internet with information(C) Calculate the routing tables(D) Create a link state database |
| Answer» | |
| 27. |
When a host on network A sends a message to a host on network B, which address does the router look at?(A) Port(B) IP(C) Physical(D) Subnet mask |
| Answer» | |
| 28. |
Which of the following models used for software reliability(A) Waterfall(B) Musa(C) COCOMO(D) Rayleigh |
| Answer» | |
| 29. |
In UML diagram of a class(A) state of object cannot be represented(B) state is irrelevant(C) state is represented as an attribute(D) state is represented as a result of an operation |
| Answer» | |
| 30. |
A physical DFD specifies(A) what processes will be used(B) who generates data and who processes it(C) what each person in an organization does(D) which data will be generated |
| Answer» | |
| 31. |
Which of the following is not an approach to Software Process Assessment?(A) SPICE(ISO/IEC15504)(B) Standard CMMI Assessment Method for process improvement(C) . ISO 9001:2000(D) IEEE 2000:2001 |
| Answer» | |
| 32. |
Silly Window Syndrome is related to(A) Error during transmission(B) File transfer protocol(C) Degrade in TCP performance(D) Interface problem |
| Answer» | |
| 33. |
SSL is not responsible for(A) Mutual authentication of client & server(B) Secret communication(C) Data Integrity protection(D) Error detection and correction |
| Answer» | |
| 34. |
A rule in a limited entry decision table is a(A) row of the table consisting of condition entries(B) row of the table consisting of action entries(C) column of the table consisting of condition entries and corresponding action entries(D) columns of the table consisting of conditions of the stub |
| Answer» | |
| 35. |
Hashed message is signed by a sender using(A) his public key(B) his private key(C) receiver’s public key(D) receiver’s private key |
| Answer» | |
| 36. |
The standard for certificates used on internet is(A) X.25(B) X.301(C) X.409(D) X.509 |
| Answer» | |
| 37. |
A program consists of two modules executed sequentially. Let f1(t) and f2(t)respectively denote the probability density functions of time taken to execute the two modules. The probability density function of the overall time taken to execute the program is given by(A) f1(t) + f2(t)(B) ∫t0f1(x), f2(x) dx(C) ∫t0f1(x), f2(t – x) dx(D) max (f1(t), f2(t)) |
| Answer» | |
| 38. |
The number of page frames that must be allocated to a running process in a virtual memory environment is determined by(A) the instruction set architecture(B) page size(C) number of processes in memory(D) physical memory size |
| Answer» | |