Hi all,
I'm attempting to train my year 12 GCE CS students into watching the Craig and Dave videos before they attend lessons to free up more time for coding and so they have some concept before attending the lesson. Craig and Dave promote this flipped learning approach and Alan O D has been talking about it for many years. As part of this process I have been trawling through videos of recent topics and posting questions based the videos as evidence that they have actually done this and to serve as useful notes these are the few that I have done so far are green........
Link to github for files
1.4.2 Data Structures YT playlist
(a) Arrays (of up to 3 dimensions), records, lists, tuples.
(b) The following structures to store data: linked-list, graph (directed and undirected), stack, queue, tree, binary search tree, hash table.
(c) How to create, traverse, add data to and remove data from the data structures mentioned above. (NB this can be either using arrays and procedural programming or an object-oriented approach).
Files are are to download from here:
2.2.2 Computational methods YT playlist
(a) Features that make a problem solvable by computational methods.
(b) Problem recognition.
(c) Problem decomposition.
(d) Use of divide and conquer.
(e) Use of abstraction.
(f) Learners should apply their knowledge of:
• backtracking
• data mining
• heuristics
• performance modelling
• pipelining
• visualisation to solve problems
2.3.1 Algorithms (Youtube playlist)
(c) Measures and methods to determine the efficiency of different algorithms, Big O notation (constant, linear, polynomial, exponential and logarithmic complexity).
(d) Comparison of the complexity of algorithms.
