COURSE UNIT TITLE

: COMPUTER ALGEBRA

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
BIL 3126 COMPUTER ALGEBRA ELECTIVE 3 0 0 5

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR FIDAN NURIYEVA

Offered to

Computer Science

Course Objective

The goal of this course is to gain the students the knowledge of the application of arithmetic on different algebraic fields.

Learning Outcomes of the Course Unit

1   Be able to use arithmetic operations on different algebraic fields.
2   Be able to run algorithms of algebraic problems.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Number systems and usage of number systems on problem solving
2 Algorithmic complexity, notations (O(omicron), (theta), (omega)), algorithms analysis (operation complexity, bit-operation complexity)
3 Integer computation algorithms (addition, subtraction, multiplication) and complexity, divisibility and division algorithm
4 Greatest common divisor (GCD), The Euclidean Algorithm and complexity, Quiz 1
5 The extended Euclidean algorithm and complexity
6 Continuous fractions and the relation with Euclidean algorithm
7 Modular arithmetic
8 Midterm exam
9 Diophantine equation and solution algorithms
10 Chinese remainder theorem and the usage of this theorem to speed up the computations
11 Methods of finding prime numbers and the comparison between these methods, primality tests, primality tests with probability
12 Factorization Algorithms and their complexity, Quiz 2
13 Fermat's Factorization Method
14 Fermat's Little Theorem, The Euler's Theorem

Recomended or Required Reading

Textbook(s):
1. Modern Computer Algebra, Joachim Von Zur Gathen and Jürgen Gerhard,Cambridge University Press, (1999).
Supplemantory Book:
2. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Third Edition, MIT Press, (2009).

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. Besides the taught lecture, group presentations are to be prepared by the groups assigned and presented in a discussion session. In some weeks of the course, results of the homework given previously are discussed.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 QUZ QUIZ
3 FIN FINAL EXAM
4 FCG FINAL COURSE GRADE MTE * 0.30 + QUZ * 0.20 + FIN * 0.50
5 RST RESIT
6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + QUZ * 0.20 + RST * 0.50


*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

fidan.nuriyeva@deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 13 3 39
Preparations before/after weekly lectures 12 4 48
Preparation for midterm exam 1 8 8
Preparation for final exam 1 10 10
Preparation for quiz etc. 2 6 12
Final 1 2 2
Midterm 1 2 2
Quiz etc. 2 1 2
TOTAL WORKLOAD (hours) 123

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.153345534
LO.2545544455

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS