Data Structures Course

material

Syllabus

codes for first lesson

Definitions
Master theorem
Assignment 1
Assignment 2
Comment: in every problem where an algorithm needs to be designed, the algorithm should be as efficient as possible, that is, its running time complexity should be as small as possible.
Assignment 3
Solution 1
Solution 2
Solution 3
Assignment 4
Assignment 5
Assignment 6
Assignment 7
Assignment 8
Assignment 9
Assignment 10
Assignment 11
Solution 4

Sample exam

Solution 5
Solution 6
Solution 7
Solution 8
Solution 9
Assignment 12
Assignment 13
Solution 10
Solution 11
Solution 12
Solution 13
Solution of sample exam