Register
Webpage for Algorithms

Recent questions tagged algorithms

0 votes
1 answer
91
TS
$\text{Please explain True or False and Why ?}$ $\text{1. f(n) = O(f(n/2))}$ $\text{2. f(n) = O($f(n)^{2}$) }$
$\text{Please explain True or False and Why ?}$$\text{1. f(n) = O(f(n/2))}$$\text{2. f(n) = O($f(n)^{2}$) }$
User Avatar
0 votes
0 answers
94
Algorithm Madeeasy Workbook
As we have to select maximal set of “non overlapping” activities. So like job scheduling algo of greedy we can solve it. So according to that complexity must be O(n logn). But ans is (b). Anyone please explain.
As we have to select maximal set of “non overlapping” activities. So like job scheduling algo of greedy we can solve it. So according to that complexity must be O(n l...
User Avatar
0 votes
0 answers
95
Michael Sipster Decidability Problems
Prove L = {F | F is a boolean formula and F evaluates to true on every asignment" is decidable (include algorithm and running time in big o notation)
Prove L = {F | F is a boolean formula and F evaluates to true on every asignment" is decidable (include algorithm and running time in big o notation)
User Avatar
0 votes
1 answer
96
Consider the following algorithm for Build-Max-heap and the given array A=[ 47, 96, 35, 54, 77, 65, 83]. Run this algorithm on the given array and redraw the heap and the heap- array whenever the swapping takes place. dry run this statement
Consider the following algorithm for Build-Max-heap and the given array A=[ 47,96, 35, 54, 77, 65, 83]. Run this algorithm on the given array and redraw the heap and the ...
User Avatar
2 votes
1 answer
97
#dsa #DataScienceAndAI #Python #Algorithms #DataStructures
When it comes to Gate Data Science and AI, what language will the DSA questions be asked in - Python or C language?
When it comes to Gate Data Science and AI, what language will the DSA questions be asked in - Python or C language?
User Avatar
0 votes
0 answers
98
Self Doubt
It is always true that Recursive code is easier to debug?? If yes then why?? please give full explanation.
It is always true that Recursive code is easier to debug?? If yes then why?? please give full explanation.
User Avatar
0 votes
1 answer
104
data structure
Consider a lower triangular matrix stored in row major order as p[-25 - - + 749][-25 - - - + 749] with base address = 6800, size of each element = 6 byte. Find the value at location p[658][596]?
Consider a lower triangular matrix stored in row major order as p[-25 - - + 749][-25 - - - + 749] with base address = 6800, size of each element = 6 byte. Find the value ...
User Avatar
Page: