You are on page 1of 2

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?

Good luck
End of the question

You might also like