Recent questions tagged isro2013

3 votes

0 answers

1

ISRO-2013-52 - Need clarfication
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 ... mentioned that we have 2 blocks. All those who is supporting answer D uses 2 blocks. Some please give the concrete solution.

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.

asked Nov 25, 2016 in Operating System cse7 628 views

4 votes

2 answers

2

ISRO-2013-80
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

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

asked Jun 5, 2016 in Computer Graphics makhdoom ghaya 3k views

3 votes

1 answer

3

ISRO-2013-79
The built-in base class in java, which is used to handle all exceptions is Raise Exception Error Throwable

The built-in base class in java, which is used to handle all exceptions is Raise Exception Error Throwable

asked Jun 5, 2016 in Java makhdoom ghaya 2.7k views

1 vote

1 answer

4

ISRO-2013-78
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

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

asked Jun 5, 2016 in Cloud Computing makhdoom ghaya 2.6k views

5 votes

2 answers

5

ISRO-2013-77
The binary equivalent of the decimal number $42.75$ is $101010 . 110$ $100110 . 101$ $101010 . 101$ $100110 . 110$

The binary equivalent of the decimal number $42.75$ is $101010 . 110$ $100110 . 101$ $101010 . 101$ $100110 . 110$

asked May 13, 2016 in Digital Logic makhdoom ghaya 2.1k views

4 votes

1 answer

6

ISRO-2013-76
The number of edges in a 'n' vertex complete graph is? $n ^{*} (n - 1) / 2$ $n^{2}$ $n ^{*} (n + 1) / 2$ $n ^{*} (n + 1)$

The number of edges in a 'n' vertex complete graph is? $n ^{*} (n - 1) / 2$ $n^{2}$ $n ^{*} (n + 1) / 2$ $n ^{*} (n + 1)$

asked May 13, 2016 in Graph Theory makhdoom ghaya 1.7k views

4 votes

2 answers

7

ISRO-2013-75
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)

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)

asked May 13, 2016 in Object Oriented Programming makhdoom ghaya 2.9k views

6 votes

2 answers

8

ISRO-2013-74
The number of elements in the power set of the set {{A, B}, C} is $7$ $8$ $3$ $4$

The number of elements in the power set of the set {{A, B}, C} is $7$ $8$ $3$ $4$

asked May 13, 2016 in Set Theory & Algebra makhdoom ghaya 2k views

6 votes

1 answer

9

ISRO-2013-73
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}$

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}$

asked May 13, 2016 in Theory of Computation makhdoom ghaya 3.3k views

8 votes

6 answers

10

ISRO-2013-72
How many diagonals can be drawn by joining the angular points of an octagon? $14$ $20$ $21$ $28$

How many diagonals can be drawn by joining the angular points of an octagon? $14$ $20$ $21$ $28$

asked May 13, 2016 in Quantitative Aptitude makhdoom ghaya 3.5k views

5 votes

1 answer

11

ISRO-2013-71
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$

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$

asked May 13, 2016 in Probability makhdoom ghaya 3k views

5 votes

7 answers

12

ISRO-2013-70
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.

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.

asked May 13, 2016 in Operating System makhdoom ghaya 3.2k views

7 votes

2 answers

13

ISRO-2013-69, UGCNET-Dec2012-III: 62
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$%

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$%

asked May 12, 2016 in IS&Software Engineering makhdoom ghaya 7.8k views

2 votes

3 answers

14

ISRO-2013-68
Which of the following testing methods uses fault simulation technique? Unit testing Beta testing Stress testing Mutation testing

Which of the following testing methods uses fault simulation technique? Unit testing Beta testing Stress testing Mutation testing

asked May 12, 2016 in IS&Software Engineering makhdoom ghaya 3.7k views

3 votes

1 answer

15

ISRO-2013-67
Which of the following types of coupling has the weakest coupling? Pathological coupling Control coupling Data coupling Message coupling

Which of the following types of coupling has the weakest coupling? Pathological coupling Control coupling Data coupling Message coupling

asked May 12, 2016 in IS&Software Engineering makhdoom ghaya 3k views

5 votes

1 answer

16

ISRO-2013-66
What is the cyclomatic complexity of a module which has seventeen edges and thirteen nodes? $4$ $5$ $6$ $7$

What is the cyclomatic complexity of a module which has seventeen edges and thirteen nodes? $4$ $5$ $6$ $7$

asked May 12, 2016 in IS&Software Engineering makhdoom ghaya 3.3k views

8 votes

9 answers

17

ISRO-2013-65
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 ∆ is 5? {8, 5, 3, 2, 9, 6} {4, 3, 6, 2, 5} {3, 9, 6, 2, 7} {3, 9, 6, 2}

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 ∆ is 5? {8, 5, 3, 2, 9, 6} {4, 3, 6, 2, 5} {3, 9, 6, 2, 7} {3, 9, 6, 2}

asked May 12, 2016 in Operating System makhdoom ghaya 5.7k views

3 votes

1 answer

18

ISRO-2013-64
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

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

asked May 5, 2016 in Java makhdoom ghaya 2.2k views

7 votes

4 answers

19

ISRO-2013-63
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$

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$

asked May 5, 2016 in Programming makhdoom ghaya 3.3k views

4 votes

2 answers

20

ISRO-2013-62
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

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

asked May 5, 2016 in Operating System makhdoom ghaya 3.1k views

7 votes

5 answers

21

ISRO-2013-61, ISRO2008-35
Embedded pointer provides A secondary access path A physical record key An inverted index A primary key

Embedded pointer provides A secondary access path A physical record key An inverted index A primary key

asked May 2, 2016 in Databases makhdoom ghaya 4.8k views

2 votes

5 answers

22

ISRO-2013-60
The state of a process after it encounters an $I/O$ instruction is? Ready Blocked Idle Running

The state of a process after it encounters an $I/O$ instruction is? Ready Blocked Idle Running

asked May 2, 2016 in Operating System makhdoom ghaya 3.4k views

5 votes

2 answers

23

ISRO-2013-59
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

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

asked May 2, 2016 in Operating System makhdoom ghaya 2.4k views

9 votes

7 answers

24

ISRO-2013-58
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

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

asked May 2, 2016 in Operating System makhdoom ghaya 3.7k views

6 votes

4 answers

25

ISRO-2013-57
Which of the following is not a necessary condition for deadlock? Mutual exclusion Reentrancy Hold and wait No pre-emption

Which of the following is not a necessary condition for deadlock? Mutual exclusion Reentrancy Hold and wait No pre-emption

asked May 2, 2016 in Operating System makhdoom ghaya 2.2k views

6 votes

2 answers

26

ISRO-2013-56
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}$

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}$

asked May 2, 2016 in Operating System makhdoom ghaya 3.3k views

3 votes

1 answer

27

ISRO2013-55
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$

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$

asked May 2, 2016 in Operating System makhdoom ghaya 11.6k views

3 votes

6 answers

28

ISRO-2013-54
Which of the following are the likely causes of thrashing? Page size was very small. There are too many users connected to the system. Least recently used policy is used for page replacement. First in First out policy is used for page replacement.

Which of the following are the likely causes of thrashing? Page size was very small. There are too many users connected to the system. Least recently used policy is used for page replacement. First in First out policy is used for page replacement.

asked May 2, 2016 in Operating System makhdoom ghaya 4.5k views

2 votes

2 answers

29

ISRO-2013-53
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}$

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}$

asked May 2, 2016 in Combinatory makhdoom ghaya 3.5k views

3 votes

4 answers

30

ISRO-2013-52
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$

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$

asked May 2, 2016 in Operating System makhdoom ghaya 4k views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Subjects

Network Sites

Recent questions tagged isro2013

Log In

Register

Recent Posts

Subjects

Recent Blog Comments

Network Sites

Recent questions tagged isro2013