CSI 2110 Data Structures and Algorithms

3 units
Computer Science
Faculty of Engineering
The concept of abstract data types. Simple methods of complexity analysis. Trees. The search problem: balanced trees, binary-trees, hashing. Sorting. Graphs and simple graph algorithms: traversal, minimum spanning tree. Strings and pattern matching.

Components:

Laboratory
Lecture
Tutorial

Requirements:

Prerequisites: ITI 1121 , MAT 1348 .

Previously Offered Terms:

Fall
Winter
Summer

French Equivalent:

CSI 2510
GradesEvaluations
All Professors
B+ Average (6.625)
Most Common: A+ (20%)
2587 students

P

S

NS

F

D

C

B

A-

A+

Yahya Massoud

Winter 2025 - E00

C+ Average (5.458)
Most Common: A+ (17%)
24 students

P

S

NS

F

D

C

B

A-

A+

Lucia Moura

13 sections from Fall 2017 to Fall 2024

B+ Average (6.687)
Most Common: A+ (20%)
1191 students

P

S

NS

F

D

C

B

A-

A+

Karim Al Ghoul

4 sections from Summer 2023 to Fall 2024

B+ Average (7.340)
Most Common: A+ (31%)
350 students

P

S

NS

F

D

C

B

A-

A+

Yazan Ma'en Hasan Otoum

4 sections from Fall 2022 to Summer 2024

B Average (6.341)
Most Common: A+ (16%)
378 students

P

S

NS

F

D

C

B

A-

A+

Mohamed Yousri Mahmoud

2 sections from Fall 2019 to Winter 2023

B Average (6.000)
Most Common: C (17%)
106 students

P

S

NS

F

D

C

B

A-

A+

Wonsook Lee

4 sections from Fall 2019 to Fall 2022

B Average (6.292)
Most Common: B+ (14%)
421 students

P

S

NS

F

D

C

B

A-

A+

Safaa Bedawi

2 sections from Fall 2019 to Summer 2022

B+ Average (7.327)
Most Common: A+ (26%)
211 students

P

S

NS

F

D

C

B

A-

A+

Mohamad Hoda

2 sections from Winter 2018 to Winter 2022

C+ Average (5.351)
Most Common: B (22%)
111 students

P

S

NS

F

D

C

B

A-

A+

Amiya Nayak

Winter 2019 - D00

B Average (6.136)
Most Common: A- (20%)
44 students

P

S

NS

F

D

C

B

A-

A+