u n i g e . i t - Informatica a Genova

Corsi di Laurea in Informatica - Computer Science Degrees

DIBRIS - Valle Puggia

  • Full Screen
  • Wide Screen
  • Narrow Screen
  • Increase font size
  • Default font size
  • Decrease font size

80298 - Algorithms and Data Structures (2015/2016) Stampa

Course syllabus

Models of computation and analysis of algorithms: cost criteria, asymptotic notation, methods for analysis, complexity analysis of recursive algorithms. Esamples of algorithm design and analysis.

Elementary data structures: arrays, lists stacks, queues,  abstract data type dictionary as a linked  list trees,  binary trees,  data structures, tree traversals, full and complete binary trees.

Search trees:  Binary search trees, search trees as implementation of the ADT Dictionary,    balanced trees, AVL trees, insertion and deletion of a node in an AVL tree. Rotations in an AVL tree. Fibonacci trees.

Priority queues:  ADT priority queue,  list implementation of a priority queue, heaps, implementation of priority queues as binary heaps, sorting using a heap.

Graphs : definitions, data structures, primitives for querying and updating directed and undirected graphs, depth-first and breadth-first graph traversals, some applications of graph traversals.

Laboratory: C++ programs on the subjects of the class




    Viviana Mascardi

    Other teachers

    Filippo Ricca

    Teaching style

    In presence

    Lesson timetable

    Monday: 9:00 - 11:00, room 506
    Tuesday: 14:00 - 16:00, room 506
    Wednesday: 11:00 - 13:00, room 506 o SW1+SW2
    Friday: 11:00 - 13:00, room 506 o SW1+SW2



    Course hour allocation

    This course consists of 52 hours of lectures. Moreover, 20 laboratory hours have been planned