• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

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. 3   Adopting modular arithmetic theory

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 5 The extended Euclidean algorithm and complexity 6 Continuous fractions and the relation with Euclidean algorithm 7 Modular arithmetic 8 Recap 9 Diophantine equation and solution algorithms 10 Chinese remainder theorem and the usage of this theorem to speed up the computations 11 Cryptosistems, RSA 12 Methods of finding prime numbers and the comparison between these methods, primality tests, primality tests with probability 13 Factorization Algorithms and their complexity 14 Fermat's Factorization Method, 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 and discussion format. In some weeks of the course, results of the homework given previously are discussed. Lecture format, built around the textbook readings with numerous examples chosen to illustrate theoretical concepts.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 VZ Vize 2 FN Final 3 BNS BNS VZ * 0.40 + FN * 0.60 4 BUT Bütünleme Notu 5 BBN Bütünleme Sonu Başarı Notu VZ * 0.40 + BUT * 0.60 *** 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 14 3 42 Preparations before/after weekly lectures 14 3 42 Preparation for midterm exam 1 18 18 Preparation for final exam 1 20 20 Final 1 2 2 Midterm 1 2 2 TOTAL WORKLOAD (hours) 126

Contribution of Learning Outcomes to Programme Outcomes

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