COURSE UNIT TITLE

: ALGORITHMS AND PROGRAMMING II

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
CME 1212 ALGORITHMS AND PROGRAMMING II COMPULSORY 2 2 0 7

Offered By

Computer Engineering (English)

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR KÖKTEN ULAŞ BIRANT

Offered to

Computer Engineering (English)

Course Objective

The main objectives of this course are to develop programming techniques and to provide a problem based approach for teaching basic data structures.

Learning Outcomes of the Course Unit

1   Express dynamic data structures concepts
2   Make object-oriented design
3   Write code to solve problems with object-oriented approaches
4   Make comparison for different data structures
5   Solve the programming problems with the most proper method

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction to Java
2 Intoduction to Object Oriented Programming
3 Class and Objects, Object Oriented Programming with Java
4 Stack
5 Queue
6 Circular Queue
7 Priority Queue
8 Single Linked List
9 Double Linked List
10 Multi-Linked List
11 Multi-Linked List
12 Circular Linked List
13 Linked Stack
14 Linked Queue

Recomended or Required Reading

TextBook(s): Michael T. Goodrich, Roberto Tamassia, Data Structures and Algorithms in Java, Wiley, 2005.
Supplementary Book(s):
1. Robert Sedgewick and Kevin Wayne, Introduction to Programming in Java, 2012.
2. An Introduction to Object-Oriented Programming with Java, 5th Edition, McGraw-Hill, ISBN: 978-0073523309, 2009.

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


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 criteria will be evaluated with exams and homeworks.

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)

Doç.Dr. Kökten Ulaş BIRANT
Dokuz Eylul University
Department of Computer Engineering
Tinaztepe Campus 35160 BUCA/IZMIR
Tel: +90 (232) 301 74 01
e-mail: ulas@cs.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 14 2 28
Tutorials 14 2 28
Preparation for final exam 1 16 16
Preparation for midterm exam 1 20 20
Preparing assignments 2 30 60
Preparations before/after weekly lectures 14 1 14
Final 1 2 2
Midterm 1 2 2
TOTAL WORKLOAD (hours) 170

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.15
LO.24555
LO.353343
LO.4335
LO.543