Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Algorithms
Recent questions tagged algorithms
0
votes
1
answer
151
Gate @Zeal
Let $'n'$ is an odd number and 1. $X$ be the minimum number of comparisons required to find the minimum and the maximum of 'n' numbers 2. $Y$ be the minimum number of comparisons required to find the minimum and the maximum of 'n+1' numbers. Then which of the following ... $Y = \left ( \frac{3(n-2)}{2} + 1 \right )$
Let $'n'$ is an odd number and 1. $X$ be the minimum number of comparisons required to find the minimum and the maximum of 'n' numbers 2. $Y$ be the minimum number of com...
Rahhul A
322
views
Rahhul A
asked
Aug 1, 2023
Algorithms
discrete-mathematics
algorithms
+
–
0
votes
1
answer
152
UGC NET CSE | June 2023 | Part 2: 21
Consider the following statements about heap sort algorithm: The MAX-HEAPIFY procedure which runs in $\mathrm{O} \lg (n)$ time, is the key to maintaining the max heap property The BUILD-MAX-HEAP procedure, which runs in $\mathrm{O} \lg (n)$ time, produces max-heap from an unordered ... $\text{A, B}$ only $\text{A, C}$ only $\text{B, D}$ only $\text{A, B, C, D}$
Consider the following statements about heap sort algorithm:The MAX-HEAPIFY procedure which runs in $\mathrm{O} \lg (n)$ time, is the key to maintaining the max heap prop...
admin
428
views
admin
asked
Jul 28, 2023
Others
ugcnetcse-june2023-paper2
binary-heap
algorithms
+
–
0
votes
1
answer
153
Algorithm Array Time complexity on splitting
If an array is split in the form of increasing and decreasing order then what is TC to find minimum element in the array?
If an array is split in the form of increasing and decreasing order then what is TC to find minimum element in the array?
NeelParekh
281
views
NeelParekh
asked
Jul 27, 2023
Algorithms
algorithms
time-complexity
+
–
0
votes
0
answers
154
Made easy booklet
Çșȇ ʛấẗẻ
177
views
Çșȇ ʛấẗẻ
asked
Jul 19, 2023
Algorithms
made-easy-booklet
data-structures
algorithms
+
–
0
votes
1
answer
155
Ace textbook
What is the time complexity of best algorithm that decides whether a given directed graph represented as adjacency Matrix contains a sink or not ? (a)O(V^2) (b)O(VlogV) (c)O(V^2logV) (d)O(V)
What is the time complexity of best algorithm that decides whether a given directedgraph represented as adjacency Matrix contains a sink or not ?(a)O(V^2)(b)O(VlogV)(c)O(...
Aniket1710
341
views
Aniket1710
asked
Jul 11, 2023
Algorithms
algorithms
time-complexity
matrix
+
–
0
votes
5
answers
156
#cpcb
Select the function(s) which is/are $O(n log n)$: $2n\log n+3n$ $10n\log n^2$ $1+\sqrt n$ $2n^2-3n$
Select the function(s) which is/are $O(n log n)$:$2n\log n+3n$$10n\log n^2$$1+\sqrt n$$2n^2-3n$
amit166
520
views
amit166
asked
Jun 30, 2023
Algorithms
algorithms
asymptotic-notation
+
–
0
votes
2
answers
157
SCIENTIST B CPCB 2023 CSE
Consider a graph with n vertices that is a collection of k disjoint trees, where 𝑛 > 𝑘 > 1 . How many edges does this graph have? (A) n-1 (B) k (n-1) (C) n-k (D) n-k-1
Consider a graph with n vertices that is a collection of k disjoint trees, where 𝑛 𝑘 1 . How many edges does this graph have?(A) n-1 (B) k (n-1) (C) n-k (D) n-k-1...
Jai Singh
467
views
Jai Singh
asked
Jun 26, 2023
CO and Architecture
algorithms
graph-theory
graph-algorithms
graph-connectivity
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
118
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register