# Tag Archives: Algorithms-Analysis of Algorithms

## Introduction to Algorithms

What is Algorithm? Algorithm Basics The word Algorithm means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore… Read More »

## Difference between Deterministic and Non-deterministic Algorithms

In deterministic algorithm, for a given particular input, the computer will always produce the same output going through the same states but in case of… Read More »

## Cyclomatic Complexity

Cyclomatic complexity of a code section is the quantitative measure of the number of linearly independent paths in it. It is a software metric used… Read More »

## Analysis of Algorithms | Big-O analysis

In our previous articles on Analysis of Algorithms, we had discussed asymptotic notations, their worst and best case performance etc. in brief. In this article,… Read More »

## Algorithms | Analysis of Algorithms | Question 19

Consider the following two functions. What are time complexities of the functions? filter_none edit close play_arrow link brightness_4 code int fun1(int n) {     if (n… Read More »

## Algorithms | Analysis of Algorithms | Question 18

Consider the following function int unknown(int n) { int i, j, k = 0; for (i = n/2; i

## Algorithms | Analysis of Algorithms | Question 17

Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are… Read More »

## Algorithms | Analysis of Algorithms | Question 16

Consider the following three claims I (n + k)^m = (n^m), where k and m are constants II 2^(n + 1) = 0(2^n) III 2^(2n… Read More »

## Algorithms | Analysis of Algorithms | Question 15

Consider the following functions 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… Read More »

## Algorithms | Analysis of Algorithms | Question 14

In the following C function, let n >= m. filter_none edit close play_arrow link brightness_4 code int gcd(n,m) {   if (n%m ==0) return m;     n… Read More »

## Algorithms | Analysis of Algorithms | Question 13

Consider the following functions: f(n) = 2^n g(n) = n! h(n) = n^logn Which of the following statements about the asymptotic behavior of f(n), g(n),… Read More »

## Algorithms | Analysis of Algorithms | Question 12

What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices? (A) O(n^2logn) (B) Theta(n^2logn) (C)… Read More »

## Algorithms | Analysis of Algorithms | Question 11

What does it mean when we say that an algorithm X is asymptotically more efficient than Y? (A) X will be a better choice for… Read More »

## Algorithms | Analysis of Algorithms | Question 10

The following statement is valid. log(n!) = (n log n). (A) True (B) False Answer: (A) Explanation: Order of growth of and is same for… Read More »

## Algorithms | Analysis of Algorithms | Question 9

In a competition, four different functions are observed. All the functions use a single for loop and within the for loop, same set of statements… Read More »