DATA STRUCTURES AND DATA ORGANIZATION
- Course
- MISY242 - DATA STRUCTURES AND DATA ORGANIZATION
- Department
- Management Information Systems - English - Undergraduate
- Course Type
- Course
- Status
- Required
- Language
- English
- Credit
- 4
- ECTS
- 6
- T+P+L
- 3 + 0 + 2
- Course Coordinator(s)
- Asst. Prof. Dr. Sara SALEHI
- Prerequisite
Course Description
The objective of this course is to provide the basics of data structures and data organization. The course will introduce Python and algorithms for the implementation of data structures which are stack, queue, linked list, tree also, the applications of data structures covering stack applications which are paranthesis checker, infix to postfix and prefix conversions, recursion, dynamic stack and queue, tree traversals. Theoretical aspects of most widely used data structures will be covered during the lectures. Programming assignments and lab works cover the Python implementations of applications of data structures that are discussed in the lectures.
DATA STRUCTURES AND DATA ORGANIZATION
Evaluation Tools (Active Term)
| Item | Type | Weight (%) |
|---|---|---|
| Midterm Exam | Midterm | 35 |
| Quiz | Quiz | 20 |
| Final Exam | Final | 45 |
| Total | 100 | |
Course outcomes
- 01 Problem solving using linear data structures: Stack applications
- 02 Examine and explain the working principles of the linear data structures: Stack and Queue
- 03 Implement the basic linear data structures: Stack and Queue
- 04 Examine and implement the dynamic data structures: Linked List
- 05 Examine and implement the hierarchical data structures: Tree
Course Syllabus
| Week | Topic |
|---|---|
| Week 1 | Introduction to Data Structures and Functions Review |
| Week 2 | Lists, Arrays and Tuples |
| Week 3 | Dictionaries, Classes and Objects |
| Week 4 | Structures and Abstract Data Types |
| Week 5 | Stack |
| Week 6 | Stack Applications |
| Week 7 | Review and Practice |
| Week 8 | MID-TERM EXAM WEEK |
| Week 9 | Queue |
| Week 10 | Linked List |
| Week 11 | Linked List |
| Week 12 | Tree |
| Week 13 | Tree |
| Week 14 | Review and Problem Solving |
| Week 15 | FINAL EXAM WEEK |
Reference Books & Course Materials
- 01 Goodrich, M. T., Tamassia, R., & Goldwasser, M. H. (2013). Data structures and algorithms in Python. Hoboken, NJ, USA: Wiley.
- 02 Miller, B., & Ranum, D. (2013). Problem solving with algorithms and data structures.
- 03 Dierbach, C. (2012). Introduction to computer science using python: A computational problem-solving focus. Wiley Publishing.
- 04 Horstmann, C. S., & Necaise, R. D. (2022). Python for everyone. John Wiley & Sons.
Learning Outcomes
- L01 Examine the use of Python lists in solving basic programming problems and implement common list operations such as insertion, deletion, searching, indexing, and traversal. SOLO 3
- L02 Examine how structured data can be represented in Python using classes and dataclasses, and implement simple records with related attributes and methods. SOLO 3.5
- L03 Examine the working principles of stacks and implement stack-based solutions for problems such as expression handling, reversing data, and checking balanced symbols. SOLO 4
- L04 Examine the working principles of queues and implement basic queue operations such as enqueue, dequeue, peek, and traversal using Python. SOLO 3.5
- L05 Examine the concept of dynamic data storage and implement linked lists, including node creation, insertion, deletion, searching, and traversal. SOLO 3.5
- L06 Examine the basic principles of hierarchical data structures and implement tree structures, including nodes, parent-child relationships, traversal, and basic binary tree operations. SOLO 4
Program Outcomes
- P01 Demonstrate comprehensive knowledge of key concepts across the breadth of effective application and use of MIS and innovative information technologies in organizations.
- P02 Demonstrate autonomy and responsibility in managing MIS projects and improving organizational processes
- P03 Demonstrate comprehensive understanding of appropriate enterprise frameworks, theories from the MIS to research and assess contemporary issues in the field and related allied fields and disciplines
- P04 Apply MIS knowledge to facilitate the acquisition, development, deployment, and management of information systems
- P05 Apply MIS knowledge to the exploitation of opportunities created by information technology innovations ensuring the alignment between MIS strategy and organizational strategy
- P06 Demonstrate ethical reasoning in relation to crucial MIS issues such as privacy, information security, and ethical use of information
- P07 Apply appropriate technologies and techniques to the collection and analysis of organizational and environmental data to facilitate evidence-based decision-making
- P08 Analyse organizational data to accurately identify organizational problems and propose solutions using MIS
- P09 Apply effective communication skills consistent with the professional environment
- P10 Apply effective collaboration skills consistent with the professional environment
Po-Lo Matrix
| LO | P01 | P02 | P03 | P04 | P05 | P06 | P07 | P08 | P09 | P10 | Average |
|---|---|---|---|---|---|---|---|---|---|---|---|
| L01 | 4 | 4 | 4 | 5 | 5 | 3 | 4 | 4 | 5 | 3 | 4.1 |
| L02 | 4 | 5 | 5 | 4 | 4 | 4 | 4 | 4 | 5 | 3 | 4.2 |
| L03 | 3 | 4 | 4 | 4 | 5 | 5 | 4 | 4 | 5 | 3 | 4.1 |
| L04 | 4 | 4 | 4 | 4 | 4 | 4 | 5 | 3 | 3 | 3 | 3.8 |
| L05 | 4 | 4 | 3 | 3 | 4 | 4 | 5 | 5 | 4 | 3 | 3.9 |
| L06 | 4 | 4 | 5 | 5 | 5 | 5 | 5 | 4 | 4 | 3 | 4.4 |