You are on page 1of 4

ELP-718

Telecom Software Lab

Assignment 02
August 12, 2015

Submitted By Sandeep Kumar


Entry Number 2015JTM2321

Bharti School of Telecom Technology and Management


IIT Delhi , India

Contents
List of Figures

1 Problem Statement

2 Tools

3 Assumptions

4 Implementation/Logic Used

5 Output

References

List of Figures

ELP 718, Telecom Software Lab

Assignment-1

Problem Statement

1. Tom has $ N and he goes to a shop to buy a chocolate of cost $ C. if the shopkeeper gives him
a discount, for every M wrappers, he will get one chocolate free. 2. We have N sticks of different
lengths. Susstract the length of smallest stick from the others and repeat the same until we left
with no stick. 3. Create a customer data base for a bank named XYZ and perform the following
tasks :
Write a function to print the account number and name of each customer with balance below
Rs.500.
If a customer requests for withdrawal or deposits,it is given in the form:
Account number, amount,code(1 for deposit ,0 for withdrawal)
Write a program in C to give a message ,The balance is insufficient for the specified withdrawal ,if on withdrawal balance falls below Rs.500

Tools

Here I have used Latex and for writing the report and gcc Compiler.

Assumptions

1. 2 N 105 , 1 C N ,
2 M N
2. For each operation calculate smallest stick
3. maximum customers in bank can be 500.

Implementation/Logic Used

1. Use recursive function calls.


2. Use recursive function calls.
3. use Structures.

Output

The C files are attached along with report.


For details you can see [1]

References
[1] Yashvant Kanethkar. Let Us C. BPB Publications, 2013.

Page 1

You might also like