Scribd
Upload
285 views18 pages

Introduction To Computing and Information Technology 1: Important Note

This document contains instructions for a tutor marked assignment (TMA) for the course Introduction to Computing and Information Technology 1. It provides details about the assignment such as the cut-off date and total marks. It warns students about plagiarism and requires them to sign a declaration that their work is original. The document outlines two questions to answer, providing algorithms and asking students to implement the algorithms in OUBILD script and include screenshots. It asks students to calculate word counts and add books to a list, validating inputs.

Uploaded by

nwara
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
285 views18 pages

Introduction To Computing and Information Technology 1: Important Note

This document contains instructions for a tutor marked assignment (TMA) for the course Introduction to Computing and Information Technology 1. It provides details about the assignment such as the cut-off date and total marks. It warns students about plagiarism and requires them to sign a declaration that their work is original. The document outlines two questions to answer, providing algorithms and asking students to implement the algorithms in OUBILD script and include screenshots. It asks students to calculate word counts and add books to a list, validating inputs.

Uploaded by

nwara
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 18

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: 20

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

The Algorithm:

Start
Set i to 0
Set temp to program
For 0  I until temp.length
0 j
“ “  word
For j until ij
Word  word + temp[j]
j  j+1
Print word
I  i+1
Question 2

1) We need to know how many book anne will add


The book name
A list to save the book to
Temporary variable to compare the name with the names in the list

2)
Start
1- Enter list size
2- answer  list size
3- if list size <5
4- Print invalid number.
5- Enter list size
6- answer  list size
7- go to 3
8- size  answer
9- I  0
10- If i < size
11- Print enter your new book name
12- If answer is in book list
13- Print this book already exist!
14- go to 12
15- Else
16- Add book to book list
17- Print book was added successfully :)
18- i  i+1
19- go to 10

3)
4)
5)
 Ask for list size and check if valid
Question 3

1-
Algorithm:

1- Clean all lists


2- Highest-votes  0, temp-votes  0,I  0, candidate-name  “ “
3- Print how many candidates is there?
4- If answer <3
5- Go to 3
6- candidates-list-len  answer
7- Print how many voters ?
8- if answer<10
9- Go to 7
10- votes-list-len answer
11- If i< candidates-list-len
12- Print who is your candidate?
13- Add answer to Candidates
14- I  i+1
15- Go to 11
16- i  0
17- If i< votes-list-len
18- Print select your vote?
19- Add answer to votes
20- I  i+1
21- Go to 17
22- i  0
23- If i< candidates length
24- Candidate-name  canditates[i]
25- J=0
26- If j< votes length
27- If Candidate-name = votes[j]
28- Temp-votes = votes-count+1
29- J=j+1
30- Go to 26
31- Add Candidate-name and his temp-votes to final votes list
32- If temp-votes > highest-votes-count
33- highest-votes-count  temp-votes
34- Winner-name=candidate-name
35- temp-votes  0
36- I  i+1
37- Go to 23
38- Show final votes list
39- Print the winner is winner-name
2-

You might also like