The user is able to input grades

and their weights, and calculates the overall final mark. The program should also output what you need to achieve on a specific assessment to achieve a desired overall mark. The program should be able to account for multiple courses as well. Lists are allowed.

Name of person
Number of courses
Course ID
Grades and Weights in various categories (Homework, Quiz, and Tests)
Enter grades until -1 is entered for each category
Final Grade before exam
Calculate to get a desired mark (using final exam)
Output all courses

Answer:

Here is an example of how you could write a program to perform the tasks described:

# Store the student's name and number of courses

name = input("Enter the student's name: ")

num_courses = int(input("Enter the number of courses: "))

# Create an empty list to store the course data

courses = []

# Loop through each course

for i in range(num_courses):

   # Input the course ID and initialize the total grade to 0

   course_id = input("Enter the course ID: ")

   total_grade = 0

   # Input the grades and weights for each category

   print("Enter grades and weights for each category (enter -1 to finish)")

   while True:

       category = input("Enter the category (homework, quiz, test): ")

       if category == "-1":

           break

       grade = int(input("Enter the grade: "))

       weight = int(input("Enter the weight: "))

       # Calculate the contribution of this category to the total grade

       total_grade += grade * weight

   # Store the course data in a dictionary and add it to the list

   course_data = {

       "id": course_id,

       "grade": total_grade

   }

   courses.append(course_data)

# Input the final grade before the exam

final_grade_before_exam = int(input("Enter the final grade before the exam: "))

solve the MRS y,x = 12 mean? for constant mariginal utility?

what is primary key? List any two advantage of it.​

In what ways does a computer network make setting appointments easier?


A) by providing a common calendar
B) by reassigning workloads to enable attendance
C) by sending out invitations
D) by telephoning those involved
E) by sending electronic reminders

Which company has the highest number of operating system versions on the market?

Linux

Microsoft

Apple

IBM

Demonstrate the Max() functio with example in ms excel

What did the police threaten to do?

np.arange(5,8,1) what output will be produced?

Which of the following IPv4 addresses is a public IP address?

Rory has asked you for advice on (1) what types of insurance she needs and (2) how she should decide on the coverage levels vs monthly premium costs. Give Rory specific recommendations she can follow to minimize her financial risk but also keep a balanced budget.

Next, you begin to clean your data. When you check out the column headings in your data frame you notice that the first column is named Company...Maker.if.known. (Note: The period after known is part of the variable name.) For the sake of clarity and consistency, you decide to rename this column Company (without a period at the end).

Assume the first part of your code chunk is:

flavors_df %>%

What code chunk do you add to change the column name?

Alvin has designed a storyboard using the following technique. Which storyboard technique did he use?

A.
hierarchical
B.
linear
C.
webbed
D.
wheel

50 Points <3

Explain how abstraction makes your computer easier to use. Give at least one example.

Which of the following devices can store large amounts of electricity, even when unplugged?
LCD monitor
DVD optical drive
CRT monitor
Hard disk drive

Select the correct answer.
Ergonomic principles suggest minimizing pressure points while working on a computer. What will help to minimize pressure points while doing
sedentary work?
O A. use handles on boxes
O B.
take regular breaks
O C.
use cushioning while sitting
arrange your work area
O
D.
Reset
Next

How do networks help protect data?

A) by shutting down at 5:00 p.m. each evening
B) by restricting access to department chairs
C) by scheduling regular backups
D) by preventing access by more than one person at a time

one example of FLAT artwork is tagged image file format which is a common computer what file

Can someone write a code that makes circles change colors. Name it update () function.

Create a program that asks the user to input three integers. After saving the values, the
program should identify the maximum and minimum from the three numbers. The output
should read
The minimum number entered was….
The maximum number entered was….

Directions :: Write a Ship class. Ship will have x, y, and speed properties. x, y, and speed are integer numbers. You must provide 3 constructors, an equals, and a toString for class Ship.



One constructor must be a default.

One constructor must be an x and y only constructor.

One constructor must be an x, y, and speed constructor.

Provide all accessor and mutator methods needed to complete the class.

Add a increaseSpeed method to make the Ship speed up according to a parameter passed in.

Provide an equals method to determine if 2 Ships are the same(i.e. in the same location).

You also must provide a toString() method.

The toString() should return the x, y, and speed of the Ship.



In order to test your newly created class, you must create another class called ShipRunner. There you will code in the main method and create at least 2 Ship objects (although you can create more if you like), using the constructors you created in the Ship class. Then you will print them out using the toString method and compare them with the equals method.



I'm trying to make an equals method I just don't know how to​

Why did Madison recommend a server-based network for SEAT?

A) It provides centralized access to resources.
B) It is simpler to expand.
C) It is easier to operate.
D) It is less expensive.
E) It provides more security.

A(n) ____ is a central computer that enables authorized users to access networked resources.

A) peripheral
B) server
C) application
D) LAN

• Describe the core components and terminology of Group Policy.

what do you understand by statistic​

Code to be written in Python:
Correct answer will get the brainliest!

Uyen decides to write a Python program to count towards the next birthday.
In order to do so, she plans to write a function count_days(start_date, end_date) which takes in the start date and end date in the string format, "dd/mm/yyyy", and returns the number of days between the start date and end date. The start date is included while the end date is not included in the count. Note that leading zeros in start_date and end_date are skipped if there are any (For example, the date 1st January 2017 will be in the format 1/1/2017).

Currently, Uyen has only completed a skeleton of count_days, and a few helper functions, which are provided below.

Your Tasks:

(a) Help Uyen complete the four functions marked with 'TODO'. They are get_day_month_year, less_than_equal, next_date and count_days.

(b) Uyen was quite careless, she didn't check for input data validity. You will also need to help her with this. We only proceed to count days if the dates are valid, and the start date is before or same as the end date.

Assume a valid date is between 1/1/1970 and 31/12/9999. The leap year and valid date check are already provided.
If one of the dates is not valid, throw an exception with a message that has the value: "Not a valid date: " + date, where date is the invalid date.
If the start date is after the end date, throw an exception with a message value: "Start date must be less than or equal end date."

Note: is_leap_year(year) and is_valid(d, m, y) are provided, you can make use of them.

Incomplete code:

def is_leap_year(year):
# DONE: do not need to modify
if year % 4 == 0 and year % 100 != 0:
return True
if year % 400 == 0:
return True
return False

def is_valid(d, m, y):
# DONE: do not need to modify
# d, m, y represents day, month, and year in integer.
if y < 1970 or y > 9999:
return False
if m < 1 or m > 12:
return False
if d < 1 or d > 31:
return False

if m == 4 or m == 6 or m == 9 or m == 11:
if d > 30:
return False

if is_leap_year(y):
if m == 2 and d > 29:
return False
else:
if m == 2 and d > 28:
return False

return True

def get_day_month_year(date):
# TODO: split the date and return a tuple of integer (day, month, year)
d = 1
m = 1
y = 1970
return (d, m, y)

def less_than_equal(start_day, start_mon, start_year, \
end_day, end_mon, end_year):
# TODO: return true if start date is before or same as end date
return False

def next_date(d, m, y):
# TODO: get the next date from the current date (d, m, y)
# return a tuple of integer (day, month, year).
return (d, m, y)

def count_days(start_date, end_date):
# date is represented as a string in format dd/mm/yyyy
start_day, start_mon, start_year = get_day_month_year(start_date)
end_day, end_mon, end_year = get_day_month_year(end_date)

# TODO: check for data validity here #
# if start date is not valid...
# if end date is not valid...
# if start date > end date...

# lazy - let the computer count from start date to end date
count = 0
while less_than_equal(start_day, start_mon, start_year, end_day, end_mon, end_year):
count = count + 1
start_day, start_mon, start_year = next_date(start_day, start_mon, start_year)

# exclude end date
return count - 1

Test Cases:

test_count_days('1/1/1970', '2/1/1970') 1
test_count_days('1/1/1970', '31/12/1969') Not a valid date: 31/12/1969
test_count_days('1/1/1999', '29/2/1999') Not a valid date: 29/2/1999
test_count_days('14/2/1995', '19/3/2014') 6973
test_count_days('19/3/2014', '19/4/2013') Start date must be less than or equal end date.
get_day_month_year('19/3/2014') (19, 3, 2014)
get_day_month_year('1/1/1999') (1, 1, 1999)
get_day_month_year('12/12/2009') (12, 12, 2009)
less_than_equal(19, 3, 2014, 19, 3, 2014) True
less_than_equal(18, 3, 2014, 19, 3, 2014) True
less_than_equal(20, 3, 2014, 19, 3, 2014) False
less_than_equal(19, 3, 2015, 19, 3, 2014) False
less_than_equal(19, 6, 2014, 19, 3, 2014) False
less_than_equal(18, 12, 2014, 19, 11, 2014) False
less_than_equal(18, 12, 2014, 19, 11, 2015) True
less_than_equal(31, 3, 2018, 29, 4, 2018) True
next_date(1, 1, 2013) (2, 1, 2013)
next_date(28, 2, 2014) (1, 3, 2014)
next_date(28, 2, 2012) (29, 2, 2012)
next_date(29, 2, 2012) (1, 3, 2012)
next_date(30, 4, 2014) (1, 5, 2014)
next_date(31, 5, 2014) (1, 6, 2014)
next_date(31, 12, 2014) (1, 1, 2015)
next_date(30, 5, 2014) (31, 5, 2014)

Code to be written in python:

Correct answer will automatically be awarded the brainliest.

One of the senior wizards Yee Sian was trapped in a maze during a mission. The maze has n * m cells, labelled from (0, 0) to (n-1, m-1). Starting at cell (0, 0), each time Yee Sian can only take one step, either to the right or down. We wish to find out the number of possible paths to the destination (n - 1, m - 1). A sample path is shown in the figure below.

Having learnt the technique of speeding up the pascal function through memoization, you decide to apply it here. If Yee Sian can walk out by himself (number of paths > 0), tell him how many ways there are. Otherwise, report to Grandwizard and send a rescue team.

Write a function num_of_paths that takes in two integers representing the number of rows (n) and columns (m) in a maze and returns an integer value of number of paths from cell (0, 0) to cell (n - 1, m - 1). The table and skeleton code are given to you. Your table is essentially a dictionary that stores (i, j): val pairs which indicate the number of paths from cell (0, 0) to cell (i, j).

Note: You may assume that all inputs n and m are valid. i.e. n > 0, m > 0.

Incomplete Code:
table = {} # table to memoize computed values

def num_of_paths(n, m):
# your code here
pass


Test Cases:

num_of_paths(1, 100) 1
num_of_paths(123, 1) 1
num_of_paths(3, 3) 6
num_of_paths(10, 10) 48620
num_of_paths(28, 56) 3438452994457305131328

You are given a design board with four input pins a 4-bit INDATA,
1-bit Load,Enable, and Clock; and one output, a 4-bit OUTDATA.
Build a sequential circuit that contains a register (Don’t forget to
trigger that register by the FALLING edge of the clock, Logisim’s default
is the opposite!).
The register is updated every clock cycle in which Enable is up. If
Load is down, the register is incremented, otherwise it is loaded with the
data asserted on the INDATA pin.
The register data output should be connected with the output pin
OUTDATA.

Code to be written in python:
Correct answer will be automatically awarded the brainliest!

Since you now have a good understanding of the new situation, write a new num_of_paths function to get the number of ways out. The function should take in a map of maze that Yee Sian sent to you and return the result as an integer. The map is a tuple of n tuples, each with m values. The values inside the tuple are either 0 or 1. So maze[i][j] will tell you what's in cell (i, j) and 0 stands for a bomb in that cell.
For example, this is the maze we saw in the previous question:

((1, 1, 1, 1, 1, 1, 1, 1, 0, 1),
(1, 0, 0, 1, 1, 1, 0, 0, 1, 1),
(0, 1, 1, 1, 0, 0, 1, 1, 1, 0),
(1, 1, 0, 1, 1, 1, 1, 0, 1, 1),
(0, 1, 0, 1, 0, 0, 1, 0, 1, 0),
(1, 0, 1, 1, 1, 1, 0, 1, 1, 1),
(0, 1, 1, 1, 1, 1, 1, 1, 1, 0),
(1, 0, 1, 0, 0, 1, 1, 0, 1, 1),
(1, 0, 1, 1, 1, 0, 1, 0, 1, 0),
(1, 1, 0, 1, 0, 1, 0, 1, 1, 1))
Note: You should be using dynamic programming to pass time limitation test.

Hint: You might find the following algorithm useful:

Initialize an empty table (dictionary), get the number of rows n and number of columns m.
Fill in the first row. For j in range m:
2.1 If maze[0][j] is safe, set table[(0, j)] to be 1 because there's one way to go there.
2.2 If maze[0][j] has a bomb, set table[(0, k)] where k >= j to be 0. Since one cell is broken along the way, all following cells (in the first row) cannot be reached.
Fill in the first column. For i in range n:
3.1 If maze[i][0] is safe, set table[(i, 0)] to be 1 because there's one way to go there.
3.2 If maze[i][0] has a bomb, set table[(i, 0)] and all cells under it to be 0. The reason is same as for the first row.

Main dynamic programming procedure - fill in the rest of the table.
If maze[i][j] has a bomb, set table[(i, j)] = 0.
Otherwise, table[(i, j)] = table[(i - 1, j)] + table[(i, j - 1)]
Return table[(n - 1, m - 1)]

Incomplete code:

def num_of_paths(maze):
# your code here

# Do NOT modify
maze1 = ((1, 1, 1, 1, 1, 1, 1, 1, 0, 1),
(1, 0, 0, 1, 1, 1, 0, 0, 1, 1),
(0, 1, 1, 1, 0, 0, 1, 1, 1, 0),
(1, 1, 0, 1, 1, 1, 1, 0, 1, 1),
(0, 1, 0, 1, 0, 0, 1, 0, 1, 0),
(1, 0, 1, 1, 1, 1, 0, 1, 1, 1),
(1, 1, 0, 1, 0, 1, 0, 0, 1, 1),
(0, 1, 1, 1, 1, 1, 1, 1, 1, 0),
(1, 0, 1, 0, 0, 1, 1, 0, 1, 1),
(1, 0, 1, 1, 1, 0, 1, 0, 1, 0),
(1, 1, 0, 1, 0, 1, 0, 1, 1, 1))


maze2 = ((1, 1, 1, 1, 1, 1, 1, 1, 1),
(1, 1, 1, 1, 1, 1, 1, 1, 1),
(1, 1, 1, 1, 1, 1, 1, 1, 1),
(1, 1, 1, 1, 1, 1, 1, 1, 1),
(1, 1, 1, 1, 1, 1, 1, 1, 1),
(1, 1, 1, 1, 1, 1, 1, 1, 1),
(1, 1, 1, 1, 1, 1, 1, 1, 1))

maze3 = ((1, 0, 1, 1),
(1, 0, 1, 1),
(1, 0, 1, 1),
(1, 0, 1, 1),
(1, 0, 1, 0),
(1, 0, 0, 1))

Test Cases:
num_of_paths(maze1) 2
num_of_paths(maze2) 3003
num_of_paths(maze3) 0

In the flag, the RGB values next to each band indicate the band's colour.
RGB: 11111101 10111001 00010011
RlGB: 00000000 01101010 01000100
RGB: 11000001 00100111 00101101
First, convert the binary values to decimal. Then, to find out what colours these values correspond to, use the Colour names' handout (ncce.io/rep2-2-hw) or look up the RGB values online. Which European country does this flag belong to?​

Put the networks below in order according to the geographic distance they cover. Put a one next to the network that covers the largest area, a two next to the one that covers the second largest area, etc.

LAN

WAN

MAN

How BFS takes more memory than DFS?