Top 10 algorithms in Interview Questions | Set 2

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

C

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

Top 10 algorithms in Interview Questions | Set 2

kartik

Improve

Article Tags :

Practice Tags :

Algorithms

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

Top 10 Algorithms in Interview Questions

Getting ready for a tech job interview? Algorithms are really important! Companies often ask questions that require problem-solving skills. In this article, we'll look at the top 10 algorithms commonly used in interviews. Each algorithm is like a powerful tool in your problem-solving toolbox. Knowin

Analysis of Algorithms | Î˜ (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 to

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

Top 10 algorithms in Interview Questions | Set 2

In the previous post, top 10 algorithms/questions on different topics that are most asked in interviews is discussed. In this post, top 10 problems on the rest of data-structures or algorithms are covered. If you are preparing for a coding interview, going through these problems is a must. Topics: S

Algorithms - GATE CSE Previous Year Questions

In this article, we are mainly focusing on the Algorithms GATE Questions that have been asked in previous years, with their solutions. And, where an explanation is required, we have also provided the reason.Topic-Wise Quizzes to Practice Previous Year's QuestionsComplexity Analysis and Asymptotic No

Algorithms Design Techniques

What is an algorithm? An Algorithm is a procedure to solve a particular problem in a finite number of steps for a finite-sized input. The algorithms can be classified in various ways. They are: Implementation MethodDesign MethodDesign ApproachesOther ClassificationsIn this article, the different alg

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

LMNs- Algorithms

An algorithm is a step-by-step procedure or set of rules to solve a specific problem. It is a logical sequence of instructions designed to achieve a desired output for given inputs.Analysis of Algorithm 1) Worst Case Analysis (Usually Done): In the worst case analysis, we calculate upper bound on ru

Maths for Data Structure and Algorithms (DSA) | A Complete Guide

Maths is a fundamental component of learning Data Structure and Algorithms, just like in programming. Maths is primarily used to evaluate the effectiveness of different algorithms.Â However, there are situations when the answer requires some mathematical understanding or the problem has mathematical