Searching, Sorting, Hashing, Asymptotic worst case time and Space complexity, Algorithm design techniques: Greedy, Dynamic programming, and Divide‐and‐conquer, Graph search, Minimum spanning trees, Shortest paths.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2 &3&2&3&2&0&2&2&3&3&0&2.2&3
\\\hline\textbf{2 Marks Count} & 2 &3&4&4&2&4&2&3&2&3&2&2.9&4
\\\hline\textbf{Total Marks} & 6 &9&10&11&6&8&6&8&7&9&\bf{6}&\bf{8}&\bf{11}\\\hline
\end{array}}}$$

Most viewed questions in Algorithms

0 votes

3 answers

1841

Let f(x), g(x) and h(x) be function which of following statement is false?
Let $f(x),g(x)$ and $h(x)$ be functions which of the following statement is false? a). if $f(x)$ is $O(g(x))$ and $g(x)$ is $O(h(x))$ then $f(x)$ is $O(h(x))$. b). if $f(x)$ ... $(b)$ I mean according to me , option (a) is correct , right ? by the rule of transitivity . Please correct me , if I am wrong.

Let $f(x),g(x)$ and $h(x)$ be functions which of the following statement is false?a). if $f(x)$ is $O(g(x))$ and $g(x)$ is $O(h(x))$ then $f(x)$ is $O(h(x))$.b). if $f...

worst_engineer

819 views

worst_engineer asked Jan 17, 2016

2 votes

2 answers

1842

What is an Inversion ??

Payal Rastogi

818 views

Payal Rastogi asked Nov 14, 2015

0 votes

1 answer

1843

IIIT BLR TEST 1 : ALGORITHMS 1
Solve the following recursions ( in terms of Θ ). T(0) = T(1) = Θ(1) in all of the following. $T(n) = n + \frac{1}{n}\sum_{i=0}^{i=n-1}T(i)$ $T(n) = n + \frac{2}{n}\sum_{i=0}^{i=n-1}T(i)$ $T(n) = n + \frac{4}{n}\sum_{i=0}^{i=n/2}T(i)$ $T(n) = n + \frac{40}{n}\sum_{i=0}^{i=n/5}T(i)$

Solve the following recursions ( in terms of Θ ).T(0) = T(1) = Θ(1) in all of the following.$T(n) = n + \frac{1}{n}\sum_{i=0}^{i=n-1}T(i)$$T(n) = n + ...

Shaik Masthan

817 views

Shaik Masthan asked Aug 27, 2019

1 votes

1 answer

1844

Made Easy Test Series:Algorithm
Given a sorted array of distinct integer $A\left [ 1,2,....n \right ]$, the tightest upper bound to check the existence of any index $i$, for which $A[i]=i$ ... index and then checking if $A[i]=i$, but answer given as $O(log n).$Please help me out, which will be correct answer?

Given a sorted array of distinct integer $A\left [ 1,2,....n \right ]$, the tightest upper bound to check the existence of any index $i$, for which $A[i]=i$ is equal to _...

srestha

817 views

srestha asked Apr 28, 2019

0 votes

2 answers

1845

Time complexity
Find the time complexity using Master's theorem : (Also mention if Master's theorem can't be applied why not?) T(n)=2T(n/2)+nlogn

Find the time complexity using Master's theorem : (Also mention if Master's theorem can't be applied why not?)T(n)=2T(n/2)+nlogn

Soham.SR

817 views

Soham.SR asked Jul 16, 2018

1 votes

1 answer

1846

how to solve this recurrence using Recursion Tree method
T(n) = T(n-1) + n4

T(n) = T(n-1) + n4

LavTheRawkstar

817 views

LavTheRawkstar asked Feb 4, 2017

0 votes

0 answers

1847

#testbook
If G = (V,E) is a directed graph, then length of adjacency list is ______ and it requires ______ amount of memory. 1 2|E|, θ(V) 2 |E|, θ(V+E) Correct Answer 3 |E|, θ(E) 4 2|E|, θ(V+E) Shouldnt the ans be 2|E| for the length of the adjacency list as every edge would be stored twice?

If G = (V,E) is a directed graph, then length of adjacency list is ______ and it requires ______ amount of memory.12|E|, θ(V)2|E|, θ(V+E)Correct Answer3|E|, θ(E)42|E|,...

anjali007

816 views

anjali007 asked Dec 19, 2018

3 votes

3 answers

1848

Big Oh Notation

Sayan Das 1

816 views

Sayan Das 1 asked Sep 21, 2016

2 votes

2 answers

1849

what is the time complexity for the below question ?
For the below code : foo() { for(i=1;i<=n;i++) { for(j=0;j<i;j++) { for(k=0;k<j;k++) c++; } } } Here k is executing j-1 times j is executing i times and i is executing n^2 times, so first I am ... I am getting order of n^8 . But this is getting too large, I checked with an example, it is not matching,So please correct where I went wrong.

For the below code : foo() { for(i=1;i<=n;i++) { for(j=0;j<i;j++) { for(k=0;k<j;k++) c++; } } } Here k is executing j-1 times j is executing i times and i is executing n^...

radha gogia

815 views

radha gogia asked Jun 28, 2018

1 votes

1 answer

1850

verify the statment
I.The depth of a breadth-first search tree on an undirected graph G=(V,E) from an arbitrary vertex v∈V is the diameter of the graph G. (The diameter d of a graph is the smallest d such that every pair of vertices s and t have δ(s, t) ≤ d.) please veirfy this statement with explanantion and example

I.The depth of a breadth-first search tree on an undirected graph G=(V,E) from an arbitrary vertex v∈V is the diameter of the graph G. (The diameter d of a graph is the...

Akriti sood

815 views

Akriti sood asked Dec 27, 2016

3 votes

2 answers

1851

ISI2011-PCB-CS-1b
There are $n$ students of a class standing in a line. The students have to arrange themselves in ascending order on the basis of their roll numbers. This rearrangement of the line must be accomplished only by successively swapping pairs of adjacent students ... the number of swaps required. Derive an expression for the number of swaps needed by your algorithm in the worst case.

There are $n$ students of a class standing in a line. The students have to arrange themselves in ascending order on the basis of their roll numbers. This rearrangement of...

go_editor

814 views

go_editor asked Jun 3, 2016

0 votes

0 answers

1852

Tremblay Manohar
Write the set $\phi \cap \left \{ \phi \right \}$

Write the set$\phi \cap \left \{ \phi \right \}$

Tesla!

813 views

Tesla! asked Apr 2, 2017

1 votes

2 answers

1853

CMI2016-B-6
An automatic spelling checker works as follows. Given a word $w$, first check if $w$ is found in the dictionary. If $w$ is not in the dictionary, compute a dictionary entry that is close to $w$. For instance if the user types $\mathsf{ocurrance}$, the spelling checker ... alignments of $x$ and $y$. What is the running time of your algorithm (in terms of the lengths of $x$ and $y)?$

An automatic spelling checker works as follows. Given a word $w$, first check if $w$ is found in the dictionary. If $w$ is not in the dictionary, compute a dictionary ent...

go_editor

813 views

go_editor asked Dec 31, 2016

3 votes

2 answers

1854

TestBook Test Series Algo Q
Q). What is the complexity of finding the $50^{th}$ smallest elements in an already constructed binary min-heap? $\theta(1)$ $\theta(logn)$ $\theta(n)$ $\theta(nlogn)$ solution: Exact complexity would be $50logn$ for heapify when we do heap sort iteration $50$ times

Q). What is the complexity of finding the $50^{th}$ smallest elements in an already constructed binary min-heap?$\theta(1)$$\theta(logn)$$\theta(n)$$\theta(nlogn)$solutio...

Akash Kanase

813 views

Akash Kanase asked Jan 6, 2016

8 votes

3 answers

1855

GO Classes Test Series 2023 | Algorithms | Test 1 | Question: 9
Given an unsorted array of $n$ distinct elements, you want to find this set of $\log n$ elements: those at positions $1,2,4,8,16, \ldots, n/2$ if array were sorted. In other words, find the largest element, the second largest element, the ... the subarray) $\Theta(\log n)$ $\Theta(n)$ $\Theta(n \log n)$ $\Theta\left(n^{2}\right)$

Given an unsorted array of $n$ distinct elements, you want to find this set of $\log n$ elements: those at positions $1,2,4,8,16, \ldots, n/2$ if array were sorted. In ot...

GO Classes

812 views

GO Classes asked Jun 13, 2022

2 votes

1 answer

1856

TIFR CSE 2021 | Part B | Question: 15
Let $A\left [ i \right ] : i=0, 1, 2, \dots , n-1$ be an array of $n$ distinct integers. We wish to sort $A$ in ascending order. We are given that each element in the array is at a position that is at most $k$ away from its position in the sorted array, ... $t\left ( n \right ) = \Theta \left ( nk \right )$

Let $A\left [ i \right ] : i=0, 1, 2, \dots , n-1$ be an array of $n$ distinct integers. We wish to sort $A$ in ascending order. We are given that each element in the arr...

soujanyareddy13

811 views

soujanyareddy13 asked Mar 25, 2021

2 votes

0 answers

1857

max heap
The number of distinct max heap are possible with keys 1, 2, 3, 4, 5 are

The number of distinct max heap are possible with keys 1, 2, 3, 4, 5 are

rajoramanoj

811 views

rajoramanoj asked Jan 17, 2018

3 votes

2 answers

1858

GATE Overflow | Algorithms | Test 1 | Question: 2
The best known algorithm for binary to decimal conversion runs in $(n$ is the number of bits in the input number, assume MUL and ADD operations to take constant time) $\Theta(n)$ $\Theta(\log n)$ $\Theta(1)$ $\Theta\left(n^2\right)$

The best known algorithm for binary to decimal conversion runs in $(n$ is the number of bits in the input number, assume MUL and ADD operations to take constant time)$\Th...

Bikram

811 views

Bikram asked Oct 3, 2016

0 votes

0 answers

1859

Heap Smallest Element
My question is in Question like find 5th Smallest element in a heap: It requires O(logn) time if we do only Delete operation 5 Times.But what if the array contains no 5th smallest element say our array contain [1,1,1,1,1,1,1,1,1,1] now ... need to do extract min operation n number of times which would give nlogn time? Plz Clear my doubt https://gateoverflow.in/1110/gate2003-23

My question is in Question like find 5th Smallest element in a heap:It requires O(logn) time if we do only Delete operation 5 Times.But what if the array contains no 5th ...

Na462

810 views

Na462 asked Feb 17, 2018

1 votes

1 answer

1860

GATEBOOK

Niharika 1

810 views

Niharika 1 asked Sep 18, 2016

Page:

« prev
1
...
88
89
90
91
92
93
94
95
96
97
98
...
242
next »

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