ISRO CS 2018

Question 1
The difference between a named pipe and a regular file in Unix is that
Cross
Unlike a regular file, named pipe is a special file
Cross
The data in a pipe is transient, unlike the content of a regular file
Tick
Pipes forbid random accessing, while regular files do allow this.
Cross
All of the above


Question 2
A class of 30 students occupy a classroom containing 5 rows of seats, with 8 seats in each row. If the students seat themselves at random, the probability that the sixth seat in the fifth row will be empty is
Cross
1/5
Cross
1/3
Tick
1/4
Cross
2/5


Question 2-Explanation: 
There are 5 rows with 8 seats in each row. So, there are total 40 seats If sixth seat in the fifth row is empty then 30 students have 39 choices of seats So, ways to choose from given choices = 39C30 But, total ways to choose = 40C30 Probability = 39C30 / 40C30 Probability = 1/4 Option (C) is correct.
Question 3
The domain of the function log( log sin(x) ) is
Cross
0 < x < π
Cross
2nπ < x < (2n + 1) π , for n in N
Tick
Empty set
Cross
None of the above


Question 3-Explanation: 
log (log sin (x))-1 <= sinx <= +1log a is defined by the positive values ​​of a, log sin (x) defined sin (x) = (0,1] Possible values ​​for log sin (x) = (−∞, 0] Log domain (log sin (x)) = Unspecified. Therefore, option (C) is correct.
Question 4
The following paradigm can be used to find the solution of the problem in minimum time: Given a set of non-negative integer, and a value K, determine if there is a subset of the given set with sum equal to K:
Cross
Divide and Conquer
Tick
Dynamic Programming
Cross
Greedy Algorithm
Cross
Branch and Bound


Question 4-Explanation: 
Given problem is Subset-sum problem in which a set of non-negative integers, and a value sum is given, to determine if there is a subset of the given set with sum equal to given sum. With recursion technique, time complexity of the above problem is exponential. We can solve the problem in Pseudo-polynomial time using Dynamic programming. Refer: Subset Sum Problem Option (B) is correct
Question 5
( G, *) is an abelian group. Then
Cross
x = x -1, for any x belonging to G
Cross
x = x2, for any x belonging to G
Tick
(x * y )2 = x2 * y2, for any x, y belonging to G
Cross
G is of finite order


Question 6
Consider the following C code segment:
#include 
main()
{
    int i, j , x ;
    scanf("%d", &x);
    i = 1 ; j = 1;
    while ( i< 10 ) {
          j = j * i;
          i = i + 1;
          if (i == x) break ;
          }
 }
For the program fragment above, which of the following statements about the variables i and j must be true after execution of this program? [!(exclamation) sign denotes factorial in the answer]
Cross
( j = (x - 1 )! ) ∧ (i >= x)
Cross
( j = 9!) ∧ (i =10)
Cross
(( j = 10!) ∧ (i = 10 )) V (( j = (x - 1)!) ∧ (i = x ))
Tick
(( j = 9!) ∧ (i = 10)) V (( j = (x - 1)!) ∧ (i = x ))


Question 7
A computer uses ternary system instead of the traditional binary system. An n bit string in the binary system will occupy
Cross
3 + n ternary digits
Cross
2n / 3 ternary digits
Cross
n(log23) ternary digits
Tick
n(log32 ) ternary digits


Question 8
Which of the following is application of Breath First Search on the graph?
Cross
Finding diameter of the graph
Cross
Finding bipartite graph
Tick
Both (a) and (b)
Cross
None of the above


Question 8-Explanation: 
BFS is used to Find the diameter of the graph and to test whether a graph is bipartite or not. BFS has many other applications also. Refer: Applications of Breadth First Traversal Option (C) is correct.
Question 9
Micro program is
Cross
the name of a source program in micro computers
Tick
set of micro instructions that defines the individual operations in response to a machine-language instruction
Cross
a primitive form of macros used in assembly language programming
Cross
a very small segment of machine code


Question 10
Given two sorted list of size m and n respectively. The number of comparisons needed the worst case by the merge sort algorithm will be
Cross
m x n
Cross
maximum of m and n
Cross
minimum of m and n
Tick
m + n - 1


Question 10-Explanation: 
To merge two lists of size m and n, we need to do m+n-1 comparisons in worst case. Since we need to merge 2 at a time, the optimal strategy would be to take smallest size lists first. The reason for picking smallest two items is to carry minimum items for repetition in merging. So, option (D) is correct.
There are 81 questions to complete.

  • Last Updated : 02 Jun, 2021

Share your thoughts in the comments
Similar Reads