AP Computer Science Principles øvingsprøve
- 15 spørsmål
- Cirka 15 min
- Gratis
Spørsmålene i testen er på engelsk.
A student's program that averages three test scores runs without any error message, but it always reports an average that is too high. The code adds the three scores and divides by 2 instead of 3. What kind of error is this?
Leser du med egne notater? Lag min egen øvingsprøve
Øv videre
- ØvingsprøveAP Statistics øvingsprøve: enhet 1 til 515 spørsmål
- ØvingsprøveAP Precalculus øvingsprøve: enhet 1 til 315 spørsmål
- ØvingsprøveAPUSH øvingsprøve: periode 1 til 915 spørsmål
- ØvingsprøveAP Psychology øvingsprøve15 spørsmål
- Alle quizer i Videregående og opptak46 quizer
- Se alle gratis øvingsquizer
Om denne testen
Dette er en gratis smakebit med 15 spørsmål i stil med flervalgsdelen av AP Computer Science Principles, skrevet av StudyPDF-teamet ut fra de fem Big Ideas som College Board publiserer for faget. Den dekker kreativ utvikling, data, algoritmer og programmering i pseudokode som på eksamen, datasystemer og nettverk og følgene av databruk, omtrent i de vektene eksamen bruker. Du møter flervalg, velg alle som passer og fyll inn luken. Svar på alle 15, sjekk poengsummen din og les forklaringen til hvert spørsmål.
Alle 15 spørsmål i oversikt
Vil du heller lese før du spiller? Alle spørsmålene i smakebiten står listet under. Svar og forklaringer er skjult til du åpner dem.
1.A student's program that averages three test scores runs without any error message, but it always reports an average that is too high. The code adds the three scores and divides by 2 instead of 3. What kind of error is this?
- A. Syntax error
- B. Logic error
- C. Overflow error
- D. Run-time error
Svar: B. Logic error
A logic error is a mistake in the algorithm: the program runs and produces a result, but the result is wrong. A syntax error breaks the rules of the language, so the program will not run at all. A run-time error stops the program while it is running, for example by dividing by zero, and an overflow error happens when a value is too large for the number of bits the computer uses to store it. Logic errors are the hardest to find because nothing crashes, which is why testing with inputs whose answer you already know matters.
2.Which practices are part of an iterative, collaborative way to develop a program?
Velg alle som passer.
- A. Building a small working version, testing it with users and revising it
- B. Having teammates review each other's code to catch errors and bring different perspectives
- C. Writing the whole program before running it even once, so nothing half-finished confuses the team
- D. Writing comments and documentation that explain what a code segment is for
- E. Keeping the design secret from users until the final version is done
Svar: A. Building a small working version, testing it with users and revising it, B. Having teammates review each other's code to catch errors and bring different perspectives, D. Writing comments and documentation that explain what a code segment is for
Iterative development means building, testing and refining in small steps, so mistakes show up early and feedback shapes the next version. Collaboration brings in other viewpoints, and people with different backgrounds notice different problems and needs. Documentation helps teammates, and your future self, understand what code was meant to do. Writing everything before the first run lets errors pile up, and hiding the design from users removes the feedback the process depends on.
3.Complete the sentence.
In binary, the number 1011 equals _____ in decimal, and a sequence of 8 bits can represent _____ different values.
Alternativer for luke 1: 9, 11, 13, 15
Alternativer for luke 2: 16, 128, 255, 256
Svar: 11, 256
Each binary place is worth twice the one to its right: 8, 4, 2, 1. So 1011 is 8 + 0 + 2 + 1 = 11. With n bits there are 2 to the power n different patterns, and 2^8 = 256, so 8 bits can represent 256 different values, from 0 through 255. The 255 option is the largest number that fits in 8 bits, not the count of values, and that off-by-one is a classic trap.
4.A museum is compressing scans of old documents and must be able to rebuild every original pixel exactly. Which approach should it use?
- A. Lossless compression
- B. Lossy compression with the quality set to high
- C. Lossy compression after deleting every second row of pixels
- D. Any compression, since a rebuilt file always matches the original
Svar: A. Lossless compression
Lossless compression reduces file size in a way that lets the original data be reconstructed exactly, which is what an archive needs. Lossy compression gets smaller files by throwing information away for good, and even at high quality the original cannot be rebuilt. Lossy is a sensible trade for streaming video or casual photos, where small differences are hard to see. The cost of lossless is that files stay larger.
5.A phone photo file includes the date, the GPS location and the camera model along with the image itself. Which statement is correct?
- A. Metadata is the part of the image that is lost when the photo is compressed
- B. Metadata can only be created by the person who views the file
- C. Metadata changes the pixels of the image every time the photo is copied
- D. Metadata is data about other data, and it can reveal private details even if you only share the photo
Svar: D. Metadata is data about other data, and it can reveal private details even if you only share the photo
Metadata describes a piece of data without being the data itself: when a photo was taken, where, with what device. It helps people organize and search large collections, and it can be changed or deleted without changing the image. It can also expose things the sender never meant to share, such as a home location, so many apps remove it on upload. Metadata is not lost by compression and does not alter the pixels.
6.total ← 0. FOR EACH item IN [3, 8, 12, 5, 10], IF (item MOD 2 = 0), then total ← total + item. After the loop, DISPLAY(total). What is displayed?
- A. 8
- B. 10
- C. 30
- D. 38
Svar: C. 30
item MOD 2 is the remainder when item is divided by 2, so the test is true only for even numbers. The even items are 8, 12 and 10, and 8 + 12 + 10 = 30. The 38 answer adds every item, as if the test were missing, and 8 is the sum of the odd items, 3 + 5. When you trace a loop, write the value of total after each pass, so the one skipped odd number is easy to see.
7.nums ← [4, 8, 15, 16]. Then INSERT(nums, 2, 23), REMOVE(nums, 1) and APPEND(nums, 42) run in that order. List positions start at 1. What does DISPLAY(nums[3]) show?
- A. 8
- B. 15
- C. 16
- D. 23
Svar: B. 15
Trace the list after each step. Start with [4, 8, 15, 16]. INSERT at position 2 puts 23 there and shifts the rest right: [4, 23, 8, 15, 16]. REMOVE position 1 deletes the 4: [23, 8, 15, 16]. APPEND adds 42 at the end: [23, 8, 15, 16, 42]. Position 3 holds 15. The 8 answer comes from forgetting that INSERT shifts items, and 16 comes from counting positions from 0 instead of 1.
8.Complete the sentence.
Suppose p is true and q is false. Then p AND (NOT q) evaluates to _____, and NOT (p OR q) evaluates to _____.
Alternativer for luke 1: true, false
Alternativer for luke 2: true, false
Svar: true, false
Work from the inside out. NOT q is true because q is false, so p AND (NOT q) is true AND true, which is true. For the second one, p OR q is true OR false, which is true, and NOT true is false. AND is true only when both sides are true, OR is true when at least one side is, and NOT flips the value. Writing each sub-result on its own line prevents most mistakes.
9.Which statements about algorithms are true?
Velg alle som passer.
- A. Every algorithm can be built from sequencing, selection and iteration
- B. A faster computer can make any undecidable problem solvable
- C. Two different algorithms can solve the same problem while using very different numbers of steps
- D. A heuristic can be used when finding the best solution would take an unreasonable amount of time
- E. An algorithm whose steps double with every added input is the best choice for very large inputs
Svar: A. Every algorithm can be built from sequencing, selection and iteration, C. Two different algorithms can solve the same problem while using very different numbers of steps, D. A heuristic can be used when finding the best solution would take an unreasonable amount of time
Sequencing, selection and iteration are enough to express any algorithm. Different algorithms for one problem can differ hugely in efficiency, which is why comparing step counts matters. A heuristic gives a good-enough answer in reasonable time when the exact answer is out of reach. An undecidable problem has no algorithm that works for every input, however fast the machine, and a step count that doubles with each added input quickly becomes unusable, since it is not a reasonable-time algorithm.
10.A city engineer uses a computer simulation of rush-hour traffic to test new traffic light timing before changing the real intersection. Which statement about the simulation is accurate?
- A. It is always more reliable than watching the real intersection, because a simulation never leaves anything out
- B. It cannot be used until the real intersection has been rebuilt
- C. It removes the need for any data about real traffic
- D. It lets the city test changes without cost or risk, but the results depend on what the model left out
Svar: D. It lets the city test changes without cost or risk, but the results depend on what the model left out
A simulation is an abstraction: it keeps the details that matter for the question and leaves the rest out. That makes it cheap and safe to try ideas, such as many timings in an afternoon, which would be impractical on a real street. The limit is that the results are only as good as the model and the data behind it, so a factor left out, such as a road closure, can make the real outcome differ. That is why simulation results are checked against real observations.
11.A school network connects each building to at least two others, so students can still reach the Internet if one cable is cut. Which statement best describes this design?
- A. It is fault tolerant, because redundant paths keep the network working after a failure
- B. It has higher bandwidth, because each cable carries more data
- C. It has lower latency, because messages always take the shortest path
- D. It is encrypted, because messages cannot be read in transit
Svar: A. It is fault tolerant, because redundant paths keep the network working after a failure
The Internet is built to be fault tolerant: there are usually several paths between two points, so routing can send data around a broken link. Extra connections do not by themselves raise bandwidth, which is how much data can move per second, and an alternate path can even be longer. Encryption is about privacy, not about surviving a failure. Redundancy is the key word for this kind of question.
12.Complete the sentence.
The Domain Name System (DNS) looks up a _____ such as example.org and returns the matching _____, which routers use to deliver packets.
Alternativer for luke 1: packet, domain name, protocol, password
Alternativer for luke 2: IP address, bit rate, file format, encryption key
Svar: domain name, IP address
People use names such as example.org because they are easy to remember, but routers move data by IP address. DNS is the lookup service that translates a domain name into the IP address of the server. Without it you would have to type numbers to visit a site. A packet is a small chunk of data that travels the Internet, and a protocol is an agreed set of rules, such as TCP and IP.
13.A company trains a program to screen job applications using the records of people it hired over the past 20 years, most of whom came from a few similar backgrounds. Which concern is most likely?
- A. The program will be fair, because computers cannot have bias
- B. The program cannot run, because applications are not binary data
- C. The program may repeat the pattern in the old hiring data, which is a form of computing bias
- D. The program will only improve if the old records are deleted after training
Svar: C. The program may repeat the pattern in the old hiring data, which is a form of computing bias
Computing bias can come from the data a program learns from or from choices its designers make. A model trained on past decisions can copy their patterns, including unfair ones, and it can do so at scale and with an air of objectivity. Computers do not make bias impossible, and all digital data, including text, is stored in binary. Reducing bias takes steps such as checking results across groups and using more representative data, not deleting records.
14.Which actions help protect an online account from being taken over?
Velg alle som passer.
- A. Turning on multifactor authentication
- B. Reusing one strong password on every site so it is easy to remember
- C. Treating a message that asks you to log in through a link with suspicion, since phishing tries to trick you into giving up your login
- D. Using a different, long password for each account, ideally with a password manager
- E. Sharing the one-time login code with anyone who says they work for support
Svar: A. Turning on multifactor authentication, C. Treating a message that asks you to log in through a link with suspicion, since phishing tries to trick you into giving up your login, D. Using a different, long password for each account, ideally with a password manager
Multifactor authentication requires a second proof besides the password, so a stolen password alone is not enough. Phishing is an attempt to trick people into entering credentials on a fake page, so going to the site directly beats clicking a link in a message. Unique passwords limit the damage if one site is breached, and a password manager makes them practical. Reusing a password lets one breach open many accounts, and a one-time code is meant for you alone, so no legitimate support team asks for it.
15.Maria publishes her public key. Devon wants to send her a message that only she can read, using public-key encryption. Which key does Devon use to encrypt it?
- A. Devon's private key
- B. Devon's public key
- C. Maria's private key
- D. Maria's public key
Svar: D. Maria's public key
In public-key encryption each person has a pair of keys. Anyone can use Maria's public key to encrypt a message to her, but only her private key can decrypt it, so only she can read it. Devon's own keys are not involved in this direction. The private key must never be shared, which is the whole point of the pair. Public keys are what let a browser start a secure connection with a site it has never met.
Slik ser AP CSP-eksamenen ut, og slik er Big Ideas vektet
AP Computer Science Principles-eksamenen gir en score fra 1 til 5 og har to deler. Ifølge College Board er avslutningseksamenen helt digital i Bluebook-appen. Del I er 70 flervalgsspørsmål på 120 minutter og teller 70 prosent av poengsummen, med fire svaralternativer på hvert: 57 er enkeltvalg, 5 er enkeltvalg bygget på en lesetekst om en databruksinnovasjon, og 8 er flervalg der du velger 2 svar. Del II teller de andre 30 prosentene. Den kombinerer Create-oppgaven (performance task) med 2 skriftlige svaroppgaver, til sammen 4 spørsmål, som du svarer på i en 60 minutter lang del av eksamensdagen, og som handler om ditt eget program.
College Board deler faget inn i fem Big Ideas og publiserer hvor mye av eksamenspoengene hver av dem får. Algoritmer og programmering er tyngst med 30 til 35 prosent. Følgene av databruk (impact of computing) utgjør 21 til 26 prosent, data 17 til 22 prosent, datasystemer og nettverk 11 til 15 prosent og kreativ utvikling 10 til 13 prosent. Omtrent en tredjedel av eksamen er altså algoritmer og programmering, mye av det er å lese og følge kode, og omtrent en fjerdedel er hvordan databruk påvirker mennesker, som er den delen elevene oftest lar ligge til sist.
College Board oppgir at eksamen i 2027 er fredag 14. mai, i økt 1, og at Create-oppgaven skal leveres som endelig i AP Digital Portfolio innen kl. 23.59 ET fredag 30. april. Datoene endres fra år til år, så sjekk College Boards side for ditt eget eksamensår. Hva en score gir av uttelling, avgjør hvert enkelt college, så slå opp reglene ved skolene du bryr deg om.
Slik bruker du smakebiten, og hva den ikke dekker
De 15 spørsmålene er fordelt på Big Ideas i omtrent samme forhold som på eksamen: fem om algoritmer og programmering, tre om data, tre om følgene av databruk, to om datasystemer og nettverk og to om kreativ utvikling. De spør mer etter resonnementet bak et svar enn etter et pugget begrep: hvorfor et program som kjører, likevel kan være galt, hvorfor tapsfri komprimering er riktig verktøy når hver piksel teller, hvorfor en simulering er nyttig, men likevel begrenset, og hvorfor en modell trent på gamle data kan gjenta gammel urettferdighet.
Kodespørsmålene bruker pseudokode i ren tekst i stil med eksamen. En pil betyr tilordning, så x ← 3 lagrer 3 i x. Lister starter på posisjon 1, ikke 0, og MOD gir resten ved en divisjon. Eksamen bruker sin egen pseudokode, ikke Python eller Java, så du kan øve på den selv om klassen din jobber i et annet språk. Ta den i én økt med kladdepapir, følg hvert program ved å skrive ned verdien til hver variabel etter hver linje, og les så forklaringen til hvert spørsmål, også for dem du fikk riktig.
Denne smakebiten øver ikke på Create-oppgaven. Det er programmet du bygger i timene over omtrent 9 timer, med koden, en kort video av at det kjører og en Personalized Project Reference, og de skriftlige svarene dine på eksamensdagen handler om det samme programmet. Jobb med det sammen med læreren din og elevmaterialet fra College Board, og bruk spørsmålene her som øving til flervalgsdelen alene. Spørsmålene er originale og skrevet etter den publiserte fagplanen. De er ikke frigitte eksamensspørsmål.
Slik bygger StudyPDF AP CSP-øvingsprøver fra notatene dine
Femten spørsmål kan vise deg hvilken Big Idea som er ustø. De gjør deg ikke klar alene, og en generell bank passer sjelden med ordene, eksemplene og pseudokoden læreren din faktisk bruker.
StudyPDF tar i stedet utgangspunkt i materialet ditt. Last opp notatene fra timene, lysbildene fra læreren, et løst oppgavesett eller repetisjonsheftet ditt, trykk på Nytt materiale, så bygger StudyPDF øvingsprøver fra akkurat de sidene. Hvert spørsmål er forankret i materialet ditt, og hver forklaring viser hvor svaret kommer fra, så du kan gå rett tilbake til siden når et steg ikke gir mening.
Du trenger ikke laste opp noe for å komme i gang. Nevn heller et tema, for eksempel Internett og DNS, eller lister og iterasjon, så setter Bo det opp med de viktigste begrepene, og du kan bygge quizer og kort på det. Resultatene dine viser hvilke begreper du stadig bommer på, slik at neste øvingsprøve kan ta dem. Det er gratis å starte.
Skrevet av StudyPDF-teamet. Sist oppdatert 19. august 2026.
Greit å vite
Er denne AP Computer Science Principles-øvingsprøven virkelig gratis?
Ja. Alle 15 spørsmålene, poengskjermen og hver forklaring er gratis å spille i nettleseren, og det er ingen betalingsmur på denne siden.
Hvordan er AP CSP-eksamenen bygget opp?
Ifølge College Board er del I 70 flervalgsspørsmål på 120 minutter og teller 70 prosent av poengsummen. Del II teller 30 prosent og kombinerer Create-oppgaven, som du bygger i timene over omtrent 9 timer, med 2 skriftlige svaroppgaver i en 60 minutter lang del av eksamensdagen. Eksamen tas i Bluebook-appen. Sjekk College Boards side for gjeldende eksamensdato.
Hvem har skrevet spørsmålene, og dekker de Create-oppgaven?
StudyPDF-teamet har skrevet hvert spørsmål og hver forklaring ut fra de Big Ideas som College Board publiserer for faget. De er ikke frigitte eksamensspørsmål, og de er ikke hentet fra noen kursleverandørs bank. Create-oppgaven øves ikke her, siden det er et program du bygger selv. StudyPDF er ikke tilknyttet College Board, og AP er et varemerke som tilhører College Board.
Kan jeg få flere slike spørsmål fra mine egne notater?
Ja. Last opp notatene fra timene, lysbilder eller repetisjonshefte til StudyPDF, så bygger Bo fullengdes øvingsprøver fra akkurat de sidene, med forklaringer som viser hvor hvert svar kom fra. Har du bare en papirutgave, kan du nevne et tema i stedet, for eksempel lister og iterasjon, så skriver Bo en prøve fra det.
Trenger du mer enn en smakebit?
Last opp din egen pensumbok, lysark eller notater, så bygger Bo fullengdes øvingsprøver fra akkurat ditt materiale, følger med på hvilke begreper du stadig bommer på og går rett på de svake punktene. Gratis å komme i gang.