Recent questions in Algorithms

0 votes

1 answer

1

What do we mean by INVERSION
I searched on internet but got noting .

asked 12 hours ago in Algorithms by Nandkishor3939 Junior (657 points) | 18 views

0 votes

0 answers

2

Complexity
An unordered list contains n distinct elements. Number of comparisons to find element larger than second minimum is O(1) O(n) None

asked 13 hours ago in Algorithms by gate_forum Active (1.2k points) | 9 views

0 votes

0 answers

3

sorted list
we are given (log m) sorted list each of size (log n) / (log m) the time complexity of merging list into single sorted list using mergesort is equal to a) O ( log m log(log n) ) b) O ( log n log(log m) ) c) O ( log m log n) d) O ( m log log n)

asked 15 hours ago in Algorithms by Rahul_Rathod_ Junior (543 points) | 4 views

0 votes

0 answers

4

mergesort
is mergesort inplace on linked list? it is not inplace on array

asked 18 hours ago in Algorithms by Rahul_Rathod_ Junior (543 points) | 15 views

0 votes

0 answers

5

Asymptotic analysis
what is the time complexities of the following code snippets. 1. k=1;i=1; while(k<=n) { i++; k=k+i; } 2. for(i=1;i<=n;++i) { for(j=1;j<n;j=j*2) c=c+1; } 3. m=pow(2,n) for(i=1;i<=n;i++) { for(j=1;j<=m;j=j*2) c=c+1; }

asked 19 hours ago in Algorithms by Iamniks4 (55 points) | 10 views

0 votes

0 answers

6

Made Easy
What are all the conditions for the degree sequence to be graphic?

asked 19 hours ago in Algorithms by gate_dreams (297 points) | 8 views

0 votes

0 answers

7

Made Easy mock test 2 gate 2019
The time and space complexity of the most efficient algorithm designed to find the kth node from the end of a linked list which has n nodes is O(1), O(1) O(n), O(1) O(n), O(n) O(n2), O(1) The answer given is d. Why is it not ... which starts after kth position. By the time last node is reached, the slow pointer will be in the kth node from end. So its only O(n).

asked 1 day ago in Algorithms by nivedha (89 points) | 31 views

0 votes

0 answers

8

Np complete
If a problem A is reduced to a problem B, where B is known to be np complete, what can we infer about A.

asked 1 day ago in Algorithms by Yumi (7 points) | 7 views

0 votes

0 answers

9

MadeEasy Test Series Full Subject Test 1

asked 2 days ago in Algorithms by Pratik Gawali Junior (827 points) | 28 views

0 votes

0 answers

10

Gateforum Test Series
Given a text array $T[1…..n]$ and a pattern array $P[1….m]$ such that T and P are character taken from alphabet $\sum$, $\sum={a,b,c,…..z}$. String matching problem is to find all the occurence of P in T. A pattern occur with shift s in T if $P[1…..m]=T[s+1,…...s+m]$. Consider $T=bacacbaacacac$ $P=cac$ The sum of the value of all s is ________

asked 3 days ago in Algorithms by Gupta731 Active (4.3k points) | 15 views

–1 vote

1 answer

11

ACE TEST SERIES ON DFS

asked 3 days ago in Algorithms by Shankar Kakde (249 points) | 21 views

0 votes

0 answers

12

ACE TEST SERIES

asked 3 days ago in Algorithms by Shankar Kakde (249 points) | 10 views

0 votes

1 answer

13

asymptotic notation
O(n) O(Log n) O(Log log n) none

asked 3 days ago in Algorithms by gate_forum Active (1.2k points) | 18 views

0 votes

1 answer

14

ACE TEST SERIES

asked 3 days ago in Algorithms by Shankar Kakde (249 points) | 12 views

0 votes

0 answers

15

toplogical sort
none

asked 3 days ago in Algorithms by gate_forum Active (1.2k points) | 12 views

0 votes

0 answers

16

old question
Can anyone give me some reference in comparing them with size and complexity and also what should be the correct answer? https://gateoverflow.in/38035/the-number-records-sorted-small-then-which-sorting-efficient

asked 3 days ago in Algorithms by Swapnil Naik Active (2.7k points) | 6 views

0 votes

0 answers

17

ME_test_series
An array A of size n is known to be sorted except for the first k elements and the last k elements, where K is a constant. Which of the following algorithms will be the best choice for sorting the array A? A.) quick sort B.) insertion sort C.) selection sort D.) bubble sort I can’t understand how can insertion sort be better in this case?

asked 3 days ago in Algorithms by Shivam Kasat Active (1.6k points) | 27 views

0 votes

0 answers

18

Madeeasy Max Heap 2019
Please explain the logic behind this shortcut and when to be used? [closed]

asked 3 days ago in Algorithms by Markzuck (393 points) | 95 views

0 votes

0 answers

19

Virtual gate test series

asked 3 days ago in Algorithms by SameekshaGupta (417 points) | 20 views

0 votes

0 answers

20

Algorithms
Is branch and bound technique part of gate syllabus ?

asked 4 days ago in Algorithms by sahil_malik (331 points) | 13 views

0 votes

0 answers

21

Algorithm analysis
Find a growth rate that cubes the run time when we double the input size. That is, if T(n) = X, then T(2n) = x^3.

asked 4 days ago in Algorithms by debanjan sarkar Active (4.1k points) | 10 views

0 votes

0 answers

22

Asymptotic notation
Let f(n) =O(n), g(n)=Ώ(n) and h(n)=Θ(n). Then g(n)+f(n).h(n) is _____? a- Ω($n^{2}$) b- Θ($n^{2}$) c-Ω(n) d-Θ(n)

asked 4 days ago in Algorithms by bts1jimin (185 points) | 23 views

0 votes

0 answers

23

algorithms
what will be best case running time for bubble sort ?? is it depends on input sequence

asked 5 days ago in Algorithms by royal shubham (471 points) | 18 views

0 votes

0 answers

24

Ace Academy Test series
Consider the multi selection problem: Given a set 'S' of n elements and set 'K' of 'r' ranks $K_{1}$, $K_{2}$, ....$K_{r}$. Find the $K_1^{th}$, $K_2^{th}$, ....$K_r^{th}$ ... The time complexity of the most efficient algorithm to solve this problem is A. O(n.r) B. O($n^2$.log r) C. O(n) D. O(n.log r)

asked 5 days ago in Algorithms by Chaitrasj Junior (799 points) | 21 views

0 votes

0 answers

25

virtual gate
https://gateoverflow.in/285669/test-series?show=292883#c292883

asked 5 days ago in Algorithms by Abhisek Tiwari 4 Active (3.5k points) | 26 views

0 votes

0 answers

26

Time complexity1
Insertion sort using binary search instead of linear serach 1.Worst case Time O(n*n) 2.Best Case Time O(n) 3.Average case O(n*n) am i correct? [closed]

asked 6 days ago in Algorithms by Abhisek Tiwari 4 Active (3.5k points) | 18 views

0 votes

0 answers

27

general doubt
for directed weighted graph with edge weight non negative whether dijakstra will give correct result in every case ???

asked 6 days ago in Algorithms by ishitasinha (15 points) | 21 views

0 votes

1 answer

28

Algorithm
What is the right answer?

asked 6 days ago in Algorithms by Anuj1995 (297 points) | 32 views

0 votes

1 answer

29

ME TEST SERIES

asked Jan 10 in Algorithms by Shankar Kakde (249 points) | 28 views

0 votes

2 answers

30

ME TEST SERIES

asked Jan 10 in Algorithms by Shankar Kakde (249 points) | 24 views

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

Recent Posts

Recent Blog Comments