MADEEASY TESTT SERIES

eyeamgj asked Nov 19, 2018 • retagged Jun 14, 2022 by Arjun

278 views

0 votes

Algorithms
time-complexity
algorithm-design

+ –

eyeamgj asked Nov 19, 2018 • retagged Jun 14, 2022 by Arjun

eyeamgj

278 views

See all

4 4 Comments

Hemanth_13

commented Nov 19, 2018

O(n)?

0 votes

eyeamgj

commented Nov 19, 2018

THIS IS GIVEN

0 votes

Naveen Kumar 3

commented Nov 19, 2018

click

0 votes

Hemanth_13

commented Nov 19, 2018

What I thought was convert n bit binary numbers into integer this takes O(n). multiply them it takes O(1).

Convert back it to binary O(n).

So O(n).

But these questions are meant to giving a look no to take too seriously

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

0 answers

Sajal Mallick asked Nov 27, 2023

183 views

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...

Sajal Mallick

183 views

Sajal Mallick asked Nov 27, 2023

Algorithms
made-easy-booklet
algorithms
time-complexity
greedy-algorithm
algorithm-design

+ –

0 votes

0 answers

Ray Tomlinson asked Aug 9, 2023

529 views

Made Easy Test Series 2024
Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1, 2, ... k). For each u in V, we wish to compute a corresponding list in(u) =such that in E ... take to construct the lists in(u), u in V, from the lists out(u), u in V? T(n) =O(n+m) B. T(n)= O(n(m+n))

Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1,...

Ray Tomlinson

529 views

Ray Tomlinson asked Aug 9, 2023

Algorithms
made-easy-test-series
algorithms
made-easy-booklet
algorithm-design
time-complexity
linked-list
graph-theory
graph-algorithms

+ –

0 votes

1 answer

Ray Tomlinson asked Aug 9, 2023

461 views

Made Easy Test Series 2024
How many times is the comparison $i >= n$ performed in the following program? int i = 200 n = 80; main() { while (i >= n) { i = i - 2 n = n + 1 } }

How many times is the comparison $i >= n$ performed in the following program?int i = 200 n = 80; main() { while (i >= n) { i = i - 2 n = n + 1 } }

Ray Tomlinson

461 views

Ray Tomlinson asked Aug 9, 2023

Algorithms
algorithms
algorithm-design
loop-invariants
loop
time-complexity

+ –

5 votes

1 answer

gatecse asked Aug 18, 2020

467 views

GATE Overflow Test Series | Algorithms | Test 1 | Question: 26
Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array $\{12, -13, -5, 25, -20, 30, 10\}$, the maximum subarray sum is $45$. The best possible algorithm to compute the maximum subarray sum will run in (Mark all the appropriate choices) $O(n)$ `$\Omega(n \log n)$ $O( \log n)$ $O(n^2)$

Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array $\{12, -13, -5, 25, -20, 30, 10\}$, the maximum subarray sum is $45$. T...

gatecse

467 views

gatecse asked Aug 18, 2020

Algorithms
go2025-algorithms-1
time-complexity
algorithm-design
multiple-selects

+ –

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

4 4 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

4 4 Comments