Management Information Systems (English)
Bachelor TR-NQF-HE: Level 6 QF-EHEA: First Cycle EQF-LLL: Level 6

General Introduction Information of the Course

Course Code: MIS103
Course Title: Algorithm and Programming
Course Semester: Fall
Ders Kredileri:
Theoretical Practical Credit ECTS
2 2 3 6
Language of instruction: EN
Course Prerequisites:
Does the Course Require Work Experience?: No
Type of course: Necessary
Course Level:
Bachelor TR-NQF-HE:6. Master`s Degree QF-EHEA:First Cycle EQF-LLL:6. Master`s Degree
Mode of Delivery: Face to face
Course Coordinator : Dr.Öğr.Üyesi Ferhat KUTLU
Course Lecturer(s): Dr.Öğr.Üyesi Engin HENGİRMEN
Dr.Öğr.Üyesi Yasemin BAKIR
Dr.Öğr.Üyesi Osman SELVİ
Dr.Öğr.Üyesi Ferhat KUTLU
Course Assistants:

Course Objectives and Content

Course Objectives: The aim of this course is to give information about general structure of programming, variables, functions, selection statements, loop, text files, user defined data type, records, pointers.
Course Content: Problem solving techniques; (input_process_output) process; algorithm analysis; certainty; finitude; events; mathematical terms (arithmetic; relational and logical operators); conditional and iterative statements; vector and matrix representation; one or multi-dimensional operations except for simple data; subroutine and function of the sub-programs; evaluation algorithms.

Learning Outcomes

The students who have succeeded in this course;
Learning Outcomes
1 - Knowledge
Theoretical - Conceptual
1) Explain the concept of algorithm.
2) Develops an algorithm for solving a problem.
3) Explains flowchart components and functions.
4) Explain the decision structure and functions.
2 - Skills
Cognitive - Practical
3 - Competences
Communication and Social Competence
Learning Competence
Field Specific Competence
Competence to Work Independently and Take Responsibility

Course Weekly Plan

Week Subject Related Preparation
1) Algorithm and Flowchart Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
2) coding environment Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
3) Code Writing Rules Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
4) Basic Input Output Commands Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
5) Variable Definitions Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
6) Loop Control Statements Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
7) Divert and Compare Commands Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
8) Midterm
9) Defining and Using Array Variables Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms,
10) Array Variable Implementations and sort operation Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
11) Subprograms Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
12) Functions Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
13) External Subprograms Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
14) Sequential Files Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
15) Direct Access Files Reading and researching topics • Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009 • Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011
16) Final Exams

Sources

Course Notes / Textbooks: The Algorithm Design Manual, Steven S Skiena, Springer, New York, 2012
Introdusction to Programming i,n Java,Addison-Wesley Professional, Robert Sedgewick, Kevin Wayne, New Jersey.
References: Introduction to Algorithms, 3rd Edition, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, MIT Press, 2009
Algorithms, 4th Edition. Sedgewick, R., Wayne, K. Addison-Wesley. 2011

Relationship Between Course and Program Learning Outcomes

Course Learning Outcomes

1

2

3

4
Program Outcomes
1) To be able to use the information obtained in the fields of Information Technologies and Business Science with appropriate tools for decision making.
2) To be able to recognize the computer hardware, to distinguish the technical features of the parts, to compare, to classify and to choose the appropriate hardware.
3) To have knowledge about software types, software selection and supply, and to plan and manage software development processes.
4) Performing the database design required for applications.
5) To be able to establish a computer network system, to solve the problems encountered in networks and hardware.
6) To be able to determine the data needs in MIS based problem solving of different disciplines, to obtain these data and to compile the data to produce information and make it ready for use.
7) To be able to determine the information system requirements, to make system analysis and design.
8) To be able to design a project for the solution of an MIS or social problem and to propose different solution methods.
9) To be able to design projects as a MIS specialist, to contribute to the project as both a manager and an employee, and to produce innovative ideas.
10) In cases where an information system problem is solved as a team, to take individual responsibility at every stage of the problem, to contribute to the team and to lead the team when necessary.
11) To be able to follow professional, current and developing trends by using Turkish and English languages, to convey necessary information in written and oral form.
12) To be able to evaluate the knowledge and skills acquired in the field with a critical perspective by integrating them with different disciplines.
13) To be able to act according to social ethical values in professional studies.

Relationship Between Course and Learning Outcome

No Effect 1 Lowest 2 Low 3 Medium 4 High 5 Highest
           
Program Outcomes Level of Contribution
1) To be able to use the information obtained in the fields of Information Technologies and Business Science with appropriate tools for decision making. 3
2) To be able to recognize the computer hardware, to distinguish the technical features of the parts, to compare, to classify and to choose the appropriate hardware. 5
3) To have knowledge about software types, software selection and supply, and to plan and manage software development processes. 5
4) Performing the database design required for applications. 4
5) To be able to establish a computer network system, to solve the problems encountered in networks and hardware. 5
6) To be able to determine the data needs in MIS based problem solving of different disciplines, to obtain these data and to compile the data to produce information and make it ready for use. 2
7) To be able to determine the information system requirements, to make system analysis and design. 3
8) To be able to design a project for the solution of an MIS or social problem and to propose different solution methods. 3
9) To be able to design projects as a MIS specialist, to contribute to the project as both a manager and an employee, and to produce innovative ideas. 3
10) In cases where an information system problem is solved as a team, to take individual responsibility at every stage of the problem, to contribute to the team and to lead the team when necessary. 1
11) To be able to follow professional, current and developing trends by using Turkish and English languages, to convey necessary information in written and oral form. 1
12) To be able to evaluate the knowledge and skills acquired in the field with a critical perspective by integrating them with different disciplines. 3
13) To be able to act according to social ethical values in professional studies. 2

Learning Activities and Teaching Methods

Lecture
Individual study and homework
Course
Grup çalışması ve ödevi
Labs
Web-Based Learning

Assessment and Evaluation Methods and Criteria

Written Exam (open-ended questions, multiple-choice, true/false, matching, fill-in-the-blanks, ordering)
Homework

Assessment & Grading

Semester Requirements Number of Activities Level of Contribution
Homework Assignments 3 % 30
Midterms 1 % 30
Final 1 % 40
Total % 100
PERCENTAGE OF SEMESTER WORK % 60
PERCENTAGE OF FINAL WORK % 40
Total % 100

Workload and ECTS Credit Calculation

Activities Number of Activities Duration (Hours) Workload
Course Hours 15 2 30
Application 15 2 30
Midterms 1 10 10
Final 1 20 20
Total Workload 90