Name: A Level Computer Science for aqa Unit 1 (en Inglés)
Price: 63770.00 CLP
Availability: InStock
Author: Kevin Roy Bond
ISBN: 9780992753610

portada A Level Computer Science for aqa Unit 1 (en Inglés)

A Level Computer Science for aqa Unit 1 (en Inglés)

Formato

Libro Físico

Editorial

Educational Computing Services Ltd

Autor

Kevin Roy Bond

Año

2017

Idioma

Inglés

N° páginas

510

Encuadernación

Tapa Blanda

ISBN13

9780992753610

Categorías

Ciencias de la computación

A Level Computer Science for aqa Unit 1 (en Inglés)

Kevin Roy Bond (Autor) · Educational Computing Services Ltd · Tapa Blanda

Libro Nuevo Importado

Envío: 12 a 16 días háb.

$ 127.540$ 63.770

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 63.770

Llega entre el 06 Jul y el 10 Jul a Santiago, Región Metropolitana. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "A Level Computer Science for aqa Unit 1 (en Inglés)"

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.