Have the ability to apply knowledge of mathematics, and computer programming
Have the ability to identify, formulate math model, and solve industrial engineering problems
Have the ability to use the techniques, skills, and modern engineering tools necessary for industrial engineering implementation
Mode of Delivery
Face to face
Prerequisites
Yes(BİL102)
Recommended Optional Programme Components
None
Course Description
Algorithms, growth of functions, complexity of algorithms, integers and algorithms, number theory, recursive structures, relations, graphs and graph theory, Euler and Hamilton paths, shortest path problems, graph coloring and trees.
Course Contents
WEEK
TOPICS
1st Week
Algorithms
2nd Week
Asymptotic notations, Complexity of algorithms
3rd Week
Search and sort algorithms
4th Week
Matrices, Number Theory and Applications
5th Week
Recursive Structures and Algorithms
6th Week
Graph Theory, networks and network dependability
7th Week
The shortest path problem, minimum spanning tree problem and Algorithms
8th Week
Midterm Exam
9th Week
Tours and paths on Euler and Hamilton networks
10th Week
Traveling salesman problem and Solution Algorithms
11th Week
Vehicle Routing Problem
12th Week
Assembly Line Balancing Problem
13th Week
Project Management
14th Week
Applications
Recommended or Required Reading
Kenneth H. Rosen, Discrete Mathematics and its Applications, 5. baskı, McGraw-Hill
Planned Learning Activities and Teaching Methods
Lecture
Presentation
Practice
Assessment Methods and Criteria
Quantity
Percentage (%)
Mid-term
1
30
Quiz
4
40
Total(%)
70
Contribution of In-term Studies to Overall Grade(%)
70
Contribution of Final Examination to Overall Grade(%)
