CSE2010. Class meeting : Wednesday 14:00 - 16:00. Evaluations : Midterms 30
%, Final 30%, Homework 30%, Project 10%. Goal. This course will cover all th.
Department of Business
Fall EAI 2010
Algorythm & Data Structures CSE2010 # Credits 4 # ECTS Credits 8 Course Instructor :
André
N° Tél : 04 93 95 44 36
MILLELIRI
MSc.
email:
[email protected]
Course Coordinator : Textbook : Data Structures and Algorithms inwill Java Goal This course cover all th Michael T. Goodrich, Roberto Tamassia John Wiley & Sons Ltd
5th ed.
ISBN-10: 0470398809, ISBN-13: 978-0470398807
Pre/Corequisite : Goals :This course will cover all the fundamentals of data structures and the related algorithmic. It will allow students to use easily linked list, trees and graphs.
# Lectures Hours: # Tutorials Hours: # Laboratory Hours: # Homework Hours: # Words Written:
0 0 0 0 0
Topics : Recursion Linked Lists Ordered binary trees AVL Trees B. Trees Sorting and searching Hash Table Graphs Data compression Memory Management
Class meeting : Wednesday 14:00 - 16:00 Evaluations : Midterms 30%, Final 30%, Homework 30%, Project 10%
Detailed Schedule:
Schedule Week
1
Week Week Week Week Week Week Week Week Week Week Week Week Week Week
2 3 4 4 5 6 7 8 9 10 11 12 13 14
Object oriented programming Complexity Analysis Recursion Arrays: Sorting and searching Midterm #1 Linked list, Stacks and queues Binary trees Binary trees B-Trees Midterm #2 Hash Tables Graphs Data Compression Midterm #2 Memory Management Examen
