Statistics Question

CPCS433
Artificial Intelligence Topics
Assignment #1
Assign Date: Saturday, November 12, 2022
Due date: Sunday, November 15,2022
This assignment will involve data analysis and reporting on methods and results using Python
code. I recommend using Google Colaboratory or any other platform to implement your code.
You may also use IPython notebook or if you prefer Word or Latex to show snippets of your code
with a written description of what you did. Then, export the finished report as a PDF file and
upload it to the Blackboard. Please submit an only single electronic report or simply submit your
Google Collaboratory file. Please ensure that there is enough information in your report/code
report to understand what you did without examining the code itself.
Problem 1: Artificial Neural Network Regression Model
In this task, you will build an artificial neural network classifier. You will, in particular,
train a two-layer feed-forward neural network that predicts a student chance of
getting accepted in graduate school using three features (GRE_score, TOEFL _score,
and GPA). The data set has four examples for training and three examples for testing.
The following table shows the content of the dataset.
(Note that you are required to build the model from scratch without using existing
libraries).
Training Set:
GRE Score
TOEFL
GPA
300
308
329
332
99
103
110
118
6.8
8.36
9.15
9.36
GRE Score
TOEFL
GPA
296
293
325
95
97
112
7.54
7.8
8.96
Chance of
Acceptance
0.36
0.7
0.84
0.9
Testing Set:
Chance of
Acceptance
0.44
0.64
0.8
In this task you will do the following:
1. Build a two-layers neural network of one input layer (three nodes 𝑥1 , 𝑥2 and b or 𝜃0 ),
one hidden layer (three nodes with sigmoid activation function) and one output layer
(one node with no activation function).
2. Initialize the parameters with some random values.
3. Perform a feed-forward stage to propagate the input forward through the network.
4. Preform the back-propagation algorithm using sum square error (SSE).
5. Print the content of the input/output of hidden layers and output layer at the feed
forward stages.
6. Print the content of the weight matrices after each epoch (4 epochs).
7. Test and report the result of classifying the testing examples.
•
Module 10: Critical Thinking Assignment
Critical Thinking Assignment (125 points)
Using the Clinical Trial on breast cancer dataset. Perform a KaplanMeier Analysis or the Log-Rank Test to determine the survival curve
for the breast cancer survivors.
H0 The risk of 50% of the participants dying from breast cancer will
occur within five years. (Null Hypothesis)
H1 The risk of 50% of the participants dying from breast cancer does
not occur within five years. (Alternative Hypothesis)
Ensure to submit the following requirements for the assignment:
•
•
•
•
•
Review the analysis from the standpoint of how many patients
survive over the seven-year time period that the clinical trial
covered.
Present your findings as a Survival Time chart in a Word
document, with a title page, introduction explaining why you
would conduct a survival analysis, a discussion where you
interpret the meaning of the survival analysis, and a conclusion
should be included.
Your submission should be 2-3 pages to discuss and display
your findings.
Provide support for your statements with in-text citations from a
minimum of two scholarly, peer-reviewed articles. One of these
sources may be from the class readings, textbook, or lectures,
but the others must be external. The Saudi Digital Library is a
good place to find these sources and should be your primary
resource for conducting research.
Follow APA 7th edition and Saudi Electronic University writing
standards.
Faculty of Computer Studies
Course Code: TM111
Course Title: Introduction to computing and information technology 1
Tutor Marked Assignment
Cut-Off Date: TBA
Total Marks: 15
Plagiarism Warning:
As per AOU rules and regulations, all students are required to submit their own TMA work and
avoid plagiarism. The AOU has implemented sophisticated techniques for plagiarism detection.
You must provide all references in case you use and quote another person’s work in your TMA.
You will be penalized for any act of plagiarism as per the AOU’s rules and regulations.
Declaration of No Plagiarism by Student (to be signed and submitted by student with TMA
work):
I hereby declare that this submitted TMA work is a result of my own efforts and I have not
plagiarized any other person’s work. I have provided all references of information that I have
used and quoted in my TMA work.
Important Note:
•
•
For all questions you need to write the full algorithm and implement the algorithm
by using OUBILD script. The student should provide provide one screenshot for
the OUBUILD script and two screenshots for differnt outputs.
If you will not provide SCREENSHOTs you will lose grades
Name of Student:
Signature:
Date:
Question 1 : (8 marks)
On one day a year a programming club at AOU hosts a tournament. Each entrant is
recorded in the appropriate tournament category on arrival and is registered a
corresponding level. Participants in level one will be entered in the basic training and
competition; participant in level two and three will be entered in the intermediate training
and competition; those in level 4 will be entered in the junior competition.
1- You are required to write an algorithm which is required to decide the appropriate
category for the entrant; Display the entrant’s in a list for that category and output
the corresponding level. Hint[The tutor will keep registering the students
until he pressed -1 to stop and exit from the loop ]
2- Draw the flowchart for the above algorithm
3- Build your algorithm by OUbuild and provide screenshots for the output?
Question 2: (5 marks)
Ahmad wanted an algorithm to list her favourite games. He wanted to be able to enter a
favourite game to be added to the list. He did not want duplicated on the final list but did
want to be told, having entered proposed game, either that it was a duplicate or that had
been added to the list. Or he can enter the list of favourites and then the algorithm will
delete the duplicated one.
1- You are required to write an algorithm to do the above task?
2- Build your algorithm by OUBUILD and then provide screenshots showing that he
has entered games twice and not added to the list. Ahmad will keep add his
favourite game until he press -1 to exit from the loop.
Question 3: (2 marks)
Consider a four-hour film to be displayed on a computer at 24 fps. Each frame is 420 x
270 pixels and a 24-bit RGB color encoding is being used
a- How many bytes will be required to represent the whole film?
b- In how many gigabytes the film in (a.) can be represented?
a.
Total film length = 4 hours.
Converts hour into seconds => 1 hour = 60 x 60 seconds.
So four hours = 4 x 60 x 60 = 14400 seconds.
Frames per second = 24 fps
Number of pixels per frame = 420 x 270 = 113400 pixels per frame
Pixel size = 24 bits (RGB – 8 bits each)
Complete memory is needed to store the film =?
=> (total time) x (frames per second) x (Number of pixels per frame) x (pixel size)
which is 14400 x 24 x 113400 x 24
= 940584960000 pieces
Now convert bits into bits: 1 byte = 8 bits.
Movie size by bytes = 940584960000/8
= 117573120000
To answer your first question with 1175731200 bytes.
b.
1 GB = 1024 MB
1 MB = 1024 KB
1 KB = 1024 Bytes
to convert it into GB, we need to divide it into (1024 x 1024 x 1024) eg 1024 cube
Therefore
117573120000 / (1024 x 1024 x 1024)
= 109.498 GB
the approximate which is required is 109.5 GB
Good luck
End of the question