The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent questions tagged isi2014
+1
vote
2
answers
1
ISI201411
Let $X_1,X_2,X_3,X_4$ be i.i.d. random variables each assuming the value $1$ and $1$ with probability $\dfrac{1}{2}$ each. Then, the probability that the matrix $\begin{pmatrix}X_1 &X_2\\ X_3 &X_4\end{pmatrix}$ is nonsingular equals $1/2$ $3/8$ $5/8$ $1/4$
asked
5 days
ago
in
Mathematical Logic
by
jjayantamahata
Junior
(
649
points)

49
views
isi2014
probability
+4
votes
1
answer
2
ISI 2014
Read the C code given below. What would be the output of the following program? Justify your answer. #include <stdio.h> int myrecurse(int a, int b){ return (b == 1 ? a: myrecurse(a, b1) + a); } main() { int ... log n)$ algorithm to determine whether the given sequence $S$ has a subsequence whose sum is zero, and justify the correctness of the algorithm.
asked
Apr 25, 2017
in
Written Exam
by
vidhyuth
(
113
points)

121
views
isi2014
programminginc
algorithms
+3
votes
1
answer
3
ISI2014A2b
Let $A$ be a 30 40 matrix having 500 nonzero entries. For $1 \leq i \leq 30$, let $r_i$ be the number of nonzero entries in the $i$th row, and for $1 \leq j \leq 40$, let $m_j$ be the number of nonzero entries in the ... contains the value $max_{1\leq i \leq 30} r_i$. Write pseudocode for creating such a stack using a single scan of the matrix $A$.
asked
Jun 8, 2016
in
Algorithms
by
Arjun
Veteran
(
347k
points)

100
views
isi2014
algorithms
+1
vote
0
answers
4
ISI2014CS7b
A heavily loaded 1 km long, 10 Mbps token ring network has a propagation speed of 200 meter per microsecond. Fifty stations are uniformly spaced around the ring. Each data packet is 256 bits long, including 32 bits of header. The token is of 8 bits. What is the effective data rate of the network assuming the stations always have packets to transmit?
asked
May 31, 2016
in
Computer Networks
by
jothee
Veteran
(
112k
points)

113
views
descriptive
isi2014
tokenring
+1
vote
0
answers
5
ISI2014CS7a
Consider a uniprocessor system with four processes having the following arrival and burst times: Calculate the average waiting time and also the average turnaround time if shortest (remaining) job first (SJF) scheduling policy is used with preemption. ... times of 2 units each. In this case, what will be the turnaround time of $P1$? Justify your answer
asked
May 31, 2016
in
Operating System
by
jothee
Veteran
(
112k
points)

113
views
isi2014
descriptive
operatingsystem
processschedule
+1
vote
0
answers
6
ISI2014CS6b
In a LAN, $n^2$ routers are connected in an $n \times n$ mesh such that $R(i, j)$ represents a router in the $i$th row and $j$th column of the mesh. Find how many distinct shortest paths exist between two routers $R(i_1 ... distinct shortest paths will be node disjoint, i.e., with no common node except the source and the destination? Justify your answer.
asked
May 31, 2016
in
Computer Networks
by
jothee
Veteran
(
112k
points)

129
views
isi2014
descriptive
computernetworks
routing
+1
vote
0
answers
7
ISI2014CS6a
Two queries equivalent to each other are specified for a relation $R(A, B, C, D, E, F)$. The queries are: $\pi_{A,B,C}(\sigma B>500(R))$ $\sigma B>500(\pi_{A,B,C}(R))$ The system maintains a $B ... will be preferred by the query optimizer for minimum cost of execution. The cost of query execution is primarily dependent on the number of disk accesses.
asked
May 31, 2016
in
Databases
by
jothee
Veteran
(
112k
points)

116
views
descriptive
isi2014
databases
btree
indexing
+2
votes
1
answer
8
ISI2014CS5
a. The average memory access time for a microprocessor with first level cache is 3 clock cycles. If data is present in the cache, it is found in 1 clock cycle. If data is not found in the cache, 100 clock cycles are needed to ... and 20% of the total execution time, respectively. Calculate the overall speedup of $P$ when it is executed on the new machine.
asked
May 31, 2016
in
CO & Architecture
by
jothee
Veteran
(
112k
points)

102
views
descriptive
isi2014
coandarchitecture
cachememory
+6
votes
3
answers
9
ISI2014CS4b
Consider the following statement: $\text{ For all languages }L \subseteq \{0, 1\}^*, \text{ if }L^* \text{ is regular then L is regular.}$ Is the above statement true? Justify your answer.
asked
May 31, 2016
in
Theory of Computation
by
jothee
Veteran
(
112k
points)

167
views
descriptive
isi2014
theoryofcomputation
regularlanguages
+8
votes
1
answer
10
ISI2014CS4a
Construct a deterministic finite automaton accepting the following language: $\{w \in \{0, 1\}^∗: w \text{ has an equal number of 01’s and 10’s }$. For example, $101$ is in the language because it contains one instance of $10$ and one instance of $01$ as well.
asked
May 31, 2016
in
Theory of Computation
by
jothee
Veteran
(
112k
points)

233
views
descriptive
isi2014
theoryofcomputation
finiteautomata
+2
votes
1
answer
11
ISI2014CS3b
Let $G = (V, E)$ be an undirected weighted graph with all edge weights being positive. Design an efficient algorithm to find the maximum spanning tree of $G$.
asked
May 31, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

143
views
descriptive
isi2014
algorithms
spanningtree
graphalgorithms
+2
votes
1
answer
12
ISI2014CS3a
Let $A$ and $B$ be two arrays, each containing $n$ distinct integers. Each of them is sorted in increasing order. Let $C = A \cup B$. Design an algorithm for computing the median of $C$ as efficiently as you can.
asked
May 31, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

78
views
isi2014
descriptive
algorithms
median
+8
votes
1
answer
13
ISI2014CS2b
Let $H_1$ and $H_2$ be two complete binary trees that are heaps as well. Assume $H_1$ and $H_2$ are maxheaps, each of size $n$. Design and analyze an efficient algorithm to merge $H_1$ and $H_2$ to a new maxheap $H$ of size $2n$.
asked
May 31, 2016
in
DS
by
jothee
Veteran
(
112k
points)

210
views
descriptive
isi2014
algorithms
binarytree
heap
+3
votes
1
answer
14
ISI2014CS2a
Let $B$ be a rooted binary tree of $n$ nodes. Two nodes of $B$ are said to be a sibling pair if they are the children of the same parent. For example, given the binary tree in Figure 1, the sibling pairs are (2, 3) and (6, 7). Design an $O(n)$ time algorithm that prints all the sibling pairs of $B$.
asked
May 31, 2016
in
DS
by
jothee
Veteran
(
112k
points)

107
views
descriptive
isi2014
datastructure
binarytree
+1
vote
0
answers
15
ISI2014CS1
Assume you have a chocolate bar containing a number of small identical squares arranged in a rectangular pattern. Our job is to split the bar into small squares by breaking along the lines between the squares. We obviously want to do ... inputs and print the line numbers along the length and the breadth according to your strategy of breaking the chocolate.
asked
May 31, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

54
views
isi2014
descriptive
algorithms
+1
vote
0
answers
16
ISI2014A2a
Let $A$ be a 30 × 40 matrix having 500 nonzero entries. For $1 \leq i \leq 30$, let $r_i$ be the number of nonzero entries in the $i$th row, and for $1 \leq j \leq 40$, let $m_j$ be the number of nonzero entries in the $j$th ... such that $1 \leq k \leq 30$, $r_k \geq 17$ and there is an $l$ such that $1 \leq l \leq 40$, $m_l \leq 12$.
asked
May 31, 2016
in
Numerical Ability
by
jothee
Veteran
(
112k
points)

34
views
isi2014
descriptive
numericalability
+2
votes
1
answer
17
ISI2014A1b
Let $x, y$ be two nonnegative integers $< 2^{32}$. By $x \wedge y$ we mean the integer represented by the bitwise logical $AND$ of the 32 bit binary representations of $x$ and $y$. For example, if $x = 13$ and $y = 6$, then $x \ ... the input $x = 13$? What will be the output of the pseudocode for an arbitrary nonnegative integer $x < 2^{32}$?
asked
May 30, 2016
in
Algorithms
by
jothee
Veteran
(
112k
points)

71
views
descriptive
isi2014
algorithms
identifyfunction
+1
vote
0
answers
18
ISI2014A1a
Let $x=(x_1, x_2, \dots x_n) \in \{0,1\}^n$ By $H(x)$ we mean the number of 1's in $(x_1, x_2, \dots x_n)$. Prove that $H(x) = \frac{1}{2} (n\Sigma^n_{i=1} (1)^{x_i})$.
asked
May 30, 2016
in
Numerical Ability
by
jothee
Veteran
(
112k
points)

35
views
descriptive
isi2014
numericalability
proof
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Applying to NUS
THANK U GO !!
need advice
A journey with GO from Air: 2494 to Air: 223
Thanks to GATE Overflow.
Follow @csegate
Gatecse
Recent questions tagged isi2014
Recent Blog Comments
Congrats Bro :D
Thank You @gauravkc, @hacker16, @Sukannya ...
Congratulations Brother :) You've made it! ECE to ...
I am also thinking of applying to the same ...
34,215
questions
40,896
answers
116,103
comments
39,804
users