[[http://www.feld.cvut.cz/cz/education/rozvrhy-ng.B182/public/cz/predmety/57/20/p5720406.html|Timetable at FEE]] [[https://www.fel.cvut.cz/cz/education/rozvrhy-ng.B182/public/cz/paralelky/P57/20/par5720406.1.html|Students of PGE]] [[https://cw.felk.cvut.cz/brute/|Upload system BRUTE]] [[https://cw.felk.cvut.cz/forum/forum-1567.html|Discussion board]] [[https://cw.fel.cvut.cz/b181/courses/be5b33prg/start|PRG]] ====== Lectures ====== ^Lecture^ Day ^ Topics ^ Slides ^ | **1.** | 20.2. | Estimation of execution time of a code, asymptotic complexity. | {{ :courses:be5b33pge:lectures:lesson01_2019.pdf | pdf }} | | **2.** | 27.2. | 1D arrays and lists, prefix sum, binary search. | {{ :courses:be5b33pge:lectures:arrays1search.py | search}} {{ :courses:be5b33pge:lectures:arrays1insert.py | insert }} {{ :courses:be5b33pge:lectures:arrays1delete.py | delete }} {{ :courses:be5b33pge:lectures:arrays1prefsum.py | prefsum }} | | **3.** | 6.3. | 2D arrays and matrices. | {{ :courses:be5b33pge:lectures:arrays2d.py | fill and search }} | | **4.** | 13.3. | Strings and text files. | {{ :courses:be5b33pge:lectures:strings.py | strings}}, {{ :courses:be5b33pge:lectures:textfiles.py | textfiles}}, {{ :courses:be5b33pge:lectures:climate1.py | climate1}},{{ :courses:be5b33pge:lectures:climate2.py | climate2}}\\ the data are available in the practices section | | **5.** | 20.3. | Recursion I, principles, simple examples. | {{ :courses:be5b33pge:lectures:recursive1.py| recursive1}} {{ :courses:be5b33pge:lectures:recursive2.py | recursive2}} {{ :courses:be5b33pge:lectures:recursive3.py | recursive3}}| | **6.** | 27.3. | Library support for searching and sorting, complexity of searching and sorting tasks. | {{ :courses:be5b33pge:lectures:searchsort1.py |search1}}, {{ :courses:be5b33pge:lectures:searchsort2.py |search2}}, {{ :courses:be5b33pge:lectures:searchsort3.py |sort1}}, {{ :courses:be5b33pge:lectures:searchsort4.py |sort2}} | | **7.** | 3.4. | Abstract Data Types (ADT) -- stack, queue, tree, graph -- and their implementation. | {{ :courses:be5b33pge:lectures:adttree.py | ADT tree, queue, stack}} | | **8.** | 10.4. | Recursion II, tree processing. | {{ :courses:be5b33pge:lectures:adttree2.py |ADT tree 2}}, {{ :courses:be5b33pge:lectures:adttreeexample.py | tree training example}} | | **9.** | 17.4. | Graph processing and searching I, graph representation, local search. | {{ :courses:be5b33pge:lectures:adtgraph.py | ADT graph}} | | **10.** | 24.4. | Graph processing and searching 2, BFS, DFS. | {{ :courses:be5b33pge:lectures:adtgraph.py | ADT graph}} | | **11.** | 9.5. | Python application libraries Numpy, Scipy with examples of use. | {{ :courses:be5b33pge:lectures:numpy0.py | ex1}} {{ :courses:be5b33pge:lectures:matplotlib0.py | ex2 }} {{ :courses:be5b33pge:lectures:matplotlib1.py | ex3}} | | | **12.** | 14.5. | Repetitions, exam preparations | {{ :courses:be5b33pge:lectures:analyse_checksudoku.py | Analysis example1}}\\ {{ :courses:be5b33pge:lectures:analyse_checkheaders.py | Analysis example2}}\\ {{ :courses:be5b33pge:lectures:analyse_neighbourpairs.py | Analysis example3}}\\ {{ :courses:be5b33pge:lectures:exampletasks.py | Example implementation tasks }} | | **13.** | 22.5. | Python application libraries Matplotlib, SageMath, NetworkX, with examples of use. | //in preparation// | Graph problem examples * * https://cw.felk.cvut.cz/brute/data/ae/release/2018l_be5b33alg/alg_ae/evaluation/input.php?task=colorgraph * https://cw.felk.cvut.cz/brute/data/ae/release/2018l_be5b33alg/alg_ae/evaluation/input.php?task=colorgraphII * https://cw.felk.cvut.cz/brute/data/ae/release/2018l_be5b33alg/alg_ae/evaluation/input.php?task=xchampionship_py * https://cw.felk.cvut.cz/brute/data/ae/release/2018l_be5b33alg/alg_ae/evaluation/input.php?task=xchampionship_dist_py * https://cw.felk.cvut.cz/brute/data/ae/release/2018l_be5b33alg/alg_ae/evaluation/input.php?task=xstars_py * https://cw.felk.cvut.cz/brute/data/ae/release/2018l_be5b33alg/alg_ae/evaluation/input.php?task=xcriticalnetworks_py * https://cw.felk.cvut.cz/brute/data/ae/release/2018l_be5b33alg/alg_ae/evaluation/input.php?task=xfixednodes_py Source codes of graph problem examples: * {{ :courses:be5b33pge:lectures:colorgraph.py | colorgraph}} * {{ :courses:be5b33pge:lectures:colorgraph2.py | colorgraph2}} * {{ :courses:be5b33pge:lectures:triangles.py | triangles}} * {{ :courses:be5b33pge:lectures:triangles_dist.py | triangles_dist}} * {{ :courses:be5b33pge:lectures:stars.py | stars}} * {{ :courses:be5b33pge:lectures:criticalnetworks.py | criticalnetworks}} * {{ :courses:be5b33pge:lectures:fixednodes.py | fixednodes}}