Warning

# Lectures

Lecture Day Topics Slides/codes
1. 17.2. 1D arrays and lists, prefix sum, binary search. List: create , access , append , insert , delete , prefix sum, search
2. 24.2. 2D arrays and matrices. fill, generate, analyse
3. 3.3. canceled, moved to lecture 12 below
4. 10.3. Strings and text files.
the data are available in the practices section
strings1 strings2 strings3 strings4 strings5 textfiles climate1 climate2
5. 17.3. Library support for searching and sorting, complexity of searching and sorting tasks. search1, search2, sort1, sort2
6. 29.3.
9:15-12:30
Abstract Data Types (ADT) – stack, queue, tree – and their implementation. stack, queue,tree - slides
7. 31.3. Recursion I, principles, simple examples. recursive1 recursive2 recursive3
8. 7.4. Recursion II, tree processing, backtrack. ADT tree 2, tree training example
9. 19.4. 9:15 - 12:30 and also 14:30 - 17:45 Basics of User Interface, TKinter all.zip win1 label1 label2 label3 button1 button2 button3 button4 entry1 entry2 entry3 combo1 combo2 checkbutton1 checkbutton2 radio1 scroll1 scroll2 dialog1 calc1
10. 21.4. Python application libraries Numpy, Matplotlib, Scipy with examples of use. numpy example display with mathplotlib display climate data climate data files
11. 28.4. Programming repetitions II & III - sorting searching, trees, recursion check also previous examples above
recursion short repetition
Tree Examples 2
Tree Examples 2a
Tree Examples 3
Tree Examples 4
search nodes problem solution
Sum of Leaves Keys solution
Neighbour Pairs solution
12. 5.5. Estimation of execution time of a code, asymptotic complexity. asymptotic complexity, nested loop examples ,
also, consult the example codes in lesson 01
13. 12.5 University Sports Day classes suspended
14. 19.5 Repetitions and exam examples set 1 , set 2