{"product_id":"an-introduction-to-algorithmic-thinking-vce-algorithmics-hess-student-guide-9781975633547","title":"An Introduction to Algorithmic Thinking: VCE Algorithmics (HESS) Student Guide","description":"\u003cp\u003e • Author(s): Georgia Gouros\u003cbr\u003e • Publisher: Createspace Independent Publishing Platform\u003cbr\u003e • Publisher Imprint: Createspace Independent Publishing Platform\u003cbr\u003e • BISAC: Computer Science\u003c\/p\u003e\u003cp\u003e\u003cb\u003eAn introduction to the theory of Computer Science (covering topics of the VCE Algorithmics (HESS) course) for high school students.\u003c\/b\u003e\u003cbr\u003eTopics covered: conditional logic and pseudocode, \u003cb\u003eabstract data types \u003c\/b\u003e(sets, lists, arrays, stacks, queues, dictionary, priority queue, graphs), modular design of algorithms, introduction to graph theory, application of graphs for modelling, \u003cb\u003egraph algorithms\u003c\/b\u003e (Depth-first search, Breadth-first search, Prims, Kruskals, Dijkstra's, Bellman Ford, Floyd Warshall, PageRank), recursion (base case, recursive case, decrease \u0026amp; conquer design patterns), basic algorithms (greedy design, brute force design, decrease \u0026amp; conquer design), \u003cb\u003ealgorithm efficiency\u003c\/b\u003e (metrics for time complexity, big O notation, recurrence relations), \u003cb\u003eadvanced algorithm designs\u003c\/b\u003e (divide \u0026amp; conquer design, dynamic programming design, backtracking design), \u003cb\u003ecomputational complexity \u003c\/b\u003e(classification P, NP, NPComplete, NPHard problems, heuristics hill climbing, simulated annealling, A*, turing machines, \u003cb\u003eartificial intelligence\u003c\/b\u003e, machine learning, neural networks, support vector machines, ethics in AI\u003cbr\u003eThe text includes detailed examples and \u003cb\u003eexercises with fully worked solutions\u003c\/b\u003e to develop understanding of the theories presented. Python, Snap!, and SnapApps\/Edgy code is used for detailed examples throughout this text: - Snap! http: \/\/snap.berkeley.edu\/ developed by The University of California, Berkeley, USA. - SnapApps\/Edgy (includes extensive graph functionality) http: \/\/snapapps.github.io\/edgy\/app\/edgy.html developed by Melbourne University, Australia - Python using the NetworkX and Matplotlib libraries (for graph functionality) in the Trinket online coding environment https: \/\/trinket.io\/features\/python3. \u003c\/p\u003e\u003cp\u003e\u003c\/p\u003eChapters, \u003cbr\u003e1 Process and Actions (conditional logic and pseudocode)\u003cbr\u003e2 Modelling Information (sets, lists, arrays, stacks, queues, dictionary, priority queue, graphs), \u003cbr\u003e3 Algorithms for Problem Solving (modular design of algorithms), \u003cbr\u003e4 Modelling with Graphs (introduction to graph theory, application of graphs for modelling), \u003cbr\u003e5 Graph Algorithms (Depth-first search, Breadth-first search, Prims, Kruskals, Dijkstra's, Bellman Ford, Floyd Warshall), \u003cbr\u003e6 Recursion in Algorithms (base case, recursive case, decrease \u0026amp; conquer design patterns), \u003cbr\u003e7 Designing Basic Algorithms (greedy design, brute force design, decrease \u0026amp; donquer design), \u003cbr\u003e8 Algorithm Efficiency (metrics for time complexity, big O notation, recurrence relations, PageRank), \u003cbr\u003e9 Advanced Algorithm Designs (divide \u0026amp; conquer design, dynamic programming design, backtracking design), \u003cbr\u003e10 Computational Complexity (classification P, NP, NPComplete, NPHard problems, heuristics hill climbing, simulated annealling, A*), \u003cbr\u003e11 Computational Models (turing machines, artificial intelligence, machine learning, neural networks, support vector machines, ethics in AI), \u003cbr\u003e12 Solutions for Exercises (fully worked solutions for exercises) \u003cp\u003e\u003c\/p\u003e\u003cb\u003eIMPORTANT NOTICE TO BUYERS: \u003c\/b\u003e This is a **\u003cb\u003eBLACK AND WHITE EDITION\u003c\/b\u003e which is in black and white, 246 pages**, a \u003cb\u003ecolor edition is also available.\u003c\/b\u003e Preview information here: \u003ci\u003ehttps: \/\/sites.google.com\/view\/msgsvce\/\u003c\/i\u003e\u003cbr\u003e\u003cb\u003eVCE Algorithmics (HESS) \u003c\/b\u003eis a subject offered in Victoria, Australia to senior high school students, details here \u003ci\u003ehttps: \/\/www.vcaa.vic.edu.au\/curriculum\/vce\/vce-study-designs\/algorithmics\/Pages\/Index.aspx\u003c\/i\u003e\u003cbr\u003e","brand":"Createspace Independent Publishing Platform","offers":[{"title":"Paperback","offer_id":45546235461783,"sku":"9781975633547","price":1095.0,"currency_code":"INR","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9781975633547.webp?v=1767676294","url":"https:\/\/atlanticbooks.com\/products\/an-introduction-to-algorithmic-thinking-vce-algorithmics-hess-student-guide-9781975633547","provider":"Atlantic Books","version":"1.0","type":"link"}