كلية الهندسة - جامعة عين شمس, الرئيسية
Data Structures and Algorithms
What Will Learn?
-
Course AimsBy the end of this course, the student will be able to: ● Illustrate the importance of data structures ● Explain how to create and use Linked list, Trees, heaps, and graphs ● Infer when to use each of the data structure ● Explain how to estimate and analyse the time and memory cost of each data structure algorithm
-
Course Goals
- Industry, Innovation and Infrastructure
Requirements
CSE331s
Description
-
English Description
Algorithms: definitions, correctness. Elementary data structures: linked lists (single, double, and circular), stacks, queues, priority queues, heaps, hash tables. Recursion: tail recursion, non-tail recursion, indirect recursion, nested recursion, excessive recursion. Binary and search trees. Tree operations: insertion, deletion, balancing. Multiway trees. Graphs. Sorting algorithms: insertion, selection, bubble, merge, quick, radix. -
Arabic Description
Algorithms: definitions, correctness. Elementary data structures: linked lists (single, double, and circular), stacks, queues, priority queues, heaps, hash tables. Recursion: tail recursion, non-tail recursion, indirect recursion, nested recursion, excessive recursion. Binary and search trees. Tree operations: insertion, deletion, balancing. Multiway trees. Graphs. Sorting algorithms: insertion, selection, bubble, merge, quick, radix.
-
قسمهندسة الحاسبات والنظم
-
الساعات المعتمدة3
-
الدرجاتالإجمالي ( 100 ) = نصف العام (20) + tr.Student Activities (20 = tr.Industry 0% , tr.Project 10% , tr.Self_learning 0% , tr.Seminar 10% ) + tr.Oral/Practical (10) + درجة الامتحان (50)
-
الساعاتساعات المحاضرة: 2, ساعات التعليم: 1, ساعات المعمل: 2
-
Required SWL125
-
Equivalent ECTS5
- - Mark Allen Weiss, Data Structures & Algorithm Analysis in C++, 4th Edition, Pearson, 2014.
- - Frank Carrano and Timothy Henry, Data Abstraction & Problem Solving with C++: Walls and Mirrors, 7th Edition, 2016, Pearson Education, Inc.