• 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

Python String and numbers

Edit Distance ( Dynamic Programming )

Client Server C program

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

SAP Off Campus Hiring_ March 2015 Sample Questions

Find the smallest window in a string containing all characters of another string

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Printing intermediate Integers between one element & next element of array

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

Practo Hiring Experience

Daughter’s Age VeryGood Puzzle

Templates in C++

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

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

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

Walmart Labs Interview Experience

25 horses 5 tracks Find 3 fastest puzzle

How strtok() Works

Minimum insertions to form a palindrome

Find Percentage of Words matching in Two Strings

Connect n ropes with minimum cost

Find and print longest consecutive number sequence in a given sequence in O(n)

Python Array String

Find if a binary tree is height balanced ?

Trie Dictionary

Fibonacci Hashing & Fastest Hashtable

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

TicTacToe Game As Asked in Flipkart

Generate next palindrome number

Urban Ladder Written Test.

Copyright © 2025 · Genesis Framework · WordPress · Log in