ISRO 2017 Computer Science Questions with Solution

# Recent questions tagged isro2017 1 vote
1
The number of elements in the power set of {{1,2},{2,1,1},{2,1,1,2}} is:
2
Let G be a grammar in CFG and Let W1 and W2 is element of G such that |w1| = |w2| then which of the following is true? A. Any derivation of W1 has exactly the same number of steps as any derivation of W2 B. Different derivation have different length C.Some derivation of W1 may be shorter that derivation of W2 D. None of the options
3
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
4
Consider the code segment int i,j,x,y,m,n; n=20; for(i=0;i<n;i++) { for(j=0;j<n;j++) { if(i%2) { x+=((4*j)+5*i); y+=(7+4*j); } } } m=x+y; Which one of the following is false ? A) The code contains loop invariant computation B) There is scope of common sub-expression elimination in this code C)There is scope of strength reduction in this code D)There is scope of dead code elimination in this code
5
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
1 vote
6
Q.Consider the following query : Select E.no,COUNT(*) FROM Employee E GROUP BY E.no If an index on eno is available,the query can be answered by scanning only the index if A) the index is only hash and clustered B) the index is only B+ tree and clustered C)index can be hash or B+ tree and clustered or non-clustered D)index can be hash or B+ tree and clustered
7
Hi All, Pls share ur marks as per official key in ISRO 2017.
8
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
9
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
10
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)$
11
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
12
Which of these is a super class of all errors and exceptions in the Java language? Runtime Exceptions Throwable Catchable None of the above
13
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
14
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
15
We use malloc and calloc for: Dynamic memory allocation Static memory allocation Both dynamic memory allocation and static memory allocation None of these
16
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
17
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
18
Consider the disk system with 100 cylinders. The request to access the cylinders occur in the following sequence. 4, 37, 10,7,19,73,2,15,6,20 Assuming the head is currently at cylinder 50 what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek ime first algorithm is used. 95 ms 119 ms 233 ms 276 ms
19
Which product metric gives the measure of the average length of words and sentence in documents? SCI number Cyclomatic complexity LOC Fog index
20
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
21
What does the following program do when the input is unsigned 16 bit integer? #include<stdio.h> main(){ unsigned int num; int i; scanf("%u", &num); for(i=0;i<16;i++){ printf("%d", (num<<i&1<<15)?1:0); } } It prints all even bits from num It prints all odd bits from num It prints binary equivalent of num None of above
22
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
23
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
24
The best data structure to check whether an arithmetic expression has balanced parenthesis is a: Queue Stack Tree List
25
Which of the following is not a life cycle model? Spiral model Prototyping model Waterfall model Capability maturity model
26
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
27
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