Register
ISRO 2017 Computer Science Questions with Solution

Recent questions tagged isro2017

1 votes
2 answers
1
isro exam december 2017
The number of elements in the power set of {{1,2},{2,1,1},{2,1,1,2}} is:
The number of elements in the power set of {{1,2},{2,1,1},{2,1,1,2}} is:
User Avatar
6 votes
3 answers
3
ISRO-2017
Q.A strictly binary tree with 10 leaves A) cannot have more than 19 nodes B) has exactly 19 nodes C)has exactly 17 nodes D) has exactly 20 nodes
Q.A strictly binary tree with 10 leavesA) cannot have more than 19 nodesB) has exactly 19 nodesC)has exactly 17 nodesD) has exactly 20 nodes
User Avatar
0 votes
1 answer
5
ISRO-2017
Let S be an NP-complete problem.Q and R are other two problems not known to be NP.Q is polynomial time reducible to S and S is polynomial time reducible to R.Which of the following statements is true ? A) R is NP-complete B) R is NP-hard C) Q is NP-complete D) Q is NP-hard
Let S be an NP-complete problem.Q and R are other two problems not known to be NP.Q is polynomial time reducible to S and S is polynomial time reducible to R.Which of the...
User Avatar
10 votes
8 answers
7
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
Which of the following data structure is useful in traversing a given graph by breadth first search?StackQueueListNone of the above
User Avatar
9 votes
4 answers
8
ISRO2017-23
What is the minimum number of two-input $\text{NAND}$ gates used to perform the function of two-input $\text{OR}$ gate? One Two Three Four
What is the minimum number of two-input $\text{NAND}$ gates used to perform the function of two-input $\text{OR}$ gate?OneTwoThreeFour
User Avatar
14 votes
3 answers
9
ISRO2017-80
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be a. $O(n\log n)$ b. $O\left( n^{3/2}\right)$ c. $O( n^3 )$ d. $O(n)$
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to bea. $O(n\log n)$b. $O\left( n^{3/2}\right)$c. $O( n^3 )...
User Avatar
5 votes
2 answers
10
ISRO2017-77
If $L$ and $P$ are two recursively enumerable languages then they are not closed under Kleene star $L^*$ of $L$ Intersection $L \cap P$ Union $L \cup P$ Set difference
If $L$ and $P$ are two recursively enumerable languages then they are not closed underKleene star $L^*$ of $L$Intersection $L \cap P$Union $L \cup P$Set difference
User Avatar
3 votes
3 answers
11
ISRO2017-74
Which of these is a super class of all errors and exceptions in the Java language? Runtime Exceptions Throwable Catchable None of the above
Which of these is a super class of all errors and exceptions in the Java language?Runtime ExceptionsThrowableCatchableNone of the above
User Avatar
7 votes
2 answers
12
ISRO2017-73
Which of the following statement is true? Hard real time OS has less jitter than soft real time OS Hard real time OS has more jitter than soft real time OS Hard real time OS has equal jitter as soft real time OS None of the above
Which of the following statement is true?Hard real time OS has less jitter than soft real time OSHard real time OS has more jitter than soft real time OSHard real time OS...
User Avatar
5 votes
1 answer
13
ISRO2017-72
The Linux command mknod myfifo b 4 16 will create a character device if user is root will create a named pipe FIFO if user is root will create a block device if user is root None of these
The Linux command mknod myfifo b 4 16will create a character device if user is rootwill create a named pipe FIFO if user is rootwill create a block device if user is root...
User Avatar
5 votes
3 answers
14
ISRO2017-70
We use malloc and calloc for: Dynamic memory allocation Static memory allocation Both dynamic memory allocation and static memory allocation None of these
We use malloc and calloc for:Dynamic memory allocationStatic memory allocationBoth dynamic memory allocation and static memory allocationNone of these
User Avatar
9 votes
3 answers
15
ISRO2017-69
Choose the equivalent prefix form of the following expression (a+(b-c))*((d-e)/(f+g-h)) *+a-bc/-de-+fgh *+a-bc-/de-+fgh *+a-bc/-ed-+fgh *+ab-c/-de-+fgh
Choose the equivalent prefix form of the following expression(a+(b-c))*((d-e)/(f+g-h))*+a-bc/-de-+fgh*+a-bc-/de-+fgh*+a-bc/-ed-+fgh*+ab-c/-de-+fgh
User Avatar
6 votes
4 answers
16
ISRO2017-68
A critical region is a piece of code which only one process executes at a time is a region prone to deadlock is a piece of code which only a finite number of processes execute is found only in windows NT operating system
A critical regionis a piece of code which only one process executes at a timeis a region prone to deadlockis a piece of code which only a finite number of processes execu...
User Avatar
6 votes
1 answer
18
ISRO2017-65
Which product metric gives the measure of the average length of words and sentence in documents? SCI number Cyclomatic complexity LOC Fog index
Which product metric gives the measure of the average length of words and sentence in documents?SCI numberCyclomatic complexityLOCFog index
User Avatar
8 votes
4 answers
19
ISRO2017-64
What is the output of the following program? #include<stdio.h> int tmp=20; main() { printf("%d", tmp); func(); printf("%d", tmp); } func() { static int tmp=10; printf("%d", tmp); } 20 10 10 20 10 20 20 20 20 10 10 10
What is the output of the following program?#include<stdio.h int tmp=20; main() { printf("%d", tmp); func(); printf("%d", tmp); } func() { static int tmp=10; printf("%d",...
User Avatar
8 votes
5 answers
21
ISRO2017-62
What will be the output of the following C code? #include <stdio.h> main() { int i; for(i=0;i<5;i++) { int i=10; printf("%d" , i); i++; } return 0; } 10 11 12 13 14 10 10 10 10 10 0 1 2 3 4 Compilation error
What will be the output of the following C code?#include <stdio.h main() { int i; for(i=0;i<5;i++) { int i=10; printf("%d" , i); i++; } return 0; }10 11 12 13 1410 10 10 ...
User Avatar
4 votes
1 answer
22
ISRO2017-61
In software maintenance tackling the changes in the hardware or software environment where the software works, is Corrective maintenance Perfective maintenance Adaptive maintenance Preventive maintenance
In software maintenance tackling the changes in the hardware or software environment where the software works, isCorrective maintenancePerfective maintenanceAdaptive main...
User Avatar
6 votes
1 answer
23
ISRO2017-59
The best data structure to check whether an arithmetic expression has balanced parenthesis is a: Queue Stack Tree List
The best data structure to check whether an arithmetic expression has balanced parenthesis is a:QueueStackTreeList
User Avatar
5 votes
3 answers
24
ISRO2017-58
Which of the following is not a life cycle model? Spiral model Prototyping model Waterfall model Capability maturity model
Which of the following is not a life cycle model?Spiral modelPrototyping modelWaterfall modelCapability maturity model
User Avatar
6 votes
3 answers
25
ISRO2017-56
Mutual exclusion problem occurs between two disjoint processes that do not interact among processes that share resources among processes that do not use the same resource between two processes that uses different resources of different machine
Mutual exclusion problem occursbetween two disjoint processes that do not interactamong processes that share resourcesamong processes that do not use the same resourcebet...
User Avatar
4 votes
2 answers
26
ISRO2017-52
Given reference to the following pages by a program 0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3 How many page faults will occur if the program has three page frames available to it and uses an optimal replacement? 7 8 9 None of the above
Given reference to the following pages by a program0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3How many page faults will occur if the program has three page frames available t...
User Avatar
15 votes
5 answers
27
ISRO2017-51
Wha is the output of the following program? main() { int a = 10; if(fork()) == 0)) a++; printf("%d\n",a); } 10 and 11 10 11 11 and 11
Wha is the output of the following program?main() { int a = 10; if(fork()) == 0)) a++; printf("%d\n",a); }10 and 11101111 and 11
User Avatar
8 votes
3 answers
28
ISRO2017-50
If the post order traversal gives ab -cd * + then the label of the nodes 1,2,3.. will be + , -, *, a,b,c,d a, -,b,+,c,*,d a,b,c,d,-,*,+ -,a,b,+,*,c,d
If the post order traversal gives ab -cd * + then the label of the nodes 1,2,3.. will be+ , -, *, a,b,c,da, -,b,+,c,*,da,b,c,d,-,*,+-,a,b,+,*,c,d
User Avatar
9 votes
5 answers
29
ISRO2017-49
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is $11$ $12$ $13$ $10$
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is$11$$12$$13$$10$
User Avatar
8 votes
2 answers
30
ISRO2017-48
What problem is solved by Dijikstra banker' algorithm? Mutual exclusion Deadlock recovery Deadlock avoidance Cache coherence
What problem is solved by Dijikstra banker' algorithm?Mutual exclusionDeadlock recoveryDeadlock avoidanceCache coherence
User Avatar
Page: