م عنوان المحاضرة عرض حفظ
    1 Lecture 37: Iterative Improvement -5 Maximum Network Flow and Maximum Matching in Bipartite Graphs
    2 Lecture 36: Iterative Improvement -4 Maximum Network Flow
    3 Lecture 35: Iterative Improvement -3 Genetic Algorithm
    4 Lecture 34: Iterative Improvement -2 The Simplex Method-B
    5 Lecture 33: Iterative Improvement -1 The Simplex Method
    6 Lecture 32: Greedy Technique -3: Dijkstra’s Alg. and Hoffman Trees
    7 Lecture 31: Greedy Technique -2: Kruskal’s Algorithm
    8 Lecture 30: Greedy Technique -1: Prim’s Algorithm
    9 Lecture 29: Dynamic Programming -3 Optimal Binary Search Trees
    10 Lecture 28:Dynamic Programming -2 Knapsack problem
    11 Lecture 26: :Space and Time Trade-Offs -4 B-trees
    12 Lecture 25: :Space and Time Trade-Offs -3 Boyer-Moore String Matching + Hashing
    13 Lecture 24: Space and Time Trade-Offs -2: Horse pool String Matching
    14 Lecture 23: حل اسئلة الامتحان النصفي
    15 Lecture 22: Space and Time Trade – Offs -1
    16 Lecture 21:Transform-and-Conquer: 5 Problem Reduction
    17 Lecture 20: Transform-and-Conquer: 4 Heaps and Heapsort
    18 Lecture 19: Transform-and-Conquer: 3 AVL and 2-3 tree Search
    19 Lecture 18:Transform-and-Conquer: 2 Gaussian Elimination
    20 Lecture 17: Transform-and-Conquer: 1 Instance Simplification
    21 Lecture 16: Divide-and-Conquer: 2 Quicksort and Large Int Multiplication
    22 Lecture 15: Divide-and-Conquer: 1 Mergesort and Quicksort
    23 Lecture 14: Decrease and Conquer - 3 Variable-size Decrease
    24 Lecture 13: Decrease and Conquer - 2 Decrease by a Constant Factor
    25 Lecture 12: Decrease and Conquer - 1 Insertion Sort and Topological Sort
    26 Lecture 11: Graph Traversal Algorithms: DFS and BFS
    27 Lecture 10: Exhaustive Search
    28 Lecture 9: Brute Force Algorithms
    29 Lecture 8: Fundamentals of the Analysis of Algorithm Efficiency -6 Computing Fibonacci Numbers
    30 Lecture 7: Fundamentals of the Analysis of Algorithm Efficiency -5
    31 Lecture 6: Fundamentals of the Analysis of Algorithm Efficiency -4
    32 Lecture 5: Fundamentals of the Analysis of Algorithm Efficiency -3
    33 Lecture 4: Fundamentals of the Analysis of Algorithm Efficiency -2
    34 Lecture 3: Fundamentals of the Analysis of Algorithm Efficiency -1
    35 Lecture 2: Introduction - 2
    م عنوان المحاضرة عرض حفظ
    1 Lecture 17: Requirements Engineering - 4
    2 Lecture 16: Requirements Engineering - 3
    3 Lecture 15: Requirements Engineering - 2
    4 Lecture 14: Requirements Engineering - 1
    5 Lecture 13: System Modeling - 3
    6 Lecture 12: System Modeling - 2
    7 Lecture 11: System Modeling - 1
    8 Lecture 10: Agile Development - 3
    9 Lecture 9: Agile Development - 2
    10 Lecture 8: Agile Development - 1
    11 Lecture 7: RUL and Agile Development
    12 Lecture 6: Incremental & Spiral Development
    13 Lecture 5: Term Project
    14 Lecture 4:Process Activities
    15 Lecture 3: Waterfall & Incremental Models
    16 Lecture 2: Software Engineering Ethics
    17 Lecture 1:Professional Software Development - 1
مساقات ذات علاقة

مركز التميز والتعليم الإلكتروني | الجامعة الإسلامية بغزة

هاتف: 2644400 8 970+ داخلي 1571| فاكس:264 4800 8 970+

البريد الإلكتروني: elearning@iugaza.edu.ps

page counter