Picture 1 of 1

Stock photo

A Level Computer Science for Unit 1 (Paperback, 2015)

superbookdeals (81122)

96.4% positive Feedback

Price:

£41.26

Free postage

Estimated delivery Tue, 10 Jun - Tue, 17 Jun

Returns:

30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.

Condition:

New

A Level Computer Science for Aqa Unit 1 by Bond, Kevin Roy, ISBN 0992753619, ISBN-13 9780992753610, Brand New, Free P&P in the UK

About this product

Product Information

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.