Teaching Plan for PDA, w.h., Instructor



|Subject Title  | Subject length in hours |

|Python-Data Structures and Algorithms |  30 |

|Subject Description: |

|This course provides students with the basics of Python programming and object-oriented design. Then foundational techniques for algorithm analysis and |

|recursion are covered. In the main portion of the course, we present fundamental data structures and algorithms for searching and sorting using Python |

|programming languages. |

| Textbooks/manuals: |

| Lecture Notes |

|by Dr. Tareq Jaber |

Method of Evaluation

|Type |Number |% Value |Type |Number |% Value |

|Assignment |4 |40 |Exam |1 |60 |

| | | | | | |

Teaching Method Location

|Method |Number of hours| Classroom/Lab (On-campus) |

|  Lecture |30 | Classroom/Lab (Off-campus) |

|  Computer Based Learning |  | Practicum |

|  Seminar |  | |

|  Supervised Practical (e.g. clinic) |  | |

|  Supervised Lab (e.g. computers) | | |

|  Distance Education |  | | |

Does this subject require a final examination or a formal evaluation?

Yes No

If “Yes”, indicate the passing mark:

Subject Outline and Teaching Calendar

|Day/Date |Contact Hours |Module Topic - Sub Topics |

|Day 1 & 2 |4.0 T |Python Review |

| | |Python Overview, Objects. |

| | |Control Flow, Functions. |

| | |Classroom exercises. |

|Day 3 & 4 |4.0T |Object-Oriented Programming |

| | |Principle, Software Development. |

| | |Class Definition, Inheritance. |

| | |Classroom exercises. |

| | |Assignment |

|Day 5 & 6 |4.0T |Algorithm Analysis |

| | |The experimental Approach. |

| | |The Theoretical Approach. |

| | |Classroom exercises. |

| | |Quiz |

|Day 7 & 8 |4.0T |Recursion, Python-Sequences |

| | |Examples of Recursions. |

| | |Arrays, Lists, Tuples, Datasets. |

| | |Classroom exercises. |

| | |Assignment |

|Day 9 & 10 |4.0T |Stack, Queue, Linked List |

| | |Stack, Queue. |

| | |Singly, Doubly, Circularly Linked Lists. |

| | |Classroom exercises. |

|Day 11 & 12 |4.0T |Trees |

| | |General, Binary Tree, Tree Traversal. |

| | |Search Tree. |

| | |Classroom exercises. |

| | |Assignment |

|Day 13 & 14 |4.0T |Sorting |

| | |Binary Sort. |

| | |Quick Sort. |

| | |Classroom exercises. |

|Day 15 |2.0T |Exam |

Legends in the course outline: T- teaching

................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download