COURSE UNIT TITLE

: ALGORITHMS AND PROGRAMMING I

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
CME 1211 ALGORITHMS AND PROGRAMMING I COMPULSORY 2 2 0 5

Offered By

Computer Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR DERYA BIRANT

Offered to

Computer Engineering

Course Objective

The main objectives of this course are to teach the main concepts and components of algorithms using a programming language.

Learning Outcomes of the Course Unit

1   Describe the basic concepts of algorithms and programming
2   Compose an algorithmic solution of a given problem
3   Translate an algorithmic solution to a computer code (program)
4   Apply structural and functional rules to programming process
5   Use developed programs for solutions in mathematical and other fields

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction to Algorithms and Programming
2 Flowcharts
3 Variables, Data Types and Basic Operations
4 Conditional Statements
5 Loop Statements - I
6 Loop Statements - II
7 File Operations
8 Arrays (One Dimensional)
9 Arrays (Two and Multi-Dimensional)
10 Solving Example Questions, Midterm Exam
11 Strings
12 Procedures and Functions
13 Structs
14 Recursive Programming

Recomended or Required Reading

Textbook:
Herbert Schildt, C# 4.0: The Complete Reference, McGraw-Hill, 2010.

Supplementary Book:
Paul Deitel, Harvey Deitel, C# 2010 for Programmers, Pearson Education, 2011.

Planned Learning Activities and Teaching Methods

Lectures / Presentation
Guided problem solving
Laboratory exercises
Homeworks

Assessment Methods

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


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

Further Notes About Assessment Methods

In-semester studies will be evaluated with a midterm exam and a number of laboratory / homework activities.
The final exam will cover all course topics.

Assessment Criteria

All of the following criteria will be evaluated with exams, homework and laboratory exercises.
1. Learnability of basic concepts will be evaluated with the correct understanding of given problem.
2.The following criteria will be considered during algorithm composition:
- Correct written and graphical representation of the algorithm
- Including sufficient comments
3. The following criteria should be provided during the translation from algorithm to program:
- The usage of meaningful variable names
- The usage of procedure and function in problem solving.
4. The following criteria should be considered during the implementation of the program:
- The usage of structured programming techniques
- The usage of insufficient data type
5. Producing significant / correct results of programs that developed for mathematical and other areas will be expected.

Language of Instruction

English

Course Policies and Rules

1. Participation is mandatory (%70 theoretical courses and 80% practices).
2. Every cheating attempt will be finalized with disciplinary action.
3. Instructor reserves the right to quizzes. Notes should be added to these examinations, midterm and final exam grades.

Contact Details for the Lecturer(s)

Assoc.Prof.Dr. Derya BIRANT
Dokuz Eylul University
Department of Computer Engineering
Tinaztepe Campus 35160 BUCA/IZMIR
Tel: +90 (232) 301 74 03
e-mail: derya@deu.edu.tr

Office Hours

Monday 15:00-17:00

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 13 2 26
Tutorials 13 2 26
Preparing assignments 4 12 48
Preparation for final exam 1 12 12
Preparation for midterm exam 1 14 14
Midterm 1 2 2
Final 1 2 2
TOTAL WORKLOAD (hours) 130

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.13
LO.2543
LO.35
LO.44
LO.55