1. FIRST CYCLE - BACHELOR'S DEGREE
  2. FACULTY OF ECONOMICS & ADMINISTRATIVE SCIENCES
  3. MANAGEMENT INFORMATION SYSTEMS DEPARTMENT
  4. 219 MANAGEMENT INFORMATION SYSTEMS
Course Information Course Learning Outcomes Course's Contribution To Program ECTS Workload Course Details
Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
YBS 260ALGORITHMS3 + 04th Semester5

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Elective
Course Objective The aim of this course is to provide students with the knowledge and skills to design, analyze and implement programming languages using modern design methods.
Course Content Algorithm design and analysis, time complexity analysis, brute force method, divide and conquer method, decrease and conquer method, transform and conquer method, dynamic programming, greedy algorithms, backtracking algorithms, computational theory
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1Defines the fundamentals of algorithm analysis
2Defines algorithm design techniques
3Defines dynamic programming
4Defines the greedy algorithm design technique

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 001            
LO 002            
LO 003            
LO 004            
Sub Total            
Contribution000000000000

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14456
Mid-terms11515
Final examination11717
Total Work Load

ECTS Credit of the Course





130

5
COURSE DETAILS
 Select Year   


This course is not available in selected semester.


Print

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes