UNIVERSITY OF MONTREAL

udem
Data structures

Professor: Esma Aimeur
Office 2361


   

e-mail: aimeur@iro.umontreal.ca






4 credit mandatory course

Lectures:

Monday (10h30-12h30)

Thursday (8h30-9h30)


Labs:

Friday (10h30-12h30)


Classrooms :

Lectures: Z-335, 1360

Labs: 1177, 1360





OBJECTIVES

The goal of this course is to familiarize the student with basic techniques in organization, manipulation and the search of data. More specifically, we will learn how to choose the most optimal data structure, considering such factors as execution time and memory requirements.



      MANDATORY BOOKS

  Standish, T.A. Data Structures, Algorithms and Software Principles, Addison Wesley, 1994.


      SUPPLEMENTARY BIBLIOGRAPHY:

  Knuth, D.E. The art of computer programming. Addison Wesley, (2nd edition) volumes (1, 2, 3) 1973.


  Aho, A., Hopcroft, J.E., Ullman, J.D. Structures de données et algorithmes. Addison Wesley, 1989.


  Lewis, H.R., Denenberg, L. Data stuctures and their algorithms. Harper Collins, 1991.


  Weiss, M.E. Data structures and algorithm analysis. The Benjamin Cumming, 1995


Click here to see the course schedule


EVALUATION

Midterm exam : 25%

Final exam : 35%

assignments : 40%

The final grade is calculated as follows:

If midterm + final >=30
then grade = midterm + final + assignment1 + assignment2 + assignment3 + assignment4
else grade = midterm + final + 0.5 * (assignment1 + assignment2 + assignment3 + assignment4)

This calculation implies that you must pass the exams to pass the course (30 on 60).
The numerical grade (/100) will be converted to a literal (A+ , A , A- , etc) at the end of the semester in relation to the group's average and mark distribution.



The allowed programming languages are: C, C++, or JAVA.






List of courses

Last update :