Recent questions in Algorithms

0 votes

0 answers

1

made easy cbt
how we can solve this type of question? [closed]

asked 5 hours ago in Algorithms by pream sagar Active (1.2k points) | 15 views

0 votes

0 answers

2

array

asked 8 hours ago in Algorithms by bts1jimin (239 points) | 9 views

0 votes

0 answers

3

Time complexity
Time complexity of second part?

asked 9 hours ago in Algorithms by bts1jimin (239 points) | 6 views

0 votes

1 answer

4

A Different Kind of Question on Longest Common Subsequence
Consider two strings A = "anandarmy" and B = "algorithms". Let ‘y’ be the length of the longest common subsequence (not necessarily contiguous) between A and B and let ‘x’ be the number of such longest common subsequences between A and B. Then 2x+3y = _________.

asked 10 hours ago in Algorithms by gmrishikumar Junior (933 points) | 9 views

0 votes

0 answers

5

Dynamic programming
My answer came out to be 13: because when we will compute T(13) { as we are using Dynamic programming , it will have to compute value of T(12),T(11),…...T(2) only once(as it will store it and reuse it) so the stack size will be 1 (for T(13))+11 (for T(12),T(11),…...T(2)) = 12…...(48/4) } will any one help me out

asked 12 hours ago in Algorithms by Nandkishor3939 Junior (847 points) | 17 views

0 votes

0 answers

6

Merge sort
What is the extra memory needed for merge sort: 1] In case of Iterative merge sort.(DS:Array) 2]In case of Recursive merge sort.(DS:Array) 3] In case of Iterative merge sort.(DS:Linked List) 4]In case of Recursive merge sort.(DS:Linked List)

asked 1 day ago in Algorithms by Nandkishor3939 Junior (847 points) | 21 views

0 votes

0 answers

7

made easy test
solution provided by made is this Doubt is if we take 421 or 423 as first insertion then rotation will happen and 2 will become root then why they are counting possibilities 421 and 428. Please clear my doubt

asked 1 day ago in Algorithms by Harshit Bajpai (327 points) | 16 views

0 votes

0 answers

8

made easy test
what is question asking for. Can any one explain the question bit

asked 1 day ago in Algorithms by Harshit Bajpai (327 points) | 24 views

0 votes

0 answers

9

made easy test
solution is provided that my doubt is can we find 3rd or 4th (and so on) smallest in 3 or 4 comparison in min heap.

asked 1 day ago in Algorithms by Harshit Bajpai (327 points) | 14 views

0 votes

0 answers

10

made easy test
what is 2nd statement want to ask about. please elaborate I could not understand 2nd statement

asked 1 day ago in Algorithms by Harshit Bajpai (327 points) | 12 views

0 votes

0 answers

11

made easy test
I could not understand the meaning of question. please elaborate it and provide solution.

asked 1 day ago in Algorithms by Harshit Bajpai (327 points) | 5 views

0 votes

0 answers

12

made easy test
Consider a scenario of modified quick sort, where we have given an input sorted array A[1 .. . n], all elements of array are distinct and n >=3. Pivot is the median of set of 3 elements [First element, middle element, and last element]. What will be worst case time complexity of modified quick sort? a.O($n^{2}$) b.O(nlogn) c.O($n^{2}$logn) d.O(nloglogn)

asked 1 day ago in Algorithms by newdreamz a1-z0 Active (1.4k points) | 9 views

0 votes

0 answers

13

SELF doubt
Which of the following statements is /are FALSE? I.Given a graph where all edge weights are strictly greater than -3, a shortest path between vertices s and t can be found by adding 3 to the weight of each edge and running Dijkstra's algorithm from s. ... having no incoming edges, a depth-first search from s will always generate a DFS tree containing a longest simple path in the graph.

asked 1 day ago in Algorithms by bhanu kumar 1 Junior (743 points) | 12 views

0 votes

1 answer

14

Recurrence relation and Time Complexity
What is the time complexity of the following recurrence relation and step to derive the same $T(n) = T(\sqrt{n}) + log(logn)$ [closed]

asked 2 days ago in Algorithms by VikramRB (189 points) | 32 views

0 votes

1 answer

15

Time complexity

asked 2 days ago in Algorithms by Rackson Active (1.8k points) | 25 views

0 votes

0 answers

16

Bellman ford for disconnected graph
True of False Bellman ford algorithm correctly computes shortest path in graph with no negative edges //graph can be disconnected as well.

asked 2 days ago in Algorithms by bts1jimin (239 points) | 7 views

0 votes

0 answers

17

LCS Algorithm
Y comes out to be 3 and the LCS is “arm”. Shouldn't x be 1? I know there are multiple “arm” should I consider all of them? P.S: My answer comes out to be 11. Correct me if I am wrong?

asked 2 days ago in Algorithms by Anilava Kundu (487 points) | 13 views

0 votes

1 answer

18

What is the complexity of T(n) =T(sqrt(n)) +loglogn

asked 2 days ago in Algorithms by Anitadalla (11 points) | 17 views

0 votes

1 answer

19

ME TEST SERIES QUESTION ON TIME COMPLEXITY

asked 2 days ago in Algorithms by Shankar Kakde (293 points) | 28 views

+1 vote

1 answer

20

ME Test series Question on AVL Tree

asked 3 days ago in Algorithms by Shankar Kakde (293 points) | 38 views

0 votes

0 answers

21

ME Test series question
Recall That A List Of Elements Is Called A Binary Min-heap If In Its Tree Representation, The Root Is The Smallest In Magnitude Compared To Its Left And Right Subtrees. Out Of All The Possible Permutations Of {1, 2, 3, 4, 5, 6, 7}, A Permutation Is Picked At Random. The Probability That The Permutation Satisfies The Min-heap Property Is ________. (Upto 3 Decimal Places)

asked 3 days ago in Algorithms by Shankar Kakde (293 points) | 18 views

0 votes

1 answer

22

Self Doubt
The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________. Ans: $\frac{8}{3}$

asked 3 days ago in Algorithms by kumar.dilip Active (4.8k points) | 44 views

0 votes

0 answers

23

Self doubts
T(n)=T(√n) + n, n>2 =1 , n<= 2 Solution = ?

asked 3 days ago in Algorithms by Daulat48 (11 points) | 29 views

0 votes

0 answers

24

Time complexity
device a binary search algorithm which splits the set not into 2 sets of almost equal size but into 2 sets of size one third and two third. what is the time complexity of the algorithm? a)theta(nlogn) b)theta(n) c)theta(logn) d)theta(n^2)

asked 3 days ago in Algorithms by bhautikng143 (33 points) | 7 views

0 votes

1 answer

25

Is there any good content available online for OPTIMAL BINARY SEARCH TREE? Preferably Videos.

asked 3 days ago in Algorithms by `JEET Active (3.3k points) | 9 views

0 votes

0 answers

26

#Ace_Test_series.
Consider the problem of construction of minimum cost binary search tree for a given set of ‘n’ identifiers with their respective probabilities. The time complexity of the most efficient algorithm of the same is (A) $O(n^2)$ (B) $O(n^3)$ © $O(nlogn)$ (D) $O(n^3logn)$

asked 3 days ago in Algorithms by `JEET Active (3.3k points) | 8 views

0 votes

1 answer

27

ME mock1
Consider a binary tree, where for every node P – Q ≤ 2, where P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such a binary tree of height h =4 will be 6 8 9 None of these

asked 3 days ago in Algorithms by balchandar reddy san Active (1.1k points) | 8 views

0 votes

0 answers

28

#ACE_Test_Series
Consider the following instance of OBST (Optimal Binary search Tree) problem. N = 4; <$a_1$, $a_2$, $a_3$, $a_4$> = <do, if, int, while> P(1...4) = <3,3,1,1>; Q(0...4) = <2,3,1,1,1> The cost of OBST is________.

asked 3 days ago in Algorithms by `JEET Active (3.3k points) | 42 views

0 votes

0 answers

29

Self Doubt Algorithms
When relative ordering of equal keys is preserved after sorting then it is called stable. Quick sort and heap sort is not a stable sorting algorithm . Doubt---IS Selection sort not a stable sorting algorithm ?

asked 3 days ago in Algorithms by Prince Sindhiya Loyal (6.1k points) | 6 views

0 votes

0 answers

30

Algorithm questions on graphs
let Gn be a complete graph on n vertices where n>2 such that each vertex is labeled by a distinct number 1,2, 3, 4, …, n , and each edge is labeled by the sum of its endpoint labels. Let f(Gn) be the minimum sum of edge labels in any path that touches every vertex in exactly once. How many values of satisfy f(Gn)2013 (mod n) ?___________

asked 3 days ago in Algorithms by Iamniks4 (59 points) | 6 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