تراكيب البيانات

Course Title: Data Structure

Credit Hours: 3 Hours

Instructors:Mahmoud Obeidat

E-mail[email protected]

Text Book: data structure and algorithms in c++ ,second edition ,adam dorzedk

Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Sedgewick, 3rd edition, Addison-WesleyProfessional, 1998.



Grading scheme

· First Exam (20)

· Second Exam (20)

· Final Exam    (50)

· Quizzes (5)

· Lab (5)

Course Description
Complexity of algorithms, matrices, strings, lists, stacks and queues, hash tables, graphs and networks, trees, types of files and their internal structures, example algorithms.
Course Outline

Fundamental data structures

o Class and array review. o Stacks by arrays. o Queues by arrays. o Pointers review. o Linked lists. o Stacks by Linked List. o Queues by Linked List. o Doubly Linked List. o Heaps. o Trees.

Data structures search and sort algorithms

o Sorting: � Selection, Insertion, Bubble, Quick and Heap sorting algorithm � Select a suitable sorting algorithm and algorithms time and space complexities. o Searching: � Linear, Linear with high probability, Binary search algorithms � Hashing

Lecture Note


الملفات المرفقة

الساعات المكتبية

الاحد 10-11

الاثنين 10-12

الثلاثاء 10-12

أرقام الاتصال

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

[email protected]

ساعة وتقويم

إحصائية الموقع

عدد الصفحات: 18

البحوث والمحاضرات: 56

الزيارات: 7732