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 isi2015pcbcs
+2
votes
1
answer
1
ISI2015PCBCS7
Consider the following schema: SUPPLIER (supId : integer, supName : string, supAddress : string) PARTS (partId : integer, partName : string, partColour : string) CATALOG (supId : integer, partId : integer, price : real) The key fields are ... relational algebra using some or all of the following operators: SELECT, PROJECT, JOIN, CARTESIAN PRODUCT, UNION, INTERSECTION, DIFFERENCE.
asked
May 30, 2016
in
Databases
by
jothee
Veteran
(
105k
points)

368
views
descriptive
isi2015pcbcs
databases
sql
relationalalgebra
+14
votes
2
answers
2
ISI2015PCBCS6b
Consider scheduling $n$ processes $P_1, P_2, \dots, P_n$ which are created in this order at almost the same instant. Assume that all processes have exactly one CPU burst of duration $D$ units (and no I/O bursts). Compute the average waiting time ... to switch from one running process to another and $\Delta$ units of time to switch from a terminated process to a running process.
asked
May 30, 2016
in
Operating System
by
jothee
Veteran
(
105k
points)

999
views
descriptive
isi2015pcbcs
operatingsystem
processschedule
+4
votes
3
answers
3
ISI2015PCBCS6a
Consider the following timings for a fivestage processor pipeline (these timings include the latching overhead): ... this pipelined implementation compared to a nonpipelined implementation? Assume that each add instruction consists of Fetch, Decode, Execute and Write Back.
asked
May 30, 2016
in
CO and Architecture
by
jothee
Veteran
(
105k
points)

503
views
descriptive
isi2015pcbcs
coandarchitecture
pipelining
+10
votes
1
answer
4
ISI2015PCBCS5b
Construct a context free grammar (CFG) to generate the following language: $L = \{a^nb^mc^{n+m}: \text{n, m are integers, and } n \geq 1, m \geq 1 \}$
asked
May 30, 2016
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

427
views
descriptive
isi2015pcbcs
theoryofcomputation
contextfreelanguages
+5
votes
2
answers
5
ISI2015PCBCS5a
Construct two nonregular languages $L_1$ and $L_2$ such that $L_1 \cup L_2$ is regular. Prove that the languages $L_1$ and $L_2$ constructed above are nonregular and $L_1 \cup L_2$ is regular.
asked
May 30, 2016
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

453
views
descriptive
isi2015pcbcs
theoryofcomputation
regularlanguages
+9
votes
3
answers
6
ISI2015PCBCS4b
Stations $A$ and $B$ are connected through a line of bandwidth $64$ $\text{kbps}$. Station $A$ uses $16$ $\text{byte}$ packets to transmit messages to $B$ using a sliding window protocol. The round trip propagation delay between $A$ ... use to maximize the line utilization. Assume that the ack frame is of negligible size and processing delay may be ignored. Justify your answer.
asked
May 30, 2016
in
Computer Networks
by
jothee
Veteran
(
105k
points)

625
views
descriptive
isi2015pcbcs
computernetworks
slidingwindow
+3
votes
4
answers
7
ISI2015PCBCS4a
Consider the use of Cyclic Redundancy Code (CRC) with generator polynomial $G(x)$ for error detection. Recall that error detection with a CRC works by appending the CRC value to the bit sequence to make it a multiple of $G(x)$. Calculate the CRC value of the bit ... burst error of length $5$ in such a way that the error cannot be detected by the CRC with the $G(x)$ given above.
asked
May 29, 2016
in
Computer Networks
by
jothee
Veteran
(
105k
points)

804
views
descriptive
isi2015pcbcs
computernetworks
errordetection
crcpolynomial
+2
votes
1
answer
8
ISI2015PCBCS3b
You are given a logic block $L$ that takes two inputs $A$ and $B$, and produces $A+B$ as output. Realize a twoinput $XOR$ gate using only the logic block $L$. You can use as many pieces of block $L$ as you need. You may use the constant function 0; but no other type of gate is allowed.
asked
May 29, 2016
in
Digital Logic
by
jothee
Veteran
(
105k
points)

160
views
descriptive
isi2015pcbcs
digitallogic
digitalcircuits
+14
votes
1
answer
9
ISI2015PCBCS3a
Consider a linked list containing $n$ nodes, where each node contains two pointers $ptr1$ and $ptr2$. For each node, $ptr1$ points to the next node of the list. Describe how pointer $ptr2$ should be set up for each node so that you will be able to locate the $i$th node from the start node in the list traversing no more than $[\log\: i] + [i/2]$ nodes.
asked
May 29, 2016
in
DS
by
jothee
Veteran
(
105k
points)

691
views
descriptive
isi2015pcbcs
datastructures
linkedlists
+2
votes
1
answer
10
ISI2015PCBCS2b
Let $P_1(x, y_1),\: P_2(x, y_2), \dots, P_n(x, y_n)$ be a collection of $n$ distinct points lying on a vertical line $L$. The value of $x$ is stored in a variable, and $y_1, y_2, \dots, y_n$ are stored in an array in decreasing order. Additionally, you ... is to select an appropriate point $P_k$ on $L$ such that the cost of the route $R$ from $S$ to $D$ through $P_k$ is minimized.
asked
May 29, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

90
views
descriptive
isi2015pcbcs
algorithms
minimumspanningtrees
+10
votes
2
answers
11
ISI2015PCBCS2a
You are given two strings $S$ and $T$, each of length $\alpha$, consisting only of lower case English letters $(a,b, \dots ,z)$. Propose an $O(\alpha)$time algorithm to decide whether $S$ can be obtained by permuting the symbols of $T$ ... $\text{YES}$; but if $S \: = \text{ trainee}$, $T\: = \text{ retinaa}$, your algorithm should return $\text{NO}$.
asked
May 29, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

295
views
descriptive
isi2015pcbcs
algorithms
algorithmdesign
+2
votes
1
answer
12
ISI2015PCBCS1c
Consider the following C program. #include <stdio.h> main() { int arr[] = {1, 1, 2, 4, 8, 16, 32, 64}; int i, j, val, t = 16; unsigned char c; for (i = 0; i < 256; i++) { c = i; val = 0; for (j = 0; j < 8; j++) val = val + ... ) & 0x1)*arr[j]; if (val == t) printf("%d\n", i); } } What will be the output of the program if t = 130 (instead of 16)? Justify.
asked
May 29, 2016
in
Programming
by
jothee
Veteran
(
105k
points)

99
views
descriptive
isi2015pcbcs
programminginc
+3
votes
1
answer
13
ISI2015PCBCS1b
Consider the following C program. #include <stdio.h> main() { int arr[] = {1, 1, 2, 4, 8, 16, 32, 64}; int i, j, val, t = 16; unsigned char c; for (i = 0; i < 256; i++) { c = i; val = 0; for (j = 0; j < 8; j++) val = val + ((c >> j) & 0x1)*arr[j]; if (val == t) printf("%d\n", i); } } What will be the output of the program? Justify your answer.
asked
May 29, 2016
in
Programming
by
jothee
Veteran
(
105k
points)

109
views
descriptive
isi2015pcbcs
programminginc
+2
votes
0
answers
14
ISI2015PCBCS1a
Consider the following C program. #include <stdio.h> main() { int arr[] = {1, 1, 2, 4, 8, 16, 32, 64}; int i, j, val, t = 16; unsigned char c; for (i = 0; i < 256; i++) { c = i; val = 0; for (j = 0; j < 8; j++) val = val ... ) & 0x1)*arr[j]; if (val == t) printf("%d\n", i); } } Trace the execution of the code inside the for loop indexed by i when i = 35.
asked
May 29, 2016
in
Programming
by
jothee
Veteran
(
105k
points)

89
views
descriptive
isi2015pcbcs
programminginc
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 isi2015pcbcs
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,353
answers
198,477
comments
105,247
users