Computer science · 2000 · November · Paper 1 · HL · Markscheme
Computer scienceMarkscheme2000HLNovember
Full PDFs are free with an email account.
Resource overview
This markscheme is listed under Computer science in the 2000 examination archive. Its catalogue level is HL. The catalogue session is November. The information below helps you identify the document before opening the complete PDF. Subject, year and session labels come from the archive catalogue; the original cover remains the reference if a label differs. A file is not automatically suitable for your current syllabus simply because its subject name matches.
Use this markscheme alongside its matching question paper. Attempt the questions first, then compare the required reasoning and the available marks. Record the exact step that lost credit rather than only the final answer. Examiner wording can help you distinguish a calculation error from missing explanation, but an older markscheme may use a previous assessment structure.
The public preview contains file information and, where reliable text extraction is available, a limited opening excerpt. It is not a summary of unseen questions or a replacement for the original document. Create a free email account to read or download the complete file. No payment is required to unlock this archive resource.
This original usage overview is based on the archive metadata. It does not claim to summarise the complete file.
Opening excerpt
Opening text only, limited to at most 20% of pages, two page-equivalents and 2,200 characters. Clearly labelled personal identifiers have been removed. Text extraction may omit equations, tables or figures.
MARKSCHEME
November 2000
COMPUTER SCIENCE
Higher Level
Paper 1
N00/650/H(1)M
INTERNATIONAL BACCALAUREATE
BACCALAURÉAT INTERNATIONAL
BACHILLERATO INTERNACIONAL
14 pages
SECTION A
1. (Award [1 mark] for the idea that it (is hardware/software combination that) connects
networks together; idea that it directs data to the appropriate path.)
2. (Award [1 mark] for temporary;
and [1 mark] for store/memory.)
3. (a) (Award [1 mark] for the idea that it’s a data-structure whose items are added to the rear of
a queue/one end;
and [1 mark] that items are removed from the front/other end.)
Give [2 marks] for stating that it is a First-in, First-out structure (or Last-in, Last-out).
Give NO marks for just stating FIFO structure!
DO NOT accept any facile comments about supermarket queues etc. – this is a Higher
Level Computer Science exam!
(b) (Award [1 mark] for a valid application, and a second mark for an attempt at a valid
description:)
– Jobs waiting to be executed by a computer, a new job is added to the end, computer
executes next job from front;
– Keyboard buffer storing data whilst the processor is busy doing another task;
– Spooling output to a disk to await printing, new jobs added at the end, printer deals
with jobs from front/accept idea as a print queue in general.
4. (Award [1 mark] for O(n logn))
5. (a) Two (or more) different values can give the same result from the hash algorithm. [1 mark]
(b) (Award [1 mark] for a valid method, and a second mark for an attempt at a valid
description:)
– Locate next free space and store data item there;
– Have an overflow area with a marker/pointer to it.
6. (Award [1 mark] for a correct stage, and a second mark for a correct elaboration, up to a
maximum of [6 marks].)
– Systems analysis, an investigation which leads to a precise statement of the problem;
– Software/program design, a breakdown of the problem statement into its constituent parts
from which coding can take place;
– installation/operation, the introduction of the system so that it can be used by the end-user;
– maintenance, where the system is checked for errors/improvements which will lead to
another cycle.
– 6 – N00/650/H(1)M
File information
Subject
Computer science
Document type
Markscheme
Year
2000
Session
November
Level
HL
Paper
1
Examination zone
Not labelled in the archive
Language
Not labelled in the archive
File size
33 KB
Pages
10
FREE FULL RESOURCE
Read the complete document.
Register or sign in with your email to unlock the full PDF. No payment, password or membership is needed.