| TDDD71 |
Data Structures and Algorithms, 2 ECTS credits.
/Datastrukturer och algoritmer/
For:
I
Ii
|
| |
Prel. scheduled
hours: 22
Rec. self-study hours: 31
|
| |
Area of Education: Technology
Main field of studies: Computer Engineering
|
| |
Advancement level
(G1, G2, A): G2
|
|
Aim:
After completing the course, the student shall be able to use, explain and analyze data structures and algorithms for representing maps and dictionaries as well as data structures and basic algorithms for graphs.
The further studies in data structures and algorithms shall give the student the opportunity to choose courses from the D and IT programs in year 4.
|
|
Prerequisites: (valid for students admitted to programmes within which the course is offered)
Programming in Java, basic course in data structures and algorithms.
Note: Admission requirements for non-programme students usually also include admission requirements for the programme and threshhold requirements for progression within the programme, or corresponding.
|
|
Supplementary courses:
Software Engineering
|
|
Organisation:
Lectures present the theory. Laboratory assignments are mainly computer based, but comprise some small written parts, and integrates theory and gives practical skill.
|
|
Course contents:
Data structures:
- Advanced tree structures
- Hash tables
- Skip lists
- Graphs
Algorithms:
- Algorithms for balancing search trees
- Graph algorithms
|
|
Course literature:
Michael T. Goodrich, Roberto Tamassia: "Data Structures and Algorithms in Java"
|
|
Examination: |
|
Lab course
|
2 ECTS
|
| |
|
The course only gives the grades Fail/Pass.
|
Course language is Swedish.
Department offering the course: IDA.
Director of Studies: Ahmed Rezine
Examiner: Christer Bäckström
Link to the course homepage at the department
Course Syllabus in Swedish
|