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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged isi2014pcbcs
+1
vote
0
answers
1
ISI2014PCBCS7b
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
(
105k
points)

174
views
descriptive
isi2014pcbcs
tokenring
+1
vote
1
answer
2
ISI2014PCBCS7a
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. Assume that the context ... 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
(
105k
points)

202
views
isi2014pcbcs
descriptive
operatingsystem
processschedule
+1
vote
0
answers
3
ISI2014PCBCS6b
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, j_1)$ ... how many of these 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
(
105k
points)

171
views
isi2014pcbcs
descriptive
computernetworks
routing
+1
vote
0
answers
4
ISI2014PCBCS6a
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+$ tree index ... two queries 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
(
105k
points)

164
views
descriptive
isi2014pcbcs
databases
btree
indexing
+1
vote
1
answer
5
ISI2014PCBCS5
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 get it from offchip ... $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 and Architecture
by
jothee
Veteran
(
105k
points)

133
views
descriptive
isi2014pcbcs
coandarchitecture
cachememory
+8
votes
4
answers
6
ISI2014PCBCS4b
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
(
105k
points)

537
views
descriptive
isi2014pcbcs
theoryofcomputation
regularlanguages
+13
votes
2
answers
7
ISI2014PCBCS4a
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
(
105k
points)

700
views
descriptive
isi2014pcbcs
theoryofcomputation
finiteautomata
+1
vote
1
answer
8
ISI2014PCBCS3b
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
(
105k
points)

229
views
descriptive
isi2014pcbcs
algorithms
spanningtree
graphalgorithms
+1
vote
1
answer
9
ISI2014PCBCS3a
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
(
105k
points)

120
views
isi2014pcbcs
algorithms
algorithmdesign
+10
votes
1
answer
10
ISI2014PCBCS2b
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
(
105k
points)

489
views
descriptive
isi2014pcbcs
algorithms
binarytree
heap
+2
votes
1
answer
11
ISI2014PCBCS2a
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
(
105k
points)

154
views
descriptive
isi2014pcbcs
datastructures
binarytree
+1
vote
0
answers
12
ISI2014PCBCS1
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 it with the minimum ... m as 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
(
105k
points)

95
views
isi2014pcbcs
descriptive
algorithms
algorithmdesign
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged isi2014pcbcs
Recent Blog Comments
Cut off will be between 95115 not more than that.
@saxena0612 , Sir since they are not considering...
Hey Everyone! Those who think that they are...
Which questions are u challenging..?
ONLY T MADE EASY STUDENTS CAN UNDERSTAND,
50,737
questions
57,365
answers
198,493
comments
105,260
users