{"product_id":"a-level-computer-science-for-aqa-unit-1-9780992753610","title":"A Level Computer Science for AQA Unit 1","description":"\u003cp\u003e • Author(s): Kevin Roy Bond\u003cbr\u003e • Publisher: Educational Computing Services Ltd\u003cbr\u003e • Publisher Imprint: Educational Computing Services Ltd\u003cbr\u003e • BISAC: Computer Science\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eThis textbook covers sections 4.1 to 4.4 of AQA's A Level Computer Science specification for first teaching from September 2015. These sections cover the fundamentals of programming, data structures, algorithms, and the theory of computation.\u003c\/p\u003e \u003cp\u003eFundamentals of programming: data types, programming concepts, arithmetic operations, relational operators, Boolean operations, constants and varibale, string-handling, random number generatio, exception handling, subroutines, parameters of subroutines, returning a value\/values from a subroutine, local variables, global variables, role of stack frames in subroutine calls, recursive techniques, procedural-oriented programming, object-oriented programming.\u003c\/p\u003e \u003cp\u003eFundamentals of data structures: data structures, single- and multi-dimensional arrays, fileds, records and files, abstract data types, queues, stacks, graphs, trees, hash tables, dictionaries, vectors.\u003c\/p\u003e \u003cp\u003eFundamentals of algorithms: graph traversal (breadth-first, depth-first), tree-traversal (pre-order, in-order, post-order), Reverse Polish, searching algorithms (linear search, binary search, binary tree search), sorting algorithms(bubble sort, merge sort), optimisation algorithms (Dijkstra's shortest path algorithm).\u003c\/p\u003e \u003cp\u003eTheory of computation: abstraction and automation, following and writing algorithms, information hiding, procedural abstraction, functional abstraction, data abstraction, problem abstraction\/reduction, decomposition, composition, automation, regular languages, finitest state machine with and without output, maths for regular expressions, regular expressions, regular language, context-free languages (BNF, syntax diagrams), classification of algorithms, maths for understanding Big-O notation, order of complexity, limits of computation, classification of algortihmic problems, computatble and non-computatable problems, halting problem, Turing machine.\u003c\/p\u003e","brand":"Atlantic Books","offers":[{"title":"Paperback","offer_id":46492696117399,"sku":"9780992753610","price":4985.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9780992753610.jpg?v=1766353874","url":"https:\/\/atlanticbooks.com\/products\/a-level-computer-science-for-aqa-unit-1-9780992753610","provider":"Atlantic Books","version":"1.0","type":"link"}