Recent questions tagged isro2016

6 votes

1 answer

61

GATE CSE 2011 | Question: 5, ISRO2016-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 lines of code (LOC) developed using L2 is estimated to be twice of the LOC developed with L1. The ... which of the cost of the project using L1 is equal to the cost of the project using L2? 4000 5000 4333 4667

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 lines of code (LOC) de...

7.7k views

go_editor asked Sep 29, 2014

46 votes

3 answers

62

GATE CSE 2006 | Question: 62, ISRO2016-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: $\text{11 bits}$ $\text{13 bits}$ $\text{15 bits}$ $\text{20 bits}$

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 en...

25.9k views

Rucha Shelke asked Sep 26, 2014

58 votes

7 answers

63

GATE CSE 2006 | Question: 51, ISRO2016-34
Consider the following recurrence: $ T(n)=2T\left ( \sqrt{n}\right )+1,$ $T(1)=1$ Which one of the following is true? $ T(n)=\Theta (\log\log n)$ $ T(n)=\Theta (\log n)$ $ T(n)=\Theta (\sqrt{n})$ $ T(n)=\Theta (n)$

Consider the following recurrence:$ T(n)=2T\left ( \sqrt{n}\right )+1,$ $T(1)=1$Which one of the following is true?$ T(n)=\Theta (\log\log n)$$ T(n)=\Theta (\log n)$$ T(n...

28.6k views

Rucha Shelke asked Sep 26, 2014

38 votes

1 answer

64

GATE CSE 1999 | Question: 1.18, ISRO2016-53
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are $m+n$ and $0$ $mn$ and $0$ $m+n$ and $|m-n|$ $mn$ and $m+n$

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

17.0k views

Kathleen asked Sep 23, 2014

70 votes

5 answers

65

GATE CSE 2005 | Question: 77, ISRO2016-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 ... books Title of the fifth most inexpensive book Title of the fifth most expensive book Titles of the five most expensive books

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...

30.7k views

Kathleen asked Sep 22, 2014

126 votes

18 answers

66

GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$

Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into ...

48.9k views

Kathleen asked Sep 22, 2014

34 votes

7 answers

67

GATE CSE 2009 | Question: 12, ISRO2016-37
$S \to aSa \mid bSb\mid a\mid b$ The language generated by the above grammar over the alphabet $\{a,b\}$ is the set of: all palindromes all odd length palindromes strings that begin and end with the same symbol all even length palindromes

$$S \to aSa \mid bSb\mid a\mid b$$The language generated by the above grammar over the alphabet $\{a,b\}$ is the set of:all palindromesall odd length palindromesstrings t...

20.5k views

Kathleen asked Sep 22, 2014

20 votes

5 answers

68

GATE CSE 2009 | Question: 9, ISRO2016-52
In which one of the following page replacement policies, Belady's anomaly may occur? FIFO Optimal LRU MRU

In which one of the following page replacement policies, Belady's anomaly may occur?FIFOOptimalLRUMRU

8.6k views

Kathleen asked Sep 22, 2014

27 votes

4 answers

69

GATE CSE 2007 | Question: 68, ISRO2016-73
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is: $11001001000$ $11001001011$ $11001010$ $110010010011$

The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is:$11001001000$$110010010...

34.1k views

Kathleen asked Sep 21, 2014

60 votes

13 answers

70

GATE CSE 2007 | Question: 67, ISRO2016-72
The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet? $62$ subnets and $262142$ hosts. $64$ subnets and $262142$ hosts. $62$ subnets and $1022$ hosts. $64$ subnets and $1024$ hosts.

The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of ...

35.9k views

Kathleen asked Sep 21, 2014

11 votes

1 answer

71

GATE CSE 2007 | Question: 66, ISRO2016-71
In a token ring network the transmission speed is $10^7$ bps and the propagation speed is $200\;\text{meters}/\mu \text{s}.$ The $1$-bit delay in this network is equivalent to: $500$ meters of cable. $200$ meters of cable. $20$ meters of cable. $50$ meters of cable.

In a token ring network the transmission speed is $10^7$ bps and the propagation speed is $200\;\text{meters}/\mu \text{s}.$ The $1$-bit delay in this network is equivale...

17.2k views

Kathleen asked Sep 21, 2014

44 votes

6 answers

72

GATE CSE 2007 | Question: 63, ISRO2016-59
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\;\text{bytes}$, data record pointer is $7\;\text{bytes}$ long, the value field is $9\;\text{bytes}$ long and a block pointer is $6 \;\text{bytes}$ long, what is the order of the leaf node? $63$ $64$ $67$ $68$

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\;\text{bytes}$, data ...

23.5k views

Kathleen asked Sep 21, 2014

33 votes

4 answers

73

GATE CSE 2007 | Question: 38, ISRO2016-27
The following postfix expression with single digit operands is evaluated using a stack: $8 \ 2 \ 3 \ {}^\hat{} ∕ \ 2 \ 3 * + 5 \ 1 * -$ Note that $^\hat{}$ is the exponentiation operator. The top two elements of the stack after the first $*$ is evaluated are $6, 1$ $5, 7$ $3, 2$ $1, 5$

The following postfix expression with single digit operands is evaluated using a stack:$$8 \ 2 \ 3 \ {}^\hat{} ∕ \ 2 \ 3 * + 5 \ 1 * -$$Note that $^\hat{}$ is the ex...

16.6k views

Kathleen asked Sep 21, 2014

25 votes

4 answers

74

GATE CSE 2007 | Question: 11, ISRO2009-36, ISRO2016-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 manner in a sector. The capacity of the disk pack and the number of bits required to specify a particular ... $256$ Mbyte, $19$ bits $256$ Mbyte, $28$ bits $512$ Mbyte, $20$ bits $64$ Gbyte, $28$ bits

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 manner in a sector. The capa...

20.8k views

Kathleen asked Sep 21, 2014

64 votes

4 answers

75

GATE CSE 2006 | Question: 32, ISRO2016-35
Consider the following statements about the context free grammar $G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $ $G$ is ambiguous $G$ produces all strings with equal number of $a$'s ... combination below expresses all the true statements about $G$? I only I and III only II and III only I, II and III

Consider the following statements about the context free grammar$$G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $$$G...

28.8k views

Rucha Shelke asked Sep 18, 2014

39 votes

8 answers

76

GATE CSE 2002 | Question: 1.25, ISRO2008-30, ISRO2016-6
The maximum number of edges in a $n$-node undirected graph without self loops is $n^2$ $\frac{n(n-1)}{2}$ $n-1$ $\frac{(n+1)(n)}{2}$

The maximum number of edges in a $n$-node undirected graph without self loops is$n^2$$\frac{n(n-1)}{2}$$n-1$$\frac{(n+1)(n)}{2}$

18.7k views

Kathleen asked Sep 15, 2014

43 votes

3 answers

77

GATE CSE 2000 | Question: 1.23, ISRO2016-57
Given the relations employee (name, salary, dept-no), and department (dept-no, dept-name,address), Which of the following queries cannot be expressed using the basic relational algebra operations ... whose name is the same as their department name The sum of all employees' salaries All employees of a given department

Given the relationsemployee (name, salary, dept-no), anddepartment (dept-no, dept-name,address),Which of the following queries cannot be expressed using the basic relatio...

14.9k views

Kathleen asked Sep 14, 2014

33 votes

4 answers

78

GATE CSE 2008 | Question: 16, ISRO2016-60
A clustering index is defined on the fields which are of type non-key and ordering non-key and non-ordering key and ordering key and non-ordering

A clustering index is defined on the fields which are of typenon-key and orderingnon-key and non-orderingkey and orderingkey and non-ordering

14.0k views

Kathleen asked Sep 11, 2014

37 votes

8 answers

79

GATE CSE 2008 | Question: 14, ISRO2016-74
What is the maximum size of data that the application layer can pass on to the TCP layer below? Any size $2^{16}$ bytes - size of TCP header $2^{16}$ bytes $1500$ bytes

What is the maximum size of data that the application layer can pass on to the TCP layer below?Any size$2^{16}$ bytes - size of TCP header$2^{16}$ bytes$1500$ bytes

17.8k views

Kathleen asked Sep 11, 2014

33 votes

5 answers

80

GATE CSE 2008 | Question: 13, ISRO2016-36
If $L$ and $\overline{L}$ are recursively enumerable then $L$ is regular context-free context-sensitive recursive

If $L$ and $\overline{L}$ are recursively enumerable then $L$ isregularcontext-freecontext-sensitiverecursive

11.6k views

Kathleen asked Sep 11, 2014

37 votes

2 answers

81

GATE CSE 2012 | Question: 20, ISRO2016-23
Register renaming is done in pipelined processors: as an alternative to register allocation at compile time for efficient access to function parameters and local variables to handle certain kinds of hazards as part of address translation

Register renaming is done in pipelined processors:as an alternative to register allocation at compile timefor efficient access to function parameters and local variablest...

15.7k views

gatecse asked Aug 5, 2014

Page:

« prev
1
2
3