Data Structures and Algorithms

• Definitions (data, data structures), algorithms, complexity • Matrices, binary, linear search. Sorting, selection sort, bubble sort. • Lists, operations on lists, types of linked lists • Special kinds of lists (stack, queue, circular queue, etc) and operations • Trees, binary trees and traversal, binary search trees (search, insertion, deletion), heap trees, height balanced trees, weight balanced trees • Graphs. Finding the shortest path. • Step by step use of the above in computer programs to solve problems.

Objectives

Aim of the course is to • Understand the concept of data structure and its difference from atomic types, the functionality of data structures: matrix, list, stack, queue, binary search tree, heap tree • Understand the various ways of representation of a data structure in computer memory, the various sorting algorithms and the search algorithms (linear, binary) in a matrix • Calculate the complexity of simple algorithms, the order of magnitude of a complexity function, visualize the implementation of a matrix and find the address of an element in it, and design modifications or combinations of basic algorithms • Implement computer programs which use basic data structures • Evaluate the efficiency of a data structure using the concepts of spatial and time complexity

Prerequisites

• Good command of mathematics (mathematical analysis and algebra) through attendance of course: Mathematics • Good knowledge of procedural and/or object-oriented programming

Syllabus

• Definitions (data, data structures), algorithms, complexity • Matrices, binary, linear search. Sorting, selection sort, bubble sort. • Lists, operations on lists, types of linked lists • Special kinds of lists (stack, queue, circular queue, etc) and operations • Trees, binary trees and traversal, binary search trees (search, insertion, deletion), heap trees, height balanced trees, weight balanced trees • Graphs. Finding the shortest path. • Step by step use of the above in computer programs to solve problems.