The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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 isi2018pcbcs
0
votes
1
answer
1
ISI2018PCBCS10
Consider two $n \times 1$ vectors $u$ and $v$ , stored as table $U(\text{ind,val})$ and $V(\text{ind,val})$ with the same schema A row $(i,u_i)$ of table $U$ specifies the $i^{th}$ element of vector $u$ has value $u_i$ ... $u + v$ of the two vectors $u$ and $v$. Explain your solution.
asked
May 12, 2019
in
Databases
by
akash.dinkar12
Boss

161
views
isi2018pcbcs
databases
relationalalgebra
sql
descriptive
+1
vote
0
answers
2
ISI2018PCBCS9
The data link layer uses a fixedsize sliding window protocol, where the window size for the connection is equal to twice the bandwidthdelay product of the network path. Consider the following three scenarios, in each of which only the given parameter changes as specified (no ... minimum value of the round trip time $R$ increases to $1.8R$; the window size $W$ decreases to $W/3$
asked
May 12, 2019
in
Computer Networks
by
akash.dinkar12
Boss

138
views
isi2018pcbcs
computernetworks
datalinklayer
descriptive
0
votes
1
answer
3
ISI2018PCBCS8
Consider a $5$ ... $\text{(in ns)}$ needed to execute the program.
asked
May 12, 2019
in
Operating System
by
akash.dinkar12
Boss

175
views
isi2018pcbcs
coandarchitecture
pipelining
descriptive
+1
vote
2
answers
4
ISI2018PCBCS7
A context switch from a process $P_{old}$ to a process $P_{new}$ consists of the following steps: Step I:saving the context of $P_{old}$; Step II: running the scheduling algorithm to pick $P_{new}$; Step III: restoring the saved context of $P_{new}$. Suppose Steps ... in the order $P_1, P_2, . . . , P_k;$ each process requires exactly one CPU burst of $20$ms and no I/O burst.
asked
May 12, 2019
in
Operating System
by
akash.dinkar12
Boss

199
views
isi2018pcbcs
operatingsystem
processschedule
descriptive
0
votes
1
answer
5
ISI2018PCBCS6
The following function computes an array $SPF$, where, for any integer $1 < i < 1000$, $SPF[i]$ is the smallest prime factor of $i$. For example, $SPF[6]$ is $2$, and $SPF[11]$ is $11$. There are five missing parts in the following code, commented as $/* Blank */$. For each of them ... < 1000; j+= i) { /* Blank 4 */ if (SPF[j] == j) { SPF[j] = _____; /* Blank 5 */ } } } } }
asked
May 12, 2019
in
Algorithms
by
akash.dinkar12
Boss

95
views
isi2018pcbcs
algorithmdesign
descriptive
0
votes
0
answers
6
ISI2018PCBCS5
Consider a maxheap of $n$ distinct integers, $n ≥ 4$, stored in an array $\mathcal{A}[1 . . . n]$. The second minimum of $\mathcal{A}$ is the integer that is less than all integers in $\mathcal{A}$ except the minimum of $\mathcal{A}$. Find all possible array indices of $\mathcal{A}$ in which the second minimum can occur. Justify your answer.
asked
May 12, 2019
in
Algorithms
by
akash.dinkar12
Boss

104
views
isi2018pcbcs
algorithms
algorithmdesign
heap
descriptive
+1
vote
1
answer
7
ISI2018PCBCS4
Let the valid moves along a staircase be $U$ (one step up) and $D$ (one step down). For example, the string $s = UUDU$ represents the sequence of moves as two steps up, then one step down, and then again one step up. Suppose a person is ... returns to the base of the staircase after the final step. Show that $L$ is not regular Write a context free grammar for accepting $L$
asked
May 12, 2019
in
Theory of Computation
by
akash.dinkar12
Boss

83
views
isi2018pcbcs
theoryofcomputation
contextfreegrammars
descriptive
+1
vote
1
answer
8
ISI2018PCBCS3
An $n$variable Boolean function $f:\{0,1\}^n \rightarrow \{0,1\} $ is called symmetric if its value depends only on the number of $1’s$ in the input. Let $\sigma_n $ denote the number of such functions. Calculate the value of $\sigma_4$. Derive an expression for $\sigma_n$ in terms of $n$.
asked
May 12, 2019
in
Set Theory & Algebra
by
akash.dinkar12
Boss

79
views
isi2018pcbcs
engineeringmathematics
discretemathematics
settheory&algebra
functions
descriptive
+2
votes
1
answer
9
ISI2018PCBCS2
You can climb up a staircase of $n$ stairs by taking steps of one or two stairs at a time. Formulate a recurrence relation for counting $a_n$, the number of distinct ways in which you can climb up the staircase. Mention the boundary conditions for your recurrence relation. Find a closed form expression for $a_n$ by solving your recurrence.
asked
May 12, 2019
in
Algorithms
by
akash.dinkar12
Boss

121
views
isi2018pcbcs
algorithms
recurrence
descriptive
0
votes
0
answers
10
ISI2018PCBCS1
Consider an array of length n consisting only of positive and negative integers. Design an algorithm to rearrange the array so that all the negative integers appear before all the positive integers, using $O(n)$ time and only a constant amount of extra space.
asked
May 12, 2019
in
Algorithms
by
akash.dinkar12
Boss

73
views
isi2018pcbcs
algorithms
algorithmdesign
descriptive
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
GATE Overflow Test Series  GATE CSE 2021
IIT gandhinagar mtech cse2020
IIT Delhi Research Interview Shortlists out
IIT Gandhinagar interview experience
IIT Gandhinagar Interview 2020
Subjects
All categories
General Aptitude
(1.9k)
Engineering Mathematics
(8.2k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged isi2018pcbcs
Recent Blog Comments
How to get good in programming like you? Please...
@yarunsharma I think cut off is 97...
Exam results page should be loading faster now....
@Satyaki Guha You can give test anytime after...
1. Thank you sir. 2. It's been fixed now, thank...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,217
questions
59,951
answers
201,132
comments
118,172
users