American University of Beirut

Skip Navigation LinksHome > Maroun Semaan Faculty of Engineering and Architecture > Electrical and Computer Engineering > Introduction to Computation and Programming Using Python > Introduction to Computation and Programming Using Python

Introduction to Computation and Programming Using Python

​​​​​​​​​​​​​​Here you can access the non-interactive content! 

​​​> Download Syllabus

> Back to the main page​

تستطيع الاطِّلاعِ على المحتوى غير التفاعلي هنا! ​​​

> تحميل المنهج ​​

​العودة إلى الصفحة الرئيسية <​​

⬇️ Check the following before starting your journey ⬇️

​​قم بمراجعة المعلومات الآتية  قبل البدء بهذه المرحلة الأكاديمية​

​
The lecture slides and assignments are available below on the left side, and the lessons' non-interactive videos are available on the right.

All videos have subtitles. 
To choose English or Arabic subtitles: 
1. Click on the Settings gear in the lower right corner of the YouTube video
2. Click on 'Settings/CC(2)' to select the language.
You can use the CC button located to the left of the Settings gear to toggle subtitles on and off.

​عرض المحاضرات والمهام متاحة أدناه على الجانب الأيسر، وفيديوهات الدروس غير التفاعلية متاحة على اليمين.

تتوفر الترجمة لكل الفيديوهات:
لاختيار الترجمة الإنجليزية أو العربية
1. اضغط على معدات الإعدادات في الزاوية اليمنى السفلية من الفيديو على منصة يوتيوب،
2. اضغط على 'الإعدادات/CC)2)" لإختيار اللغة المرجوّة.
اضغط على "CC"  الواقع على الجانب الأيسر لمعدات الإعدادات بهدف تفعيل الترجمة أو تعطيلها.​


Recommendations for successful completion:

> Stop the video after each question and take time to think before continuing:

In the interactive version of the course,  each lesson is divided into short videos separated by questions. These short videos are combined together in the below non-interactive lesson videos with a 10-second delay after each question. You are strongly encouraged to stop the video after each question and give it as much time as possible before resuming the video. The reason is that learning by discovering strongly enhances your problem-solving skills. It moves you from the receiving end of the instructional methodology to the active learner's end.

>It's okay if you don't have the complete answer to some questions:
For some questions, figuring out a complete answer on your own is not simple and may take time. It is enough to think about the question for some time depending on your time constraints to prepare your mind for the answer. It doesn't really matter if you end up figuring out the answer because identifying what doesn't work is equally important. 

Longer videos may lead to a loss of focus:
The inclusion of questions helps break down the videos into shorter segments, averaging around 5 minutes each. This duration is considered optimal, as studies have shown that students tend to lose focus when watching longer videos.

:إقتراحات للإكمال التام والناجح

> أوقف الفيديو بعد كل سؤال وخذ وقتًا للتفكير قبل المتابعة:​​​
يحوي كل فيديو أسئلة متعددة بالعادة يليها الأجوبة التي تظهر بعد عشر ثواني. يُرجى من المتعلم إيقاف الفيديو مؤقتًا بعد كل سؤال للاستغراق في التفكير بهدف فهم المحتوى قبل متابعة المشاهدة. ويعود السبب إلى طريقة "التعلم عن طريق الاكتشاف" المُعززة لمهارات حل المعضلات التعليمية. فتقوم هذه الطريقة بنقل المتعلم من الطرف المتلقي للمنهجية التعليمية إلى طرف المتعلم الناشط.

> لا بأس إذا لم يكن لديك إجابة كاملة لبعض الأسئلة:
أما بالنسبة إلى بعض الأسئلة المعقدة بعض الشيء، قد يستغرق المتعلم بعض الوقت لتقديم جوابًا نظرًا لمرحلة الصعوبة. يكفي الاستغراق بالتفكير آخذا بالاعتبار الوقت المتبقي لتقديم جواب ما. لا يهم حقًا إذا انتهى الأمر باكتشاف الإجابة لأن تحديد ما لا يهم، يُعد مُهمًا بنفس القدر.
​
قد تؤدي مقاطع الفيديو الطويلة إلى فقدان التركيز:​
بالإضافة إلى ذلك، يساعد إضافة الأسئلة على تقسيم مقاطع الفيديو إلى مقاطع أقصر، تستغرق إحداها 5 دقائق. هذه المدّة تُعتبر مثالية بما أن الدراسات برهنت فقدان تركيز المتعلم في خلال مشاهدة مقاطع الفيديو الطويلة. 


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

​​​Module I: Foundations
WeekTopicNon-interactive lesson videos
Week 1Topic 1: Getting Started Lecture: Lesson 1 - Algorithms and computational problem solving
Lecture: Lesson 2 - Stored Program Computers
Lecture: Lesson 3 - Binary representation
Lecture: Lesson 4 - Programming languages
Lecture: Lesson 5 - Sample Python code
Week 1Topic 2: Introduction to Python Lecture: Lesson 1 - Data Types in Python
Lecture: Lesson 2 - Operators
Lecture: Lesson 3 - Expressions
Lecture: Lesson 4 - Variables and the assignment operator
Lecture: Lesson 5 - Miscellaneous
Week 2Topic 3: Selection and Repetition Lecture: Lesson 1 - Motivation
Lecture: Lesson 2 - Selection if, if-else
Lecture: Lesson 3 - Multi-way selection and nested structures
Lecture: Lesson 4 - Repetition: while loops and counters
Lecture: Lesson 5 - Examples
Lecture: Lesson 6 - For loops
Lecture: Lesson 7 - Nested loops
Lecture: Lesson 8 - Boolean variables in loops
Lecture: Lesson 9 - Bisection method
Week 3Topic 4: Lists, tuples, and strings Lecture: Lesson 1 - List type
Lecture: Lesson 2 - Manipulating lists
Lecture: Lesson 3 - Element distinctness problem
Lecture: Lesson 4 - List copy: alias versus Clone
Lecture: Lesson 5 - Lists and Tuples with Mutable Objects
Lecture: Lesson 6 - For loops
Lecture: Lesson 7 - Nested loops
Lecture: Lesson 8 - Boolean variables in loops
Lecture: Lesson 9 - Bisection method
Week 4Topic 5: Functions: Lecture: Lesson 1 - Introduction
Lecture: Lesson 2 - Scope of variables and execution stack
Lecture: Lesson 3 - Functions handling lists, tuples, and strings
Lecture: Lesson 4 - Miscellaneous
Lecture: Lesson 5 - Higher-order functions
Lecture: Lesson 6 - Some methods associated with list and str types
Week 5 Topic 6: Files and exceptions Topic 7: Miscellaneous: plotting, randomness, and Monte Carlo simulation Lecture: Lesson 1 - Files
Lecture: Lesson 2 - Exceptions and Assertions
Lecture: Lesson 1 - Plotting
Lecture: Lesson 2 - Generating random numbers
Lecture: Lesson 3 - Monte Carlo Simulation: approximating 𝜋
Reading: Spyder Debugger - Spyder Debugger
Week 6 Topic 8: Program Efficiency, Binary Search, and Insertion Sort Lecture: Lesson 1 - Asymptotic Analysis: Theta notation
Lecture: Lesson 2 - Working with Theta
Lecture: Lesson 3 - Time analysis of the element distinctness problem
Lecture: Lesson 4 - Other asymptotic notations
Lecture: Lesson 5 - Time analysis of programs from previous assignments
Lecture: Lesson 6 - Binary search
Lecture: Lesson 7 - Insertion Sort
Lecture: Lesson 8 - Time analysis of some list operations and methods
Module II: Recursion and Elementary Data Structures
Week 7 Topic 9: Recursion I: Foundations Lecture: Lesson 1 - Introduction: recursive factorial and recursion stack
Lecture: Lesson 2 - Tracking recursion, indirect recursion, infinite
Lecture: Lesson 3 - Two-way recursion: Fibonacci numbers
Lecture: Lesson 4 - Two-way recursion: tower of Hanoi
Lecture: Lesson 5 - Recursive binary search
Week 8 Topic 10: Recursion II: Merge Sort, Divide-And-Conquer, And Solving Recurrences Lecture: Lesson 1 - Merge Sort
Lecture: Lesson 2 - Merge Sort time: recurrence and recursion tree
Lecture: Lesson 3 - Comparison of Merge Sort with Insertion Sort and
Lecture: Lesson 4 - Additional recursion tree examples
Lecture: Lesson 5 - Master Theorem
Lecture: Lesson 6 - Ternary Search
Week 9 Topic 11: Data structures digression: Lists Of Lists, 2-Dimensional Lists, Dictionaries, And Stacks Lecture: Lesson 1 - Lists of lists
Lecture: Lesson 2 - 2-dimensional lists
Lecture: Lesson 3 - Dictionaries
Lecture: Lesson 4 - Applications of dictionaries
Lecture: Lesson 5 - Stacks
Week 10 Topic 12: Recursion III: Applications: Enumeration, Randomized Quick Sort, Maze DFS Traversal Lecture: Lesson 1 - Application of recursion: enumeration: generate all
Lecture: Lesson 2 - Another enumeration problem: generate all
Lecture: Lesson 3 - Quick Sort
Lecture: Lesson 4 - Randomized Quick Sort
Lecture: Lesson 5 - Maze DFS traversal
Module III: Object Oriented Programming and Applications
Weeks 11-12 Topic 13: Classes and Object Oriented Programming Lecture: Lesson 1 - Object oriented programming
Lecture: Lesson 2 - User defined classes
Lecture: Lesson 3 - OOP machinery
Lecture: Lesson 4 - OOP concepts
Lecture: Lesson 5 - Inheritance
Lecture: Lesson 6 - Miscellaneous
Week 12 Topic 14: Stacks and Queues Lecture: Lesson 1 - Stack class derived from list
Lecture: Lesson 2 - Queue class: circular implementation
Week 13 Topic 15: Graphs Lecture: Lesson 1 - Classes for dynamic directed and undirected graphs
Lecture: Lesson 2 - Graph Depth First Search (DFS)
Lecture: Lesson 3 - Graph Breadth First Search (BFS)
Lecture: Lesson 4 - Other graph problems
​
Creative Commons License 


Contact Us

For various questions, please try contacting us via social media first!
read more

Privacy Statement

We take data privacy seriously and adhere to all applicable data privacy laws and regulations.
read more

Copyright and Disclaimer

Written permission is needed to copy or disseminate all or part of the materials on the AUB website.
read more

Title IX, Non-Discrimination, and Anti-Discriminatory Harassment

AUB is committed to providing a safe and respectful environment to all members of its community.
read more