A Level Computer Science for AQA Unit 1
Bond, Kevin Roy
Sold by Lucky's Textbooks, Dallas, TX, U.S.A.
AbeBooks Seller since July 22, 2022
New - Soft cover
Condition: New
Ships within U.S.A.
Quantity: Over 20 available
Add to basketSold by Lucky's Textbooks, Dallas, TX, U.S.A.
AbeBooks Seller since July 22, 2022
Condition: New
Quantity: Over 20 available
Add to basketThis 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.
"About this title" may belong to another edition of this title.
We guarantee the condition of every book as it's described on the AbeBooks web
sites. Please note that used items may not include access codes or cards, CD's
or other accessories, regardless of what is stated in item title. If you need to
guarantee that these items are included, please purchase a brand new copy.
All requests for refunds and/or returns will be processed in accordance with
AbeBooks policies. If you're dissatisfied with your purchase (Incorrect Book/Not
as Described/Damaged) or if ...
Books ordered via expedited shipping should arrive between 2 and 7 business days after shipment confirmation. Books ordered via standard shipping should arrive between 4 and 14 business days after shipment confirmation.
| Order quantity | 4 to 10 business days | 3 to 6 business days |
|---|---|---|
| First item | US$ 3.99 | US$ 6.99 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.