Recent questions in Algorithms

0 votes

1 answer

1

asked 13 hours ago in Algorithms by atul_21 (49 points) | 9 views

0 votes

1 answer

2

Test Series
Consider the following function Worst case complexity of fun() ?

asked 1 day ago in Algorithms by atul_21 (49 points) | 32 views

0 votes

3 answers

3

Time complexity of quick sort when we take pivot as the middle element

asked 1 day ago in Algorithms by Swati verma (17 points) | 22 views

0 votes

1 answer

4

Finding the second element neither minimum nor maximum

asked 1 day ago in Algorithms by gari (83 points) | 40 views

+1 vote

1 answer

5

gate 2013
The number of elements that can be sorted in Θ(logn) time using heap sort is A) Θ(1) (B) Θ(sqrt(logn)) (C) Θ(Log n/(Log Log n)) (d) Θ(Log n)

asked 1 day ago in Algorithms by Nandini 1 (33 points) | 28 views

0 votes

0 answers

6

gate 2013
1) What is the return value of f(p, p) if the value of p is initialized to 5 before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f(int &x, int c) { c = c - 1; if (c == 0) return 1; x = x + 1; return f(x, c) * x; } (A) 3024 (B) 6561 (C) 55440 (D) 161051

asked 1 day ago in Algorithms by Nandini 1 (33 points) | 21 views

0 votes

1 answer

7

P and NP
P and NP concepts are there in gate syllabus?????????????????????????????????????????????

asked 1 day ago in Algorithms by akankshadewangan24 Active (1.5k points) | 23 views

+1 vote

1 answer

8

Merge Sort Comparisons
Q . In the standard merge sort algorithm on a list of size n, what is the maximum number of times an item can be compared? a)2 b)logn c)n-1 d)NOT My doubt is here ,Are we considering a specific Item throughout our Analysis.?

asked 2 days ago in Algorithms by imamitk9 (51 points) | 23 views

0 votes

1 answer

9

polynomial
The minimum number of arithmetic operations required to evaluate the polynomial P(X) = X5 + 4X3 + 6X + 5 for a given value of X using only one temporary variable. (A) 6 (B) 7 (C) 8 (D) 9

asked 2 days ago in Algorithms by Nandini 1 (33 points) | 16 views

+1 vote

1 answer

10

#MST #GREEDY ALGO
Consider the following statements I. Let T be a minimum spanning tree of a graph G.Then for any two vertices u and v the path from u to v in T is the shortest path from u to v in the graph G II.Suppose that average edge weight for a graph ... in graph G. which of the above statements are true ? A)Only I B)Only II C)both I and II D)None of these

asked 3 days ago in Algorithms by junaid ahmad Active (1.4k points) | 23 views

0 votes

1 answer

11

algorithm
is sum of subset problem is there in the gate cse syllabus ?

asked 3 days ago in Algorithms by akankshadewangan24 Active (1.5k points) | 19 views

0 votes

1 answer

12

Hashing
Given the input sequence {11, 33, 43, 99, 34, 79, 19} and hash table of size 10 with the hash function h(k) = k mod 10. If hash table uses quadratic probing, the number of collisions occurred while mapping the given sequence is ______.

asked 3 days ago in Algorithms by Abhisek Saha (41 points) | 16 views

0 votes

1 answer

13

Loop Invariant -CLR
What is loop invariant in general term ? PS: Insertion Sort has loop invariant . We have three things in loop invariant : a. Initialization b.Maintenance c.Termination

asked 3 days ago in Algorithms by ashwina (351 points) | 23 views

0 votes

1 answer

14

program
main() { int m,row, col; int *ptr ,sum = 0 ; int arr[2][2][2] ={1,2,3,4,5,6,7,8}; int(*p)[2][2] ; p = arr; for(m=0;m<2;m++) 1 { ptr = p+m; for(row= 0 ;row<2;row=row+2) { ptr = ptr + row ; ... a diagram how it is processing morever , at ptr = p + m , when control go here ptr stores 1 , my question is ptr should hold address because its a pointer , thanks

asked 4 days ago in Algorithms by Sumit Goyal (185 points) | 15 views

0 votes

1 answer

15

Asymptotic Notation
Time Complexity of T(n) = 2T(n-1)+n by using substitution method

asked 5 days ago in Algorithms by Manish Kumar 14 (11 points) | 32 views

0 votes

1 answer

16

i read string constant cannot be modified here it gets modified whyyyy

asked 5 days ago in Algorithms by Sumit Goyal (185 points) | 14 views

+3 votes

1 answer

17

Time Complexity for Recurrence relation

asked 6 days ago in Algorithms by Ashish Sharma 3 (55 points) | 50 views

0 votes

1 answer

18

Algorithm graph
Do the sum of forward edge,backward edges,and cross edges remains same in the graph??

asked 6 days ago in Algorithms by RiteshSingh (153 points) | 19 views

0 votes

0 answers

19

algorithm
for (int i = 1; i <=m; i += c) { ---do something ---} for (int i = 1; i <=n; i += c) { ---do something --- } What will the the tiem complexity of given code pseudococde? A. O (max(m,n)) B. O(min(m,n)) C. O( m+n) D. O(mn) WHICH IS correct A or C [closed]

asked 6 days ago in Algorithms by Sumit Goyal (185 points) | 35 views

+1 vote

3 answers

20

algorithm
sum = 0; for( i = 0; i < n; i++) for( j = 0; j < i*i; j++) for( k = 0; k < j; k++) sum++; how to solve this :( help someone time complexity = o(n^5 ) how ??

asked 6 days ago in Algorithms by Sumit Goyal (185 points) | 59 views

0 votes

1 answer

21

Time complexity
Please provide me how to get time complexity concepts.... ND the question related to time complexity analysis asked in gate

asked Jun 15 in Algorithms by Swati verma (17 points) | 30 views

+1 vote

2 answers

22

algorithm
sum = 0; for( i = 0; i < n; i++) for( j = 0; j < i*i; j++) for( k = 0; k < j; k++) sum++; its time complexity should be o(n^3) 1^2 + 2^2 + ------------------------------+ n^2 = n(n+1)(2n+1)/6 = o(n^3) but answer given is o(n^5) why ?

asked Jun 15 in Algorithms by Sumit Goyal (185 points) | 39 views

0 votes

1 answer

23

complexity

asked Jun 15 in Algorithms by Sumit Goyal (185 points) | 24 views

0 votes

0 answers

24

pointers
not able to solve complex pointers question what to do , my friend said to join gate overflow , hope i get some good suggestions :(

asked Jun 15 in Algorithms by anonymous | 19 views

+1 vote

2 answers

25

for(i=n/2;i<=n;++i)
i read time taken loop will run is o(n/2) but if n=8 loop becomes for(i=4;i<=8;++i) it print 4,5,6,7,8 , so it runs 5 times then how n/2 can be running time please help :

asked Jun 15 in Algorithms by Sumit Goyal (185 points) | 30 views

0 votes

1 answer

26

how many times loop will run for(i=0;i<n;++i) some people say it runs n+1 time

asked Jun 15 in Algorithms by Sumit Goyal (185 points) | 18 views

0 votes

2 answers

27

geeksforgeeks
Which of the following is true? (GATE CS 2000) (a) h(n) is 0(f(n)) (b) h(n) is 0(g(n)) (c) g(n) is not 0(f(n)) (d) f(n) is 0(g(n))

asked Jun 14 in Algorithms by Bhavana Giri 10 (23 points) | 30 views

0 votes

1 answer

28

geeksforgeeks
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort? A N(logN base 3) B N(logN base 2/3) C N(logN base 1/3) D N(logN base 3/2)

asked Jun 14 in Algorithms by Bhavana Giri 10 (23 points) | 14 views

+1 vote

1 answer

29

Time complexity of fibonacci series

asked Jun 13 in Algorithms by K Praveen Kumar (35 points) | 50 views

0 votes

1 answer

30

DSSB_2017
A sorting algorithm is called stable if 1.It takes O(n log n) time 2.It maintains relative order of occurrence of non-distinct elements 3.It uses divide and conquer paradigm 4.It takes linear time

asked Jun 13 in Algorithms by Harikesh Kumar (121 points) | 22 views

Recent questions in Algorithms

Recent Posts

Recent Blog Comments