ISRO Scientist or Engineer Computer Science 2016

All rights reserved. No part of this publication may be reproduced, distributed, or transmitted in any
form or by any means, electronic, mechanical, photocopying, recording or otherwise, or stored in any
retrieval system of any nature without the permission of cracku.in, application for which shall be made
to [email protected]

Downloaded from cracku.in

 Computer Science
Instructions
For the following questions answer them individually

Question 1

Which of the followingis true?

A 3+ 7= 10

B 3+ 7≤ 10

C 3+ 7< 10

D 3+ 7> 10
Answer: D

Question 2

What is the sum to infinity of the series,

3 + 6x2 + 9x4 + 12x6 +........given ∣ x < 1 ?

3
A 1+x2

3
B (1+x2 )2

3
C (1−x2 )2

3
D (1−x2 )

Answer: C

Question 3
1+x− 1−x
limx→o x is given by

A 0

B -1

C 1

1
D 2

Answer: C

Question 4
a
If (G, -) is a group such that (ab)−1 = a −1 b−1 , ∀a, b ∈ G then G is an

A Commutative semi group

B Abelian group

C Non-abelian group

D None of these

Downloaded from cracku.in

 Answer: B

Question 5

A given connected graph G is a Euler Graphif and only if all vertices of G are of

A Same degree

B Even degree

C Odd degree

D Different degree

Answer: B

Question 6

Maximum number of edges in a n—node undirected graph withoutself-loops is

A n2
n(n−1)
B 2

C n-1

n(n+1)
D 2

Answer: B

Question 7

The mimmum number of NAND gates required to implement the Boolean function ˉ + AB
A + AB ˉ C is equal to

A 0

B 1

C 4

D 7

Answer: A

Question 8

The minimum Boolean expression for the following circuit is

A AB+AC+BC

Downloaded from cracku.in

B A+BC

C A+B

D A+B+C

Answer: A

Question 9

For a binary half-subtractor having two inputs A and B, the correct set of logical expression for the outputs D (= A minus B) and X =
borrow) are

A D = AB + AB, X = AB

B D = AB + AB, X = AB

C D = AB + AB, X = AB

D D = AB + AB, X = AB
Answer: C

Question 10

Consider the following gate network

Which one of the following gates is redundant?

A Gate No. 1

B Gate No. 2

C Gate No. 3

D Gate No. 4

Answer: B

Question 11

The dynamic hazard problem occurs in

A Combinational circuit alone

B Sequential Circuit only

C Both (a) and (b)

D None of the above

Answer: C

Downloaded from cracku.in

Question 12

The logic circuit given below converts a binary code y1 , y2 , y3 into

A Excess-3 code

B Gray code

C BCD code

D Hamming Code

Answer: B

Question 13

The circuit shown in the below figure is

A An oscillating circuit and its output is square wave

B The one whose output remains stable in ‘1’ state

C The one having output remainsstable in ‘0’ state

D Has single pulse of three times propagation delay

Answer: A

Question 14

If 12A7C16 = X8 then the value of X is

A 224174

B 425174

C 6173

D 225174

Answer: D

Downloaded from cracku.in

Question 15

The Excess-3 Code is also called

A Cyclic Redundancy Code

B Weighted Code

C Self-Complementing Code

D Algebraic Code

Answer: C

Question 16

The simplified Sum of Product form of the following Boolean expression (P + Q + R)(P + Q + R)(P + Q + R)

A (P Q + R)

B (P + QR)

C (P Q + R)

D (P Q + R)
Answer: B

Question 17

Which of the following binary numberis the sameas its 2’s complement?

A 1010

B 0101

C 1000

D 1001

Answer: C

Question 18

The functional difference between SRflip-flop and JK flip-flop is that

A JK flip-flop is faster than SRflip-flop

B JK flip-flop has a feedback path

C JK flip-flop accepts both inputs 1

D None of the above

Answer: C

Question 19

Which of the following binary numberis the sameas its 2’s complement?

A 1010

Downloaded from cracku.in

B 0101

C 1000

D 1001

Answer: A

Question 20

Whatis the output of this C code?

#include <stdio.h>
void main()
{
int k = 5;
int *p = &k;
int **m = &p;
printf("%d %d %d\n", k, *p, **m);
}

A 555

B 5 5 junk

C § junk junk

D Compile time error

Answer: A

Question 21

Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stored in a bit serial
fashion in a sector. The capacity of the disk pack and the numberofbits required to specify a particular sector in the disk respectively

A 256 MB,19 bits

B 256 MB, 28 bits

C 512 MB, 20 bits

D 64 GB, 28 bits

Answer: A

Question 22

Let the page fault service time be 10 ms in a computer with average memory access time being 20 ns. If one page fault is generated
for every 106 memory accesses, what is the effective access time for the memory?

A 21.4ns

B 29.9ns

C 23.5 ns

D 35.1ns

Answer: B

Question 23

Register renaming is done in pipelined processors

Downloaded from cracku.in

A As an alternative to register allocation at compile time

B For efficient access to function parameters and local variables

C To eliminate certain kind of hazards

D As part of address translations

Answer: C

Question 24

In which class of Flynn’s taxonomy, Von Neumann architecture belongs to?

A SISD

B SIMD

C MIMD

D MISD

Answer: A

Question 25

What will be output of following program? Assume that you are running this program in little-endian processor.
#include<stdio.h>
int main() {
short a = 320;
char *ptr;
ptr = (char *)&a;
printf("%d"_,*ptr);
return 0;
}

A 1

B 320

C 64

D Compilation Error

Answer: C

Question 26

Consider the following segment of C code

int j, n;
j =1;
while (j ≤ n)
j=j*2;
The number of comparisons madein the execution of the loop for any n > 0 is

A [log2 n] ∗ n

B n

C [log2 n]

Downloaded from cracku.in

D [log2 n] + 1
Answer: D

Question 27

The following postfix expression with single digit operands is evaluated using a stack
823^/23* 5 1*-
(Note that ^ is the exponential operator)
The top two elements of the stack after the first * operator is evaluated are

A 6,1

B 5,7

C 3,2

D 1,5

Answer: A

Question 28

Average number of comparison required for a successful search for sequential search on ‘n’ items is

n
A 2

(n−1)
B 2

(n+1)
C 2

D None of the above

Answer: C

Question 29

A Hash Function f is defined as f(key) = key mod 7. With linear probing, while inserting the keys 37, 38, 72, 48, 98, 11, 56 into a table
indexed from 0, in which location the key 11 will be stored (count table Index 0 as 0th location )?

A 3

B 4

C 5

D 6

Answer: C

Question 30

A complete binary tree with n non-leaf nodes contains

A log2 n nodes

B n+1 nodes

C 2n nodes

D 2n+1 nodes

Downloaded from cracku.in

 Answer: D

Question 31

Algorithm design technique used in quick sort algorithm is

A Dynamic programming

B Backtracking

C Divide and Conquer

D Greedy Method

Answer: C

Question 32

An FSM (Finite State Machine) can be considered to be a Turning Machineof finite tape length

A Without rewinding capability and unidirectional tape movement

B Rewinding capability and unidirectional tape movement

C Without rewinding capability and bidirectional tape movemen

D Rewinding capability and bidirectional tape movement

Answer: A

Question 33

Let L = {ωϵ(0 + 1) ∗ ∣ ω} has even number of 1s, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular
expression below represents L?

A (0*10*1)*

B 0*(10*10*)*

C 0*(10*1*)*0*

D 0*1(10*1)*10*

Answer: B

Question 34

Consider the following recurrence

T (n) = 2T ( n) + 1
T (1) = 1
Which of the following is true?

A T (n) = O(log log n)

B T (n) = O(log n)

C T (n) = O( n)

D T (n) = O(n)
Answer: A

Downloaded from cracku.in

Question 35

Consider the following statements about the context-free grammar:

G = {S → SS, S → ab, S → ba, S → ∧}
I. G is ambiguous
II. G produces all strings with equal number of a’s and b’s
III.G can be accepted by a deterministic PDA
Which combinations below expresses all the true statements about G?

A I only

B I and III only

C II and III only

D I, II and III

Answer: D

Question 36

If L and L are recursively enumerable , then L is

A Regular

B Context-free

C Context-sensitive

D Recursive

Answer: D

Question 37

S → aSa∣bSb∣a∣b
The language generated by the above grammar over the alphabets { a, b } is the set of

A All palindromes

B All odd length palindromes

C Strings that begin and end with same symbol

D All even length palindromes

Answer: B

Question 38

What is the highest type number that can be assigned to this following grammar : S → Aa, A → Ba, B → abc

A Type 0

B Type l

C Type 2

D Type 3

Answer: C

Downloaded from cracku.in

Question 39

Access time of the symbol table will be logarithmic, if it is implemented by

A Linearlist

B Search Tree

C Hash Table

D Self-organization list

Answer: B

Question 40

Recursive descent parsing is an example of

A Top-down parsers

B Bottom-up parsers

C Predictive parsers

D None of these

Answer: B

Question 41

A top-down parser generates

A Rightmost derivation

B Rightmost derivation in reverse

C Leftmost derivation

D Leftmost derivation in reverse

Answer: C

Question 42

Relative mode of addressing is most relevant to writing

A Co-routines

B Position-independent code

C Sharable code

D Interrupt Handlers

Answer: B

Question 43

A simple two-pass assembler does which of the following in the first pass?

A Checksto seeif the instructions are legal in the current assembly mode

B It allocates spacefor the literals

Downloaded from cracku.in

C It builds the symboltable for the symbols and their values

D Allof these

Answer: D

Question 44

Peephole optimization is a form of

A Loop optimization

B Local optimization

C Constant folding

D Data flow analysi

Answer: B

Question 45

At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operation and x V operations were completed
on this semaphore. If the final value of the semaphore is 5, x will be

A 18

B 22

C 15

D 13

Answer: A

Question 46

With single resource, deadlock occurs

A If there are more than two processor competing for that resource

B If there are only two processes competing for that resource

C If there is a single process competing for that resource

D None of these

Answer: D

Question 47

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then

A Deadlock can never occur

B Deadlock may occur

C Deadlock has to occur

D None of these

Answer: A

Downloaded from cracku.in

Question 48

Determine the numberof page faults whenreferences to pages occur in the following order: 1, 2, 4, 5, 2, 1, 2, 4 Assume that the main
memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page one having brought earlier than
page 2. (LRU page replacement algorithm is used)

A 3

B 5

C 4

D None of these

Answer: C

Question 49

Working Set (t, k) at an instant of time t is

A The set of k future references that the Operating System (OS) will make

B The set of future references that the OS will make in next t unit of time

C The set of k references with high frequency

D The k set of pages that have been referenced in the last t time units

Answer: D

Question 50

A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can
hold a total of 128 page table entries and is
4-way set associative. The minimum size of the TLB tag is

A 11 bits

B 13 bits

C 15 bits

D 20 bits

Answer: C

Question 51

The real-time operating system, which of the following is the most suitable scheduling scheme?

A Round robin

B First come first serve

C Pre-emptive

D Random scheduling

Answer: C

Question 52

In which one of the following page replacementpolicies, Balady’s anomaly may occur?

Downloaded from cracku.in

A FIFO

B Optimal

C LRU

D MRU

Answer: A

Question 53

Consider Join of a relation R with a relation S. If R has m tuples and S has n tuples, then maximum and minimum sizes of the Join
respectively are

A m+n and 0

B mn and 0

C m+n and ∣m−n∣

D mn and m+n

Answer: B

Question 54

Let R(a, b,c)and S(d,e, f) be two relations in which d is the foreign key of S that refers to the primary key of R Consider the following
four operations in R and S
I.Insert into R
II.Insert into S
III.Deletion from R
IV.Deletion from S
Which of the following can cause violation of the relational integrity constraint above?

A Both I and IV

B Both II and III

C All of these

D None of these

Answer: B

Question 55

The relation book (title, price) contains the titles and prices of different books. Assuming that no two books have the same price,
what does the following SQL query list?
[select title from book as B where (select count(*) from book as T where T.price > B.price) < 5]

A Titles of the four most expensive books

B Title of the fifth most inexpensive book

C Title of the fifth most expensive book

D Titles of the five most expensive books

Answer: D

Downloaded from cracku.in

Question 56

Goals for the design of the logical schemainclude

A Avoiding data inconsistency

B Being able to construct queries easil

C Being able to access data efficiently

D All of these

Answer: D

Question 57

Given the relations employee (name, salary, deptno) and department (depino, deptname, address)
Which of the following queries cannot be expressed using the basic relational algebra operations (U, −, x, π, σ, p)

A Department address of every employee

B Employees whose nameis the same as their department name

C The sum of all employees’ salaries

D All employees of a given department

Answer: C

Question 58

Trigger is

A Statement that enables to start any DBMS

B Statement that is executed by the user when debugging an application program

C The condition that the system tests for the validity of the database user

D Statement that is executed automatically by the system as a side effect of a modification to the database

Answer: D

Question 59

The orderofa leaf node in a B+ tree is the maximum numberof (value, data record pointer) pairs it can hold. Given that the block size is
1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long andablock pointeris 6 bytes long, what is the orderofthe
leaf node?

A 63

B 64

C 67

D 68

Answer: B

Question 60

A clustering index is defined on thefields which are of type

Downloaded from cracku.in

A Non-key and ordering

B Non-key and non-ordering

C Key and ordering

D Key and non-ordering

Answer: A

Question 61

The Extent to which the software can continue to operate correctly despite the introduction of invalid inputs is called as

A Reality

B Robustness

C Fault tolerance

D Portability

Answer: B

Question 62

Which one of the following is a functional requirement?

A Maintainability

B Portability

C Robustness

D None of the mentioned

Answer: D

Question 63

Configuration managementis not concerned with

A Controlling changes to the source code

B Choice of hardware configuration for an application

C Controlling documentation changes

D Maintaining versions of software

Answer: B

Downloaded from cracku.in

Question 64

A company needs to develop a strategy for software product development for which it has a choice of two programming languages L1
and L2. The number of lines of code (LOC) developed using L2 is estimated to be twice the LOC developed with L1. The product will
have to be maintained for five years. Various parameters for the company are given in the table below.

Total cost of the project includes cost of development and maintenance. What is the LOC for L1 for which the cost of the project
using L1 is equal to the cost of the project using L2 ?

A 10,000

B 5,000

C 7,500

D 75,000

Answer: B

Question 65

A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have
20000 lines of code. The company needs to
determine the effort in person-months needed to develop this software using the basic COCOMO model. The multiplicative factor for
this model is given as 2.2 for the software development on embedded systems, while the exponentiation factor is given as 1.5. What
is the estimated effort in person-months?

A 196.77

B 206.56

C 199.56

D 210.68

Answer: A

Question 66

In the spiral model of software development, the primary determinantin selecting activities in each iteration is

A Iteration size

B Cost

C Adopted process such as Rational Unified Process or Extreme Programming

D Risk

Answer: D

Question 67

Bit stuffing refers to

Downloaded from cracku.in

A Inserting a ‘0’ in user stream to differentiate it with a flag

B Inserting a ‘0’ in flag stream to avoid ambiguity

C Appending a nibble to the flag sequence

D Appending a nibble to the user data stream

Answer: A

Question 68

Dynamic routing protocol enable routers to:

A Dynamically discover and maintain routes

B Distribute routing updates to other routers

C Reach agreementwith other routers about the network topology

D All of the above

Answer: D

Question 69
CSM A
In Ethernet CD , the special bit sequenee is transmitted by media access managementto handle collision is called

A Preamble

B Postamble

C Jam

D None of these

Answer: C

Question 70

Which network protocol Allows hosts to dynamically get a unique IP number on each bootup?

A DHCP

B BOOTP

C RARP

D ARP

Answer: A

Question 71
m
In a token ring network, the transmission speed is 107 bps and the propagation speed is 200 μs . Then 1 bit delay in this network is
equivalent to

A 500m of cable

B 200 m of cable

C 20 m of cable

Downloaded from cracku.in

D 50m of cable

Answer: C

Question 72

The address of a class B hostis to be split into subnets with a 6-bit subnet number. What is the maximum numberof subnets and the
maximum numberofhosts in each subnet?

A 62 subnets and 262142 hosts

B 64 subnets and 262142 hosts

C 62 subnets and 1022 hosts

D 64 subnets and 1024 hosts

Answer: C

Question 73

The message 11001001is to be transmitted using the CRC polynomial x3 +1 to protect it from errors. The message that should be
transmitted is

A 11001001000

B 11001001011

C 11001010

D 110010010011

Answer: B

Question 74

What is the maximum size of data that application layer can pass on to the TCP layer below?

A Any size

B (216 bytes -the size of TCP header)

C 216 bytes

D 1500 bytes

Answer: A

Question 75

Framesof 1000 bits are sent over a 106 }bps duplex link between two hosts. The propagation time is 25 ms. Frames are to be
transmitted into this link to maximally pack them in transit (within the link).What is the minimum numberofbits (i) that will be required
to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.

A i=2

B i=3

C i=4

D i=5

Answer: D

Downloaded from cracku.in

Question 76

Which of the following is TRUE only for XML, but not for HTML?

A It is derived from SGML

B ‘It describes content and layout

C It allows user defined tags

D _Itis restricted only to be used with web browsers

Answer: C

Question 77

Consider a system with 2 level caches. Access times of Level 1 cache, Level 2 cache and main memory are 1 ns, 10 ns, and 500 ns,
respectively. The hit rates of Level 1 and Level 2 caches are 0.8 and 0.9, respectively. What is the average access time of the system
ignoring the search time within the cache?

A 13.0 ns

B 12.8 ns

C 12.6 ns

D 12.4 ns

Answer: C

Question 78

If a class C is derived from class B, which is derived from class A, all through public inheritance, then a class C memberfunction can
access

A Only protected and public data of C and B

B Only protected and public data of C

C All data of C and private data of A and B

D Public and protected data of A and B andall data of C

Answer: D

Question 79

Which oneof the following is correct about the statements given below?
I, All function calls are resolved at compile-time in C language.
II. All function calls are resolved at compile-time in C++.

A Only II is correct

B Both I and II are correct

C Only I is correct

D Both I and II are incorrect

Answer: D

Downloaded from cracku.in

Question 80

When a DNS server accepts and uses incorrect information from a host that has no authority giving that information, then it is called

A DNS lookup

B DNS hijacking

C DNS spoofing

D None of the mentioned

Answer: C

Downloaded from cracku.in