A Level Computer Science for AQA Unit 1
Bond, Kevin Roy
Venduto da PBShop.store US, Wood Dale, IL, U.S.A.
Venditore AbeBooks dal 7 aprile 2005
Nuovi - Brossura
Condizione: Nuovo
Quantità: Più di 20 disponibili
Aggiungere al carrelloVenduto da PBShop.store US, Wood Dale, IL, U.S.A.
Venditore AbeBooks dal 7 aprile 2005
Condizione: Nuovo
Quantità: Più di 20 disponibili
Aggiungere al carrelloNew Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Codice articolo L0-9780992753610
This 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.
Fundamentals 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.
Fundamentals 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.
Fundamentals 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).
Theory 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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Visita la pagina della libreria
Returns Policy
We ask all customers to contact us for authorisation should they wish to return their order. Orders returned without authorisation may not be credited.
If you wish to return, please contact us within 14 days of receiving your order to obtain authorisation.
Returns requested beyond this time will not be authorised.
Our team will provide full instructions on how to return your order and once received our returns department will process your refund.
Please note the cost to return any...
Books are shipped from our US or UK warehouses. Delivery estimates allow for delivery from either location.
Quantità dell?ordine | Da 10 a 15 giorni lavorativi | Da 10 a 15 giorni lavorativi |
---|---|---|
Primo articolo | EUR 0.00 | EUR 0.00 |
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.