The course described: This course provided an overview of types of data structures such as: matrices, linked lists, single linked list, double linked list, circular linked list, trees, stacks, queues, and forests; discussed the various applications of these data structures, and programming patterns.
Credit hours: 3
Prerequisites: MATH212
Objectives of the course :
• Learn how to easily select data structures and affect the performance of the program.
• Solving data-driven critical problems.
• Study of common abstract data structures such as matrices, linked lists, stacks, queues, trees, binary trees, heaps, binary search trees, and graphs.
• Apply different data structures and gain more experience in programming in C or C++.
Course outputs :
1.1: Explanation of the basic concepts and processes of common data structures such as matrices, linked lists, stacks, queues, and trees.
1.2: Comparison and comparison between different data structures and their usage cases.
2.1: The delivery and explanation of the design and implementation of data structures and algorithms.
2.2: Choosing the appropriate data structures for a particular problem and justifying the choice.
2.3: Application of common data structures in a programming language.
2.4: Improving and evaluating the efficiency of data structures.
3.1: Cooperation with peers in projects related to data structures and algorithms.
This website uses special cookies to ensure ease of use, improve your browsing experience, and clarify the terms and policies related to About user privacy. By continuing to browse this website, you acknowledge that you accept the use of cookies and the terms of the Privacy Policy