• 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 YBS 8047 SOFTWARE DEVELOPMENT COMPULSORY 2 0 0 5

Offered By

Management Information Systems Non-Thesis(Distance Learning)

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

ASSOCIATE PROFESSOR CAN AYDIN

Offered to

Management Information Systems Non-Thesis(Distance Learning)

Course Objective

Students will gain competency to define a problem to be solved, to develop solution strategy, to apply the strategy, and to assess the quality and reliability of the production.

Learning Outcomes of the Course Unit

1   To be able to define the problem to be solved by software. 2   To be able to design realization steps of a software project. 3   To be able to use data abstraction. 4   To be able to apply software development methods to problem solving. 5   To be able to assess the methods, the tools, and the technology critically.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Introduction: Programming Languages 2 Intro to Python, variables, expressions, 3 Comparison, recursion 4 Loops 5 Strings, Lists 6 Dictionaries, Tuples 7 Files exception handling 8 Midterm exam 9 Search and sort algorithms 10 Object oriented programming I 11 Object oriented programming II 12 Visualization 13 Statistical Applications 14 Graphical Interface Applications 15 Application

Recomended or Required Reading

Downey, A. B., 2012. Think Python. O'Reilly Media Inc., Sebastapol.

Planned Learning Activities and Teaching Methods

The activities are detailed in the 'Assessment Methods' and 'Workload Calculation' sections.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 FCG FINAL COURSE GRADE 3 FCG FINAL COURSE GRADE MTE * 0.20 + FIN* 0.80 4 RST RESIT 5 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.20 + RST* 0.80 *** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

Students' performances are measured with a midterm exam and a final exam.

Language of Instruction

Turkish

Course Policies and Rules

The rules applied by the department apply.

Contact Details for the Lecturer(s)

Dr. Can AYDIN Dept. of Management Information Systems DEÜ Dokuzçeşmeler Kampüsü Buca 35400 Izmir E-mail: can.aydin at deu.edu.tr Phone: 232-301 0760

Office Hours

It will be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 14 2 28 Preparations before/after weekly lectures 14 4 56 Preparation for midterm exam 1 20 20 Preparation for final exam 1 20 20 Midterm 1 2 2 Final 1 2 2 TOTAL WORKLOAD (hours) 128

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 LO.1 5 5 5 5 5 5 5 5 5 5 5 LO.2 5 5 5 5 5 5 5 5 5 5 5 LO.3 5 5 5 5 5 5 5 5 5 5 5 LO.4 5 5 5 5 5 5 5 5 5 5 5 LO.5 5 5 5 5 5 5 5 5 5 5 5