MOOC Massive Open Online Courses (السنة الدراسية 2018/2019)

Programming tecniques

درس رقم 1: Files File Handling in C File Access Access Rules Functions		Farouk Al Omari
درس رقم 2: Pointers I Computer Memory Pointers		Farouk Al Omari
درس رقم 3: Pointers II Pointers and Functions Arguments Pointers and Array Address Arithmetic		Farouk Al Omari
درس رقم 4: Strings Strings Strings as character pointers The strcmp() Function		Farouk Al Omari
درس رقم 5: Structures Structures in C Keeping Data Together Structures vs. Arrays Nested Structures Pointers to structures Array of structures General Notes on structures		Farouk Al Omari
درس رقم 6: Sorting I Why Sorting External and Internal Sorting Sorting Algorithms Our Focus Insertion Sort		Farouk Al Omari
درس رقم 7: Sorting II Selection Sort Algorithm Examples Sample Code Complexity Analysis Properties		Farouk Al Omari
درس رقم 8: Sorting III Bubble Sort Bubble Sort Algorithm Bubble Sort C Code Complexity Analysis Properties of Bubble Sort		Farouk Al Omari
درس رقم 9: Searching Notation Sequential Search Binary Search Complexity Analysis		Farouk Al Omari
درس رقم 10: 2d Arrays Two Dimensional Arrays Declaration Accessing 2D Arrays Arrays and Functions Array of Strings Dynamic Memory Allocation		Farouk Al Omari
درس رقم 11: Stacks I Stacks in our life Computer Stacks Stacks Manipulation Basic Operations on A Stack Implementing Stack with Array Data Structure		Farouk Al Omari
درس رقم 12: Stacks II Basic Operations - Push Example Stack Initialization - Revisited		Farouk Al Omari
درس رقم 13: Queues I Queues in out life Computer Queues Application of Queues Basic Operations on A Queue		Farouk Al Omari
درس رقم 14: Queues II Prototypes of functions on Queues Implementation of Queues		Farouk Al Omari
درس رقم 15: Queues III Implementing Circular Arrays in C Create A Queue Array implementation of queues		Farouk Al Omari
درس رقم 16: Linked Lists I Properties and Limitations of Array Representation Abstract Data Types Linked Lists Node and List Declarations		Farouk Al Omari
درس رقم 17: Linked Lists II Simple List Operations Set Position Insertion Function Prototype Insertion Code		Farouk Al Omari
درس رقم 18: Linked Lists III Simple List Operations Comments on Node Deletion Traverse a List Find a List size Find a Target Node		Farouk Al Omari
درس رقم 19: Stacks and Queues: Linked lists implementation I Stack is an Abstract Data type (ADT) Multiple Implementations key structures in C Create a Stack		Farouk Al Omari
درس رقم 20: Stacks and Queues: Linked lists implementation II Pop Operation Stack full function Compare Implementations		Farouk Al Omari
درس رقم 21: Recursion I Introduction Recursion Tree Recursion Process		Farouk Al Omari
درس رقم 22: Recursion II Designing Recursive Algorithms Implementation Considerations Binary Search		Farouk Al Omari
درس رقم 23: Recursion III Key Step Outline Backtracking Algorithms Choosing the data structure Implementation		Farouk Al Omari
درس رقم 24: Recursion IV The Towers of Hanoi Power Function Divide and Conquer Sorting Merge Sort		Farouk Al Omari
درس رقم 25: Notions of Algorithms Complexity Measures of Algorithm Complexity Efficiency Measures Big - O - Notation		Farouk Al Omari

Menu secondario

MOOC Massive Open Online Courses (السنة الدراسية 2018/2019)

Programming tecniques

الشرائح

Please login

Please login

Menu secondario

MOOC Massive Open Online Courses (السنة الدراسية 2018/2019)

Programming tecniques

الشرائح