• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS BIL 3129 CONCEPTS OF PROGRAMMING LANGUAGES ELECTIVE 3 0 0 5

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

Offered to

Computer Science

Course Objective

The aim of this course is to enable students to; to understand the concepts of programming language with examples from different programming languages, and to have knowledge about the basic components of programming languages.

Learning Outcomes of the Course Unit

1   Be able to learn a new programming language in a short period of time. 2   Be able to choose the appropriate programming language to develop a project. 3   Be able to evaluate the advantages and disadvantages of the programming languages. 4   Be able to gain the ability to express problem solutions in a programming language using various programming approaches. 5   BE able to acquire the knowledge and skills necessary for designing a new programming language.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Introduction 2 Evaluation of the major programming languages 3 Describing Syntax and Semantics 4 Describing Syntax and Semantics (cont.) 5 Lexical and Syntax Analysis 6 Basic Properties of Variables, Data Types and Statements 7 Statement Level Control Structures 8 Midterm exam 9 Subprograms 10 Abstract Data Types and Encapsulation 11 Support for Object Oriented Programming 12 Concurrency 13 Exception Handling and Evet Handling 14 Functional Programming and Logic Programming Languages

Recomended or Required Reading

Concepts of Programming Languages (12th Edition), Robert W. Sebesta, Addison Wesley, 2019.

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 VZ Vize 2 FN Final 3 BNS BNS VZ * 0.40 + FN * 0.60 4 BUT Bütünleme Notu 5 BBN Bütünleme Sonu Başarı Notu VZ * 0.40 + BUT * 0.60 *** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

mete.eminagaoglu@deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 13 3 39 Preparations before/after weekly lectures 12 4 48 Preparation for midterm exam 1 8 8 Preparation for final exam 1 10 10 In-class practices 1 7 7 Final 1 2 2 Midterm 1 2 2 TOTAL WORKLOAD (hours) 116

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 PO.11 PO.12 PO.13 LO.1 4 5 5 LO.2 4 5 5 LO.3 4 5 5 LO.4 4 5 5 LO.5 5 5 5 5 5 5 5 5 5 5 5 5 5