• ### المرجع الرئيسي للمقرر

المرجع الرئيسي لمقرر 2321 عال

• ### الخطة الدراسية

الخطة الدراسية لمقرر 2321 عال

##### المحاضرات
الإسم تفاصيل أخرى
PowerPoint Slides

PowerPoint Slides for CS2321

PowerPoint Slides Part II

PowerPoint Slides for CS2321

Tutorials

Tutorials for CS2321

Solutions for Tutorials
##### الخطة الدراسية
 2321 عال  -  تراكيب البيانات والخوارزميات عدد الوحدات عدد الساعات نظري عملي 3 3 0
##### وصف المقرر

This course aims to introduce basic data structures and Algorithms which are to be used as tools in designing solutions to problems. The course includes describing the usage of various data structures, explaining the operations for maintaining common data structures and recognizing the associated algorithms’ operations and complexity.

CS1111 CS2301

##### الكتاب

Data Structures and Algorithm Analysis in C , 3rd Edition, Prentice Hall Int. 1997.

Mark Allen Weiss

Mr. Saud Aleid

##### احتساب الدرجات
نوع التقييم الدرجة
1 .  First Exam 25 % ()
2 .  Second Exam 25 % ()
3 .  Tutorial Test 10 % ()
4 .  Final Exam 40 % ()
##### الأهداف
الهدف التقييم
1 .  Define basic concepts of algorithms analysis. Exams
2 .  Describe different data structures including lists, stacks, queue, hash tables, graphs and trees. Exams
3 .  State the relative performance analysis of some sorting algorithms via worst, average, and best cases. Exams
4 .  Recognize various graph algorithms Exams
5 .  Derive asymptotic complexity measures for operations on abstract data type values; typically, to search, sort, match, or traverse the abstract data type. Exams
6 .  Choose the appropriate data structure in solving a specific problem. Exams
7 .  Analyze problems and find the best algorithm that solves them. Exams
##### الموضوعات
الأسبوع الوصف - القراءة
1-15

Introduction

Algorithm Analysis

Pointers and Arrays

Recursion, Lists, Stacks, and Queues

Trees

Hashing

Priority Queues

Sorting & Searching

Graph Algorithms