Filetype PDF | Posted on 05 Feb 2023 | 2 years ago
Authentication
digital resources
144x Filetype PDF File size 1.48 MB Source: englishcentral.net
ADVANCED_COMPUT_SCIENCE_COVER.qxp_COMPUTER_Science_COVER 10/10/16 4:32 PM Page 1
M K
A O
R S
K T
O A
S S
D
H I
A M
T I
Z T
I R
T I
A O
S U
K ,
O P
S h
, d
M
S
c
A
D
V
A
N
C
E
Advanced Computer Science: For the IB Diploma Program is a new educational resource D
for all students who need to understand the High Level topics of Computer Science. This
book references all the assessment statements in the 2014 IB Computer Science subject C
guide, while remaining flexible enough to be used in any educational setting, including O
programming courses of moderate to advanced difficulty. M
The book uses plain English allowing native and non-native young learners to master the IB P
computer science High Level course. Advanced computer science for the IB Diploma U
Program builds upon the successful Core Computer Science book and facilitates High Level T
students to master the necessary topics. E
R
Feature include:
S
• Plain English language C
I
• Diagrams and illustrations for all key concepts E
• Examination style questions with answers for all topics N
• Use of IB style pseudocode, as well as actual working code in the Java C
Programming Language E
• A complete and efficient working Java solution that addresses a real life scenario
• One-to-one reference to the assessment statements in the IB Computer Science
H F
subject guide I o
G r
H
t
h
L e
E
This book allows both students and teachers to follow the wide-ranging IB Computer V
I
E B
Science syllabus in such a way that they can be confident that all aspects of theory and L
D
C
practical exercises have been covered. O i
M p
l
Further details about the book, including errata and programming code, can be obtained at P o
the following website: http://www.expresspublishing.co.uk/ibadvancedcomputerscience U m
T a
E
R P
r
S o
C g
I
E r
N a
C m
E
ISBN 978-1-4715-5233-5
Advanced_ComputerScience_001-150.qxp_Advanced_ComputerScience 10/10/16 3:58 PM Page 1
Advanced_ComputerScience_001-150.qxp_Advanced_ComputerScience 10/10/16 3:58 PM Page 2
Published by Express Publishing
Liberty House, Greenham Business Park, Newbury,
Berkshire RG19 6HW, United Kingdom
Tel.: (0044) 1635 817 363
Fax: (0044) 1635 817 463
email: inquiries@expresspublishing.co.uk
www.expresspublishing.co.uk
© Express Publishing, 2016
Design and Illustration © Express Publishing, 2016
First published 2016
Made in EU
All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or
transmitted in any form, or by any means, electronic, photocopying, or otherwise, without the prior
written permission of the publishers.
This book is not meant to be changed in any way.
ISBN 978-1-4715-5233-5
Advanced_ComputerScience_001-150.qxp_Advanced_ComputerScience 10/10/16 3:58 PM Page 3
!
Topic 5—Abstract data structures
5.1 Abstract data structures
Thinking recursively
5.1.1 Identiffyy a situation that requires the use of recursive thinking.
5.1.2 Identiffyy recursive thinking in a specified problem solution.
5.1.3 Trace a recursive algorithm to express a solution to a problem.
Abstractdatastructures
5.1.4 Describe -the characteristics of a two dimensional array.
5.1.5 Construct algorithms using -two dimensional arrays.
5.1.6 Describe the characteristics and applications of a stack.
5.1.7 Construct algorithms using the access methods of a stack.
5.1.8 Describe the characteristics and applications of a queue.
5.1.9 Construct algorithms using the access methods of a queue.
5.1.10 Explain the use of arrays as static stacks and queues.
Linkedlists
Linkedlists will be examined at the level of diagrams and descriptions. Studdents are not expected to construct
linked list algorithms using pseudocode.
5111Describethefeaturesandcharacteristicsofadynamicdatastructure.e
5.1.11 Describe the features and characterristics of a dynamic data structure
5.1.12 Describe how linkedlists operate loogically.
5.1.13 Sketch linked lists (single, double annd circular).
Trees
Binary trees will be examined at the level oof diagrams and descriptions. Students are not expected to construct
re not expected.
tree algorithms using pseudocode.Tracingg and constructing algorithms a e
5.1.14
Describehowtreesoperatelogicallyy(bothbinaryandnon-.binary)
f.
5.1.15 Define the terms: parent, lefftt-child, r-ight child, subtree, root and leaf
5.1.16 State the result of inorder, postordeer and preorder tree traversal.
5.1.17 Sketch binary trees.
Applications
5.1.18 Define the term dynamic data structure.
5.1.19 Compare the use ofstatic and dynamicdata structures.
5.1.20 Suggesta suitable structure for a given situation.
Topic6—Resourcemanagement
6.1 Resource management
Systemresources
6.1.1 Id ystem.
entiffyy the resources that need to bee managed within a computer s s
6.1.2 Evaluate the resources available in a variety of computer systems.
er system.
6.1.3 Identiffyy the limitations of a range of rresources in a specified comput r
esources in a computer system.
6.1.4 Describe the possible problems resullting from the limitations in the re
Roleoftheoperating system
ry, peripherals and hardware
66.11.55 EExpllaiin tthhe rolle off tthhe operattiing systttem in terms of managing memor
interfaces.
6.1.7 Outline OS resource managementtechniques:scheduling,policies,multitasking,virtualmemory,paging,
interrupt, polling.
ora device.
6.1.8 Discuss the advantagesof producingg a dedicatedoperating systemfo
6.1.9 Outline how anoperatingsystemhiddesthe complexityofthe hardwar.efromusersandapplications
Topic7—Control
7.1 Control
Centralized controlsystems
7.1.1 Discuss a range of control systems.
ms.
7.1.2 Outline the uses of microprocessors aand sensor input in control system
situations.
7.1.3 Evaluate difffferent input devices for thshe collection of data in specified
uttransducer.
7.1.4 Explain the relationship between a seensor, the processor and an outpu
no reviews yet
Please Login to review.
