ISRO Scientist Examination December 2017 for Computer Science & Engineering

# Recent questions tagged isrodec2017

1
Consider the following $C$ function #include<stdio.h> int main(void) { char c[]="ICRBCSIT17" char *p=c; printf("%s",c+2[p]-6[p]-1); return 0; } The output of the program is $\text{SI}$ $\text{IT}$ $\text{T1}$ $17$
2
Consider the results of a medical experiment that aims to predict whether someone is going to develop myopia based on some physical measurements and heredity. In this case, the input dataset consists of the person's medical characteristics and the target variable is ... develop myopia and $0$ for those who aren't. This can be best classified as Regression Decision Tree Clustering Association Rules
3
Which of the following related to snowflake schema is true? Each dimension is represented by a single dimensional table Maintenance efforts are less Dimension tables are normalized It is not an extension of star schema
4
Consider the following : A. Condition Coverage p. Black box testing B. Equivalence Class partitioning q. System testing C. Volume Testing r. White box testing D. Beta Testing s. Performance testing Matching $A, B, C, D$ in the same order gives, r,p,s,q p,r,q,s s,r,q,p q,r,s,p
5
Consider the function int func(int num) { int count=0; while(num) { count++; num>>=1; } return(count); } For $func(435)$ the value returned is $9$ $8$ $0$ $10$
6
We consider the addition of two ${2}'s$ compliment numbers $b_{n-1}b_{n-2}\ldots b_{0}$ and $a_{n-1}a_{n-2}\ldots a_{0}$. A binary adder for adding two unsigned binary numbers is used to add two binary numbers.The sum is denoted by $c_{n-1}c_{n-2}\ldots c_{0}$ ... $c_{out}\oplus c_{n-1}$ $a_{n-1}\oplus b_{n-1}\oplus c_{n-1}$
1 vote
7
Which of the following set of components is sufficient to implement any arbitrary Boolean function? $XOR$ gates, $NOT$ gates $AND$ gates, $XOR$ gates and $1$ $2$ to $1$ multiplexer Three input gates that output $(A.B)+C$ for the inputs $A, B, C$
8
A $32$-$bit$ adder is formed by cascading $4$-$bit$ CLA adder.The gate delays (latency) for getting the sum bits is $16$ $18$ $17$ $19$
9
Consider the function int fun(x: integer) { If x>100 then fun=x-10; else fun=fun(fun(x+11)); } For the input $x=95$, the function will return $89$ $90$ $91$ $92$
10
In $\text{IEEE}$ floating point representation, the hexadecimal number $\text{0xC0000000}$ corresponds to $-3.0$ $-1.0$ $-4.0$ $-2.0$
11
Which one of the following are essential features of object-oriented language? A. Abstraction and encapsulation B. Strictly-typed C. Type-safe property coupled with sub-type rule D. Polymorphism in the presence of inheritance $A$ and $B$ only $A,D$ and $B$ only $A$ and $D$ only $A,C$ and $D$ only
12
Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes? In deadlock prevention, the request for resources is always granted if resulting state is safe. In deadlock avoidance, the request for resources ... is safe. Deadlock avoidance requires knowledge of resource requirements a priori. Deadlock prevention is more restrictive than deadlock avoidance.
13
Consider a disk sequence with $100$ cylinders. The request to access the cylinder occur in the following sequence : $4,34,10,7,19,73,2,15,6,20$ Assuming that the head is currently at cylinder $50$, what is the time taken to satisfy all requests if it takes $2\,ms$ to move from one cylinder to adjacent one and shortest seek time first policy is used? $190$ $238$ $233$ $276$
1 vote
14
Consider the following table: A. Activation record p. Linking loader B. Location counter q. Garbage collection C. Reference counts r. Subroutine call D. Address relocation s. Assembler ... $A, B, C, D$ in the same order gives : $p,q,r,s$ $q,r,s,p$ $r,s,q,p$ $r,s,p,q$
1 vote
15
Which languages necessarily need heap allocation in the runtime environment? Those that support recursion Those that use dynamic scoping Those that use global variables Those that allow dynamic data structures
16
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? The code contains loop invariant computation There is scope of common sub-expression elimination in this code There is scope of strength reduction in this code There is scope of dead code elimination in this code
17
A counting semaphore was initialized t o $7$. Then $\text{20 P (wait)}$ operations and$\text{x V (signal)}$ operations were completed on this semaphore. If the final value of semaphore is $5$, then the value $x$ will be $0$ $13$ $18$ $5$
18
Consider the following scheduling: A. Gang scheduling s. Guaranteed scheduling B. Rate monotonic scheduling t. Thread scheduling C. Fair share scheduling u. Real-time scheduling Matching the table in the order $A,B,C$ gives t,u,s s,t,u u,s,t u,t,s
19
Which of the following is false? User level threads are not scheduled by the kernel. Context switching between user-level threads is faster than context switching between kernel-level threads. When a user thread is blocked all other threads of its processes are blocked. Kernel-level threads cannot utilize multiprocessor systems by splitting threads on different processors or cores.
20
A process executes the following code for(i=0;i<n;i++) fork(); The total number of child processes created is $n^2$ $2^{n+1}-1$ $2^n$ $2^{n}-1$
1 vote
21
Consider three $CPU$ intensive processes, which require $10,20,30$ units and arrive at times $0,2,6$ respectively. How many context switches are needed if shortest remaining time first is implemented? Context switch at $0$ is included but context switch at end is ignored $1$ $2$ $3$ $4$
22
A system uses $FIFO$ policy for page replacement.It has $4$ page frames with no pages loaded, to begin with.The system first accesses $50$ distinct pages in some order and then accesses the same $50$ pages in reverse order.How many page faults will occur? $96$ $100$ $97$ $92$
1 vote
23
A priority queue is implemented as a $Max$-$heap.$Initially, it has $5$ elements. The level order traversal of the heap is $10,8,5,3,2.$ Two new elements $1$ and $7$ are inserted into the heap in that order. The level order traversal of the heap after the insertion of the elements is $10,8,7,5,3,2,1$ $10,8,7,2,3,1,5$ $10,8,7,1,2,3,5$ $10,8,7,3,2,1,5$
1 vote
24
The minimum number of stacks needed to implement a queue is $3$ $1$ $2$ $4$
25
A strictly binary tree with $10$ leaves cannot have more than $19$ nodes has exactly $19$ nodes has exactly $17$ nodes has exactly $20$ nodes
26
Which one of the following property is correct for a red-black tree? Every simple path from anode to a descendant leaf contains the same number of black nodes. If a node is red, then one children is red and another is black. If a node is red, then both its children are red. Every leaf node (sentinel node) is red.
27
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary tree is $\text{e d b g f c a}$ $\text{e d b f g c a }$ $\text{d e b f g c a}$ $\text{d e f g b c a}$
A virtual memory system uses $FIFO$ page replacement policy and allocates a fixed number of frames to the process. Consider the following statements M: Increasing the number of page frames allocated to a process sometimes increases the page fault rate. N: Some programs do not exhibit locality of reference. ... $M$. Both $M$ and $N$ are false. $M$ is false, but $N$ is true.
Suppose the numbers $7,5,1,8,3,6,0,9,4,2$ are inserted in that order into an initially empty binary search tree.The binary search tree uses the reversal ordering on natural numbers i.e. $9$ is assumed to be smallest and $0$ is assumed to be largest. The $in$-$order$ ... $0,1,2,3,4,5,6,7,8,9$ $0,2,4,3,1,6,5,9,8,7$ $9,8,7,6,5,4,3,2,1,0$
The characters of the string $\text{K R P C S N Y T J M}$ are inserted into a hash table of the size of size $10$ using a hash function $h(x)=(ord(x)-ord(A)+1)$ $mod$ $10$ If linear probing is used to resolve collisions, then the following insertion causes the collision $Y$ $C$ $M$ $P$