Početna stranicaVisoka učilištaKorisničke stranice
Advanced Algorithms and Data Structures
Abbreviation: Load: 45(L) + 0(E) + 0(LE) + 0(CE)
Lecturers in charge: Prof. dr. sc. Damir Kalpić
Doc. dr. sc. Nikica Hlupić
Lecturers:
Course description: Search. Skip lists. Self-organizing lists. Sparse tables. Rotation on trees. Red-black trees. Self-adjusting trees. B trees. B trees. Multi-way trees. Structure trie. Expandable hashing. Priority queues. Operations on sets. Selected algorithms on graphs. Graph traversal. Depth-first. Breadth-first. Random numbers. Greedy method. Divide and conquer. Taboo search. Backtracking. Dynamic programming. Knapsack problem. Traveling salesman problem. Scheduling.
Lecture languages: - - -
Compulsory literature:
1. Data Structures and Algorithm Analysis in C;M.A. Weiss;1997;Addison Wesley
Recommended literature:
2. Algorithms in C;R. Sedgewick;2004;Addison Wesley
3. Data Structures and Algorithms in C;A. Drozdek;2005;Thomson
Legend
L - Lectures
E - Exercises
LE - Laboratory exercises
CE - Project laboratory
* - Not graded
Copyright (c) 2006. Ministarstva znanosti, obrazovanja i športa. Sva prava zadržana.
Programska podrška (c) 2006. Fakultet elektrotehnike i računarstva.
Oblikovanje(c) 2006. Listopad Web Studio.
Posljednja izmjena 2011-07-19