This laboratory is intended to facilitate understanding of the widely used data structures such as lists, trees, graphs, hash tables and the operations associated with them. Also, the main general algorithms development methods − greedy, backtracking, branch-and-bound, divide and conquer, dynamic programming and some heuristics − form the object of this guide, as well as some sorting algorithms.