program that determine if a student qualifies for the NSFAS through their Average score for Maths, English and Physics. The program must receive 3 marks for each subject in order to calculate the average to determine whether or not a student qualifies for NSFAS
1. Prompt the user to capture marks for Maths, Physics and English
2. The funding amounts are broken down as follows, an average marks of : a) 75% & above - R75000 b) 60% up to 74% - R60000 c) 50% up to 59% - R40000
3. The program must displayed at the end of all the operations:
The number of NSFAS funded students
The number of students who received R75000, R60000 & R40000
The number of non NSFAS funded students
4. Your output must test the four conditions:
2 NSFAS qualifying students and 2 non-qualifying students
2 NSFAS students qualifying for R75000 & 1 non-NSFAS qualifying student
2 NSFAS students qualifying for R60000 & 1 non-NSFAS qualifying
2 NSFAS students qualifying for R40000 & 1 non-NSFAS qualifying
Profit or Loss
This Program name is Profit or Loss Write a Python program to Profit or Loss
The below link contains Profit or Loss question, explanation and test cases
https://docs.google.com/document/d/1D4lHuphIlZv7hGzq0mY8Y0-p892RyZFW/edit?usp=sharing&ouid=107231566038157986423&rtpof=true&sd=true
We need exact output when the code was run
Hillar Furniture Enterprise is a furniture store owned by Dr. Hillar Addo of AIT.
The following table shows the essential data required for this application.
Attribute Name Sample Value
Material_ID 3792
Material_ Name Hinges 3” locking
Unit_of_Measure Each
Standard_Cost GHC 5.00
Vendor_ID V300
Vendor_name Apex Hardware
Unit_price GHC 4.75
Terms_Code 1
Terms COD
a. Identify the functional dependencies for this data. You may assume the following
b. Convert your data into a set of 3NF relations, identifying all the primary and foreign keys
Half String - 2
Write a program that prints the second half of the given input string.
You can assume that the length of the input string will always be an even number.
The first line of input is a string.
The output should be a string.
In the given string
messages, the length of the string is 8. The last 4 characters i.e The second half of the string is ages. So the output should be
ages.
Sample Input 1
messages
Sample Output 1
ages
Sample Input 2
time
Sample Output 2
me
First Letters
You are given three strings as input. Write a program to print the first character of each string.
The first, second, and third lines of input are strings.
Consider the given strings to be
apple, banana, and carrot. We need to consider the first character in each of these strings. We get the character a from the first string apple, we get the character b from the second string banana, and we get the character c from the third string carrot. So the final output should be abc.
Sample Input 1
apple
banana
carrot
Sample Output 1
abc
Sample Input 2
Very
Important
Person
Sample Output 2
VIP
Compare Last Three Characters
Write a program to check if the last three characters in the two given strings are the same.
The first and second lines of inputs are strings.
The output should be either True or False.
Given strings are
apple, pimple. In both the strings, the last three characters ple are common. So the output should be
True.
Sample Input 1
apple
pimple
Sample Output 1
True
Sample Input 2
meals
deal
Sample Output 2
False
Print in Reverse Order - 2
You are given two strings as input. Write a program to print the given two strings in reverse order separated by "---".
The first and second line of input are strings.
In the example, the given strings are
Apple, Banana. So now we have to reverse the order of strings to Banana, Apple and add a separation line between the two strings.
So the output should be
Banana
---
Apple
Sample Input 1
Apple
Banana
Sample Output 1
Banana
---
Apple
Sample Input 2
Car
Bike
Sample Output 2
Bike
---
Car
You are given a positive integer N. Your task is to find the number of positive integers K <= N such that K is not divisible by any of the following numbers 2, 3, 4, 5, 6, 7, 8, 9, 10.
non adjacent combination o two words