Operations table. and to write algorithms for data
structures and analyze their performance. And to recognize the nature of the
work of stacks, arrays, queues and grid lists. And understand the arrangement
Intended learning outcomes
When the student passes Syntax 1, he will have learned the concept and meaning of data structures and their types. Describe the functioning of arrays, linked lists, stacks, and queues. Learn about the different methods of the search and ranking process. He can distinguish the basics of data structures and use C languages to solve complex problems using data structures.
Teaching and learning methods
The traditional method (descriptive explanation and free discussion. Implementation and application of programs in the computer lab
Methods of assessments
The midterm exam in the seventh week is practical and theoretical, and the final exam is in the fifteenth week
