Programming & Computer Science Answers

Compound interest is the addition of interest to the principal (original) sum of a loan or deposit, or in

other words, interest on interest. It is the result of reinvesting interest, rather than paying it out, so that

interest in the next period is then earned on the principal sum plus previously-accumulated interest.

The compound interest is calculated using the formula below.

A = P(1 + (r/100))^n

Where:

A = total amount after n year

P = Principal or Original price

r = rate of interest per annum

N = number of years the money is invested

1 Write a program that will calculate the compound interest using the formula above with an annual interest

rate of 5.4 %.

Hope Michael, a DBIT student did 8 units in an exam and got different marks in each of the exam papers. She intends to calculate her total, mean score and exams verdict for the exams using a program written in C++. Requirements/Guide. (All the instructions below should be done in the same single program)

i. Assign 8 scores to Hope in a one-dimensional array. [2 Marks]

ii. Declare a function that takes an array of Hope’s scores as a parameter and calculates both the total and the mean score. [3 Marks]

iii. Pass the mean score from (ii) above into another function by reference, that computes whether Hope has passed or not given that a pass is 50 – 100 while a fail is 0 – 49.99 Marks. [3 Marks]

iv. Display Hope’s results as follows: (this is a sample output, use arbitrary values in your solution) [2 Marks]

Student Name: Hope Michael

Test Scores: 40, 50, 60, 80, 98, 82, 70, 32

Total Marks: 512

Mean Score: 64

Exams Verdict: Pass 

_{PROGRAM SHOULD BE IN C LANGUAGE...}

You are given employees database. Your code should perform the following tasks on this file.

1. Read the file.
2. Search and display the contents of file based on name, age and salary of employees.
3. Sort the data in ascending order based on the name (alphabetical order), age or salary of employees.
4. Edit the records and write the updated records back on the file.
5. The file is in text mode, the user should be able to save this file (with a different name) in the binary mode.

You have to create a proper menu driven program so that the user can select the options. You must also make separate functions for all the above-mentioned tasks.

EMPLOYEE DATABASE:

Jameel_Ahmed

29

45000

Tauqeer_Abbas

43

56000

Hanzala_Masood

32

47000

Irum_Baig

27

40000

Munawar_Shakeel

59

132000

Maryam_Zahid

24

35000

Zainab_Mirza

34

49000

Aftab_Anjum

40

52000

Atif_Majeed

39

120000

Bushra_Nazeer

33

78000

Draw a empty stairs patten using nested loop in c++

apply the for looping statement

Write a program that calculates and produces these two columns sequence numbers using the three looping statements:

Sequence nos. Squared

1 1

2 4

3 9

4 16

5 25

In the Virtual Circuit (VC) Subnet (refer the course material “Session 20 Network Layer Functionalities” in Moodle) every circuit will have a VC ID and the routing table includes the VC IDs to manage the circuits. But, the problem with VC ID is it is local to the system; VC IDs are assigned by the host system itself without the knowledge of VC IDs assigned by the other hosts. Because of which there will be a clash of VC IDs at the router. Understanding the ambiguity, the router then changes one of the VC IDs to a unique ID at router level and proceeds with data transfer (refer Slide No. 12 of the course material). Over and above the data transfer, this is the additional responsibility for a router which creates hiccups in the data communication. Question: Design a network system where VC IDs will be assigned uniquely which avoids VC ID collision at routers. Since such a system avoids the VC ID collision at the router, it should definitely save router's time and should improve performance of router.

Find latitude and longitude of first 20 countries with a population greater than or equal to the population limit given below. Use the country details from this dataset.

Your task is to find the sum of the length of all lines (in kms) that can be drawn between co-ordinates of these countries.

• Assume radius of earth: 6371 km
• Round length of each line and final result to 2 decimal points
• If co-ordinates are missing for any country use 0.000 N 0.000 E

Population limit: 277500

Note: Population limit will change at random intervals. So please make sure answer is computed for the correct population limit before submitting.

Let us consider you are going to be create a AVL tree by inserting one by one up to 15 nodes with the help of Random number generation function. At each node, after insertion you should maintain the tree as balanced one. Sketch the Avl tree from the first node insertion to last 15^th node insertion step by step. Then you have start to delete operation with 5^th,10th and 15^th input of inserted node. You have to follow the given details mentioned below for node input.

Sl.No

Student’s Roll Number

Range of Input

Insertion

Deletion

1

201IT101 - 201IT117

1 - 75

Totally 15 randomized numbers from the Specified range

Delete the 5^th , 10^th and 15^th randomized input number when inserted.

2

201IT118 - 201IT134

76 - 150

3

201IT135 - 201IT151

151 - 225

4

201IT152 - 201IT168

226 - 300

5

201IT169 - 201IT216

301 - 375

6

201IT218 - 201IT234

376 - 450

7

201IT235 - 201IT251

451 - 525

8

201IT252 - 201IT269

526 – 600

Program ( 5 Marks)

Tree Structure step by step (15 Marks) for 15 node insertion.

Create a program that accepts numbers of pennies to make change for 387

dollars= 3

quarters=3

dimes=1

nickels=0

pennies=2

Write a program to implement round robin scheduling concept using a linked list. Each node will represent a process with attributes as <PID, CPU_time>. A quantum time T will be input by the user.

A process will be executed (when user wants) for quantum time T and the CPU_time will be updated with CPU_time T, and the current process node is deleted from the beginning and added to the end of the list. If the updated CPU_time is <=0, then the process is deleted from the list.

After a process is executed for T time, the the next process in the queue is executed upon user choice. The entire process gets completed when all process nodes are deleted.