Back

Data Structures and Algorithms

 

PİRİ REİS UNIVERSITY

MARITIME HIGHER VOCATIONAL SCHOOL

Course Name : Data Structures and Algorithms

Degree: Associate's Degree

 

Code

 

 

Year/Semester

 

Local Credits

 

ECTS Credits

 

Course Implementation, Hours/Week

Course

Tutorial

Laboratory

BİP 1004

1/2 (Spring)

2.5

5

2

0

1

Department / Programme

Computer Programming Programme

Instructors

Assist.Prof..Dr.Şevket GÜNDÜZ

Contact Information

sgunduz@pirireis.edu.tr

Office Hours

Wednesday 09:00-11:00

Web page

www.pirireis.edu.tr

Course Type

 Compulsory

Course Language

Turkish

Course Prerequisites

Introduction to Programming

Course Category by Content, %

Basic Sciences

Engineering Science

Engineering Design

Humanities

10

40

40

10

Course Description

Basic concepts: Data structures and models, Algorithms and Heuristic thinking, Pseudo and working code, Programme complexity, Big O’notation,  Search Algorithms (sequential and binary search), Sort algorithms (insertion, buble, fast, etc.), List and link list algorithms, Que and Stack structures, tree data structure, Graph Models, File structures.

 

Course Objectives

 

The objectives of this lesson are to define the basic and structured data types, to teach the managing and using algorithms of data, to develop the abilities of students in determining the data structure suitable given problems and in comparing the effectiveness of different algorithms.

 

Course Learning Outcomes

 

With the successful completion of this course, the students will be able to;

1. define the basic data structure and models, express the differences from each other.

2. define search and sort algorithms, and convert these algorithms into C code.

3. define list and linked list algorithms, write C codes implementing these algorithms.

4. define ques and stacks, write C codes implementing these algorithms.

5.define tree data structures, write C codes implementing these algorithms.

6.define graphs, write C codes implementing these algorithms.

7. define state machines, write C codes implementing these algorithms.

8. define recursive algorithms, write C codes implementing these algorithms.

9. define file structures, write C codes implementing these.

Instructional Methods and Techniques

Power Point presentation, Computer workshops

Tutorial Place

classroom, Computer Lab.

Co-term Condition

-

Textbook

1) Çölkesen,R.T. ; Algoritma Geliştirme Veriyapıları; Papatya Bilim..; 3.Basım; 2016; ISBN : 978-975-6797-94-5

2) Kurnaz, S,: Veri Yapıları ve Algoritma Temelleri, 3.Basım, Papatya Yayıncılık, 2015, ISBN: 978-975-6797-45-7

Other References

 

Homework & Projects

Problems with C coding will be given to the students

Laboratory Work

 

Computer Use

Dev C++

Other Activities

None

                   

 

 

 

 

Assessment Criteria

Activities

Quantity

Effects on Grading, %

Attendance

 

 

Midterm

1

30

Quiz

 

 

Homework

7

25

Term Paper/Project

 

 

Laboratory Work

 

 

Practices

 

 

Tutorial

 

 

Seminar

 

 

Presentation

 

 

Field Study

 

 

Final Exam

1

45

TOTAL

 

%100

Effects of Midterm on Grading, %

 

%55

Effects of Final on Grading, %

 

%45

TOTAL

 

%100

 

 

ECTS/

WORKLOAD TABLE

Activities

Count

Hours

Total

Workload

Lecture

14

2

28

Midterm

1

12

12

Quiz

 

 

 

Homework

8

5

40

Term Paper/Project

 

 

 

Laboratory Work

14

1

14

Practices

2

4

8

Tutorial

 

 

 

Seminar

 

 

 

Presentation

 

 

 

Field Study

 

 

 

Final Exam

1

12

12

Total Workload

 

 

114

Total Workload/25

 

 

114/25

Course ECTS Credits

 

 

5

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Week

 

Topics

Course Outcomes

1

Developing algorithms, and data structures

1

2

Data Models and sorting algorithms

2

3

Recursive algorithms

8

4

Searching algorithms

2

5

List and linked List

3

6

Que data structure

4

7

Stack data structure

4

8

Midterm Examination

1-7

9

Tree data structure

5

10

Grphs data models

6

11

Graph aplications

6

12

File data structure

9

13

State machines

7

14

State machines

7

15

Final Examination

1-14

 

Relationship between Computer-Based Data Acquisition and Control

Course and the MECHATRONICS Curriculum

 

 

Program Outcomes

Level of Contribution

1

2

3

a

An ability to apply basic knowledge of mathematics, science, and engineering

 

 

X

b

To learn basic computer knowledge, to make use of software and hardware components needed in the professional work life

 

 

X

c

To think algorithmically and use this ability in conducting software planning

 

 

X

d

To define professional work life problems and to be able to solve them

 

 

X

e

To code by using uptodate software programming languages

 

 

X

f

To design and code software using Internet technologies, to code client/server based programs

X

 

 

g

To learn designing a database and to code programs that have connection with a database

 

X

 

h

To gain basic electrics and electronics knowledge related with the computer hardware

 

 

 

i

An ability to apply their knowledge to maritime discipline

X

 

 

j

To get responsibility in analyzing, designing, planning and coding phases of a software as well as writing reports in each of these phases. To have non-administrative responsibilities in project production

 

 

X

k

To have a general knowledge about computer networks

X

 

 

l

To have basic knowledge about operating systems

X

 

 

m

To attain an ability to communicate written and orally effectively

 

X

 

n

To take responsibility and initiative, to make decisions and be creative

 

X

 

o

A recognition of the need for, and an ability to engage in life-long learning

 

X

 

p

An understanding of professional and ethical responsibilities

X

 

 

r

To be able to read and understand technical documents written in both Turkish and English, to be able to communicate written and orally effectively

X

 

 

   1: Small, 2: Partial, 3: Full

 

 

 

 

 

 

 

 

 

 

 

 

 

Programme Outcomes & Course Outcomes Connectivity Matrix

Course

Outcomes

1

2

3

4

5

6

7

8

9

Programme Outcomes

 

a

 

 

 

 

 

 

 

 

 

b

 

 

 

 

 

 

 

 

 

c

 

 

 

 

 

 

 

 

 

d

 

 

 

 

 

 

 

 

 

e

 

 

 

 

 

 

 

 

 

f

 

 

 

 

 

 

 

 

 

g

 

 

 

 

 

 

 

 

 

h

 

 

 

 

 

 

 

 

 

i

 

 

 

 

 

 

 

 

 

j

 

 

 

 

 

 

 

 

 

k

 

 

 

 

 

 

 

 

 

l

 

 

 

 

 

 

 

 

 

m

 

 

 

 

 

 

 

 

 

n

 

 

 

 

 

 

 

 

 

o

 

 

 

 

 

 

 

 

 

P

 

 

 

 

 

 

 

 

 

r

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Prepared by

Şevket GÜNDÜZ

Assist.Prof..Dr.

Date

26.01.2017

Signature