
Overview
Overview
وصف المقرر:
هذا المقرر هو نقطة البداية في رحلتك لفهم كيفية عمل الحاسب.
ستتعلم أساسيات تمثيل المعلومات ومعالجتها، بالإضافة إلى أساسيات الجبر المنطقي وكيفية استخدامه في تصميم الدوائر الرقمية.
يتم تقديم المفاهيم بأسلوب مبسط مع أمثلة تربط المادة بالواقع وتساعدك على تذكرها لسنوات قادمة.
عند الاشتراك في المقرر ستحصل على:
- فيديوهات شرح: تغطي جميع مواضيع المادة بأسلوب واضح ومنظم.
- فيديوهات حل للأمثلة: لتطبيق المفاهيم على أسئلة عملية.
- فيديوهات حل للاختبارات القديمة: لفهم الأنماط المتكررة وتحسين أدائك.
- مجموعة خاصة: للتفاعل مع زملائك ومناقشة المادة.
المنهج:
- Data Representation: Understanding how information is represented and processed in computers, including binary numbers and data encoding.
- Boolean Algebra: Basics of Boolean algebra, truth tables, and logic operations.
- Combinational Logic: Designing combinational circuits, including adders, subtractors, and multiplexers.
- Sequential Logic: Introduction to flip-flops, counters, and shift registers.
- Memory Design: Basics of designing and understanding memory elements, such as RAM and ROM.
- Computer Architecture Basics: Overview of CPU operations, instruction cycles, and simple instruction sets.
ملاحظات هامة:
- الاشتراك في المقرر لمدة ترم واحد فقط
- الاشتراك لا يحتوي بثوث مباشرة
- الاشتراك لا يشمل حل الواجبات نيابة عنك.
Course Features
- Lectures 150
- Quizzes 3
- Duration 22 weeks
- Skill level Beginner
- Language Arabic
- Students 275
- Assessments Yes
Curriculum
Curriculum
Curriculum
- 10 Sections
- 150 Lessons
- 22 Weeks
Expand all sectionsCollapse all sections
- Ch1: Data Representation34
- 1.1Course Introduction1 Minute
- 1.2Chapter 1 content1 Minute
- 1.3Intro to Systems1 Minute
- 1.4Types of Number Systems5 Minutes
- 1.5Decimal to Binary6 Minutes
- 1.6Decimal to Octal3 Minutes
- 1.7Decimal to Hex3 Minutes
- 1.8Quick intro to the second type of conversions1 Minute
- 1.9Converting Binary to Decimal3 Minutes
- 1.10Converting Octal to Decimal2 Minutes
- 1.11Converting Hex to Decimal2 Minutes
- 1.12Revision of converting from ANY to Decimal1 Minute
- 1.13Counting in Binary6 Minutes
- 1.14Introduction to the 3rd and 4th type of conversions1 Minute
- 1.15Converting Octal to Binary5 Minutes
- 1.16Converting Hex to Binary4 Minutes
- 1.17Special Powers of 21 Minute
- 1.18Binary Coded Decimal4 Minutes
- 1.19BCD Addition11 Minutes
- 1.20Examples on Converting Decimal to any System14 Minutes
- 1.21Examples on Converting any System to Decimal10 Minutes
- 1.22Converting Octal to Hexadecimal6 Minutes
- 1.23ASCII5 Minutes
- 1.24UniCode2 Minutes
- 1.25Parity Bit5 Minutes
- 1.26Parity Bit Examples3 Minutes
- 1.27Binary Arithmetics with Examples14 Minutes
- 1.28Did you Master Conversions ? …10 Minutes5 Questions
- 1.29Hexadecimal Arithmetics8 Minutes
- 1.30Octal Arithmetics5 Minutes
- 1.31Complements6 Minutes
- 1.322’s Complement Extra9 Minutes
- 1.33Extra Examples
- 1.34Revision Slides
- CH1: Extra Exercises4
- Extensive Practice Ch11
- Ch2: Introduction to Digital Logic Circuits33
- 4.1Combinational Logic Circuits Introduction2 Minutes
- 4.2AND , OR , NOT Gates5 Minutes
- 4.3NAND & NOR Gates4 Minutes
- 4.4How to Draw a Logic Diagram ?3 Minutes
- 4.5How to Find the Expression Using the Diagram ?3 Minutes
- 4.6Boolean Algebra Axioms and Theorems p18 Minutes
- 4.7Boolean Algebra Axioms and Theorems p26 Minutes
- 4.8Boolean Algebra Simplification Examples8 Minutes
- 4.9Boolean Algebra Simplification Special Cases8 Minutes
- 4.10Why Do We Simplify ?4 Minutes
- 4.11The Canonical Form SOP5 Minutes
- 4.12The Canonical Form POS4 Minutes
- 4.13SOP & POS Revision1 Minute
- 4.14Canonical Forms Important Remarks10 Minutes
- 4.15How to Write the Function in POM Form?12 Minutes
- 4.16How to Write the Function in SOM Form?4 Minutes
- 4.17Introduction to K-maps2 Minutes
- 4.18Two Variable K-map7 Minutes
- 4.19Two Variable K-map Representation3 Minutes
- 4.20Three Variable K-map6 Minutes
- 4.21Three Variable K-map Representation3 Minutes
- 4.22Four Variable K-map4 Minutes
- 4.23Four Variable K-map Representation5 Minutes
- 4.24K-map simplification Part 1 (grouping)10 Minutes
- 4.25K-map simplification Part 2 (finding the minimal expression)5 Minutes
- 4.26Don’t Care Conditions with an Example9 Minutes
- 4.27POS K-map with an Example6 Minutes
- 4.28POS K-map with Don’t Care Conditions8 Minutes
- 4.29XOR & XNOR Gates5 Minutes
- 4.30NAND & NOR Gates Remarks3 Minutes
- 4.31Technological Mapping Using NAND Gates with example11 Minutes
- 4.32Technological Mapping Using NOR Gates with example7 Minutes
- 4.33Quiz CH225 Minutes12 Questions
- Major 1 revision13
- 5.1Multiple Choice questions & True or False10 Minutes
- 5.2Conversion and Arithmetic question6 Minutes
- 5.3Complement question1 Minute
- 5.4(minterms expression, simplification , logic diagram ) question5 Minutes
- 5.5K-map Full question8 Minutes
- 5.6Your Turn !
- 5.7Multiple Choice questions & True or False10 Minutes
- 5.8Complement questions5 Minutes
- 5.9Minterms & Maxterms questions4 Minutes
- 5.10Boolean function (truth table, minterms, maxterms, logic diagram) questions6 Minutes
- 5.11Boolean Algebra question3 Minutes
- 5.12Your Turn !
- 5.13Live 26-Feb-202551 Minutes
- Ch3: Combinational Logic Design23
- 6.1Chapter Three Introduction1 Minute
- 6.2Design Procedure5 Minutes
- 6.3How to Design a Combinational Circuit ?12 Minutes
- 6.4Designing a Combinational Circuit8 Minutes
- 6.5Half Adder ( important ! )12 Minutes
- 6.6Full Adder ( important ! )12 Minutes
- 6.7BCD to Excess-3 Code P112 Minutes
- 6.8BCD to Excess-3 Code P26 Minutes
- 6.9What time is it ?7 Minutes
- 6.10What is a Decoder?4 Minutes
- 6.11Decoders Applications3 Minutes
- 6.12Decoder Types and Remarks12 Minutes
- 6.13Binary to Octal Decoder5 Minutes
- 6.14BCD to Decimal Decoder5 Minutes
- 6.15How to build a big decoder using a smaller one? what is the enabler?3 Minutes
- 6.16Building 3-8 Decoders using 2-4 Decoders6 Minutes
- 6.17Building a Binary to Hexa Decoder using 2-4 Decoders10 Minutes
- 6.18The Power of Decoders and OR Gates3 Minutes
- 6.19Implement the Function using a Decoder1 Minute
- 6.20Introduction to Multiplexers3 Minutes
- 6.21Multiplexers Types, Truth Tables and Rules7 Minutes
- 6.22Implementing a Function Using 8 to 1 Multiplexer5 Minutes
- 6.23Implementing a function using 4 to 1 Multiplexer8 Minutes
- Major 2 Live2
- Ch4: Introduction to computer organization42
- 8.1Chapter 4 Introduction1 Minute
- 8.2Digital Computer Main Components5 Minutes
- 8.3CPU Components6 Minutes
- 8.4Register Types12 Minutes
- 8.5Instruction Execution Cycle6 Minutes
- 8.6Instruction Format2 Minutes
- 8.7Program Execution Speed5 Minutes
- 8.8Program Execution Speed (Important Practice)7 Minutes
- 8.9RISC VS CISC11 Minutes
- 8.10Parallel Processing3 Minutes
- 8.11Parallel Processing (Instruction level Pipelining) + (Important Practice)10 Minutes
- 8.12Pipelining Limitations6 Minutes
- 8.13Parallel Processing (Processor Level)5 Minutes
- 8.14CPU throughput + (example)5 Minutes
- 8.15Slides 4.1
- 8.16Introduction to Memory6 Minutes
- 8.17Memory Organization and Size5 Minutes
- 8.18Memory Block Diagram4 Minutes
- 8.19Memory Size Practice6 Minutes
- 8.20Memory Size Practice (Important)5 Minutes
- 8.21Memory and CPU Communication3 Minutes
- 8.22Memory Operations4 Minutes
- 8.23Characteristics of RAM6 Minutes
- 8.24Read Only Memory (ROM)6 Minutes
- 8.25Byte Oredering Problem3 Minutes
- 8.26Interpreters VS Compilers4 Minutes
- 8.27Introduction to Cache Memory3 Minutes
- 8.28Temporal VS Spital Locality4 Minutes
- 8.29Cache Structure and Operations7 Minutes
- 8.30Types of Cache3 Minutes
- 8.31Multilevel Cache5 Minutes
- 8.32Cache Performance3 Minutes
- 8.33Memory Access Time and Practice (important)6 Minutes
- 8.34Slides 4.2
- 8.35Introduction to Buses5 Minutes
- 8.36Types of Arbitration4 Minutes
- 8.37Centralized Arbitration (1) Daisy Chaining7 Minutes
- 8.38Centralized Arbitration (2) Multiple Shared Bus Request with Priority Levels (Important Question)7 Minutes
- 8.39Centralized Arbitration (3) Single Shared Bus Request with Priority Levels7 Minutes
- 8.40Distributed Arbitration5 Minutes
- 8.41Applications of Bus Arbitration2 Minutes
- 8.42Slides 4.3
- Extensive Practice Ch40
- OLD FINAL (GOOD LUCK !)1
Instructor
Instructor