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 isi2011pcbcs
+4
votes
0
answers
1
ISI2011PCBCS6b
For the function given by the Karnaugh map shown below, you can change at most one $1$ or one $0$ entry to a DON'T CARE. Determine what single change of this kind produces the simplest twolevel ANDOR realization. Assume both uncomplemented and complemented inputs are available.
asked
Jun 3, 2016
in
Digital Logic
by
jothee
Veteran
(
105k
points)

271
views
digitallogic
descriptive
isi2011pcbcs
kmap
+9
votes
2
answers
2
ISI2011PCBCS6a
Assume a machine has $4$ registers (one of which is the accumulator $A$) and the following instruction set. $\text{LOAD}$ and $\text{STORE}$ are indirect memory operations that load and store, using the address stored in the given register operand ... . Design an instruction encoding scheme that allows each of the above instructions (along with operands) to be encoded in $8$ bits.
asked
Jun 3, 2016
in
CO and Architecture
by
jothee
Veteran
(
105k
points)

705
views
coandarchitecture
descriptive
isi2011pcbcs
machineinstructions
+14
votes
2
answers
3
ISI2011PCBCS5c
One of your classmates has suggested the following modified version of a standard scheme for solving the $2$process critical section problem (CSP). shared char want[2] = {0,0}; shared int turn = 0; 1. P_i() 2. { while (1) { 3. turn = j; ... instructions executed by two processes $P_0$ and $P_1$. Modify the above scheme so that it becomes a correct solution to the $2$process CSP.
asked
Jun 3, 2016
in
Operating System
by
jothee
Veteran
(
105k
points)

472
views
isi2011pcbcs
descriptive
operatingsystem
processsynchronization
normal
+15
votes
4
answers
4
ISI2011PCBCS5b
Suppose we have a relation $R(A, B, C, D, E)$ with the functional dependencies: $A \rightarrow D, B \rightarrow C, D \rightarrow E, CE \rightarrow B$. If we project $R$ and therefore its functional dependencies onto the schema $ABC$, what will the key(s) for $ABC$ be?
asked
Jun 3, 2016
in
Databases
by
jothee
Veteran
(
105k
points)

699
views
descriptive
isi2011pcbcs
databases
databasenormalization
+2
votes
1
answer
5
ISI2011PCBCS5a
Consider relations $R(A, B)$ and $S(B, C)$. Find a propositional formula $\phi$ such that the following two relational algebra expressions produce the same answer. $\pi_{A,B}(\sigma_\phi(R \bowtie S))$ $R \cap ({\rho_T(A)}(\pi_C(S)) \times \pi_B(S))$
asked
Jun 3, 2016
in
Databases
by
jothee
Veteran
(
105k
points)

217
views
descriptive
isi2011pcbcs
databases
relationalalgebra
+2
votes
0
answers
6
ISI2011PCBCS4c
Recall that a typical URL has the following form. It starts with a protocol specifier, followed by a colon (:) and two forward slashes (/), followed by a hostname and a domain name. This is followed by an optional path specifier. Some example URLs are ... are the only characters that can be used in a host / domain / file / directory name, write a regular expression for URLs.
asked
Jun 3, 2016
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

63
views
descriptive
isi2011pcbcs
regularexpressions
+5
votes
1
answer
7
ISI2011PCBCS4a
Let $L$ be the set of strings over $\{0, 1\}$ containing an unequal number of $0$s and $1$s. Prove that $L$ is not regular. $L^2$ is regular.
asked
Jun 3, 2016
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

189
views
descriptive
isi2011pcbcs
theoryofcomputation
regularlanguages
+1
vote
2
answers
8
ISI2011PCBCS3c
A vertex cover of a graph $G = (V, E)$ is a set of vertices $V' \subseteq V$ such that for any edge $(u, v) \in E$, either $u$ or $v$\ (or both) is in $V'$. Write a linear time algorithm to find the minimum vertex cover of a given tree $T$. Establish its correctness.
asked
Jun 3, 2016
in
Graph Theory
by
jothee
Veteran
(
105k
points)

140
views
descriptive
isi2011pcbcs
graphtheory
vertexcover
+2
votes
0
answers
9
ISI2011PCBCS3b
Let $T = (V, E)$ be a tree, and let $v \in V$ be any vertex of $T$. The $\text{eccentricity}$ of $v$ is the maximum distance from $v$ to any other vertex in $T$. The $\text{centre } C$ of $T$ is the set of vertices which have minimum eccentricity among all ... centre and centroid, each having two vertices (i.e. $C \cap \mathcal{C} = \not{O}$ and $C = \mathcal{C} = 2)$.
asked
Jun 3, 2016
in
Graph Theory
by
jothee
Veteran
(
105k
points)

96
views
descriptive
isi2011pcbcs
graphtheory
graphconnectivity
+3
votes
4
answers
10
ISI2011PCBCS3a
Solve the following recurrence ($n$ is a natural number): $T(n) = \begin{cases} 7T(n\div3)+n^2 & ;n>2 \\ 1 & ;n \leq 2. \end{cases}$
asked
Jun 3, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

147
views
descriptive
isi2011pcbcs
algorithms
recurrence
+2
votes
1
answer
11
ISI2011PCBCS2
You are given $k$ sorted lists, each containing $m$ integers in ascending order. Assume that (i) the lists are stored as singlylinked lists with one integer in each node, and (ii) the head pointers of these lists are stored in an array. ... if you were permitted to use only constant additional storage? Analyse the time complexity of your algorithm for each of the above two cases.
asked
Jun 3, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

180
views
descriptive
isi2011pcbcs
algorithms
sorting
+3
votes
1
answer
12
ISI2011PCBCS1b
There are $n$ students of a class standing in a line. The students have to arrange themselves in ascending order on the basis of their roll numbers. This rearrangement of the line must be accomplished only by successively swapping pairs of adjacent students ... the number of swaps required. Derive an expression for the number of swaps needed by your algorithm in the worst case.
asked
Jun 3, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

209
views
isi2011pcbcs
descriptive
algorithms
sorting
+1
vote
0
answers
13
ISI2011PCBCS1a
The function $divby3$ given below is intended to check whether a given number is divisible by 3. It assumes that the argument $(number)$ is a string containing the decimal representation of a positive integer, and returns 1 or 0 depending on whether the ... for all positive integers. note: The smaller the number of ALU operations used by your function, the more marks you will get.
asked
Jun 3, 2016
in
Digital Logic
by
jothee
Veteran
(
105k
points)

144
views
descriptive
isi2011pcbcs
numberrepresentation
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
Management Trainee Recruitment COAL INDIA 2020
ECIL Interview Experience
Follow @csegate
Recent questions tagged isi2011pcbcs
Recent Blog Comments
Hey all! I can't see the CS branch here? How...
it's depends year to year
What was the average cutoff that was maintained...
@Shivateja MST I don't think it will go high
http://univ.tifr.res.in/gs2020/Test_Results/INT_Sh...
50,741
questions
57,251
answers
198,056
comments
104,682
users