The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged descriptive
0
votes
1
answer
1
ISI2016PCBB1
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
1 day
ago
in
Others
by
jothee
Veteran
(
101k
points)

10
views
isi2016pcbb
descriptive
0
votes
0
answers
2
ISI2016PCBB2
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. Assume that there is no queuing ans propagation delay, and the router has sufficient buffer space. Host A splits the ... transferring one byte involves 4 operations: instatus, checkstatus, branch and read/write in memory, each requiring one machine cycle.
asked
1 day
ago
in
Others
by
jothee
Veteran
(
101k
points)

6
views
isi2016pcbb
descriptive
0
votes
0
answers
3
ISI2016PCBB3
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 ... 8 bytes 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
1 day
ago
in
Others
by
jothee
Veteran
(
101k
points)

5
views
isi2016pcbb
descriptive
0
votes
0
answers
4
ISI2016PCBB4
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
1 day
ago
in
Others
by
jothee
Veteran
(
101k
points)

9
views
isi2016pcbb
descriptive
0
votes
0
answers
5
ISI2016PCBB5
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
1 day
ago
in
Others
by
jothee
Veteran
(
101k
points)

11
views
isi2016pcbb
descriptive
0
votes
0
answers
6
ISI2016PCBB8
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
1 day
ago
in
Others
by
jothee
Veteran
(
101k
points)

7
views
isi2016pcbb
descriptive
0
votes
1
answer
7
ISI2016PCBA1
If $\alpha, \beta, \gamma$ are the roots of the equation $x^3+6x+1=0$, then prove that $\frac{\alpha}{\beta} + \frac{\beta}{\alpha} + \frac{\beta}{\gamma}+ \frac{\gamma}{\beta} + \frac{\gamma}{\alpha}+ \frac{\alpha}{\gamma}=3$
asked
1 day
ago
in
Others
by
jothee
Veteran
(
101k
points)

15
views
isi2016pcba
descriptive
0
votes
0
answers
8
ISI2016PCBA2
Let $n$ be a fixed positive integer. For any real number $x$, if for some integer $q$, $x=qn+r, \: \: \: 0 \leq r < n$, then we define $x \text{ mod } n=r$. Specify the points of discontinuity of the function $f(x)=x \text{ mod } 3$ with proper reasoning.
asked
1 day
ago
in
Others
by
jothee
Veteran
(
101k
points)

3
views
isi2016pcba
descriptive
0
votes
0
answers
9
ISI2016PCBA3
A bit string is called legitimate if it contains no consecutive zeros, e.g., 0101110 is legitimate, where as 10100111 is not. Let $a_n$ denote the number of legitimate bit strings of length $n$. Define $a_0=1$. Derive a recurrence relation for $a_n$ (i.e., express $a_n$ in terms of the preceding $a_i$').
asked
1 day
ago
in
Others
by
jothee
Veteran
(
101k
points)

3
views
isi2016pcba
descriptive
0
votes
2
answers
10
GATE199810b
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m < n$ and $R^m = R^n$.
asked
Aug 12
in
Set Theory & Algebra
by
Arjun
Veteran
(
357k
points)

63
views
gate1998
descriptive
settheory&algebra
relations
+1
vote
1
answer
11
Kennth Rosen,ch:1,Ex:1.3,Qn:51
Find a compound proposition logically equivalent to $p \rightarrow q$ using only the logical operator $\downarrow$?
asked
Jun 5
in
Mathematical Logic
by
siva140191
(
63
points)

49
views
kennethrosen
settheory&algebra
propositionallogic
mathematicallogic
descriptive
0
votes
0
answers
12
Kennth Rosen Ch:1,Ex:1.2, Qn:38.
Solve this famous logic puzzle, attributed to Albert Einstein, and known as the zebra puzzle.Five men with different nationalities and with different jobs live in consecutive houses on a street. These houses are painted different colors. The men ... , their pets, and their favorite drinks and use logical reasoning to determine the correct entries in the table.]?
asked
Jun 3
in
Mathematical Logic
by
siva140191
(
63
points)

70
views
kennethrosen
mathematicallogic
settheory&algebra
propositionallogic
descriptive
+1
vote
1
answer
13
CMI2010  6
You are given a list of positive integers along with a sequence of operations from the set $\left \{ *,+\right \}$ .You construct expressions from these two lists so that: The numbers in the expression are drawn from the first list, without repetition and ... assume that the length of the first list is more than the length of the second list. Describe an algorithm to solve this problem.
asked
Apr 30
in
Algorithms
by
Sammohan Ganguly
(
435
points)

105
views
algorithms
descriptive
cmi2010
algorithmdesign
+2
votes
1
answer
14
GATE200218b
The functionality of atomic TESTANDSET assembly language instruction is given by the following C function int TESTANDSET (int *x) { int y; A1: y=*x; A2: *x=1; A3: return y; } Complete the following C functions for implementing code for ... starvationfree? For the above solution, show by an example that mutual exclusion is not ensured if TESTANDSET instruction is not atomic?
asked
Feb 28
in
Operating System
by
jothee
Veteran
(
101k
points)

201
views
gate2002
operatingsystem
processsynchronization
normal
descriptive
+3
votes
3
answers
15
GATE19901ivb
A 32bit floatingpoint number is represented by a 7bit signed exponent, and a 24bit fractional mantissa. The base of the scale factor is 16, The range of the exponent is ___________, if the scale factor is represented in excess64 format.
asked
Feb 12
in
Digital Logic
by
jothee
Veteran
(
101k
points)

239
views
gate1990
descriptive
digitallogic
numberrepresentation
floatingpointrepresentation
+2
votes
2
answers
16
GATE200111b
A sequential circuit takes an input stream of 0's and 1's and produces an output stream of 0's and 1's. Initially it replicates the input on its output until two consecutive 0's are encountered on the input. From then onward, it produces an output stream, ... be used to design the circuit. Give the minimized sumofproduct expression for J and K inputs of one of its state flipflops
asked
Feb 12
in
Digital Logic
by
jothee
Veteran
(
101k
points)

155
views
gate2001
digitallogic
normal
descriptive
flipflop
+2
votes
2
answers
17
GATE200121b
Consider a relation examinee (regno, name, score), where regno is the primary key to score is a real number. Write an SQL query to list the regno of examinees who have a score greater than the average score.
asked
Feb 8
in
Databases
by
jothee
Veteran
(
101k
points)

186
views
gate2001
databases
sql
normal
descriptive
–2
votes
1
answer
18
GATE200121c
Consider a relation $\text{examinee (regno, name, score)},$ where regno is the primary key to score is a real number. Suppose the relation $\text{appears (regno, centr_code)}$ specifies the center where an examinee appears. Write an SQL query to list the centr_code having an examinee of score greater than $80.$
asked
Feb 8
in
Databases
by
jothee
Veteran
(
101k
points)

115
views
gate2001
databases
sql
normal
descriptive
+2
votes
1
answer
19
CMI2017B8
Consider the following function that takes as input a sequence $A$ of integers with n elements, $A$$\left [ A1 \right ]$, $\left [ A2 \right ], \ldots, \left [ An \right ]$and an integer $k$ and returns an integer value. The function length$(S)$ ... complexity of this algorithm in terms of the length of the input sequence $A$? Give an example of a worstcase input for this algorithm.
asked
Feb 5
in
Algorithms
by
Tesla!
Boss
(
16.5k
points)

128
views
cmi2017
algorithms
timecomplexity
descriptive
+10
votes
2
answers
20
ISI Entrance Exam MTech (CS)
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$?
asked
Apr 6, 2017
in
Graph Theory
by
Shreya Roy
Active
(
4.3k
points)

703
views
isi2016
graphtheory
trees
descriptive
+2
votes
1
answer
21
False sharing in cache Line
Here is pseudo code for a multiprocessing purpose: set_num_threads(NUM_THREADS); double sum=0.0; sum_local[NUM_THREADS]; parallel region { int this_thread_id = get_thread_number(); // returns 0 to (no_of_threads1) sum_local[this_thread_id] = 0.0; for (i ... I think frequent DRAM write back causing the problem, but not very clear, though. please explain a bit. @Arjun Sir
asked
Mar 6, 2017
in
CO & Architecture
by
Debashish Deka
Veteran
(
57.2k
points)

245
views
coandarchitecture
cachememory
nongate
descriptive
+2
votes
1
answer
22
ISI 2016 PCB C8
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
Mar 5, 2017
in
Others
by
Devasish Ghosh
Junior
(
679
points)

145
views
datastructure
engineeringmathematics
isi2016
descriptive
graphtheory
0
votes
2
answers
23
Discrete math
The following is a sequence of formula, $$\begin{align*} \begin{matrix} & 9*1+2 &= &11 \\ & 9*12+3 &= &111 \\ & 9*123+4 &= &1111 \\ & 9*1234+5 &= &11111 \\ \end{matrix} \\ \dots \dots \dots \ ... \\ \end{align*}$$ Here numbers are in base $10$. (a) Establish a formula in $\sum$ notation. (b) Generalize that formula in for any base $b$..
asked
Feb 26, 2017
in
Set Theory & Algebra
by
Debashish Deka
Veteran
(
57.2k
points)

115
views
discretemathematics
descriptive
nongate
0
votes
2
answers
24
Discrete Math
Prove or disprove: $\begin{align*} \log_8x = \frac{1}{2}.\log_{2}x \end{align*}$.
asked
Feb 25, 2017
in
Set Theory & Algebra
by
Debashish Deka
Veteran
(
57.2k
points)

106
views
discretemathematics
descriptive
nongate
0
votes
0
answers
25
Discrete math
Let $w \in \sum$$*$ be a string, with $\sum$ being the alphabet. Let $w^R$ be the reversal of string $w$, using induction prove that $(w^R)(w^R). . .(\text{for k times}) = (ww . . .(\text{for k times}))^R.$
asked
Feb 22, 2017
in
Set Theory & Algebra
by
Debashish Deka
Veteran
(
57.2k
points)

73
views
descriptive
iitg_math
discretemathematics
0
votes
2
answers
26
Discrete Math
Prove or disprove the following: for finite sets A and B, $\overline{(A  B) \cup (B  A)} = A \cap B$ . If the proposition is incorrect, do minimal modifications to the same and prove.
asked
Feb 22, 2017
in
Set Theory & Algebra
by
Debashish Deka
Veteran
(
57.2k
points)

115
views
discretemathematics
iitg_math
nongate
descriptive
0
votes
1
answer
27
Discrete math
Prove the following: $3 \;  \;\left ( a^2+b^2 \right )$ if and only if $3 \;  \;a$ and $3 \;  \;b$.
asked
Feb 22, 2017
in
Set Theory & Algebra
by
Debashish Deka
Veteran
(
57.2k
points)

106
views
discretemathematics
iitg_math
descriptive
nongate
+1
vote
2
answers
28
Stable sorting algorithms
Show that any comparison based sorting algorithm can be made stable without increasing its complexity beyond a constant factor.
asked
Feb 21, 2017
in
Algorithms
by
Debashish Deka
Veteran
(
57.2k
points)

221
views
algorithms
descriptive
timecomplexity
nongate
0
votes
1
answer
29
CMI2016B7ai
Consider the funciton $M$ defined as follows: $M(n) = \begin{cases} n10 & \text{ if } n > 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$ Compute the following: M(101)
asked
Dec 31, 2016
in
Others
by
jothee
Veteran
(
101k
points)

45
views
cmi2016
descriptive
0
votes
0
answers
30
CMI2016B7b
Consider the funciton $M$ defined as follows: $M(n) = \begin{cases} n10 & \text{ if } n > 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$ Give a constant time algorithm that computes $M(n)$ on input $n$. (A contanttime algorithm is one whose running time is independent of the input $n$)
asked
Dec 31, 2016
in
Others
by
jothee
Veteran
(
101k
points)

26
views
cmi2016
descriptive
Page:
1
2
3
4
5
6
...
18
next »
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
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Discrete Mathematics GO Classroom
Digital Logic GO Classroom
Follow @csegate
Gatecse
Recent questions tagged descriptive
Recent Blog Comments
Last week was break. Probability started this...
@Ahwan Please share ur interview experience
@Barney Full course for Gate17 in my final year.
Gr8
39,481
questions
46,655
answers
139,565
comments
57,347
users