• 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

Cisco Hiring Event 21st – 22nd Feb 2015

Connect n ropes with minimum cost

Practo Hiring Experience

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

Find Nearest Minimum number in left side in O(n)

How Radix sort works

Spanning Tree

Word Break Problem

Coin Collection Dynamic Programming

Find the number ABCD such that when multipled by 4 gives DCBA.

Check Binary Tree is Binary Search Tree or not

LeetCode: Binary Tree Maximum Path Sum

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

Given a string, find the first character which is non-repetitive

Find the kth number with prime factors 3, 5 and 7

25 horses 5 tracks Find 3 fastest puzzle

Password Predictor

Difference between a LinkedList and a Binary Search Tree BST

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

Microsoft BING Interview Experience

BFS (Breath First Search)

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Level order traversal in Spiral form

Binary Tree in Java

BlueStone E-commerce Interview Experience

TicTacToe Game As Asked in Flipkart

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 ?

Count Possible Decodings of a given Digit Sequence

HackeEarth Flipkart’s Drone

Doubly linked list

Copyright © 2026 · Genesis Framework · WordPress · Log in