This course explores how different data structures are implemented and their main applications, so the student can analyse any problem and identify the computer requirements appropriate to its solution.
It includes implementation of Pointers and pointer operations, including pointers in objects. Implementation of Linked list: singly, doubly, circular. Practical implementation of Linked Stacks and using Stack to calculate arithmetic expressions. Practical implementation of Linked Queues. Practical implementation of recursive functions on Binary Search Trees.
The students assessment will be based on practical quizzes and exams