Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for isro2016
126
votes
18
answers
1
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 ...
Kathleen
48.1k
views
Kathleen
asked
Sep 22, 2014
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
isro2016
+
–
64
votes
15
answers
2
GATE CSE 2007 | Question: 15, ISRO2016-26
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: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
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:$\lceil \...
Arjun
36.7k
views
Arjun
asked
Jul 6, 2016
Algorithms
gatecse-2007
algorithms
time-complexity
normal
isro2016
+
–
53
votes
8
answers
3
GATE IT 2004 | Question: 12, ISRO2016-77
Consider a system with $2$ level cache. 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? $13.0$ $12.8$ $12.6$ $12.4$
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $1$ $ns$, $10$ $ns$, and $500$ $ns$ respectively. The hit rat...
Ishrat Jahan
29.3k
views
Ishrat Jahan
asked
Nov 1, 2014
CO and Architecture
gateit-2004
co-and-architecture
cache-memory
normal
isro2016
+
–
55
votes
8
answers
4
GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
Kathleen
31.3k
views
Kathleen
asked
Oct 9, 2014
Algorithms
gate1996
algorithms
easy
isro2016
searching
+
–
60
votes
13
answers
5
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 ...
Kathleen
35.4k
views
Kathleen
asked
Sep 21, 2014
Computer Networks
gatecse-2007
computer-networks
subnetting
easy
isro2016
+
–
46
votes
3
answers
6
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...
Rucha Shelke
25.7k
views
Rucha Shelke
asked
Sep 26, 2014
Operating System
gatecse-2006
operating-system
virtual-memory
normal
isro2016
+
–
69
votes
5
answers
7
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...
Kathleen
30.4k
views
Kathleen
asked
Sep 22, 2014
Databases
gatecse-2005
databases
sql
easy
isro2016
+
–
64
votes
4
answers
8
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...
Rucha Shelke
28.6k
views
Rucha Shelke
asked
Sep 18, 2014
Compiler Design
gatecse-2006
compiler-design
context-free-language
normal
isro2016
+
–
21
votes
7
answers
9
GATE CSE 1994 | Question: 1.19, ISRO2016-31
Algorithm design technique used in quicksort algorithm is? Dynamic programming Backtracking Divide and conquer Greedy method
Algorithm design technique used in quicksort algorithm is?Dynamic programmingBacktrackingDivide and conquerGreedy method
Kathleen
18.3k
views
Kathleen
asked
Oct 4, 2014
Algorithms
gate1994
algorithms
algorithm-design-technique
quick-sort
easy
isro2016
+
–
58
votes
7
answers
10
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...
Rucha Shelke
27.8k
views
Rucha Shelke
asked
Sep 26, 2014
Algorithms
algorithms
recurrence-relation
isro2016
gatecse-2006
+
–
37
votes
8
answers
11
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
Kathleen
17.6k
views
Kathleen
asked
Sep 11, 2014
Computer Networks
gatecse-2008
easy
computer-networks
application-layer-protocols
isro2016
+
–
39
votes
8
answers
12
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}$
Kathleen
17.7k
views
Kathleen
asked
Sep 15, 2014
Graph Theory
gatecse-2002
graph-theory
easy
isro2008
isro2016
graph-connectivity
+
–
44
votes
6
answers
13
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 ...
Kathleen
23.2k
views
Kathleen
asked
Sep 21, 2014
Databases
gatecse-2007
databases
b-tree
normal
isro2016
+
–
35
votes
6
answers
14
GATE CSE 1996 | Question: 1.16, ISRO2016-42
Relative mode of addressing is most relevant to writing: Co – routines Position – independent code Shareable code Interrupt Handlers
Relative mode of addressing is most relevant to writing:Co – routinesPosition – independent codeShareable codeInterrupt Handlers
Kathleen
12.5k
views
Kathleen
asked
Oct 9, 2014
CO and Architecture
gate1996
co-and-architecture
addressing-modes
easy
isro2016
+
–
34
votes
7
answers
15
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...
Kathleen
20.2k
views
Kathleen
asked
Sep 22, 2014
Theory of Computation
gatecse-2009
theory-of-computation
grammar
easy
isro2016
+
–
5
votes
3
answers
16
ISRO2016-30
A complete binary tree with $n$ non-leaf nodes contains $\log_{2}n$ nodes $n+1$ nodes $2n$ nodes $2n+1$ nodes
A complete binary tree with $n$ non-leaf nodes contains$\log_{2}n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes
ManojK
9.1k
views
ManojK
asked
Jul 4, 2016
DS
data-structures
binary-tree
isro2016
+
–
33
votes
4
answers
17
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...
Kathleen
16.4k
views
Kathleen
asked
Sep 21, 2014
DS
gatecse-2007
data-structures
stack
normal
infix-prefix
isro2016
+
–
27
votes
4
answers
18
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...
Kathleen
33.7k
views
Kathleen
asked
Sep 21, 2014
Computer Networks
gatecse-2007
computer-networks
error-detection
crc-polynomial
normal
isro2016
+
–
20
votes
5
answers
19
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
Kathleen
8.4k
views
Kathleen
asked
Sep 22, 2014
Operating System
gatecse-2009
operating-system
page-replacement
normal
isro2016
+
–
25
votes
4
answers
20
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...
Kathleen
20.6k
views
Kathleen
asked
Sep 21, 2014
Operating System
gatecse-2007
operating-system
disk
normal
isro2016
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register