Ders Planı

ISTANBUL AYDIN UNIVERSITY

CLASS 1

Lesson plan /

Lesson Information

Course Credit
Course ECTS Credit
Teaching Language of Instruction	İngilizce
Level of Course	Bachelor's Degree, TYYÇ: Level 6, EQF-LLL: Level 6, QF-EHEA: First Cycle
Type of Course
Mode of Delivery	Face-to-face
Does the course require compulsory or optional work experience?
Course Coordinator	Prof. Dr. RAFET AKDENİZ
Instructor (s)
Course Assistant

Purpose and Content

The aim of the course	The objective of this course unit is to discuss the problems of data structures that are used in programming languages, to acquire skills in designing in C, represent data in memory, studey declaration in C-based programming languages, and use complex data structures to solve practical problems.
Course Content	Primitive and complex data structures, arrays, representation arrays in memory, multidimentional arrays, records, linked lists, stacks and queues, representation stacks and queues using arrays and linked lists, graphs, trees, binery trees, problems of sorting and searching.

Learning Outcomes

Adequate knowledge in mathematics, physical sciences and the computer engineering subjects of individual branches; the ability to implement theoretical and practical knowledge in the respective areas to modeling and solving computer engineering problems.
Ability to reflect the developments in Information and Communication Technologies to the applications of Information Technology.
Ability to identify, define, formulate and solve complex computer engineering problems; ability to select and implement the appropriate analysis and modeling methods in this respect.
Ability to design experiments for analysing computer engineering problems, to conduct experiments, to collect data, to analyse and interpret the results.
Ability to design a complex informtacis system, process, device or product to meet specific requirements under realistic restrictions and conditions; ability to implement the modern design methods for this purpose.
Ability to use, choose and develop modern techniques and means required for computer engineering applications; ability to use information technologies effectively.
Ability to work effectively in interdisciplinary and multi-disciplinary teams; ability to work individually..
Knowledge of applications in business life like project management, risk management and change management; awareness about entrepreneurship, innovativeness and sustainable development.
Awareness of the necessity of lifelong learning; ability to reach information, follow the latest developments in science and technology; ability to ensure self-renewal perpetually.
Ability to communicate efficiently both in oral and written ways in Turkish; knowledge of at least one foreign language; ability to effectively prepare reports and understand written reports, prepare design and production reports, effective presentation, giving and receiving clear and understandable instructions.
Knowledge on the effects of informatics applications on health, environment and safety in terms of universal and social aspects and information about the problems of the era; awareness on the legal results of informatics solutions.
Acting in line with ethical principles, sense of professional and ethical responsibility; knowledge on the standards of engineering applications.

Weekly Course Subjects

1	Intruduction. Data structures and algorithms, Primitive data structures.
2	Arrays and pointers. Representation arrays in memory, declaration in C, and application.
3	Multidimentional arrays.
4	Dynamic data allocation.
5	Linear structures and linked lists, Functions to operate on linked lists.
6	Stacks, Operations on stacks, Practical applications.
7	Queues, Representation queues as arrays and as linked lists, applications.
8	Midterm Exam
9	Double linked lists, Circular lists, Operational functions, Trees and tree-like structures, Representation using linked list principles.
10	Binary trees, Binary tree representation of arithmetical expressions.
11	Traversal functions on binery trees.
12	Representation linear lists as binary trees.
13	Sorting and searching algorithms.
14	Multiway search trees.

Resources

1-Sahni S. "Data Structures, Algorithms , and Applications in C++", McGraw-hill, 2005.

EUA Kurumsal Öz değerlendirme Programı İzleme Raporu