Countdown headerdesktop engtrwktimer16aug26

MAI SUNT 00:00:00:00

MAI SUNT

X

Countdown headermobile cupon11aug26

MAI SUNT 00:00:00:00

MAI SUNT

X

Transport Gratuit la comenzile de peste 75 lei

Promotii popup img

🤩English Weekend -20%-50% &

🪂Transport GRATUIT peste 75 lei

Comandă acum!

Transport Gratuit la comenzile de peste 75 lei

Level Computer Science for Unit 1 -

De (autor): Anonim

Coperta cărții 'Level Computer Science for Unit 1 -'
Level Computer Science for Unit 1 -

De (autor): Anonim

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.
Citește mai mult

-20%

transport gratuit

PRP: 410.29 Lei

!

Acesta este Prețul Recomandat de Producător. Prețul de vânzare al produsului este afișat mai jos.

328.23Lei

328.23Lei

410.29 Lei

Primești 328 puncte

Important icon msg

Primești puncte de fidelitate după fiecare comandă! 100 puncte de fidelitate reprezintă 1 leu. Folosește-le la viitoarele achiziții!

Livrare in 2-4 saptamani

Descrierea produsului

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.
Citește mai mult

S-ar putea să-ți placă și

De același autor

Părerea ta e inspirație pentru comunitatea Libris!

Acum se comandă

Noi suntem despre cărți, la fel este și

Newsletter-ul nostru.

Abonează-te la veștile literare și primești un cupon de EXTRA -10% reducere pentru viitoarea ta comandă!

Mă abonez image one
Mă abonez image one
Accessibility Logo