ISRO 2014 Computer Science Questions with Solution

# Recent questions tagged isro2013 1
Suppose we have variable logical records of lengths of 55 bytes, 1010 bytes and 2525 bytes while the physical block size in disk is 1515 bytes. What is the maximum and minimum fragmentation seen in bytes? 2525 and 55 1515 and 55 1515 and 00 1010 and 5 what is ... haven't mentioned that we have 2 blocks. All those who is supporting answer D uses 2 blocks. Some please give the concrete solution.
2
In graphics, the number of vanishing points depends on The number of axes cut by the projection plane The center of projection The number of axes which are parallel to the projection plane The perspective projections of any set of parallel lines that are not parallel to the projection plane
3
The built-in base class in java, which is used to handle all exceptions is Raise Exception Error Throwable
1 vote
4
Which of the following is not provided as a service in cloud computing? Infrastructure as a service Architecture as a service Software as a service Platform as a service
5
The binary equivalent of the decimal number $42.75$ is $101010 . 110$ $100110 . 101$ $101010 . 101$ $100110 . 110$
6
The number of edges in a 'n' vertex complete graph is? $n ^{*} (n - 1) / 2$ $n^{2}$ $n ^{*} (n + 1) / 2$ $n ^{*} (n + 1)$
7
What is the right way to declare a copy constructor of a class if the name of the class is MyClass? MyClass (constant MyClass * arg) MyClass (constant MyClass & arg) MyClass (MyClass arg) MyClass (MyClass * arg)
8
The number of elements in the power set of the set {{A, B}, C} is $7$ $8$ $3$ $4$
9
What are the final states of the DFA generated from the following NFA? $q_{0}, q_{1}, q_{2}$ $[q_{0}, q_{1}], [q_{0}, q_{2}], [ ]$ $q_{0}, [q_{1}, q_{2}]$ $[q_{0}, q_{1}], q_{2}$
10
How many diagonals can be drawn by joining the angular points of an octagon? $14$ $20$ $21$ $28$
11
Let $P(E)$ denote the probability of the occurrence of event $E$. If $P(A)= 0.5$ and $P(B)=1$ then the values of $P(A|B)$ and $P(B|A)$ respectively are $0.5, 0.25$ $0.25, 0.5$ $0.5, 1$ $1, 0.5$
12
Which of the following strategy is employed for overcoming the priority inversion problem? Temporarily raise the priority of lower priority level process Have a fixed priority level scheme. Implement Kernel pre-emption scheme. Allow lower priority process to complete its job.
13
If a program $P$ calls two subprograms $P1$ and $P2$ and $P1$ can fail $50$% of the time and $P2$ can fail $40$% of the time, what is the failure rate of program $P$? $50$% $60$% $70$% $10$%
14
Which of the following testing methods uses fault simulation technique? Unit testing Beta testing Stress testing Mutation testing
15
Which of the following types of coupling has the weakest coupling? Pathological coupling Control coupling Data coupling Message coupling
16
What is the cyclomatic complexity of a module which has seventeen edges and thirteen nodes? $4$ $5$ $6$ $7$
17
Consider the list of page references in the time line as below: 9 6 2 3 4 4 4 4 3 4 4 2 5 8 6 8 5 5 3 2 3 3 9 6 2 7 What is the working set at the penultimate page reference if &#8710; is 5? {8, 5, 3, 2, 9, 6} {4, 3, 6, 2, 5} {3, 9, 6, 2, 7} {3, 9, 6, 2}
18
What is the output of the following program? Class Test { public static void main (String [] args) { int x = 0; int y = 0 for (int z = 0; z < 5; z++) { if((++x >2)||(++y > 2)) { x++; } } System.out.printIn (x+ "" + y); } } 8 2 8 5 8 3 5 3
19
Consider the following $C$ code. #include <stdio.h> #include <math.h> void main () { double pi = 3.1415926535; int a = 1; int i; for (i=0; i < 3; i++) if (a = cos(pi * i/2)) printf("% d", 1); else printf("%d", 0); } What would the program print? $000$ $010$ $101$ $111$
20
A particular parallel program computation requires $100$ seconds when executed on a single CPU. If $20$% of this computation is strictly sequential, then theoretically the best possible elapsed times for this program running on $2$ CPUs and $4$ CPUs respectively are $55$ and $45$ seconds $80$ and $20$ seconds $75$ and $25$ seconds $60$ and $40$ seconds
21
Embedded pointer provides A secondary access path A physical record key An inverted index A primary key
22
The state of a process after it encounters an $I/O$ instruction is? Ready Blocked Idle Running
23
A starvation free job scheduling policy guarantees that no job indefinitely waits for a service. Which of the following job scheduling policies is starvation free? Priority queing Shortest job first Youngest job first Round robin
24
Consider the following process and resource requirement of each process. Predict the state of this system, assuming that there are a total of $5$ instances of resource type $1$ and $4$ instances of resource type $2$. Can go to safe or unsafe state based on sequence Safe state Unsafe state Deadlock state
25
Which of the following is not a necessary condition for deadlock? Mutual exclusion Reentrancy Hold and wait No pre-emption
26
In a $64$- bit machine, with $2$ GB RAM, and $8$ KB page size, how many entries will be there in the page table if its is inverted? $2^{18}$ $2^{20}$ $2^{33}$ $2^{51}$
27
Consider a logical address space of $8$ pages of $1024$ words each, mapped onto a physical memory of $32$ frames. How many bits are there in the physical address and logical address respectively? $5, 3$ $10, 10$ $15, 13$ $15, 15$
A CPU scheduling algorithm determines an order for the execution of its scheduled processes. Given 'n' processes to be scheduled on one processor, how many possible different schedules are there? $n$ $n^{2}$ $n!$ $2^{n}$
Suppose we have variable logical records of lengths of $5$ bytes, $10$ bytes and $25$ bytes while the physical block size in disk is $15$ bytes. What is the maximum and minimum fragmentation seen in bytes? $25$ and $5$ $15$ and $5$ $15$ and $0$ $10$ and $5$