Computer Science 2 - Data Structures and Algorithms PET-PI - 3PMKSDAL

Goal(s)

The objective is to learn the main concepts and data structures used by solutions to many problems. It addresses the recursive programming and the main dynamic data structures and abstract data types (lists, stacks, queues, trees, graphs) and presents some implementations and algorithms used by these these data structures.

Another objectif is reinforcing software engineering knowhows.

Content(s)

Examples of main concepts :
Recursive programming, Complexity
Abstract data type
Linear dynamic data structures: lists, fifos, etc.
hast tables and dictionnaries
Tree data structures

Tp : These concepts are implemented in lab works using C langage and Linux, such as:
MandelBrot Fractal
Heap Sort
War Card Game with stack and queue
Spelling checker with Hash Table
computer algebra, arithmetic, derivation with binary trees

Final mini project. Example : routes in Paris (Metro and RER) using the shortest path in a graph with different algorithms: Dijkstra, Bellman, A-Star.

COmputer science module of first semester.

Test

SESSION 1 :

Types of assessment: EX - written exam
Duration: 1 hour
Authorized documents: none
Prohibited documents: any electronic document (on phone, computer, etc.)
Specific materials authorized: none
Calculator: no
Possible remotely: if necessary
Comments:

Types of assessment: CC
CC : QCM + BE report + end-of-semester project submission

N1 = 40%EX + 60%CC

RETAKE SESSION:

Types of assessment: EX - written exam
Duration: 1 hour
Authorized documents: none
Prohibited documents: any electronic document (on phone, computer, etc.)
Specific materials authorized: none
Calculator: no
Possible remotely: if necessary
Comments:

Types of assessment: CC
CC : note obtained during session 1

N1 = 60%EX + 40%CC

Additional Information