Data Structures and Algorithms  094223
Will not be given the year



Lecture 
Exercise 
Laboratory 
Project or Seminar 
House Work 
Weekly Hours 
3 
1 




Determination of the grade according to progress during the semester and a final examination.
Prerequisites:
 
(
  Discrete Mathematics (for I.E) 
094344
 
  
and
 Introduction to Systems Programming 
234122
 ) 

or

(
  Introduction to Software Systems 
044101
 
  
and
 Discrete Mathematics (for I.E) 
094344
 ) 

or

(
  Software Engineering 
094219
 
  
and
 Discrete Mathematics (for I.E) 
094344
 ) 

or
   Introductio to Data Science 
094201
 

Overlapping Courses:
    Int. to Data Structur and Algorithms 
044268
 
    Data Structures and Algorithms 
094224
 
    Data Structures 1 
234218
 
    Graph Algorithms 
234246
 
    Algorithms 1 
234247
 

Incorporated Courses:
    Data Structures and Algorithms 
094224
 

Incorporating Courses:
    Introduction to Algorithms 
094226
 
The Purpose of the Course Is to Introduce the Students to the Concepts of Abstract DataStructures, Algorithms and Complexity. the DataStructures Which Will Be Described Are: Stackc, Queues, Priority Queues, Heaps, HashTabels, Trees, Balanced Trees and Graphs. the Algorithms Which Will Be Taught Will Be: Sorting, Searching, HashFunctions and Several Algorithms in Graphs. Among Them Depth First Search, Breadth First Search, Minimum Spanning Trees Shortest Paths, Topological Sort and Strongly Connected Components.
TextbooksPublished  Publisher  Authors  Book 

1999  mcgraw hill  thomas h. cormen, charles e. leiserson thomas h. cormen, charles e. leiserson  introduction to algorithms ) 2nd. ed. ( 
Created in 22/04/2021 Time 13:55:05