• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Test Cases for Round Function

July 27, 2014 by Dhaval Dave

Write the test data for the function which takes input value as floating number and precision. It returns the output by rounding the value nearest to precision value.
e.g roundOff (3.4567,2) output will be 3.46.

To write Test Cases
1) Try to figure out the code or pseudo code
2) There can be several kind of testing but for simple question
a. Positive Test Case (where code should result output)
b. Negative Test Case (try to generate wrong output from code )
c. Destructive Test Case ( Try to generate Error )

Thanks to Dhaval for suggesting this  code,  testcases and Article

Sample Code :

#include <stdio.h>
#include <math.h>

float round1 ( float num , int n){
    float temp, dec;
    num = num < 0 ? num - (1 / pow(10,n)) : num + 1 / pow(10,n);
    num = num * pow (10 , n );

    return (int) num / pow ( 10 , n );
}
int main(){
int n = 2;
printf("n %f ",round1( 4.4567 , n ) );
return 0;
}

This may not be the perfect code but for testcases lets take this code.
Now
Test cases :
Think
1. Input/Output Tests
a)  if we give very large number to be stored in float number then ?
b) what if “n” is 0
c) what if n is too large to accommodate in int ? eg n =111000000000; (Boundry Value tests)
e) what if n is negative ?
f) Consider instead of numbers 4.4567 and n, String is passed. eg (4.456×7 , 2a)

2. Black box testing :  check proper (desired) output is printed // black box testing.

3. Stress Test
: What if this function get called by 10000 times together.

4.
 Destructive Test : what if pow(10,n) or any mathematical step gives memory error ?
a) n is too large to generate pow (10,n) :  eg n = 10
b) Both  “n” and “num”  are proper but num = num * pow (10 , n ); can generate exeception
for round1(234244.45672,5);
c) same for “Division”
solution : Keep Try Catch block to handle exception and errors

Please Give ur feedback below and share information.

Similar Articles

Filed Under: Flipkart Interview Questions, Interview Questions, problem Tagged With: testing

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Regular Expression Matching

Leetcode: Merge Intervals

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

flattens 2 D linked list to a single sorted link list

Python List

Python Dictionaries

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Introduction To Number Theory ( Part 1 )

Binary Tree in Java

Templates in C++

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

ADOBE Aptitude C Language Test

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Maximum difference between two elements s.t larger element appears after the smaller number

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Find Percentage of Words matching in Two Strings

Diagonal Traversal of Binary Tree

Serialise Deserialise N-ary Tree

Urban Ladder Written Test.

LeetCode: Container With Most Water

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Amazon Interview On-Campus For Internship – 1

LeetCode: Binary Tree Maximum Path Sum

Circular Linked List

Count number of ways to reach a given score in a game

Maximum of all subarrays of size k

Handle duplicates in Binary Search Tree

Get K Max and Delete K Max in stream of incoming integers

Closed Parentheses checker

Copyright © 2026 · Genesis Framework · WordPress · Log in