100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached 4.6 TrustPilot
logo-home
Summary

Summary COMPUTER SCIENCE A LEVEL OCR "MARK-SCHEME PERFECT MIXED NOTES"

Rating
-
Sold
-
Pages
10
Uploaded on
25-06-2023
Written in
2022/2023

The mark-scheme is always ridiculous for OCR computing and I FEEL YOU. BUT this highlights the way to gain all those "hard to get" marks due struggling with wording. (please note this doesn't cover the whole specification but crucial parts)

Show more Read less
Institution
OCR

Content preview

COMPUTER SCIENCE OCR “MARK-SCHEME PERFECT” MIXED NOTES

note: this doesn’t include everything in the spec, these were just, for me, what i needed to
recall to ensure i got the marks for some parts of the content

PAPER 1

● non-graphical use of a GPU: performing complex numerical calculations e.g.
insurance pricing (context)
● pipelining: concurrent processing of multiple instructions
○ one instruction can be fetched whilst prev is being decoded and prev is being
executed
○ in case of a branch pipeline is flushed
○ increases speed of execution
● IP address: a numerical address made up of 4 numbers each between 0 and 255 that
uniquely identifies a device on a network
● foreign key: an attribute that links two tables together to create relationships
between them
● magnetic storage: devices include magnetic hard drives + magnetic tape
○ data stored by altering magnetic field of a small section of the tape/disk
■ one orientation represents binary value of 1 and opposite represents 0
○ uses moving magnetic parts (read and write heads)
○ written to using a red head which reads magnetic fields to retrieve data
○ suitable for storing OS, software and data
○ large capacity
○ cheap purchasing price and reliability -- ideal for heavy use in insurance
offices
● solid state storage: drives can be based on NAND flash or DRAM
○ data stored using semiconductors
○ no moving parts required
○ backup involves copying potentially large amounts of data to and from
devices at regular intervals
○ servers distribute data to client devices
● describe the LMC mnemonic
○ BRP - branch if positive or zero
○ STA - store value in accumulator at address given
○ LDA + OUT - outputs a value held in memory
● benefit of memory management
○ multitasking -- allows multiple programs to run at once
● (currently unneeded) pages moved from memory to secondary storage when RAM
is full to create room in memory
● a device driver is a program
● examples of utility software + purpose
○ encryption…scrambles meaning of data files with a key
○ defragmentation…organises file segments on secondary storage
○ compression… reduces size of files

, ○ backup…makes regular copies of files in case of loss
● using an open source IDE is likely to be free of cost
● library:
○ pre-written, pre-tested sections of code which contain useful routines
○ e.g. encryption
○ can significantly increase size of compiled file as it contains many unused
subroutines
○ libraries need to be linked because the user may not have it installed onto
their machine -- the relevant code needs to be included in the final executable
code -- it is the job of the linker to combine this code
● linker:
○ used to link main program to external libraries
○ can either be included in the final executable code, or get the code to point to
the external libraries
● primary key:
○ a field which has a unique value for every record in a database
● hash:
○ a result generated by applying an algorithm to a value
○ advantage
■ hash functions are one way - if someone gains access to the database
they cannot access the user’s password
● purpose of a GPU:
○ to run CAD software
○ to render models of ‘x’
○ run modelling calculations
● why use an OS which is capable of multitasking:
○ to ensure more than one program can be run concurrently
○ e.g. running CAD software whilst checking emails
● firewall: a piece of software which monitors traffic going to and from a network
● linked list: a dynamic data structure which consists of nodes - these nodes contain
data + pointer. the pointer gives the location of the next node.
● linked list vs hash table:
○ HT
■ enables direct access to location of records
■ as more nodes are added, it will take the same amount of time to
search
○ LL
■ requires every node to be checked when searched
■ as more nodes are added, it will take longer to search
● why use lossless compression:
○ original data not lost whilst information lost in lossy
○ with text, loss of small amounts of info will make it unreadable
● DRM: encrypted data until a certain date
● state an instruction which changes the value in the PC:
○ BRP, BRZ, BRA
● in SQL, it is “=” not “==”

Document information

Uploaded on
June 25, 2023
Number of pages
10
Written in
2022/2023
Type
SUMMARY

Get to know the seller

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
maryamkamar St Augustine\'s Priory
View profile
Follow You need to be logged in order to follow users or courses
Sold
26
Member since
2 year
Number of followers
8
Documents
15
Last sold
1 week ago

4.6

10 reviews

5
8
4
1
3
0
2
1
1
0

Trending documents

Recently viewed by you

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their exams and reviewed by others who've used these revision notes.

Didn't get what you expected? Choose another document

No problem! You can straightaway pick a different document that better suits what you're after.

Pay as you like, start learning straight away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and smashed it. It really can be that simple.”

Alisha Student

Frequently asked questions