• 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 CSC 2201 ALGORITHMS AND PROGRAMMING COMPULSORY 2 2 0 5

Offered By

Mathematics

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR CAN ATILGAN

Offered to

Mathematics (Evening) Mathematics

Course Objective

This course aims to introduce the algorithm concept. The course also lays emphasis on foundations and basic principles of computer programming. Beginning with elementary concepts, students will be presented with detailed discussions on a variety of programming constructs and features of a selected programming language.

Learning Outcomes of the Course Unit

1   Have a good understanding of algorithm concept. 2   Have ability to use of computer programming structures. 3   Have a good understanding of a programming language. 4   Have ability to design code and test of applications. 5   Have ability to code mathematical computation problems by using a programming language.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Algorithms and Their History, Origin of the word, The basic features of the algorithm 2 Number Systems and Basic Structures in Algorithms Binary, octal, hexadecimal etc. number systems and conversion Order, selection, repeat structures 3 Flow-Chart Diagrams Start and end symbols Arrows Input and output symbols Conditional symbol 4 Examination of Sample Algorithm, Algorithm Design 5 Introduction to Programming Language: Data, Basic Data Types Basic Operations, Statements, Input and Output 6 Decision Structures: Single and Dual Alternative decision structures 7 Decision Structures: Multiple and nested decision structures 8 Review and exercises 9 Condition controlled loops 10 Count controlled loops and nested loops 11 Arrays: One-dimensional arrays 12 Arrays: Two-dimensional and multi-dimensional arrays 13 Introduction to Functions 14 Function examples, Recursive functions

Recomended or Required Reading

Python Crash Course, 2nd Edition A Hands-On, Project-Based Introduction to Programming by Eric Matthes May 2019, ISBN-13: 9781593279288

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. In some weeks of the course, results of the homework given previously are discussed.

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

Written exams

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

can.atilgan@deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 14 2 28 Tutorials 14 2 28 Preparation before/after weekly lectures 13 3 39 Preparation for Mid-term Exam 1 5 5 Preparation for Final Exam 1 10 10 Final 1 2 2 Mid-term 1 2 2 TOTAL WORKLOAD (hours) 114

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 4 2 5 4 3 LO.2 5 3 2 3 LO.3 3 3 5 3 4 4 LO.4 5 3 5 LO.5 5