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 algorithmdesigntechniques
0
votes
0
answers
1
Cormen Edition 3 Exercise 2.4 Question 4 (Page No. 42)
Give an algorithm that determines the number of inversions in any permutation on $n$ elements in $\Theta (n\ lg\ n)$ worstcase time. (Hint: Modify merge sort.)
asked
Jun 26
in
Algorithms
by
akash.dinkar12
Boss
(
41.9k
points)

15
views
cormen
algorithms
algorithmdesigntechniques
inversions
descriptive
0
votes
1
answer
2
Cormen Edition 3 Exercise 2.3 Question 7 (Page No. 39)
Describe a $\Theta(n\ lg\ n)$ time algorithm that, given a set $S$ of $n$ integers and another integer $x$, determines whether or not there exist two elements in $S$ whose sum is exactly $x$.
asked
Jun 26
in
Algorithms
by
akash.dinkar12
Boss
(
41.9k
points)

11
views
cormen
algorithms
algorithmdesigntechniques
descriptive
difficult
+20
votes
5
answers
3
GATE2017105
Consider the following table: ... $(P) \leftrightarrow (i), (Q) \leftrightarrow (ii), (R) \leftrightarrow (iii)$
asked
Feb 14, 2017
in
Algorithms
by
khushtak
Loyal
(
7k
points)

2.8k
views
gate20171
algorithms
algorithmdesigntechniques
+3
votes
1
answer
4
GATE199012b
Consider the following problem. Given $n$ positive integers $a_{1}, a_{2}\dots a_n,$ it is required to partition them in to two parts $A$ and $B$ such that $\sum_{i \in A} a_{i}  \sum_{i \in B} a_{i}$ is minimised Consider a greedy ... in that part whose sum in smaller at that step. Give an example with $n=5$ for which the solution produced by the greedy algorithm is not optimal.
asked
Nov 25, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.2k
points)

203
views
gate1990
descriptive
algorithms
algorithmdesigntechniques
+7
votes
1
answer
5
GATE19902vii
Match the pairs in the following questions: ...
asked
Nov 19, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.2k
points)

715
views
gate1990
matchthefollowing
algorithms
algorithmdesigntechniques
+19
votes
3
answers
6
GATE2015236
Given below are some algorithms, and some algorithm design paradigms. ... $\text{1iii, 2ii, 3i, 4iv}$ $\text{1iii, 2ii, 3i, 4v}$
asked
Feb 12, 2015
in
Algorithms
by
jothee
Veteran
(
105k
points)

2k
views
gate20152
algorithms
easy
algorithmdesigntechniques
+21
votes
4
answers
7
GATE201516
Match the following: ... $\text{Pii, Qiii, Riv, Si}$ $\text{Pii, Qi, Riii, Siv}$
asked
Feb 12, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
30.2k
points)

1.7k
views
gate20151
algorithms
normal
algorithmdesigntechniques
+19
votes
3
answers
8
GATE19971.5
The correct matching for the following pairs is ... $\text{A3 B4 C1 D2}$ $\text{A3 B4 C2 D1}$ $\text{A4 B1 C2 D3}$
asked
Sep 29, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.2k
points)

1.3k
views
gate1997
algorithms
normal
algorithmdesigntechniques
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
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged algorithmdesigntechniques
Recent Blog Comments
Even In 2019 my 16 questions goes for negative...
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
50,647
questions
56,497
answers
195,489
comments
100,811
users