Skip to main content
TR

DATA STRUCTURES AND DATA ORGANIZATION

Course
ISYE242 - DATA STRUCTURES AND DATA ORGANIZATION
Department
Information Systems Engineering - English - Master
Course Type
Scientific Preparation
Status
Required
Language
English
Credit
0
ECTS
0
T+P+L
0 + 0 + 0
Course Coordinator(s)
Dr. Inst. Basmah ANBER
Prerequisite
-
Keywords
-

Course Description

-

DATA STRUCTURES AND DATA ORGANIZATION

Evaluation Tools (Active Term)

Item Type Weight (%)
Midterm Midterm 35
Final Final 45
Assignment Lab Assignment 10
Quiz Lab Quiz 10
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 Overview of C and C++ Programming Language
Week 2 Structures
Week 3 Stacks
Week 4 Stacks Applications
Week 5 Recursion
Week 6 Queues
Week 7 Queues
Week 8 MID-TERM EXAM WEEK
Week 9 MID-TERM EXAM WEEK
Week 10 Linked List
Week 11 Linked List
Week 12 Trees
Week 13 Trees
Week 14 FINAL EXAM WEEK
Week 15 FINAL EXAM WEEK

Reference Books & Course Materials

  1. 01 Jeffrey Childs, C++: Classes and Data Structures, Prentice Hall, 2007.
  2. 02 Langsam Y., Augenstein M., Tenenbaum A. Data Structures Using C and C++, 2nd ed., Prentice Hall Int. 1996.

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.