كلية الهندسة - جامعة عين شمس, الرئيسية

الرئيسية  >  كلية الهندسة - جامعة عين شمس, الرئيسية

Data Structures and Problem Solving

What Will Learn?

  • Course Aims
    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 algorith
  • Course Goals
  • Industry, Innovation and Infrastructure

Requirements

CSE141

Description

  • English Description

    Algorithms: definitions, correctness, efficiency. Complexity analysis: the big O-notation, the theta-notation, the Omega-notation. Elementary data structures: arrays. Linked lists: stacks, queues, priority queues, hash tables, heaps. Recursion. Binary and search trees. Tree operations: insertion, deletion, balancing. Multiway trees: B-tree, B*-tree, B+-tree, R-tree. graphs. Sorting algorithms: insertion, selection, bubble, merge, quick, radix. Comparison between sorting algorithms using complexity analysis notations.
  • Arabic Description

    Algorithms: definitions, correctness, efficiency. Complexity analysis: the big O-notation, the theta-notation, the Omega-notation. Elementary data structures: arrays. Linked lists: stacks, queues, priority queues, hash tables, heaps. Recursion. Binary and search trees. Tree operations: insertion, deletion, balancing. Multiway trees: B-tree, B*-tree, B+-tree, R-tree. graphs. Sorting algorithms: insertion, selection, bubble, merge, quick, radix. Comparison between sorting algorithms using complexity analysis notations.
  • قسم
    هندسة الحاسبات والنظم
  • الساعات المعتمدة
    3
  • الدرجات
    الإجمالي ( 100 ) = نصف العام (20) + tr.Major Assessment (25 = tr.Industry 0% , tr.Project 20% , tr.Self_learning 0% , tr.Seminar 10% ) + tr.Minor Assessment (5) + tr.Oral/Practical (10) + درجة الامتحان (40)
  • الساعات
    ساعات المحاضرة: 2, ساعات التعليم: 1, ساعات المعمل: 2
  • Required SWL
    125
  • Equivalent ECTS
    5
  • - 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.