Information Systems and Technologies (with thesis) | |||||
Master | TR-NQF-HE: Level 7 | QF-EHEA: Second Cycle | EQF-LLL: Level 7 |
Course Code: | BIS504 | ||||||||
Course Name: | Data Structures | ||||||||
Course Semester: |
Fall Spring |
||||||||
Course Credits: |
|
||||||||
Language of instruction: | |||||||||
Course Requisites: | |||||||||
Does the Course Require Work Experience?: | No | ||||||||
Type of course: | Department Elective | ||||||||
Course Level: |
|
||||||||
Mode of Delivery: | Face to face | ||||||||
Course Coordinator : | Öğr.Gör. HALİME SUVAY EKER | ||||||||
Course Lecturer(s): |
Dr.Öğr.Üyesi NURŞEN TOPÇUBAŞI |
||||||||
Course Assistants: |
Course Objectives: | The aim of the course is to enable the students to select the most suitable data structures and algorithms for a problem by considering the existing constraints and also to evaluate the performance of the solutions they find without coding. Throughout the course, simple data structures such as sorting and searching will be explained, ranging from simple data structures to advanced data structures such as balanced trees and graphical operations. |
Course Content: | Introduction to algorithms and data structures; Array data structure and dynamic memory allocation; Recursive programming; Linked lists; Stacks; Queues; Wood construction; Search techniques; Ranking techniques; Hash techniques; Information compression techniques; Basic graph algorithms; Problem-solving work. |
The students who have succeeded in this course;
|
Week | Subject | Related Preparation |
1) | Introduction to algorithms and data structures | |
2) | Linked lists | |
3) | Array data structure and dynamic memory allocation | |
4) | Recursive Programming | |
5) | Stacks, Queues | |
6) | Wood, construction | |
7) | Search techniques | |
8) | Midterm | |
9) | Sorting techniques | |
10) | Hash techniques | |
11) | Graph representation and algorithms: Circulation | |
12) | Information compression techniques | |
13) | Basic graph algorithms | |
14) | Problem-solving work. |
Course Notes / Textbooks: | Data Structures and Algorithms Made Easy in Java, Narasimha Karumanchi, 2011 |
References: | The Algorithm Design Manual, Steven S Skiena, Springer, New York, 2012 Data Structures and Algorithms in Java, 2nd Edition, Robert Lafore, 2002 |
Learning Outcomes | 1 |
2 |
3 |
4 |
5 |
---|---|---|---|---|---|
Program Outcomes | |||||
1) Having knowledge and skills in software development for different environments, systems management, network security, data and database management systems. | |||||
2) Keeping up-to-date with current issues about new information systems that are the result of rapid change of information technologies. | |||||
3) Be aware of the importance of Information Systems' strategic position in the firm and its role in the creation of new business strategies. | |||||
4) To be able to take responsibilities in the information projects as project manager or participant in accordance with the project objectives. | |||||
5) Ability to carry out an independent study on the subjects requiring expertise in the field of Information Systems. |
No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
Program Outcomes | Level of Contribution | |
1) | Having knowledge and skills in software development for different environments, systems management, network security, data and database management systems. | 3 |
2) | Keeping up-to-date with current issues about new information systems that are the result of rapid change of information technologies. | 2 |
3) | Be aware of the importance of Information Systems' strategic position in the firm and its role in the creation of new business strategies. | |
4) | To be able to take responsibilities in the information projects as project manager or participant in accordance with the project objectives. | 2 |
5) | Ability to carry out an independent study on the subjects requiring expertise in the field of Information Systems. | 2 |
Individual study and homework | |
Lesson | |
Group study and homework | |
Lab | |
Problem Solving | |
Case Study |
Written Exam (Open-ended questions, multiple choice, true-false, matching, fill in the blanks, sequencing) | |
Homework | |
Application |
Semester Requirements | Number of Activities | Level of Contribution |
Midterms | 1 | % 40 |
Final | 1 | % 60 |
total | % 100 | |
PERCENTAGE OF SEMESTER WORK | % 40 | |
PERCENTAGE OF FINAL WORK | % 60 | |
total | % 100 |
Activities | Number of Activities | Workload |
Course Hours | 14 | 42 |
Application | 4 | 4 |
Midterms | 1 | 1 |
Final | 1 | 1 |
Total Workload | 48 |