Your transaction is in progress.
Please Wait...
Course Details
KTO KARATAY UNIVERSITY
Trade and Industry Vocational School
Programme of Information Security Technology
Course Details
Course Code Course Name Year Period Semester T+A+L Credit ECTS
08121108 Data Structures 1 Spring 2 2+2+0 5 5
Course Type Elective
Course Cycle Associate (Short Cycle) (TQF-HE: Level 5 / QF-EHEA: Short Cycle / EQF-LLL: Level 5)
Course Language Turkish
Methods and Techniques -
Mode of Delivery Face to Face
Prerequisites -
Coordinator -
Instructor(s) Lect. Gizem ÇELİK
Instructor Assistant(s) -
Course Instructor(s)
Name and Surname Room E-Mail Address Internal Meeting Hours
Lect. Gizem ÇELİK C-125 [email protected] 7434 Friday
10:00-12:00
Course Content
The importance of data structures and their relationship with algorithms
Importance of data structures in secure software development and performance
Concepts of memory management and data integrity

Arrays and secure data access
Array definition, search, and sorting algorithms
Array overflow (buffer overflow) and security vulnerabilities

Linked lists
Singly and doubly linked lists
Data integrity in insertion and deletion operations

Stack data structure and attack scenarios
Stack logic and applications
Stack overflow and stack-based attack concept

Queue and priority queue structures
Queue operations
Task scheduling and secure message queue management

Tree structures (Tree, BST)
Nodes, search, and insertion algorithms
Use of trees in access control systems

Graph structures (Graph)
Nodes, edges, and directed graphs
Use in network topologies and security monitoring systems

Hash tables
Hash functions and collision management
Relationship with cryptographic hash functions

File structures and data integrity
File systems and data read/write operations
Integrity verification using hashing

Security applications involving data structures
Examples of log recording, event analysis, and data masking

Time and memory complexity analysis
Big-O notation and performance measurement in secure coding

The role of data structures in encryption algorithms
Key management and table-based algorithms (e.g., AES, RSA – conceptual)

Applied mini project
Designing a secure data access or simple log analysis system

General review and evaluation
Students present their projects with practical examples
Objectives of the Course
The aim of this course is to develop students'algorithmic thinking skills and help them understand the logic of data structures while learning how to use them to ensure data security, integrity, and efficient access.
Students will explore fundamental data structures such as arrays, linked lists, stacks, queues, trees, and graphs, and will learn their applications in cryptographic algorithms, log analysis, access control systems, and network security through practical exercises.
Contribution of the Course to Field Teaching
Basic Vocational Courses
Specialization / Field Courses
Support Courses
Transferable Skills Courses
Humanities, Communication and Management Skills Courses
Relationships between Course Learning Outcomes and Program Outcomes
Relationship Levels
Lowest Low Medium High Highest
1 2 3 4 5
# Program Learning Outcomes Level
P1 He/she has basic, current and practical knowledge about his/her profession. 5
P3 Follows current developments and practices for his/her profession and uses them effectively. 3
P4 Uses professionally relevant information technologies (software, programs, animations, etc.) effectively. 5
P5 Has the ability to independently evaluate professional problems and issues with an analytical and critical approach and to propose solutions. 4
P6 Can effectively present thoughts through written and verbal communication at the level of knowledge and skills and express them in an understandable manner. 3
P7 Takes responsibility as a team member to solve unforeseen and complex problems encountered in applications related to his/her field. 3
P9 It has social, scientific, cultural and ethical values ​​in the stages of collecting data related to its field, its application and the announcement of its results. 2
P11 Explains and applies data security and encryption methods. 4
P13 Identifies and fixes security vulnerabilities in computer and software systems. 3
P14 Performs mathematical calculations. 3
P20 To enable students to gain the competence to solve the problems they encounter in their academic and professional lives by using information technologies effectively and efficiently. 4
Course Learning Outcomes
Upon the successful completion of this course, students will be able to:
No Learning Outcomes Outcome Relationship Measurement Method **
O1 P.1.3
O2 P.11.1
O3 P.1.6
O4 P.11.6
O5 P.3.3
O6 P.4.3
O7 P.4.4
O8 P.5.1
O9 P.5.4
** Written Exam: 1, Oral Exam: 2, Homework: 3, Lab./Exam: 4, Seminar/Presentation: 5, Term Paper: 6, Application: 7
Weekly Detailed Course Contents
Week Topics
1 Importance of data structures and their relationship with algorithms. Memory management and data integrity concepts.
2 Arrays and secure data access. Buffer overflow and related security vulnerabilities.
3 Linked lists: single and double. Data integrity and secure access.
4 Stack data structure and stack-based attack scenarios.
5 Queues and priority queues. Secure task scheduling.
6 Tree structures (Tree, BST). Applications in access control systems.
7 Graph data structures. Network topologies and security monitoring systems.
8 Midterm
9 Hash tables and collision handling. Relation to cryptographic hash functions.
10 File structures and data integrity verification.
11 Data structure applications in security: logging, event analysis, data masking.
12 Time and memory complexity analysis (Big-O notation).
13 Role of data structures in encryption algorithms.
14 Applied mini project: secure data access or log analysis system design.
15 General review and project presentations.
16 Final Exam
Textbook or Material
Resources Dr. Rifat Çölkesen, "Veri Yapıları ve Algoritmalar", Papatya Yayıncılık
Prof. Dr. Vasif Vagifoğlu NABİYEV, "Algoritmalar", Seçkin Yayıncılık
Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Addison Wesley
Evaluation Method and Passing Criteria
In-Term Studies Quantity Percentage
Attendance - -
Laboratory - -
Practice - -
Field Study - -
Course Specific Internship (If Any) - -
Homework - -
Presentation - -
Projects - -
Seminar - -
Quiz - -
Listening - -
Midterms - -
Final Exam - -
Total 0 (%)
ECTS / Working Load Table
Quantity Duration Total Work Load
Course Week Number and Time 0 0 0
Out-of-Class Study Time (Pre-study, Library, Reinforcement) 0 0 0
Midterms 0 0 0
Quiz 0 0 0
Homework 0 0 0
Practice 0 0 0
Laboratory 0 0 0
Project 0 0 0
Workshop 0 0 0
Presentation/Seminar Preparation 0 0 0
Fieldwork 0 0 0
Final Exam 0 0 0
Other 0 0 0
Total Work Load: 0
Total Work Load / 30 0
Course ECTS Credits: 0
Course - Learning Outcomes Matrix
Relationship Levels
Lowest Low Medium High Highest
1 2 3 4 5
# Learning Outcomes P1 P3 P4 P5 P11
O1 Temel programlama mantığı ve veri yapıları hakkında bilgiye sahiptir. 5 3 5 - -
O2 Öğrenilen bilgileri uygulamalı örneklerle gösterir. - - - - -
O3 Karmaşık problemleri ele alır ve yaratıcı çözümler üretir. - - - - -
O4 Algoritma geliştirmeyi bilir ve algoritmaya uygun veri yapısı oluşturur. - - - - -
O5 Güncel yazılım dilleri hakkında bilgi sahibi olur. - - - - -
O6 Bir problemi analiz eder. - - - - -
O7 Alternatif çözüm yollarını değerlendirir ve en uygun olanını seçer. - - - - -
O8 Veri güvenliğinin temel prensiplerini ve amacını tanımlar. - - - - -
O9 Şifreleme yöntemlerinin veri bütünlüğü ve kimlik doğrulamasını sağlama rollerini açıklar ve bu yöntemleri kullanır. - - - - -