Course
| code | CS212 |
| credit_hours | 3 |
| title | Data Structures and Algorithms |
| arbic title | |
| prequisites | CS243 |
| credit hours | 3 |
| Description/Outcomes | This course covers the organization of data and algorithms that act upon them. The topics of linked lists, stacks, queues, trees and graphs as well as hashing are introduced. Algorithms manipulating data structure, like searching and sorting, memory allocation and file management are included. The concept of abstract data types is also introduced. |
| arabic Description/Outcomes | |
| objectives | 1. Understand the difference between static and dynamic data types.
2. Understand the concept of pointers & dynamic memory allocation.
3. Acquire practical programming experience using dynamic structures
4. Analyze the organizations of proposed data structures and how to use them efficiently.
5. Apply the acquired knowledge in many practical applications like database, network, compiler and others..
6. Demonstrate the ability to design abstract data types using various data structures |
| arabic objectives | |
| ref. books | Adam Drozdek, Data Structures and Algorithms in C++, Course Technology.
Mark Allen Weiss, Data Structures & Algorithm Analysis in C++, Pearson. |
| arabic ref. books | |
| textbook | Noel Kalicharan, Data Structures in C, Create Space Independent Publishing Platform. |
| arabic textbook | |
| objective set | |
| content set | |
| course file |
530_CS212_CS212.pdf |