Overview
Introduction to data structures, operations on data
structures, arrays, storage of arrays, objective function, access tables, linear
lists, stacks and operations on them, queues and their uses and operations on
them, linked reservation for storage, operations on stacks and interconnected
queues, comparison between sequential and interconnected reservation for
storage, Trees, applications of trees, surveying binary trees, representation
of trees and ways to visit them
Intended learning outcomes
1 Recognize the
concept and meaning of data structures and types.
2 describes the
workings of arrays, linked lists, stacks, and queues.
3 Enumerate the
different methods for the search and arrangement process.
4 Distinguish the
basics of data structures and use advanced programming languages to develop
complex problem-solving methods using data structures
Teaching and learning methods
1. Theoretical
lectures
2. Practical
lectures
3. Practical
assignments and discussion
Methods of assessments
Percentage
assessment methods
1 theoretical
exam 30%
2 practical exams
10%
3 final exam 60%
Total 100%
References
Scientific
journals
Internet sites
"www.MicroSoft.com"
