COURSE UNIT TITLE

: ALGORITHMS AND PROGRAMMING

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

PROFESSOR EFENDI NASIBOĞLU

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 the C# 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 C# programming language.
4   Have ability to design code and test of C# applications.
5   Have ability to code mathematical computation problems by using C# 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 Algorithms by the ancients 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 Subroutines Recursive subroutines Searching and sorting algorithms
5 Introduction to C# Programming Language Interface of Visual Studio (IDE) The C# language and its advantages Writing first C# program Building an executable version of a C# program
6 Data Types, Variables and Pointers Data types Conversion of data types
7 Data Types, Variables and Pointers (continues to ...) Constants Pointers
8 Mid-term exam
9 Operators and Expressions Arithmetic operators Relational operators
10 Logical operators Expressions, priority of expressions
11 Control-Flow Statements Conditional statements Select statements
12 Control-Flow Statements (continues to ) Loop statements
13 Arrays and Structured Data Types One-dimensional arrays Multi-dimensional arrays
14 Arrays and Structured Data Types (continues to ) Structures Arrays of structures Nested structures , Functions , Recursive functions

Recomended or Required Reading

C# for Programmers, Harvey M. Deitel, Paul J. Deitel, ISBN: 9780137144150
C# Programlama Dili ve Yazılım Tasarımı, Ahmet Kaymaz, ISBN: 9789756797839

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 FIN FINAL EXAM
3 FCG FINAL COURSE GRADE MTE * 0.40 + FIN * 0.60
4 RST RESIT
5 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.40 + FIN * 0.60


Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

efendi.nasibov@deu.edu.tr
murat.berberler@deu.edu.tr

Office Hours

Tuesday, 9:00 - 10:00

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 13 2 26
Tutorials 13 2 26
Preparation before/after weekly lectures 12 3 36
Preparation for Mid-term Exam 1 5 5
Preparation for Final Exam 1 20 20
Final 1 2 2
Mid-term 1 2 2
TOTAL WORKLOAD (hours) 117

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.142543
LO.25323
LO.3335344
LO.4535
LO.55