Eskisehir Technical University Info Package Eskisehir Technical University Info Package
  • Info on the Institution
  • Info on Degree Programmes
  • Info for Students
  • Türkçe
About the Program Educational Objectives Key Learning Outcomes Course Structure Diagram with Credits Field Qualifications Matrix of Course& Program Qualifications Matrix of Program Outcomes&Field Qualifications
  • Vocational School Of Information Technologies
  • Department Of Computer Technologies
  • Computer Programming Pr.
  • Course Structure Diagram with Credits
  • Data Structures and Programming
  • Learning Outcomes
  • Description
  • Learning Outcomes
  • Course's Contribution to Prog.
  • Learning Outcomes & Program Qualifications
  • ECTS Credit Load

  • The concept of abstract data types can be applied.
  • EN: The Student will be able to describe the abstract data type.
  • EN: Student will be able to implement constructive and destructive functions
  • The student will be able to apply object-oriented programming principles.
  • EN: The student will be able to write header files for classes.
  • EN: The student will be able to understand the hierarchy between classes.
  • EN: The students will be able to apply pointers correctly.
  • EN: The students will be able to process dynamic variables and arrays in a programme.
  • The students will be able to implement array based lists.
  • EN: The students will be able to implement abstract classes.
  • EN: The students will be able to implement abstract functions.
  • The students will be able to check and control exceptions.
  • EN: Exceptions can be identified.
  • EN: precautions are taken for exceptions.
  • EN: Functions are deployed for exceptions.
  • EN: Class can be designed for exceptions.
  • To be written later
  • To be written later
  • To be written later
  • To be written later
  • Recursive functions can be applied.
  • EN: Linked lists can be applied.
  • EN: Operations are conducted on linked lists.
  • Searching and sorting algorithms can be applied in programmes.
  • EN: Lower limits of algorithms can be determined.
  • EN: Various search and sort algorithms can be applied.
  • EN: Queues can be implemented.
  • EN:Stack can be implemented.
  • Binary trees can be implemented in programmes.
  • EN: Problems which binary trees can be implemented, are determined.
  • EN: Add, remove and balance operations can be applied to binary trees.
  • Grapsh can be applied in programmes.
  • EN: Algorithms for graphs can be applied.
  • EN: The storage of graphs in the memory,can be explained.
  • EN: Graphs algorithms can be applied.
  • Programmes can be written with STL.
  • EN: Vectors can be applied in a programme.
  • EN: Containes can be applied in programmes.
  • EN: Vectors and containers are used in programmes.
  • EN: All related functions and algorithms can be implemented in programmes.

  • Info on the Institution
  • Name and Adress
  • Academic Calendar
  • Academic Authorities
  • General Description
  • List of Programmes Offered
  • General Admission Requirements
  • Recognition of Prior Learning
  • Registration Procedures
  • ECTS Credit Allocation
  • Academic Guidance
  • Info on Degree Programmes
  • PhD / Proficiency in Art
  • Master's Degree
  • Bachelor's Degree
  • Associate Degree
  • Info for Students
  • Cost of living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Special Needs Students ı
  • Insurance
  • Financial Support for Students
  • Student Affairs Office
  • Info for Students
  • Learning Facilities
  • International Programmes r
  • Practical Information for Mobile Students
  • Language courses
  • Internships
  • Sports and Leisure Facilities
  • Student Associations