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 answered questions in Algorithms

0 votes

1 answer

1801

algo questions
in case of comparision sort max possible is n(n-1)/2

in case of comparision sort max possible is n(n-1)/2

I_am_winner

558 views

I_am_winner asked Nov 6, 2018

1 votes

1 answer

1802

Please Explain also..
. Assume an array A[1….n] has n-elements, and every element of an array is less than or equal to n. An element is said to be majority element, if it occurred in more than n/2 positions of an array. What is the best time complexity to check whether the majority of elements exist or not? (a) O (log n) (b) O (n) (c) O (n log n) (d) O (n2)

. Assume an array A[1….n] has n-elements, and every element of an array is less than or equal to n. An element is said to be majority element, if it occurred in more th...

Mak Indus

1.7k views

Mak Indus asked Nov 6, 2018

0 votes

1 answer

1803

Gate Forum

nag.swarna

670 views

nag.swarna asked Nov 6, 2018

0 votes

1 answer

1804

Please Explain with exapmle
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 (a) Half of the product of the 3 consecutive integers ... the product of the 3 consecutive integers (c) One-sixth of the product of the 3 consecutive integers (d) None of the above Solution: Option (c)

Consider the following pseudo code. What is the total number of multiplications to be performed?D = 2for i = 1 to n do for j = i to n do for k = j + 1 to n do ...

Mak Indus

414 views

Mak Indus asked Nov 6, 2018

0 votes

1 answer

1805

shortest path
Can shortest path contains positive weight cycle???Please explain with examples.

Can shortest path contains positive weight cycle???Please explain with examples.

saumya mishra

278 views

saumya mishra asked Nov 6, 2018

0 votes

1 answer

1806

Please solve this recurence relation.... How we got option--a.
The recurrence equation: T(1) = 1 T(n) = 2T(n - 1) + n, n ≥ 2 evaluates to (a) 2n + 1 - n – 2 (b) 2n – n (c) 2n + 1 – 2n – 2 (d) 2n – n Solution: Option (a)

The recurrence equation:T(1) = 1T(n) = 2T(n - 1) + n, n ≥ 2evaluates to(a) 2n + 1 - n – 2 (b) 2n – n(c) 2...

Mak Indus

781 views

Mak Indus asked Nov 5, 2018

0 votes

1 answer

1807

GateForum
Can anyone please explain

Can anyone please explain

nag.swarna

578 views

nag.swarna asked Nov 4, 2018

0 votes

1 answer

1808

made easy test series

Chetan28kumar

699 views

Chetan28kumar asked Nov 4, 2018

0 votes

1 answer

1809

merge sort
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ? explain with example

given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ?explain with example

suneetha

437 views

suneetha asked Nov 3, 2018

0 votes

1 answer

1810

time complexity of recursive program
What is the time complexity of the following code snippet? Assume "statement" takes $O(1)$ time. int x=0; int A(n) { statement; if(n==1)return 1; else { x + = 4A(n/2)+n^{2} return (x); } } $A)\theta(n^{2}logn)$ $B)\theta(logn)$ $C)\theta(n^{2})$ $D)\theta(nlogn)$

What is the time complexity of the following code snippet? Assume "statement" takes $O(1)$ time.int x=0; int A(n) { statement; if(n==1)return 1; else { ...

Lakshman Bhaiya

1.6k views

Lakshman Bhaiya asked Nov 3, 2018

0 votes

1 answer

1811

Time complexity of the program
Consider the following function(n) { val=0; for i=1 to n { if(n<=10000) for j=1 to n for k=1 to n val = val + 1; else for j=1 to n val = val + 1; } } The running time of the above function can best be described by $T(n)=$____________ $A)\theta(n^{3}) $ $B)\theta(n^{2})$ $C)\theta(n)$ $D)\theta(1)$

Consider the following function(n) { val=0; for i=1 to n { if(n<=10000) for j=1 to n for k=1 to n val = val + 1; else for j=1 to n val = val + 1; } } The running time of ...

Lakshman Bhaiya

725 views

Lakshman Bhaiya asked Nov 3, 2018

0 votes

1 answer

1812

recurrence equation:
T(1) = 1 T(n) = 2T(n - 1) + n, n ≥ 2 evaluates to (a) 2n + 1 - n – 2 (b) 2n – n (c) 2n + 1 – 2n – 2 (d) 2n – n HOW TO EVALUATES USING MASTER THEOREM

T(1) = 1 T(n) = 2T(n - 1) + n, n ≥ 2 evaluates to(a) 2n + 1 - n – 2(b) 2n – n(c) 2n + 1 – 2n – 2(d) 2n – n HOW TO EVALUATES USING MASTER THEOREM

altamash

400 views

altamash asked Nov 2, 2018

0 votes

1 answer

1813

Recurrence Relations
Given $T(n)=T(\frac{n}{4})+T(\frac{n}{2})+n^{2},$ then $A)T(n)=\theta(n^{3})$ $B)T(n)=\theta(n^{2}logn)$ $C)T(n)=\theta(n^{2})$ $D)T(n)=\theta(n^{3}logn)$

Given $T(n)=T(\frac{n}{4})+T(\frac{n}{2})+n^{2},$ then$A)T(n)=\theta(n^{3})$ $B)T(n)=\theta(n^{2}logn)$ $C)T(n)=\theta(n^{2})$ ...

Lakshman Bhaiya

423 views

Lakshman Bhaiya asked Nov 1, 2018

1 votes

1 answer

1814

Asymptotic Notations with condition
Identify the FALSE statement: $A)$ $f(n)=\theta(f(\frac{n}{2})$ $implies$ $f(n^{2})=\theta(f(\frac{n^{2}}{2}))$ $B)$ $f(n)=O(g(n))$ $implies$ $log(f(n))=O(log(g(n)))$ where $n\geq2$ $C)$ $f(n)=O(g(n))$ $implies$ $2^{f(n)}=O(2^{g(n)})$ $D)$ $f(n)+g(n)=\theta(Max(f(n),g(n)))$

Identify the FALSE statement:$A)$ $f(n)=\theta(f(\frac{n}{2})$ $implies$ $f(n^{2})=\theta(f(\frac{n^{2}}{2}))$$B)$ $f(n)=O(g(n))$ $implies$ $log(f(n))=O(log(g(n)))$ w...

Lakshman Bhaiya

655 views

Lakshman Bhaiya asked Nov 1, 2018

0 votes

1 answer

1815

Self doubt on sorting
$(1)$Give $"logn"$ Sorted lists each of size $"\frac{n}{logn}",$what is the total time required to merge them into one single list? $(2)"n"$ strings each of length $"n"$ are given them, what is the time ... $O(n)$ time algorithm.What is the worst case time complexity of quicksort?

$(1)$Give $"logn"$ Sorted lists each of size $"\frac{n}{logn}",$what is the total time required to merge them into one single list?$(2)"n"$ strings each of length $"n"$ a...

Lakshman Bhaiya

830 views

Lakshman Bhaiya asked Nov 1, 2018

0 votes

1 answer

1816

Karumanchi
what is the time complexity of function(int n) { if(n<=1) return; for(int i=1; i<n; i++) { printf("*"); } function(0.8n); } i'm getting O(nlogn base 5/4) using the recurrence relation method but in the book it's given O(n) $T(n)=T(\frac{4n}{5})+O(n)$

what is the time complexity offunction(int n){ if(n<=1) return; for(int i=1; i<n; i++) { printf("*"); } ...

aditi19

1.2k views

aditi19 asked Oct 31, 2018

0 votes

1 answer

1817

Analysis of algorithms of recurrence relation
I want to learn to find time complexity of the recurrence relation of an algorithm. Please suggest some good links or any gatetoverflow imp questions links to look as examples . Thanks

I want to learn to find time complexity of the recurrence relation of an algorithm.Please suggest some good links or any gatetoverflow imp questions links to look as exam...

Mayankprakash

875 views

Mayankprakash asked Oct 31, 2018

0 votes

1 answer

1818

time complexity
for(i=1;i<=n;++i) { j=1; while(j<=n) j=2*j; for(k=1;k<=n;++k) c=c+1; } then what is the time complexity will be?

for(i=1;i<=n;++i){j=1;while(j<=n)j=2*j;for(k=1;k<=n;++k)c=c+1;}then what is the time complexity will be?

suneetha

439 views

suneetha asked Oct 30, 2018

1 votes

1 answer

1819

Made easy test series

mitesh kumar

629 views

mitesh kumar asked Oct 29, 2018

0 votes

1 answer

1820

asymptotic notations
√logx = O(loglogx) is it true or false? and explain why?

√logx = O(loglogx) is it true or false?and explain why?

suneetha

311 views

suneetha asked Oct 29, 2018

Page:

« prev
1
...
86
87
88
89
90
91
92
93
94
95
96
...
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