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 isi2016pcbcs
+1
vote
1
answer
1
ISI2016PCBCS1
Consider the array $A=[20,13,19,8,3,5,4]$ that represents a heap. Draw the heap after removing the element $20.$ List all the distinct integer keys $k$ such that, when $k$ is inserted in the Binary Search Tree of Figure $1,$ its height increases. Note that you are not allowed to insert an already existing key again. Justify your answer.
asked
Sep 18, 2018
in
DS
by
jothee
Veteran
(
105k
points)

42
views
isi2016pcbcs
trees
binarysearchtree
descriptive
0
votes
0
answers
2
ISI2016PCBCS2
Consider sending a large file of $360,000$ bits from Host $A$ to Host $B,$ connected through a router, as shown in the below figure $2.$ Assume that there is no queuing and propagation delay, and the router has sufficient buffer space. Host ... transferring one byte involves $4$ operations: instatus, checkstatus, branch and read/write in memory, each requiring one machine cycle.
asked
Sep 18, 2018
in
Computer Networks
by
jothee
Veteran
(
105k
points)

26
views
isi2016pcbcs
linkstaterouting
dma
nongate
descriptive
+1
vote
0
answers
3
ISI2016PCBCS3
Consider the following extract from a program, written in a Clike language, that computes the transpose of a matrix. for (i=0; i<N; i++) for (j=0; j<N; j++) B[i,j]=A[i,j]; $A$ and $B$ are $N \times N$ matrices with floating point entries ... Each of $A$ and $B$ is stored starting from the beginning of a page None of the pages allocated to $A$ and $B$ are initially in memory.
asked
Sep 18, 2018
in
Operating System
by
jothee
Veteran
(
105k
points)

28
views
isi2016pcbcs
operatingsystem
demandpaging
pagefault
nongate
descriptive
0
votes
0
answers
4
ISI2016PCBCS4
Commodity items have some positive or negative changes in their prices each week. Each trading company picks a portfolio of commodity items, that is, they have one or more items and they own some nonzero quantity of each one. The database table for this problem ... and there exists at least one company selling that item only. (i.e., not selling any other item) in that week.
asked
Sep 18, 2018
in
Databases
by
jothee
Veteran
(
105k
points)

24
views
isi2016pcbcs
databases
sql
nongate
descriptive
0
votes
0
answers
5
ISI2016PCBCS5
What will be the output of the following C program? If you think it will give a runtime error, you need to mention it. In either case, your answer must include proper justifications without which no credit will be given. #include<stdio.h> main() { unsigned char i, j, a[]={1, 2, 3, 4, 5}; ... ;, i, j, n); while(j !=0) a[0]+=n; printf("j=%d, a[0]=%d\n", j, a[0]); }
asked
Sep 18, 2018
in
Programming
by
jothee
Veteran
(
105k
points)

29
views
isi2016pcbcs
programminginc
output
nongate
descriptive
0
votes
0
answers
6
ISI2016PCBCS6
Let L be a regular language over $\{0,1\}$. Define the reverse of the language $L$ to be the language $L^R = \{ w \in \{0,1\}^* \: \: : \: \: \text{ reverse }(w) \in L\}$, where $\text{reverse}(w)$ denotes the string $w$ ... $x$ contains an odd number of $1's$ and $00$ as a substring$\}.$ Construct a regular expression for the language $L$.
asked
Sep 18, 2018
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

21
views
isi2016pcbcs
regularlanguages
regularexpressions
descriptive
0
votes
0
answers
7
ISI2016PCBCS7
Let $A$ be a sorted array of $n$ positive integers, such that $A[1] \leq A[2] \leq \dots \leq A[n]$. Given an integer $x$ as input, the goal is to find two array indices $k$ and $l$ such that $A[k]+A[l] =x$, if such indices exist; otherwise, the goal is to report 'Failure". Design an algorithm for this problem, that works in $O(n)$ time.
asked
Sep 18, 2018
in
Algorithms
by
jothee
Veteran
(
105k
points)

23
views
isi2016pcbcs
algorithmdesign
descriptive
+1
vote
0
answers
8
ISI2016PCBCS8
Consider all possible trees with $n$ nodes. Let $k$ be the number of nodes with degree greater than 1 in a given tree. What is the maximum possible value of $k$? Justify your answer. Consider $2n$ committees, each having at least $2n$ persons, formed from a group of $4n$ persons. Prove that there exists at least one person who belongs to at least $n$ committees.
asked
Sep 18, 2018
in
Combinatory
by
jothee
Veteran
(
105k
points)

22
views
isi2016pcbcs
permutationandcombination
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
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 isi2016pcbcs
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