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 isi2013pcbcs
+1
vote
0
answers
1
ISI2013PCBCS7
A connected, simple, undirected planar graph $G(V, E)$ is given where $V$ denotes the set of vertices and E denotes the set of edges. In $V$, there is a designated source vertex $s$ and a designated destination vertex $t$. Let $P(v)$ ... .]
asked
Jun 1, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

117
views
descriptive
isi2013pcbcs
algorithms
graphtheory
algorithmdesign
+1
vote
0
answers
2
ISI2013PCBCS6b
A school database maintains the following relations for its students, teachers and subjects: Student(st_name, st_address, class, section, roll_no, regn_no) Teacher(t_name, t_address, tel_no) Subject(s_name, t_name, text_book, class) Consider the following constraints on ... Class V and reside in Baranagar (name of a locality). Consider that any address offers a locality name.
asked
Jun 1, 2016
in
Databases
by
jothee
Veteran
(
105k
points)

142
views
descriptive
isi2013pcbcs
databases
databasenormalization
sql
+2
votes
2
answers
3
ISI2013PCBCS6a
A block of bits with $n$ rows and $m$ columns uses horizontal and vertical parity bits for error detection. If exactly 4 bits are in error during transmission, derive an expression for the probability that the error will be detected.
asked
Jun 1, 2016
in
Computer Networks
by
jothee
Veteran
(
105k
points)

353
views
descriptive
isi2013pcbcs
errordetection
computernetworks
+16
votes
1
answer
4
ISI2013PCBCS5b
A system has $4$ processes $A$, $B$, $C$, $D$ and $5$ allocatable resources $R_1, \: R_2,\: R_3, \: R_4,\: R_5$ ... $0, \: 0,\: X,\: 1,\: 1$. What is the minimum value of $X$ for which this is a safe state? Justify your answer.
asked
Jun 1, 2016
in
Operating System
by
jothee
Veteran
(
105k
points)

723
views
descriptive
isi2013pcbcs
operatingsystem
resourceallocation
+10
votes
3
answers
5
ISI2013PCBCS5a
Suppose that an operating system provides two functions, $block()$ which puts the calling process on the blocked queue, and $wakeup(P)$ which moves process $P$ to the runnable queue if it is currently on the blocked queue (otherwise, its behaviour is unpredictable). Consider ... the initialisation of the semaphore(s), and the calls to $wait()$ and $signal()$ made by $A$ and $B$.
asked
Jun 1, 2016
in
Operating System
by
jothee
Veteran
(
105k
points)

391
views
descriptive
isi2013pcbcs
operatingsystem
processsynchronization
+11
votes
3
answers
6
ISI2013PCBCS4b
Write a regular expression for all strings of $0$’s and $1$’s in which the total number of $0$’s to the right of each $1$ is even. Justify your answer.
asked
Jun 1, 2016
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

536
views
descriptive
isi2013pcbcs
theoryofcomputation
regularexpressions
+9
votes
1
answer
7
ISI2013PCBCS4a
Give a contextfree grammar $G$ that generates $L = \{0^i1^j0^k \mid i + k = j\}$. Prove that $L = L(G)$.
asked
Jun 1, 2016
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

379
views
descriptive
isi2013pcbcs
contextfreegrammars
theoryofcomputation
+1
vote
0
answers
8
ISI2013PCBCS3
Let $M$ be an $(n \times n)$ matrix where each element is a distinct positive integer. Construct another matrix $M'$ by permuting the rows and/or permuting the columns, such that the elements of one row appear in increasing order ( ... structure that supports your algorithm. Clearly explain how much additional storage, other than the matrix itself, is required in your algorithm.
asked
Jun 1, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

80
views
descriptive
isi2013pcbcs
algorithms
algorithmdesign
+1
vote
1
answer
9
ISI2013PCBCS2b
Let $C$ denote a logic block that is capable of comparing two $4$  bit $2$'s complement numbers $A\:(a_3, a_2, a_1, a_0)$ and $B\: (b_3, b_2, b_1, b_0)$, where $a_i, b_i \in \{0, 1\}$ for $i = 0, 1, 2, 3$. The circuit $C$ ... then the outputs should be $E = 0,\: L = 0$, and $G = 1$. Write the Boolean equations for the three outputs $E, \: L$, and $G$.
asked
Jun 1, 2016
in
Digital Logic
by
jothee
Veteran
(
105k
points)

231
views
descriptive
isi2013pcbcs
digitallogic
numberrepresentation
booleanalgebra
+2
votes
0
answers
10
ISI2013PCBCS2a
Draw a complete binary tree $T$ with $(N − 1)$ nodes where $N = 2^n$. Suppose each node in $T$ is a processor and each edge of $T$ is a physical link between two processors through which they can communicate. Given $M$ ... architecture to compute the sum of each array $SUM_i = \Sigma^N_{j=1} e_{ji}$ for all $i$ in $O(\log N + M)$ time.
asked
Jun 1, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

93
views
descriptive
isi2013pcbcs
algorithms
algorithmdesign
+1
vote
0
answers
11
ISI2013PCBCS1c
Consider the $\text{fast square}$ and $\text{multiply algorithm}$ to calculate $x^y \text{ mod } N$ as given below, where $x, \: y,\: N$ are positive integers and $1 \leq x, y < N$. Input: $x, \:y, \:N$ ... than $512$ bits. Assume that the time complexity of modular multiplication is $O(log^2 \: N)$, when the positive integers involved are less than $N$.]
asked
May 31, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

73
views
descriptive
isi2013pcbcs
algorithms
timecomplexity
+1
vote
0
answers
12
ISI2013PCBCS1a,b
Consider the $fast \: square$ and $multiply \: algorithm$ to calculate $x^y \: mod \: N$ as given below, where $x, \: y,\: N$ are positive integers and $1 \leq x, y < N$. Input: $x, \:y, \:N$ ... , all of which are of type $unsigned long long$ (i.e., 64bit unsigned integers). Discuss whether your program works perfectly for all possible input combinations.
asked
May 31, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

52
views
descriptive
isi2013pcbcs
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 isi2013pcbcs
Recent Blog Comments
Which questions are u challenging..?
ONLY T MADE EASY STUDENTS CAN UNDERSTAND,
Yes and few more questions also
nkg_master9 you challenged that dbms query...
@nsaisirisha Yes they will give marks only...
50,737
questions
57,354
answers
198,478
comments
105,248
users