Algorithms and data structures

N/A

Not available

At the end of the course the student should be able to:
• know different structures to store and manipulate data in memory;
• distinguish static structures from dynamic structures;
• choose, define, and use the most suitable data structure for each problem;
• develop and implement algorithms to manipulate different data structures, in C;
• implement iterative and recursive algorithms for problem solving;
• understand the concept of complexity and choose between two or more algorithms to solve the same
problem considering the computational effort of each.

1. Sorting and searching algorithms
a. Naive
b. Efficient
2. File manipulation using C (create, open, read, write)
a. Text files
b. Binary files
3. Structs
a. Definition, declaration, and assign
b. typedef
c. Struct arrays
4. Pointers
a. Pointer concept
b. Pointers arithmetic
c. Pointers and subprograms
c. Arrays and pointers
d. Structs and pointers
e. Dynamic memory allocation
5. Dynamic structures
a. Linked lists: Single, Doubly linked, Circular
b. Trees
c. Abstract Data Types: Stack, Queue, Dictionary
6. Recursion
a. Divide and conquer
b. Memory function
7. Introduction to the study of algorithm efficiency
a. Temporal and spatial complexity
b. Complexity analysis of the best case, the worst case and the average case

NAO