الصفحات - صفحة عضو هيئة التدريس

أعضاء هيئة التدريس

|

تسجيل دخول

y

ساره عبدالكريم عبدالله الزكري

أستاذ مساعد

القسم :

علوم الحاسبات

التخصص العام :

علوم الحاسب الألي

التخصص الدقيق :

علوم الحاسب الألي

معلومات التواصل

البريد الإلكتروني :

saalzakari@pnu.edu.sa

رقم التحويلة :

نبذة عن عضو هيئة التدريس

المناصب الحالية

الجامعية

جدول المقررات

رمز المقرر	الشعبة	اسم المقرر	من الساعة	إلى الساعة
	24123	تحليل وتصميم الخوارزميات	10:00	11:40
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.
	23862	تحليل وتصميم الخوارزميات	13:00	13:50
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.
	23368	تحليل وتصميم الخوارزميات	13:00	14:40
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.

جدول المقررات

رمز المقرر	الشعبة	اسم المقرر	من الساعة	إلى الساعة
	21186	مشروع التخرج (2)	10:00	11:40
وصف المقرر
	21186	مشروع التخرج (2)	08:00	09:40
وصف المقرر

جدول المقررات

رمز المقرر	الشعبة	اسم المقرر	من الساعة	إلى الساعة
	24123	تحليل وتصميم الخوارزميات	10:00	10:50
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.
	23368	تحليل وتصميم الخوارزميات	13:00	13:50
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.
	24123	تحليل وتصميم الخوارزميات	11:00	11:50
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.
	23368	تحليل وتصميم الخوارزميات	14:00	14:50
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.

جدول المقررات

رمز المقرر	الشعبة	اسم المقرر	من الساعة	إلى الساعة
	24430	تحليل وتصميم الخوارزميات	10:00	10:50
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.

جدول المقررات

رمز المقرر	الشعبة	اسم المقرر	من الساعة	إلى الساعة
	24430	تحليل وتصميم الخوارزميات	10:00	11:40
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.
	23862	تحليل وتصميم الخوارزميات	09:00	09:50
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.

جدول المقررات

رمز المقرر	الشعبة	اسم المقرر	من الساعة	إلى الساعة
	24430	تحليل وتصميم الخوارزميات	10:00	10:50
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.
	23862	تحليل وتصميم الخوارزميات	08:00	09:40
وصف المقرر The focus of this course is on how to design good algorithms, and how to analyze their efficiency. It explains how to compare and analyze the primary sorting and searching algorithms. It illustrates the behavior of the algorithm with respect to the best, worst, and average case running times. In addition, it describes the divide-and-conquer, greedy, dynamic programming, backtracking, and branch-and-bound methods and their implementations. It also covers the essential topics of algorithms design and analysis from a mathematical perspective.