Philadelphia University

Faculty of Information Technology

Department of Computer Science
----- Semester, 2007/2008

Course Syllabus

Course Title: Computer Graphics Course code: 750371

Course prerequisite(s) and/or corequisite(s):
Course Level: 3
210103 + 721211
Lecture Time: Credit hours: 3

Academic Staff Specifics

Office Number Office
Name Rank E-mail Address
and Location Hours

Course Description:
This module introduces interactive computer graphics and some drawing algorithms.

Course Objectives:
The main objective of this module is to introduce to the students the concepts of computer graphics.
It starts with an overview of interactive computer graphics, two dimensional system and mapping,
then it presents the most important drawing algorithm, two-dimensional transformation;
Clipping, filling and an introduction to 3-D graphics.

Course Components
• Introduction to computer graphics
• Point-plotting techniques
• Two-dimensional transformation
• Clipping and drawing
• Polygon Filling
• Introduction to 3-dimensional graphics

Textbooks:
Title: Computer Graphics
Author: D. Hearn & M. Baker
Publisher: Prentice Hall, 2000

In addition to the above, the students will be provided with handouts by the lecturer.

Page 1 of 5
Teaching Methods:
Duration: 16 weeks in first semester, 60 hours in total
Lectures: 32 hours (2 hours per week),
Tutorials: 13 hours, 1 per week,
Laboratories: 16 hours, 1 per week
Project Presentation: 3 hours

Learning Outcomes:
• Knowledge and understanding
- Have a knowledge and understanding of the structure of an interactive computer graphics
system, and the separation of system components.
- Have a knowledge and understanding of geometrical transformations and 3D viewing.
- Have a knowledge and understanding of techniques for representing 3D geometrical objects.
- Have a knowledge and understanding of interaction techniques.

• Cognitive skills (thinking and analysis).

- Be able to create interactive graphics applications.

• Communication skills (personal and academic).

- Use C++ builds functions or equivalent graphics tools (Java, Pascal) to perform item (3),
above.

• Practical and subject specific skills (Transferable Skills).

- Perform simple 2D graphics with lines, curves and can implement algorithms to rasterizing
simple shapes, fill and clip polygons and have a basic grasp of anti-aliasing techniques.

Assessment Instruments

Allocation of Marks
Assessment Instruments Mark
First examination 15%
Second examination 15%
Final Exam (written unseen exam) 40 %
Final project (defended) 10%
Reports, assignments, Quizzes, Home works, Tutorials 20%
Total 100%

* Make-up exams will be offered for valid reasons only with consent of the Dean. Make-up exams
may be different from regular exams in content and format.

Practical Submissions
The assignments that have work to be assessed will be given to the students in separate documents
including the due date and appropriate reading material.

Documentation and Academic Honesty

Submit your home work covered with a sheet containing your name, number, course title and
number, and type and number of the home work (e.g. tutorial, assignment, and project).

Page 2 of 5
Any completed homework must be handed in to my office (room IT ---) by 15:00 on the due date.
After the deadline “zero” will be awarded. You must keep a duplicate copy of your work because it
may be needed while the original is being marked.

You should hand in with your assignments:

1- A printed listing of your test programs.
2- A brief report to explain your findings.
3- Your solution of questions.

For the research project, you are required to write a report similar to a research paper. It should include:
- Abstract: It describes the main synopsis of your paper.
- Introduction: It provides background information necessary to understand the research and
getting readers interested in your subject. The introduction is where you put your problem in
context and is likely where the bulk of your sources will appear.
- Methods (Algorithms and Implementation): Describe your methods here. Summarize the
algorithms generally, highlight features relevant to your project, and refer readers to your
references for further details.
- Results and Discussion (Benchmarking and Analysis): This section is the most important
part of your paper. It is here that you demonstrate the work you have accomplished on this
project and explain its significance. The quality of your analysis will impact your final grade
more than any other component on the paper. You should therefore plan to spend the bulk of
your project time not just gathering data, but determining what it ultimately means and
deciding how best to showcase these findings.
- Conclusion: The conclusion should give your reader the points to “take home” from your
paper. It should state clearly what your results demonstrate about the problem you were
tackling in the paper. It should also generalize your findings, putting them into a useful
context that can be built upon. All generalizations should be supported by your data, however;
the discussion should prove these points, so that when the reader gets to the conclusion, the
statements are logical and seem self-evident.
- Bibliography: Refer to any reference that you used in your assignment. Citations in the body
of the paper should refer to a bibliography at the end of the paper.

• Protection by Copyright
1. Coursework, laboratory exercises, reports, and essays submitted for assessment must be your
own work, unless in the case of group projects a joint effort is expected and is indicated as such.
2. Use of quotations or data from the work of others is entirely acceptable, and is often very
valuable provided that the source of the quotation or data is given. Failure to provide a source or
put quotation marks around material that is taken from elsewhere gives the appearance that the
comments are ostensibly your own. When quoting word-for-word from the work of another
person quotation marks or indenting (setting the quotation in from the margin) must be used and
the source of the quoted material must be acknowledged.
3. Sources of quotations used should be listed in full in a bibliography at the end of your piece of
work.

• Avoiding Plagiarism.
1. Unacknowledged direct copying from the work of another person, or the close paraphrasing of
somebody else's work, is called plagiarism and is a serious offence, equated with cheating in
examinations. This applies to copying both from other students' work and from published
sources such as books, reports or journal articles.
2. Paraphrasing, when the original statement is still identifiable and has no acknowledgement, is
plagiarism. A close paraphrase of another person's work must have an acknowledgement to the
source. It is not acceptable for you to put together unacknowledged passages from the same or

Page 3 of 5
 from different sources linking these together with a few words or sentences of your own and
changing a few words from the original text: this is regarded as over-dependence on other
sources, which is a form of plagiarism.
3. Direct quotations from an earlier piece of your own work, if not attributed, suggest that your
work is original, when in fact it is not. The direct copying of one's own writings qualifies as
plagiarism if the fact that the work has been or is to be presented elsewhere is not
acknowledged.
4. Plagiarism is a serious offence and will always result in imposition of a penalty. In deciding
upon the penalty the Department will take into account factors such as the year of study, the
extent and proportion of the work that has been plagiarized, and the apparent intent of the
student. The penalties that can be imposed range from a minimum of a zero mark for the work
(without allowing resubmission) through caution to disciplinary measures (such as suspension
or expulsion).

Course Academic Calendar

Basic and support material to be Homework/reports and

Week covered their due dates
(1) Introduction to computer graphics
(2) Introduction to computer graphics Tutorial 1
(3) Point-plotting techniques Tutorial 2
(4) Point-plotting techniques Tutorial 3
(5) Point-plotting techniques Tutorial 4, Assignment 1
(6) Point-plotting techniques, Exam 1 Tutorial 5
(7) Two-dimensional transformation Tutorial 6
(8) Two-dimensional transformation Tutorial 7, Assignment 2
(9) Two-dimensional transformation Tutorial 8
(10) Clipping and drawing Tutorial 9, Assignment 3
(11) Clipping and drawing, Exam 2 Tutorial 10, project
(12) Polygon Filling Tutorial 11
(13) Polygon Filling
(14) Polygon Filling Tutorial 12
(15) Introduction to 3-dimensional graphics Tutorial 13
Specimen
examination
(Optional)
(16) Project presentation
Final
Examination

Expected Workload:
On average students need to spend 2 hours of study and preparation for each 50-minute
lecture/tutorial.

Attendance Policy:
Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit
without a medical or emergency excuse acceptable to and approved by the Dean of the relevant
college/faculty shall not be allowed to take the final examination and shall receive a mark of zero
for the course. If the excuse is approved by the Dean, the student shall be considered to have
withdrawn from the course.

Page 4 of 5
Module References
Students will be expected to give the same attention to these references as given to the Module
textbook(s)
1- David F. Rogers, Procedural Elements for Computer Graphics, McGraw Hill, 1995.
2- Edward Angel, Interactive Computer Graphics, Addison-Wesley, 2000
3- Mason Woo et al, OpenGL Programming Guide, Addison-Wesley, 1997

Website(s):
• www.cee.hw.zc.uk/~pjbk/pathways/cpp1/cpp1.html
• www.edm2.com/0507/introcpp1.html
• www.doc.ic.ac.uk/~wjk/C++intro
• www.cprogramming.com/tutorial.html
• www.cs.umd.edu/users/cml/cstyle/ellemtel-rules.html
• www.deakin.edu.au/~agoodman/Ctutorial.html
• www.tldp.org/howto/c++programming.howto.html
• www.vb-bookmark.com/cpptutorial.html

DOCUMENTATION FOR PROGRAMS:

(All programming assignments must include at least the following comment lines)
/*TASK: Identify what the program will accomplish */
/* */
/*WRITTEN BY: */
/* */
/*DATE: List creation & modification dates */
/* */
/*VARIABLES: List and give what each represents */
/* */
/*INPUT: Identify the input parameters: Give examples */
/* */
/*OUTPUT: Identify the expected output: Give examples */
/* */
/*ALGORITHM: Briefly describe the algorithm used*/
#include <stdio.h>
main ( )
{ … }
(If your program includes any function modules, each function needs to be documented)
/*TASK: Identify what the subprogram accomplishes */
/* */
/*DATE: List creation and modification dates */
/* */
/*WRITTEN BY: */
/* */
/*VARIABLES: List names and what each represents */
/* */
/*INPUT: Identify the input parameters, if any. Give examples */
/* */
/*OUTPUT: Identify the output. Give examples */
/* */

Page 5 of 5