ISRO Scientist/Engineer SC Computer Science 2016 — ISRO Scientist/Engineer SC 2016 · Computer Science

Which of the following is true?

What is the sum to infinity of the series, 3 + 6x² + 9x⁴ + 12x⁶ + ..... given |x| < 1?

limₓ→₀ [√(1 + x) − √(1 − x)]/x is given by

If (G, .) is a group such that (ab)⁻¹ = a⁻¹ b⁻¹, for all a,b belongs to G, then G is a /an :

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

The maximum number of edges in a n-node undirected graph without self loops is

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

The minimum Boolean expression for the following circuit is

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

Consider the following gate network. Which one of the following gates is redundant?

The dynamic hazard problem occurs in

The logic circuit given below converts a binary code Y₁, Y₂ and Y₃ into

The circuit given below in the figure below is

If 12A7C₁₆ = X₈, then the value of X is

The Excess-3 code is also called

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

Which of the following binary number is the same as its 2's complement?

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

Consider a non-pipelined processor with a clock rate of 2.5 gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processor with five stages; but due to the internal pipeline delay, the clock speed is reduced to 2 gigahertz. Assume that there are no stalls in the pipeline. The speedup achieved in this pipelined processor is

What is 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);
}

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 number of bits required to specify a particular sector in the disk respectively

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?

Register renaming is done in pipelined processors

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;
}

Consider the following segment of C-code:

int j, n;
j = 1;
while (j <= n)
       j = j * 2;

The number of comparisons made in the execution of the loop for any n > 0 is:

The following postfix expression with single digit operands is evaluated using a stack:

8 2 3 ^ / 2 3 * + 5 1 * - 

Note that ^ is the exponentiation operator. The top two elements of the stack after the first * is evaluated are:

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

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 0thlocation)?

A full binary tree with n non-leaf nodes contains

Algorithm design technique used in quicksort algorithm is?

A FSM(finite state machine) can be considered to be a Turing machine of finite tape length ,

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

Consider the recurrence T(n) = 2T(⌊√n⌋) + 1, with T(1) = T(2) = 1. For integers n ≥ 3, which choice gives the tightest asymptotic upper bound for T(n)?

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?

If L and L̄ are recursively enumerable, then L is

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

What is the highest type number that can be assigned to the following grammar?

S → Aa
A → Ba
B → abc

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

Recursive descent parsing is an example of

A top-down parser generates

Relative mode of addressing is most relevant to writing

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

Peephole optimization is a form of

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

With a single resource, deadlock occurs

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

Determine the number of page faults when references to pages occur in the 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 1 having brought earlier than page 2.(assume LRU i.e. Least-Recently-Used algorithm is applied)

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

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:

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

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

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

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?

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

Goals for the design of the logical schema include

Given the relations

employee (name, salary, deptno) and

department (deptno, deptname, address)

Which of the following queries cannot be expressed using the basic relational algebra operations (∪, −, ×, π, σ, ρ)?

Trigger is

The order of a leaf node in a B+ tree is the maximum number of (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 and a block pointer is 6 bytes long, what is the order of the leaf node?

A clustering index is defined on the fields which are of type

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

Which one of the following is a functional requirement

Configuration management is not concerned with

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 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.50. What is the estimated effort in person-months?

In the Spiral model of software development, the primary determinant in selecting activities in each iteration is:

Bit stuffing refers to

Dynamic routing protocol enable routers to

In Ethernet CSMA/CD, the special bit sequence is transmitted by media access management to handle collision is called

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

In a token ring network the transmission speed is 107 bps and the propagation speed is 200 meters/ μs. The 1-bit delay in this network is equivalent to:

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

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

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

Frames of 1000 bits are sent over a 10 ^ 6 bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the minimum number of bits (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.

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

Consider a system with 2 level caches. Access times of Level 1 cache, Level 2 cache and main memory are 1 ns, 10ns, 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?

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

Which one of 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++.

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