Skip to main content
TR

DATA STRUCTURES AND DATA ORGANIZATIONS

Course
ITEC242 - DATA STRUCTURES AND DATA ORGANIZATIONS
Department
Information Technologies - English - Master
Course Type
Scientific Preparation
Status
Required
Language
English
Credit
0
ECTS
0
T+P+L
0 + 0 + 0
Course Coordinator(s)
Asst. Prof. Dr. Sara SALEHI
Prerequisite
-
Keywords
-

Course Description

-

DATA STRUCTURES AND DATA ORGANIZATIONS

Evaluation Tools (Active Term)

Item Type Weight (%)
Midterm Exam Midterm 35
Quiz Quiz 20
Final Exam Final 45
Total 100

Course outcomes

  1. 01 Problem solving using linear data structures: Stack applications
  2. 02 Examine and explain the working principles of the linear data structures: Stack and Queue
  3. 03 Implement the basic linear data structures: Stack and Queue
  4. 04 Examine and implement the dynamic data structures: Linked List
  5. 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

  1. 01 Goodrich, M. T., Tamassia, R., & Goldwasser, M. H. (2013). Data structures and algorithms in Python. Hoboken, NJ, USA: Wiley.
  2. 02 Miller, B., & Ranum, D. (2013). Problem solving with algorithms and data structures.
  3. 03 Dierbach, C. (2012). Introduction to computer science using python: A computational problem-solving focus. Wiley Publishing.
  4. 04 Horstmann, C. S., & Necaise, R. D. (2022). Python for everyone. John Wiley & Sons.

Learning Outcomes

  1. L01 Problem solving using linear data structures: Stack applications
  2. L02 Examine and explain the working principles of the linear data structures: Stack and Queue
  3. L03 Implement the basic linear data structures: Stack and Queue
  4. L04 Examine and implement the dynamic data structures: Linked List
  5. L05 Examine and implement the hierarchical data structures: Tree

Program Outcomes

No program outcomes have been defined.

Po-Lo Matrix

The PO-LO matrix has not been populated yet.