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. |
Peephole optimization is form of(A) Loop optimization(B) Local optimization(C) Constant folding(D) Data flow analysis |
| Answer» | |
| 2. |
Access time of the symbolic table will be logarithmic if it is implemented by(A) Linear list(B) Search tree(C) Hash table(D) Self organization list |
| Answer» | |
| 3. |
What will be output of the following program? Assume that you are running this program in little-endian processor.#include<stdio.h>int main() {short a = 320;char * ptr;ptr = (char * ) & a;printf("%d", * ptr);return 0;}(A) 1(B) 320(C) 64(D) Compilation error |
| Answer» | |
| 4. |
The following postfix expression with single digit operands is evaluated using a stack:8 2 3 ^ / 2 3 * + 5 1 * –Note that ^ is the exponentiation operator. The top two elements of the stack after the first * is evaluated are(A) 6,1(B) 5,7(C) 3,2(D) 1,5 |
| Answer» | |
| 5. |
Consider the following segment of C-code:int j, n;j = 1;while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any n > 0 is:(A) |_ log 2n _| * n(B) n(C) |_ log2n _|(D) |_ log2n _| + 1 |
| Answer» | |
| 6. |
Working Set at an instant of time is(A) the set of future references that the OS will make(B) the set of future references that the OS will make in next unit of time(C) the set of references with high frequency(D) the set of pages that have been referenced in the last time units |
| Answer» | |
| 7. |
A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128 page table entries and is 4-way set associative. The minimum size of the TLB tag is:(A) 11 bits(B) 13 bits(C) 15 bits(D) 20 bits |
| Answer» | |
| 8. |
For the real time operating system, which of the following is the most suitable scheduling scheme?(A) Round robin(B) Pre-emptive(C) First come first serve(D) Random scheduling |
| Answer» | |
| 9. |
In which one of the following page replacement policies, Belady’s anomalymay occur?(A) FIFO(B) Optimal(C) LRU(D) MRU |
| Answer» | |
| 10. |
A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have 20000 lines of code. The company needs to determine the effort in person-months needed to develop this software using the basic COCOMO model. The multiplicative factor for this model is given as 2.2 for the software development on embedded systems, while the exponentiation factor is given as 1.50. What is the estimated effort in person-months?(A) 196.77(B) 206.56(C) 199.56(D) 210.68 |
| Answer» | |
| 11. |
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 nibble to the flag sequence(D) appending a nibble to the use data stream |
| Answer» | |
| 12. |
The extent to which the s/w can continue to operate correctly despite the introduction of invalid inputs is called as(A) Reliability(B) Robustness(C) Fault tolerance(D) Portability |
| Answer» | |
| 13. |
Configuration management is not concerned with(A) controlling changes to the source code(B) choice of hardware configuration for an application(C) controllling documentation changes(D) maintaining versions of software |
| Answer» | |
| 14. |
Which one of the following is a functional requirement(A) Maintainability(B) Portability(C) Robustness(D) None of the mentioned |
| Answer» | |
| 15. |
A company needs to develop a strategy for software product development for which it has a choice of two programming languages L1 and L2. The number of lines of code (LOC) developed using L2 is estimated to be twice the LOC developed with Ll. The product will have to be maintained for five years. Various parameters for the company are given in the table below.ParameterLanguage L1Language L2Man years needed for developmentLOC/10000LOC/10000Development cost per man yearRs. 10,00,000Rs. 7,50,000Maintenance time5 years5 yearsCost of maintenance per yearRs. 1,00,000Rs. 50,000Total cost of the project includes cost of development and maintenance. What is the LOC for L1 for which the cost of the project using L1 is equal to the cost of the project using L2?(A) 10,000(B) 5,000(C) 7,500(D) 75,000 |
| Answer» | |
| 16. |
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then(A) Deadlock can never occur(B) Deadlock may occur(C) Deadlock has to occur(D) None of these |
| Answer» | |
| 17. |
A Hash Function f is defined as f(key) = key mod 7. With linear probing, while inserting the keys 37, 38, 72, 48, 98, 11, 56 into a table indexed from 0, in which location the key 11 will be stored (Count table index 0 as 0thlocation)?(A) 3(B) 4(C) 5(D) 6 |
| Answer» | |
| 18. |
A clustering index is defined on the fields which are of type(A) non-key and ordering(B) non-key and non-ordering(C) key and ordering(D) key and non-ordering |
| Answer» | |
| 19. |
The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node?(A) 63(B) 64(C) 67(D) 68 |
| Answer» | |
| 20. |
What is the output of this C code?#includevoid main(){int k=5;int *p=&k;int **m=&p;printf("%d %d %d",k,*p,**m);}(A) 5 5 5(B) 5 5 junk(C) 5 junk junk(D) Compile time error |
| Answer» | |
| 21. |
At a particular time of computation the value of a counting semaphore is 7. Then 20 P operations and xV operations were completed on this semaphore. If the new value of semaphore is 5 ,x will be(A) 18(B) 22(C) 15(D) 13 |
| Answer» | |