Algorithm Practice Question for Beginners | Set 1

Algorithms | Analysis of Algorithms | Question 19

Last Updated : 08 Oct, 2021

Consider the following program fragment for reversing the digits in a given integer to obtain a new integer. Let n = D1D2…Dm

int n, rev;  
rev = 0;  
while (n > 0)  
{  
   rev = rev*10 + n%10;  
   n = n/10;  
} 

The loop invariant condition at the end of the ith iteration is: (GATE CS 2004)
(A) n = D1D2….Dm-i and rev = DmDm-1…Dm-i+1
(B) n = Dm-i+1…Dm-1Dm and rev = Dm-1….D2D1
(C) n != rev
(D) n = D1D2….Dm and rev = DmDm-1…D2D1

Answer: (A)

Explanation: We can get it by taking an example like n = 54321. After 2 iterations, rev would be 12 and n would be 543.

Quiz of this Question

Algorithm Practice Question for Beginners | Set 1

kartik

Improve

Article Tags :

Similar Reads

Analysis of Algorithms

Analysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space. Basics on Analysis of Algorithms:Why is Analysis Important?Order of GrowthAsymptotic Analysis Worst, Average and Best

Algorithm Practice Question for Beginners | Set 1

Consider the following C function. unsigned fun(unsigned n) { if (n == 0) return 1; if (n == 1) return 2; return fun(n-1) + fun(n-1); } Consider the following questions for above code ignoring compiler optimization. a) What does the above code do? b) What is the time complexity of above code? c) Can

How to Analyse Loops for Complexity Analysis of Algorithms

We have discussed Asymptotic Analysis, Worst, Average and Best Cases and Asymptotic Notations in previous posts. In this post, an analysis of iterative programs with simple examples is discussed. The analysis of loops for the complexity analysis of algorithms involves finding the number of operation

Worst, Average and Best Case Analysis of Algorithms

In the previous post, we discussed how Asymptotic analysis overcomes the problems of the naive way of analyzing algorithms. Now let us learn about What is Worst, Average, and Best cases of an algorithm: 1. Worst Case Analysis (Mostly used) In the worst-case analysis, we calculate the upper bound on

Why the Analysis of Algorithm is important?

Why is Performance of Algorithms Important ? There are many important things that should be taken care of, like user-friendliness, modularity, security, maintainability, etc. Why worry about performance? The answer to this is simple, we can have all the above things only if we have performance. So p

Analysis of Algorithms | Big - Î˜ (Big Theta) Notation

In the analysis of algorithms, asymptotic notations are used to evaluate the performance of an algorithm by providing an exact order of growth. This article will discuss Big - Theta notations represented by a Greek letter (Î˜). Definition: Let g and f be the function from the set of natural numbers t

Asymptotic Analysis of Algorithms Notes for GATE Exam [2024]

This Asymptotic Analysis of Algorithms is a critical topic for the GATE (Graduate Aptitude Test in Engineering) exam, especially for candidates in computer science and related fields. This set of notes provides an in-depth understanding of how algorithms behave as input sizes grow and is fundamental

Sample Practice Problems on Complexity Analysis of Algorithms

Prerequisite: Asymptotic Analysis, Worst, Average and Best Cases, Asymptotic Notations, Analysis of loops. Problem 1: Find the complexity of the below recurrence: { 3T(n-1), if n>0,T(n) = { 1, otherwise Solution: Let us solve using substitution. T(n) = 3T(n-1) = 3(3T(n-2)) = 32T(n-2) = 33T(n-3) .

Types of Asymptotic Notations in Complexity Analysis of Algorithms

We have discussed Asymptotic Analysis, and Worst, Average, and Best Cases of Algorithms. The main idea of asymptotic analysis is to have a measure of the efficiency of algorithms that don't depend on machine-specific constants and don't require algorithms to be implemented and time taken by programs

Complete Guide On Complexity Analysis - Data Structure and Algorithms Tutorial

Complexity analysis is defined as a technique to characterise the time taken by an algorithm with respect to input size (independent from the machine, language and compiler). It is used for evaluating the variations of execution time on different algorithms. What is the need for Complexity Analysis?