31:I[196793,["/_next/static/chunks/04dz0xqjvyj1r.js?dpl=nogit-1790430181","/_next/static/chunks/0p4rexedanx97.js?dpl=nogit-1790430181","/_next/static/chunks/2epfhfe5im7r6.js?dpl=nogit-1790430181","/_next/static/chunks/176p1wltq5_f6.js?dpl=nogit-1790430181","/_next/static/chunks/1f95q9c4h-8pl.js?dpl=nogit-1790430181","/_next/static/chunks/0u008gt6051u7.js?dpl=nogit-1790430181","/_next/static/chunks/1odwrcl12kfnl.js?dpl=nogit-1790430181","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1790430181","/_next/static/chunks/2u46tugibrk1v.js?dpl=nogit-1790430181","/_next/static/chunks/3ao1re0xmmur_.js?dpl=nogit-1790430181","/_next/static/chunks/03q735zs9dbpu.js?dpl=nogit-1790430181","/_next/static/chunks/3r5hh4t0jf4es.js?dpl=nogit-1790430181","/_next/static/chunks/3ht89vb0p09bm.js?dpl=nogit-1790430181","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1790430181","/_next/static/chunks/12xoy6h_w_le6.js?dpl=nogit-1790430181","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1790430181","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1790430181","/_next/static/chunks/3ocoqwe4aht_u.js?dpl=nogit-1790430181","/_next/static/chunks/330aj5rw-3o2w.js?dpl=nogit-1790430181","/_next/static/chunks/1h4wccj42vygd.js?dpl=nogit-1790430181","/_next/static/chunks/3xa2z7fbv2riw.js?dpl=nogit-1790430181","/_next/static/chunks/14kf-an-d2n-e.js?dpl=nogit-1790430181","/_next/static/chunks/381o-754ev9ia.js?dpl=nogit-1790430181","/_next/static/chunks/2th820ily21xq.js?dpl=nogit-1790430181","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1790430181","/_next/static/chunks/3kom3ps_bn2q6.js?dpl=nogit-1790430181","/_next/static/chunks/1x_yxljsdq0vl.js?dpl=nogit-1790430181","/_next/static/chunks/1xkpwfqqdrdio.js?dpl=nogit-1790430181","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1790430181","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1790430181","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1790430181","/_next/static/chunks/3dcuhw7_p-nlv.js?dpl=nogit-1790430181","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1790430181","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1790430181","/_next/static/chunks/2a4uxh-kqx1wo.js?dpl=nogit-1790430181","/_next/static/chunks/2-3hvjs177r4z.js?dpl=nogit-1790430181","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1790430181","/_next/static/chunks/1l2yee13s4kff.js?dpl=nogit-1790430181","/_next/static/chunks/1pp_uf_jx5j9r.js?dpl=nogit-1790430181","/_next/static/chunks/1s6j_7_p0ugo9.js?dpl=nogit-1790430181","/_next/static/chunks/2vg15qyptj-oc.js?dpl=nogit-1790430181","/_next/static/chunks/2b6r02yb2zswo.js?dpl=nogit-1790430181","/_next/static/chunks/12mv6p8rwcl5o.js?dpl=nogit-1790430181","/_next/static/chunks/422ba61wql3d7.js?dpl=nogit-1790430181","/_next/static/chunks/2opkuzmjw8cxb.js?dpl=nogit-1790430181","/_next/static/chunks/34ux0fo6f-rm8.js?dpl=nogit-1790430181","/_next/static/chunks/3h4suq-9gmzwh.js?dpl=nogit-1790430181","/_next/static/chunks/0rt2_go1it43r.js?dpl=nogit-1790430181","/_next/static/chunks/0v5zhouho0zlq.js?dpl=nogit-1790430181","/_next/static/chunks/1gtlwpzgzi12z.js?dpl=nogit-1790430181","/_next/static/chunks/2zwoemojbdlmi.js?dpl=nogit-1790430181","/_next/static/chunks/2y341-r8ncizo.js?dpl=nogit-1790430181","/_next/static/chunks/3jzaxe43n3e1e.js?dpl=nogit-1790430181","/_next/static/chunks/3xz_lj7nwz2k-.js?dpl=nogit-1790430181","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1790430181","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1790430181","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1790430181","/_next/static/chunks/2tgvlfspjb-j8.js?dpl=nogit-1790430181","/_next/static/chunks/0pdzmybpnr872.js?dpl=nogit-1790430181","/_next/static/chunks/1zt4k83kx3bkw.js?dpl=nogit-1790430181","/_next/static/chunks/200x0be4hbjpj.js?dpl=nogit-1790430181","/_next/static/chunks/35bn8r0ao86_s.js?dpl=nogit-1790430181","/_next/static/chunks/3wqp-h5xnebw9.js?dpl=nogit-1790430181","/_next/static/chunks/120-bka6zq5lp.js?dpl=nogit-1790430181","/_next/static/chunks/30dopbgd1dkf9.js?dpl=nogit-1790430181","/_next/static/chunks/43ajf4ofaeu5y.js?dpl=nogit-1790430181"],"Gingerbread"] 33:I[647935,["/_next/static/chunks/04dz0xqjvyj1r.js?dpl=nogit-1790430181","/_next/static/chunks/0p4rexedanx97.js?dpl=nogit-1790430181","/_next/static/chunks/2epfhfe5im7r6.js?dpl=nogit-1790430181","/_next/static/chunks/176p1wltq5_f6.js?dpl=nogit-1790430181","/_next/static/chunks/1f95q9c4h-8pl.js?dpl=nogit-1790430181","/_next/static/chunks/0u008gt6051u7.js?dpl=nogit-1790430181","/_next/static/chunks/1odwrcl12kfnl.js?dpl=nogit-1790430181","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1790430181","/_next/static/chunks/2u46tugibrk1v.js?dpl=nogit-1790430181","/_next/static/chunks/3ao1re0xmmur_.js?dpl=nogit-1790430181","/_next/static/chunks/03q735zs9dbpu.js?dpl=nogit-1790430181","/_next/static/chunks/3r5hh4t0jf4es.js?dpl=nogit-1790430181","/_next/static/chunks/3ht89vb0p09bm.js?dpl=nogit-1790430181","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1790430181","/_next/static/chunks/12xoy6h_w_le6.js?dpl=nogit-1790430181","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1790430181","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1790430181","/_next/static/chunks/3ocoqwe4aht_u.js?dpl=nogit-1790430181","/_next/static/chunks/330aj5rw-3o2w.js?dpl=nogit-1790430181","/_next/static/chunks/1h4wccj42vygd.js?dpl=nogit-1790430181","/_next/static/chunks/3xa2z7fbv2riw.js?dpl=nogit-1790430181","/_next/static/chunks/14kf-an-d2n-e.js?dpl=nogit-1790430181","/_next/static/chunks/381o-754ev9ia.js?dpl=nogit-1790430181","/_next/static/chunks/2th820ily21xq.js?dpl=nogit-1790430181","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1790430181","/_next/static/chunks/3kom3ps_bn2q6.js?dpl=nogit-1790430181","/_next/static/chunks/1x_yxljsdq0vl.js?dpl=nogit-1790430181","/_next/static/chunks/1xkpwfqqdrdio.js?dpl=nogit-1790430181","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1790430181","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1790430181","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1790430181","/_next/static/chunks/3dcuhw7_p-nlv.js?dpl=nogit-1790430181","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1790430181","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1790430181","/_next/static/chunks/2a4uxh-kqx1wo.js?dpl=nogit-1790430181","/_next/static/chunks/2-3hvjs177r4z.js?dpl=nogit-1790430181","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1790430181","/_next/static/chunks/1l2yee13s4kff.js?dpl=nogit-1790430181","/_next/static/chunks/1pp_uf_jx5j9r.js?dpl=nogit-1790430181","/_next/static/chunks/1s6j_7_p0ugo9.js?dpl=nogit-1790430181","/_next/static/chunks/2vg15qyptj-oc.js?dpl=nogit-1790430181","/_next/static/chunks/2b6r02yb2zswo.js?dpl=nogit-1790430181","/_next/static/chunks/12mv6p8rwcl5o.js?dpl=nogit-1790430181","/_next/static/chunks/422ba61wql3d7.js?dpl=nogit-1790430181","/_next/static/chunks/2opkuzmjw8cxb.js?dpl=nogit-1790430181","/_next/static/chunks/34ux0fo6f-rm8.js?dpl=nogit-1790430181","/_next/static/chunks/3h4suq-9gmzwh.js?dpl=nogit-1790430181","/_next/static/chunks/0rt2_go1it43r.js?dpl=nogit-1790430181","/_next/static/chunks/0v5zhouho0zlq.js?dpl=nogit-1790430181","/_next/static/chunks/1gtlwpzgzi12z.js?dpl=nogit-1790430181","/_next/static/chunks/2zwoemojbdlmi.js?dpl=nogit-1790430181","/_next/static/chunks/2y341-r8ncizo.js?dpl=nogit-1790430181","/_next/static/chunks/3jzaxe43n3e1e.js?dpl=nogit-1790430181","/_next/static/chunks/3xz_lj7nwz2k-.js?dpl=nogit-1790430181","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1790430181","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1790430181","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1790430181","/_next/static/chunks/2tgvlfspjb-j8.js?dpl=nogit-1790430181","/_next/static/chunks/0pdzmybpnr872.js?dpl=nogit-1790430181","/_next/static/chunks/1zt4k83kx3bkw.js?dpl=nogit-1790430181","/_next/static/chunks/200x0be4hbjpj.js?dpl=nogit-1790430181","/_next/static/chunks/35bn8r0ao86_s.js?dpl=nogit-1790430181","/_next/static/chunks/3wqp-h5xnebw9.js?dpl=nogit-1790430181","/_next/static/chunks/120-bka6zq5lp.js?dpl=nogit-1790430181","/_next/static/chunks/30dopbgd1dkf9.js?dpl=nogit-1790430181","/_next/static/chunks/43ajf4ofaeu5y.js?dpl=nogit-1790430181"],"RecordResourceResume"] 34:I[830476,["/_next/static/chunks/04dz0xqjvyj1r.js?dpl=nogit-1790430181","/_next/static/chunks/0p4rexedanx97.js?dpl=nogit-1790430181","/_next/static/chunks/2epfhfe5im7r6.js?dpl=nogit-1790430181","/_next/static/chunks/176p1wltq5_f6.js?dpl=nogit-1790430181","/_next/static/chunks/1f95q9c4h-8pl.js?dpl=nogit-1790430181","/_next/static/chunks/0u008gt6051u7.js?dpl=nogit-1790430181","/_next/static/chunks/1odwrcl12kfnl.js?dpl=nogit-1790430181","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1790430181","/_next/static/chunks/2u46tugibrk1v.js?dpl=nogit-1790430181","/_next/static/chunks/3ao1re0xmmur_.js?dpl=nogit-1790430181","/_next/static/chunks/03q735zs9dbpu.js?dpl=nogit-1790430181","/_next/static/chunks/3r5hh4t0jf4es.js?dpl=nogit-1790430181","/_next/static/chunks/3ht89vb0p09bm.js?dpl=nogit-1790430181","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1790430181","/_next/static/chunks/12xoy6h_w_le6.js?dpl=nogit-1790430181","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1790430181","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1790430181","/_next/static/chunks/3ocoqwe4aht_u.js?dpl=nogit-1790430181","/_next/static/chunks/330aj5rw-3o2w.js?dpl=nogit-1790430181","/_next/static/chunks/1h4wccj42vygd.js?dpl=nogit-1790430181","/_next/static/chunks/3xa2z7fbv2riw.js?dpl=nogit-1790430181","/_next/static/chunks/14kf-an-d2n-e.js?dpl=nogit-1790430181","/_next/static/chunks/381o-754ev9ia.js?dpl=nogit-1790430181","/_next/static/chunks/2th820ily21xq.js?dpl=nogit-1790430181","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1790430181","/_next/static/chunks/3kom3ps_bn2q6.js?dpl=nogit-1790430181","/_next/static/chunks/1x_yxljsdq0vl.js?dpl=nogit-1790430181","/_next/static/chunks/1xkpwfqqdrdio.js?dpl=nogit-1790430181","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1790430181","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1790430181","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1790430181","/_next/static/chunks/3dcuhw7_p-nlv.js?dpl=nogit-1790430181","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1790430181","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1790430181","/_next/static/chunks/2a4uxh-kqx1wo.js?dpl=nogit-1790430181","/_next/static/chunks/2-3hvjs177r4z.js?dpl=nogit-1790430181","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1790430181","/_next/static/chunks/1l2yee13s4kff.js?dpl=nogit-1790430181","/_next/static/chunks/1pp_uf_jx5j9r.js?dpl=nogit-1790430181","/_next/static/chunks/1s6j_7_p0ugo9.js?dpl=nogit-1790430181","/_next/static/chunks/2vg15qyptj-oc.js?dpl=nogit-1790430181","/_next/static/chunks/2b6r02yb2zswo.js?dpl=nogit-1790430181","/_next/static/chunks/12mv6p8rwcl5o.js?dpl=nogit-1790430181","/_next/static/chunks/422ba61wql3d7.js?dpl=nogit-1790430181","/_next/static/chunks/2opkuzmjw8cxb.js?dpl=nogit-1790430181","/_next/static/chunks/34ux0fo6f-rm8.js?dpl=nogit-1790430181","/_next/static/chunks/3h4suq-9gmzwh.js?dpl=nogit-1790430181","/_next/static/chunks/0rt2_go1it43r.js?dpl=nogit-1790430181","/_next/static/chunks/0v5zhouho0zlq.js?dpl=nogit-1790430181","/_next/static/chunks/1gtlwpzgzi12z.js?dpl=nogit-1790430181","/_next/static/chunks/2zwoemojbdlmi.js?dpl=nogit-1790430181","/_next/static/chunks/2y341-r8ncizo.js?dpl=nogit-1790430181","/_next/static/chunks/3jzaxe43n3e1e.js?dpl=nogit-1790430181","/_next/static/chunks/3xz_lj7nwz2k-.js?dpl=nogit-1790430181","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1790430181","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1790430181","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1790430181","/_next/static/chunks/2tgvlfspjb-j8.js?dpl=nogit-1790430181","/_next/static/chunks/0pdzmybpnr872.js?dpl=nogit-1790430181","/_next/static/chunks/1zt4k83kx3bkw.js?dpl=nogit-1790430181","/_next/static/chunks/200x0be4hbjpj.js?dpl=nogit-1790430181","/_next/static/chunks/35bn8r0ao86_s.js?dpl=nogit-1790430181","/_next/static/chunks/3wqp-h5xnebw9.js?dpl=nogit-1790430181","/_next/static/chunks/120-bka6zq5lp.js?dpl=nogit-1790430181","/_next/static/chunks/30dopbgd1dkf9.js?dpl=nogit-1790430181","/_next/static/chunks/43ajf4ofaeu5y.js?dpl=nogit-1790430181"],"FlashcardAccessBranch"] 35:I[315438,["/_next/static/chunks/04dz0xqjvyj1r.js?dpl=nogit-1790430181","/_next/static/chunks/0p4rexedanx97.js?dpl=nogit-1790430181","/_next/static/chunks/2epfhfe5im7r6.js?dpl=nogit-1790430181","/_next/static/chunks/176p1wltq5_f6.js?dpl=nogit-1790430181","/_next/static/chunks/1f95q9c4h-8pl.js?dpl=nogit-1790430181","/_next/static/chunks/0u008gt6051u7.js?dpl=nogit-1790430181","/_next/static/chunks/1odwrcl12kfnl.js?dpl=nogit-1790430181","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1790430181","/_next/static/chunks/2u46tugibrk1v.js?dpl=nogit-1790430181","/_next/static/chunks/3ao1re0xmmur_.js?dpl=nogit-1790430181","/_next/static/chunks/03q735zs9dbpu.js?dpl=nogit-1790430181","/_next/static/chunks/3r5hh4t0jf4es.js?dpl=nogit-1790430181","/_next/static/chunks/3ht89vb0p09bm.js?dpl=nogit-1790430181","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1790430181","/_next/static/chunks/12xoy6h_w_le6.js?dpl=nogit-1790430181","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1790430181","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1790430181","/_next/static/chunks/3ocoqwe4aht_u.js?dpl=nogit-1790430181","/_next/static/chunks/330aj5rw-3o2w.js?dpl=nogit-1790430181","/_next/static/chunks/1h4wccj42vygd.js?dpl=nogit-1790430181","/_next/static/chunks/3xa2z7fbv2riw.js?dpl=nogit-1790430181","/_next/static/chunks/14kf-an-d2n-e.js?dpl=nogit-1790430181","/_next/static/chunks/381o-754ev9ia.js?dpl=nogit-1790430181","/_next/static/chunks/2th820ily21xq.js?dpl=nogit-1790430181","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1790430181","/_next/static/chunks/3kom3ps_bn2q6.js?dpl=nogit-1790430181","/_next/static/chunks/1x_yxljsdq0vl.js?dpl=nogit-1790430181","/_next/static/chunks/1xkpwfqqdrdio.js?dpl=nogit-1790430181","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1790430181","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1790430181","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1790430181","/_next/static/chunks/3dcuhw7_p-nlv.js?dpl=nogit-1790430181","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1790430181","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1790430181","/_next/static/chunks/2a4uxh-kqx1wo.js?dpl=nogit-1790430181","/_next/static/chunks/2-3hvjs177r4z.js?dpl=nogit-1790430181","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1790430181","/_next/static/chunks/1l2yee13s4kff.js?dpl=nogit-1790430181","/_next/static/chunks/1pp_uf_jx5j9r.js?dpl=nogit-1790430181","/_next/static/chunks/1s6j_7_p0ugo9.js?dpl=nogit-1790430181","/_next/static/chunks/2vg15qyptj-oc.js?dpl=nogit-1790430181","/_next/static/chunks/2b6r02yb2zswo.js?dpl=nogit-1790430181","/_next/static/chunks/12mv6p8rwcl5o.js?dpl=nogit-1790430181","/_next/static/chunks/422ba61wql3d7.js?dpl=nogit-1790430181","/_next/static/chunks/2opkuzmjw8cxb.js?dpl=nogit-1790430181","/_next/static/chunks/34ux0fo6f-rm8.js?dpl=nogit-1790430181","/_next/static/chunks/3h4suq-9gmzwh.js?dpl=nogit-1790430181","/_next/static/chunks/0rt2_go1it43r.js?dpl=nogit-1790430181","/_next/static/chunks/0v5zhouho0zlq.js?dpl=nogit-1790430181","/_next/static/chunks/1gtlwpzgzi12z.js?dpl=nogit-1790430181","/_next/static/chunks/2zwoemojbdlmi.js?dpl=nogit-1790430181","/_next/static/chunks/2y341-r8ncizo.js?dpl=nogit-1790430181","/_next/static/chunks/3jzaxe43n3e1e.js?dpl=nogit-1790430181","/_next/static/chunks/3xz_lj7nwz2k-.js?dpl=nogit-1790430181","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1790430181","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1790430181","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1790430181","/_next/static/chunks/2tgvlfspjb-j8.js?dpl=nogit-1790430181","/_next/static/chunks/0pdzmybpnr872.js?dpl=nogit-1790430181","/_next/static/chunks/1zt4k83kx3bkw.js?dpl=nogit-1790430181","/_next/static/chunks/200x0be4hbjpj.js?dpl=nogit-1790430181","/_next/static/chunks/35bn8r0ao86_s.js?dpl=nogit-1790430181","/_next/static/chunks/3wqp-h5xnebw9.js?dpl=nogit-1790430181","/_next/static/chunks/120-bka6zq5lp.js?dpl=nogit-1790430181","/_next/static/chunks/30dopbgd1dkf9.js?dpl=nogit-1790430181","/_next/static/chunks/43ajf4ofaeu5y.js?dpl=nogit-1790430181"],"TopicFlashcardRunner"] 22:[["$","$L31",null,{"feature":"flashcards"}],"$L32",["$","$L33",null,{"href":"/a-level/computer-science/aqa/information-coding-systems/flashcards","label":"Information coding systems","subjectCode":"a_level_computer_science__aqa","surface":"flashcards"}],["$","$L34",null,{"runner":["$","div",null,{"className":"min-h-0 flex-1 overflow-hidden bg-background","children":["$","$L35",null,{"decks":[{"id":"3139ec1d-9436-4145-b453-d59a5ae4d0c9","title":"Information coding systems Flashcards","topicId":"4b083ea6-05d6-5fcf-a45f-088c34534968","topicSlug":"information-coding-systems","cards":[{"id":"46ffa562-567b-4c8c-83e8-7684a8f95231","cardType":"basic","points":1,"front":"When a digit will be used in arithmetic, how should it be stored?","back":"As a numeric value.","mcqOptions":[{"text":"As a numeric value.","correct":true,"explanation":"Arithmetic operations require the digit’s actual magnitude, represented as a numeric value. This allows calculations such as addition and multiplication to operate directly on it."},{"text":"As a character code.","correct":false,"explanation":"Character codes represent displayed symbols, so arithmetic would operate on the symbol’s code rather than its magnitude. A digit used in arithmetic must be stored as a numeric value."},{"text":"As a Boolean value.","correct":false,"explanation":"A Boolean stores only one of two logical states, not the magnitude of an arbitrary digit. A digit intended for arithmetic must be stored as a numeric value."},{"text":"As an instruction code.","correct":false,"explanation":"An instruction code tells the processor which operation to perform; it does not represent a quantity used by that operation. The digit must be stored as a numeric value."}]},{"id":"f20f22f3-b6f4-4fdb-8fbe-3240f3728a58","cardType":"basic","points":1,"front":"When a digit is text to be displayed, how should it be stored?","back":"As a character code.","mcqOptions":[{"text":"As a character code.","correct":true,"explanation":"A character coding system assigns the displayed digit a numeric code, allowing the computer to store and reproduce it as a text symbol."},{"text":"As a numeric value.","correct":false,"explanation":"A numeric value represents the digit’s magnitude for calculation, not the symbol that should appear on screen. Displayed text must be stored as a character code."},{"text":"As a Boolean value.","correct":false,"explanation":"A Boolean represents a logical state such as true or false, so it cannot identify a particular displayed digit. Text digits must be stored as character codes."},{"text":"As an instruction code.","correct":false,"explanation":"Instruction codes represent processor operations rather than symbols to display. A digit being treated as text must instead be represented by its character code."}]},{"id":"aa3252fc-e4b9-40fe-ac27-1507be2f90d5","cardType":"cloze","points":null,"front":"A pure binary representation stores the actual [ ] using base 2 place values.","back":"A pure binary representation stores the actual numeric value using base 2 place values.","mcqOptions":[{"text":"numeric value","correct":true,"explanation":"Pure binary uses powers of two as place values to encode the number’s actual magnitude, so it directly represents the numeric value."},{"text":"character code","correct":false,"explanation":"A character code identifies a symbol according to a coding system such as ASCII or Unicode. Pure binary place values instead represent the actual numeric value."},{"text":"memory address","correct":false,"explanation":"A memory address identifies a storage location rather than the magnitude of a number. Pure binary representation stores the actual numeric value using powers of two."},{"text":"displayed symbol","correct":false,"explanation":"A displayed symbol requires an agreed character coding system, not merely base 2 place values. Pure binary place values encode the actual numeric value."}]},{"id":"77b9cc24-b9da-4c25-86d5-a3c2113d975b","cardType":"cloze","points":null,"front":"A character code representation stores a [ ] using a numeric code from a coding system such as ASCII or Unicode.","back":"A character code representation stores a symbol using a numeric code from a coding system such as ASCII or Unicode.","mcqOptions":[{"text":"symbol","correct":true,"explanation":"Character coding systems assign numeric codes to symbols, including letters, digits and punctuation, so those symbols can be represented and processed in binary."},{"text":"numeric value","correct":false,"explanation":"A numeric value is represented directly for arithmetic rather than identified through ASCII or Unicode. A character code representation uses its assigned number to store a symbol."},{"text":"memory address","correct":false,"explanation":"A memory address identifies where data is stored, whereas ASCII and Unicode numbers identify text symbols. Character code representation therefore stores a symbol."},{"text":"processor instruction","correct":false,"explanation":"A processor instruction is encoded using the computer’s instruction set, not a text coding system. ASCII and Unicode assign numeric codes to symbols."}]},{"id":"537120ad-9bdc-4f8d-9a12-63830e103192","cardType":"basic","points":1,"front":"Why is the character '7' not stored as 0111?","back":"0111 is the pure binary value 7, not its character code.","mcqOptions":[{"text":"0111 is the pure binary value 7, not its character code.","correct":true,"explanation":"Using binary place values, 0111 evaluates directly to 7. The text character '7' instead has its own assigned code, such as 00110111 in ASCII."},{"text":"0111 is the character code for 7 with its leading zeros removed.","correct":false,"explanation":"Removing leading zeros from ASCII 00110111 would not produce 0111; significant bits would be lost. 0111 is the pure binary value 7, not its character code."},{"text":"0111 is too short to represent 7 in any binary coding system.","correct":false,"explanation":"Four bits are sufficient to represent the numeric value 7 because 0111 equals 7 in pure binary. It is not, however, the character code for '7'."},{"text":"0111 is the pure binary value 5, not its character code.","correct":false,"explanation":"Misreading the place values gives the wrong magnitude: 0111 equals $4 + 2 + 1 = 7$. It is pure binary 7, not the code for '7'."}]},{"id":"5e29ed8e-49cb-413a-99fd-ab29e6f27957","cardType":"basic","points":1,"front":"In 8 bits, what is the ASCII/Unicode code for the character '5'?","back":"00110101.","mcqOptions":[{"text":"00110101.","correct":true,"explanation":"ASCII assigns decimal code 53 to the character '5'. Converting 53 to an 8-bit binary value gives 00110101, which Unicode preserves for this character."},{"text":"00000101.","correct":false,"explanation":"This is the 8-bit pure binary representation of the numeric value 5, not the text character’s code. ASCII and Unicode encode '5' as 00110101."},{"text":"00110100.","correct":false,"explanation":"This is the ASCII and Unicode code for the neighbouring character '4'. Increasing it by one gives 00110101, the code for '5'."},{"text":"00110110.","correct":false,"explanation":"This is the ASCII and Unicode code for the neighbouring character '6'. Decreasing it by one gives 00110101, the code for '5'."}]},{"id":"dabfeec7-8d65-4c48-86e0-fbb935d435a0","cardType":"basic","points":3,"front":"How is the number 42 stored differently from the text '42' in the notes?","back":"

42: one 8-bit value, 00101010
'42': two character codes

","mcqOptions":[{"text":"

42: one 8-bit value, 00101010
'42': two character codes

","correct":true,"explanation":"The number 42 is one numeric quantity and has the pure binary representation 00101010. The text contains two separate symbols, so each needs its own character code."},{"text":"

42: one 8-bit value, 00110100
'42': two character codes

","correct":false,"explanation":"The first byte confuses 42 with the character code for '4'. Numeric 42 is stored as 00101010, while the text '42' uses two character codes."},{"text":"

42: two character codes
'42': one 8-bit value, 00101010

","correct":false,"explanation":"This reverses the two representations. Numeric 42 is one 8-bit value, 00101010, whereas text '42' consists of two symbols and therefore needs two character codes."},{"text":"

42: one 8-bit value, 00101010
'42': one character code

","correct":false,"explanation":"The text contains two characters, '4' and '2', so one character code cannot represent it. Numeric 42 uses 00101010, while the text requires two codes."}]},{"id":"4ea05e59-d15b-43b1-b5a5-99a6c780b284","cardType":"basic","points":1,"front":"What does a character coding system allow computers to do with text?","back":"Store and transmit characters as binary.","mcqOptions":[{"text":"Store and transmit characters as binary.","correct":true,"explanation":"A character coding system maps each text symbol to an agreed numeric code, allowing computers to represent, store and transmit those characters using binary data."},{"text":"Store and transmit numbers as decimal.","correct":false,"explanation":"Computers store and transmit data in binary rather than decimal notation. Character coding systems specifically map text characters to numeric codes so they can be represented as binary."},{"text":"Store and transmit characters as analogue.","correct":false,"explanation":"Analogue signals vary continuously and are not the representation defined by character coding systems. These systems assign codes that let computers store and transmit characters as binary."},{"text":"Store and transmit instructions as binary.","correct":false,"explanation":"Processor instructions are encoded by an instruction set, not by a character coding system. ASCII and Unicode instead allow computers to store and transmit text characters as binary."}]},{"id":"9e11d1e2-bbc8-448f-a3f2-c35b32828f76","cardType":"cloze","points":null,"front":"Standard ASCII uses [ ] bits, giving [ ] possible codes.","back":"Standard ASCII uses 7 bits, giving 128 possible codes.","mcqOptions":[{"text":"Standard ASCII uses 7 bits, giving 128 possible codes.","correct":true,"explanation":"Seven bits provide 2^7 possible combinations, which equals 128. Standard ASCII uses these codes to represent characters, including letters, digits, punctuation and control characters."},{"text":"Standard ASCII uses 8 bits, giving 256 possible codes.","correct":false,"explanation":"This confuses standard ASCII with an 8-bit character storage format. Standard ASCII uses 7 bits, producing 128 possible codes; an extra leading bit may be added when stored in a byte."},{"text":"Standard ASCII uses 6 bits, giving 64 possible codes.","correct":false,"explanation":"The six-bit value is too small for standard ASCII, which needs codes for more than 64 characters. Seven bits are used, giving 2^7, or 128, possible codes."},{"text":"Standard ASCII uses 7 bits, giving 64 possible codes.","correct":false,"explanation":"This uses the correct bit length but calculates the number of combinations incorrectly. Seven bits give 2^7 = 128 codes, not 64, which would require only six bits."}]},{"id":"c3493a19-6042-4699-b7aa-2c70012bd948","cardType":"basic","points":1,"front":"Why are ASCII characters often stored in 8 bits despite ASCII being 7-bit?","back":"They are stored in a byte with a leading zero.","mcqOptions":[{"text":"They are stored in a byte with a leading zero.","correct":true,"explanation":"A byte contains eight bits, so a standard ASCII value is stored with one extra bit added at the front. That leading zero preserves the original seven-bit ASCII value."},{"text":"They are stored in a byte with a trailing zero.","correct":false,"explanation":"The extra bit is conventionally placed at the front, not the end, so it is a leading zero. Adding a trailing zero would change the binary value of the character."},{"text":"They are stored in a byte with a leading one.","correct":false,"explanation":"A leading one would alter the value and could make the byte appear to use an extended character code. Standard ASCII is stored with a leading zero to fill the byte."},{"text":"They are stored in a byte with a parity bit.","correct":false,"explanation":"A parity bit is used for some error-detection schemes, not simply to extend every ASCII character to eight bits. The extra storage bit for ASCII is a leading zero."}]},{"id":"c5fd6bf0-ae62-43d0-a573-2cfd72a1d3ad","cardType":"basic","points":1,"front":"What is the 8-bit ASCII binary code for uppercase A?","back":"01000001.","mcqOptions":[{"text":"01000001.","correct":true,"explanation":"Uppercase A has decimal ASCII value 65. Converting 65 to eight-bit binary gives 01000001, with the leading zero filling the standard eight-bit storage byte."},{"text":"01000010.","correct":false,"explanation":"01000010 represents decimal 66, which is uppercase B. Uppercase A is decimal 65, so its eight-bit ASCII code is 01000001."},{"text":"01000000.","correct":false,"explanation":"01000000 represents decimal 64, the code immediately before uppercase A. Adding one to this value gives A's correct code, 01000001."},{"text":"01100001.","correct":false,"explanation":"01100001 is decimal 97, the ASCII code for lowercase a. Uppercase A uses decimal 65 and is represented as 01000001."}]},{"id":"64935300-e980-406c-9838-26b454b8244c","cardType":"basic","points":2,"front":"Why was Unicode introduced?","back":"ASCII lacked enough codes for global languages and symbols.","mcqOptions":[{"text":"ASCII lacked enough codes for global languages and symbols.","correct":true,"explanation":"Standard ASCII has only 128 codes and mainly supports English characters and a limited set of symbols. Unicode was introduced to represent many writing systems and a much wider range of symbols."},{"text":"ASCII used too many codes for English letters and numbers.","correct":false,"explanation":"ASCII's problem was not having too many codes for English. It had too few codes to represent global languages and symbols, which Unicode was designed to support."},{"text":"ASCII could not store any characters in binary.","correct":false,"explanation":"ASCII successfully stores characters as binary codes, particularly English letters, digits and punctuation. Unicode was needed because ASCII could not cover enough languages and symbols."},{"text":"ASCII required too much space for global languages and symbols.","correct":false,"explanation":"ASCII's limitation was insufficient capacity, not excessive storage. Its 128 codes could not represent global languages and symbols, so Unicode provided a much larger character set."}]},{"id":"ec4efefd-72fd-498e-88c3-df9f9b8c0478","cardType":"cloze","points":null,"front":"Unicode assigns each character a unique [ ], often written as U+ followed by [ ] digits.","back":"Unicode assigns each character a unique code point, often written as U+ followed by hexadecimal digits.","mcqOptions":[{"text":"Unicode assigns each character a unique code point, often written as U+ followed by hexadecimal digits.","correct":true,"explanation":"A Unicode code point identifies a character uniquely. It is commonly written in hexadecimal after U+, such as U+0041 for uppercase A."},{"text":"Unicode assigns each character a unique binary value, often written as U+ followed by decimal digits.","correct":false,"explanation":"Unicode identifies characters using code points, not binary values in this notation. The digits after U+ are conventionally hexadecimal, allowing compact representation of the code point."},{"text":"Unicode assigns each character a unique code point, often written as U+ followed by binary digits.","correct":false,"explanation":"The first term is correct, but U+ notation uses hexadecimal digits rather than binary digits. Hexadecimal makes Unicode values shorter and easier to read."},{"text":"Unicode assigns each character a unique character code, often written as U+ followed by octal digits.","correct":false,"explanation":"Unicode uses the term code point, and its standard U+ notation is hexadecimal. Character code and octal digits are tempting near-misses but do not describe this notation accurately."}]},{"id":"b5d39348-da7f-4bab-b307-b3dc333cf9d2","cardType":"basic","points":1,"front":"How do the first 128 Unicode code points help compatibility?","back":"They match standard ASCII.","mcqOptions":[{"text":"They match standard ASCII.","correct":true,"explanation":"Unicode deliberately assigns its first 128 code points to the same characters and values as standard ASCII. This allows ASCII text to remain compatible when processed as Unicode."},{"text":"They replace standard ASCII.","correct":false,"explanation":"The first 128 Unicode code points do not replace ASCII values; they match them exactly. This shared range provides compatibility between ASCII text and Unicode systems."},{"text":"They extend standard ASCII to 256 codes.","correct":false,"explanation":"Unicode compatibility is based on matching the first 128 ASCII codes, not extending ASCII to 256 codes. Unicode then continues with many additional code points."},{"text":"They compress standard ASCII into fewer bits.","correct":false,"explanation":"The first 128 Unicode code points preserve the same character assignments as ASCII, but they do not compress ASCII. Their purpose is compatibility between character sets."}]},{"id":"3208b5ca-d8ef-434e-9b2a-29ef6e4f9b7a","cardType":"cloze","points":null,"front":"Unicode is not simply [ ]; encodings such as [ ] can store its code points as bytes.","back":"Unicode is not simply 16-bit ASCII; encodings such as UTF-8 can store its code points as bytes.","mcqOptions":[{"text":"Unicode is not simply 16-bit ASCII; encodings such as UTF-8 can store its code points as bytes.","correct":true,"explanation":"Unicode is a character set of code points, while an encoding specifies how those code points are stored. UTF-8 uses one to four bytes depending on the character."},{"text":"Unicode is not simply 8-bit ASCII; encodings such as UTF-16 can store its code points as bytes.","correct":false,"explanation":"Unicode is not 8-bit ASCII, but the usual contrast is that it is not simply 16-bit ASCII. UTF-16 is an encoding, yet this completed statement has the wrong description."},{"text":"Unicode is not simply 16-bit ASCII; encodings such as ASCII can store its code points as bytes.","correct":false,"explanation":"The description of Unicode is correct, but ASCII cannot encode all Unicode code points. UTF-8 is an encoding designed to represent the Unicode character set."},{"text":"Unicode is not simply 32-bit ASCII; encodings such as UTF-8 can store its code points as bytes.","correct":false,"explanation":"UTF-8 can encode Unicode code points, but Unicode is not correctly described as 32-bit ASCII. The common misconception is that Unicode itself is simply 16-bit ASCII."}]},{"id":"386e851a-dff6-4eae-b6f1-ac9c8011186a","cardType":"basic","points":2,"front":"What is the difference between error detection and error correction?","back":"

Detection: identifies probable corruption
Correction: recovers original data sometimes

","mcqOptions":[{"text":"

Detection: identifies probable corruption
Correction: recovers original data sometimes

","correct":true,"explanation":"Error detection indicates that transmitted data may have been corrupted, while error correction uses additional information to recover the original data when the error-correcting method allows it."},{"text":"

Detection: recovers original data sometimes
Correction: identifies probable corruption

","correct":false,"explanation":"These definitions are reversed. Detection identifies probable corruption, whereas correction attempts to recover the original data, sometimes successfully, using added redundancy."},{"text":"

Detection: prevents all corruption
Correction: identifies the transmission speed

","correct":false,"explanation":"Detection cannot prevent all corruption, and correction is not about transmission speed. Detection identifies probable corruption; correction may recover the original data."},{"text":"

Detection: removes corrupted bits
Correction: adds encryption to data

","correct":false,"explanation":"Detection normally flags likely corruption rather than removing bits, and correction is not encryption. The correct distinction is identifying corruption versus recovering the original data."}]},{"id":"5ed94afa-2fc2-4a47-af39-cb5ab8146f82","cardType":"cloze","points":null,"front":"Most error checking methods add [ ]: extra bits or digits not part of the original message.","back":"Most error checking methods add redundant data: extra bits or digits not part of the original message.","mcqOptions":[{"text":"redundant data","correct":true,"explanation":"Redundant data consists of extra bits or digits added to a message so that transmission errors can be detected or, in some coding systems, corrected."},{"text":"compressed data","correct":false,"explanation":"Compression reduces the amount of data rather than adding checking information. The correct term is redundant data, which is deliberately added to help detect or correct errors."},{"text":"encrypted data","correct":false,"explanation":"Encryption disguises information to prevent unauthorised access, but it does not specifically describe extra checking bits. These additional bits or digits are called redundant data."},{"text":"source data","correct":false,"explanation":"Source data is the original information before processing or transmission. Extra information added for error checking is redundant data because it is not part of the original message."}]},{"id":"f6e47417-83b1-4629-a78e-24f38df66126","cardType":"basic","points":1,"front":"In even parity, what must the total number of 1s be?","back":"An even number, including the parity bit.","mcqOptions":[{"text":"An even number, including the parity bit.","correct":true,"explanation":"Even parity requires the complete transmitted pattern, including the parity bit, to contain an even total number of 1s."},{"text":"An odd number, including the parity bit.","correct":false,"explanation":"An odd total is the rule for odd parity, not even parity. With even parity, the parity bit makes the total number of 1s even."},{"text":"An even number, excluding the parity bit.","correct":false,"explanation":"The common slip is to count only the original data. Even parity applies to the entire transmitted pattern, so the parity bit must be included in the even total."},{"text":"An odd number, excluding the parity bit.","correct":false,"explanation":"This confuses both the required total and what must be counted. Even parity requires an even number of 1s across the data and parity bit together."}]},{"id":"7d98c6df-27bf-460c-9ff0-ad44ae9827a7","cardType":"basic","points":2,"front":"What even parity bit is added to 10110010?","back":"0, because it already has four 1s.","mcqOptions":[{"text":"0, because it already has four 1s.","correct":true,"explanation":"The byte contains four 1s, which is already even. Adding a parity bit of 0 leaves the total unchanged at four, preserving even parity."},{"text":"1, because it already has four 1s.","correct":false,"explanation":"Although the count of four 1s is correct, adding 1 would produce five 1s and create odd parity. The even parity bit must therefore be 0."},{"text":"1, because four is an odd total.","correct":false,"explanation":"Four is even, not odd. Since the byte already contains an even number of 1s, a parity bit of 0 is added to maintain even parity."},{"text":"1, because the parity bit must be set.","correct":false,"explanation":"A parity bit is not automatically set to 1; its value depends on the data. Four existing 1s already give even parity, so the required bit is 0."}]},{"id":"0b61155d-d577-434c-bfef-b3b982c01b14","cardType":"basic","points":2,"front":"Why can a parity bit detect many single-bit errors?","back":"One changed bit switches the parity.","mcqOptions":[{"text":"One changed bit switches the parity.","correct":true,"explanation":"Changing one bit alters the number of 1s by one, switching the total between odd and even. The receiver can therefore detect that the expected parity has changed."},{"text":"One changed bit preserves the parity.","correct":false,"explanation":"Preserving parity is associated with an even number of bit changes. A single changed bit alters the number of 1s by one and therefore switches the parity."},{"text":"One changed bit identifies its position.","correct":false,"explanation":"A single parity bit can reveal that an error occurred, but it cannot locate the corrupted bit. Detection works because one bit change switches the expected parity."},{"text":"One changed bit restores the message.","correct":false,"explanation":"Parity provides error detection rather than automatic correction, so it cannot restore the original message. It detects a single-bit error because that change switches the parity."}]},{"id":"a93c894d-aaa7-4a85-98f0-efed5a8deedc","cardType":"basic","points":2,"front":"Why can parity fail to detect two corrupted bits?","back":"Two changes can leave the same parity.","mcqOptions":[{"text":"Two changes can leave the same parity.","correct":true,"explanation":"Two bit changes alter the number of 1s by an even amount, or not at all, so the resulting data can retain the expected parity and pass undetected."},{"text":"Two changes always produce opposite parity.","correct":false,"explanation":"An odd number of bit changes switches parity, but two changes can preserve it. The receiver may therefore see the same expected parity and fail to detect the corruption."},{"text":"Two changes reveal the error positions.","correct":false,"explanation":"A parity bit does not indicate which bits were corrupted. Two changes may leave the same parity, meaning the receiver might not detect any error at all."},{"text":"Two changes restore the original message.","correct":false,"explanation":"Two corrupted bits do not generally reverse each other because they occur at different positions. Parity can fail because the two changes may leave the same overall parity."}]},{"id":"263312d2-21e9-4781-8c51-f6559c3c23eb","cardType":"cloze","points":null,"front":"In majority voting, each bit is sent multiple times, commonly [ ] times, and the receiver chooses the value that appears [ ].","back":"In majority voting, each bit is sent multiple times, commonly three times, and the receiver chooses the value that appears most often.","mcqOptions":[{"text":"In majority voting, each bit is sent multiple times, commonly three times, and the receiver chooses the value that appears most often.","correct":true,"explanation":"Sending three copies provides an odd-sized group with a clear majority. The receiver selects the most frequent value, allowing one corrupted copy to be outvoted."},{"text":"In majority voting, each bit is sent multiple times, commonly two times, and the receiver chooses the value that appears most often.","correct":false,"explanation":"Two copies can disagree one-to-one, leaving no majority and no way to identify the original value. Three copies are commonly used so the most frequent value wins."},{"text":"In majority voting, each bit is sent multiple times, commonly three times, and the receiver chooses the value that appears least often.","correct":false,"explanation":"Choosing the least frequent value would select the likely corrupted copy. With three transmissions, the receiver chooses the value appearing most often because it has the majority."},{"text":"In majority voting, each bit is sent multiple times, commonly four times, and the receiver chooses the value that appears least often.","correct":false,"explanation":"Four copies can produce a tie, while selecting the least frequent value reverses the purpose of voting. The standard method uses three copies and chooses the most frequent value."}]},{"id":"4e041278-9452-4d73-949e-dfda1fa2bf57","cardType":"basic","points":1,"front":"Using majority voting, what bit is decoded from 101?","back":"1, because two bits are 1.","mcqOptions":[{"text":"1, because two bits are 1.","correct":true,"explanation":"The group contains two 1s and one 0, so 1 has the majority. Majority voting therefore decodes the group as the bit value 1."},{"text":"0, because two bits are 1.","correct":false,"explanation":"The count is correct, but the conclusion reverses the majority rule. Since two of the three copies are 1, the decoded bit must be 1."},{"text":"0, because one bit is 0.","correct":false,"explanation":"This selects the minority value, a common reversal of majority voting. Only one copy is 0, while two are 1, so the decoded bit is 1."},{"text":"0, because the final bit is 1.","correct":false,"explanation":"Majority voting does not invert or prioritise the final copy. It counts all three values, and because 1 appears twice, the decoded result is 1."}]},{"id":"c10b2823-c69b-4dce-8dcf-cce738e1c3cf","cardType":"basic","points":1,"front":"What kind of error can three-copy majority voting correct?","back":"A single corrupted bit in each group of three.","mcqOptions":[{"text":"A single corrupted bit in each group of three.","correct":true,"explanation":"If one copy is corrupted, the other two still agree and form the majority. Three-copy voting can therefore recover the original bit in every affected group."},{"text":"A pair of corrupted bits in each group of three.","correct":false,"explanation":"If two copies are corrupted to the opposite value, they form the majority and the receiver decodes incorrectly. Only one corrupted bit per group can be corrected."},{"text":"A deleted bit in each group of three.","correct":false,"explanation":"Deletion can shift the boundaries between subsequent groups, so ordinary three-copy majority voting cannot reliably correct it. The method corrects one substituted or corrupted bit per group."},{"text":"A duplicated bit in each group of three.","correct":false,"explanation":"An extra duplicated bit can disrupt grouping and alignment rather than merely changing one copy’s value. Three-copy voting is designed to correct one corrupted bit within each fixed group."}]},{"id":"8d97f308-eb49-4038-a109-ea8f6684d6d0","cardType":"basic","points":1,"front":"Why is majority voting inefficient for large messages?","back":"It uses much more data.","mcqOptions":[{"text":"It uses much more data.","correct":true,"explanation":"Majority voting sends each data unit several times so the receiver can choose the most frequent value. This redundancy greatly increases the amount of transmitted data."},{"text":"It uses much less data.","correct":false,"explanation":"Majority voting adds redundancy rather than reducing the message size. It is inefficient for large messages because transmitting repeated copies uses much more data."},{"text":"It causes more transmission errors.","correct":false,"explanation":"Repeating data does not itself cause more errors; it helps overcome them. The inefficiency arises because majority voting sends much more data than the original message contains."},{"text":"It requires complex decompression.","correct":false,"explanation":"Majority voting does not depend on compressed data or decompression. Its main inefficiency is the much larger quantity of data created by sending repeated copies."}]},{"id":"65676bcc-9231-498e-8722-c43de2094770","cardType":"basic","points":2,"front":"How does a receiver use a checksum to detect errors?","back":"It recalculates the checksum and compares it with the received one.","mcqOptions":[{"text":"It recalculates the checksum and compares it with the received one.","correct":true,"explanation":"The receiver applies the same checksum algorithm to the received data. A mismatch between the recalculated and received checksums indicates that corruption probably occurred."},{"text":"It retransmits the checksum and compares it with the original one.","correct":false,"explanation":"Error detection is performed locally rather than by retransmitting the checksum. The receiver recalculates a checksum from the received data and compares it with the received checksum."},{"text":"It recalculates the checksum and replaces the received one.","correct":false,"explanation":"Replacing the transmitted checksum would remove the value needed for comparison. The receiver must recalculate the checksum and compare the two values to detect corruption."},{"text":"It decrypts the checksum and compares it with the received data.","correct":false,"explanation":"A checksum is not normally decrypted or compared directly with the data. The receiver recalculates the checksum from the data and compares it with the received checksum."}]},{"id":"1d620539-e01f-45c7-bf5e-2f81334f0d90","cardType":"basic","points":1,"front":"What is the checksum for byte values 12, 25, 9 and 40 using sum modulo 256?","back":"86.","mcqOptions":[{"text":"86.","correct":true,"explanation":"Adding the byte values gives $12+25+9+40=86$. Since 86 is already below 256, applying modulo 256 does not change the result."},{"text":"77.","correct":false,"explanation":"This result omits the byte value 9: $12+25+40=77$. Including every byte gives $12+25+9+40=86$, which remains 86 modulo 256."},{"text":"170.","correct":false,"explanation":"This is $256-86$, which confuses a modulo sum with its additive complement. The sum is 86, and because it is below 256, modulo 256 leaves it unchanged."},{"text":"87.","correct":false,"explanation":"This is an off-by-one addition error. The exact sum is $12+25+9+40=86$, and no wraparound occurs because the result is less than 256."}]},{"id":"00658506-73a0-407d-95b8-437b5c06bb82","cardType":"basic","points":2,"front":"Why can checksums detect more errors than a single parity bit but still be imperfect?","back":"Different corruptions can produce the same checksum.","mcqOptions":[{"text":"Different corruptions can produce the same checksum.","correct":true,"explanation":"A checksum maps many possible messages to a limited set of values, so collisions are unavoidable. An altered message with the original checksum value may pass undetected."},{"text":"Different corruptions always produce different checksums.","correct":false,"explanation":"A checksum has a limited range, so distinct corrupted messages can collide and produce the same value. These collisions explain why checksums cannot detect every possible error."},{"text":"Checksums can always correct corrupted data.","correct":false,"explanation":"Ordinary checksums indicate likely corruption but do not identify the damaged bits or restore them. Their imperfection is that different corruptions can produce the same checksum."},{"text":"A checksum stores only a single parity bit.","correct":false,"explanation":"Checksums usually contain multiple bits and therefore distinguish more cases than one parity bit. However, different corrupted messages can still produce the same checksum and escape detection."}]},{"id":"577c1ff2-2338-433c-a844-307b1968a27e","cardType":"basic","points":1,"front":"What type of errors are check digits commonly used to detect?","back":"Human input errors.","mcqOptions":[{"text":"Human input errors.","correct":true,"explanation":"Check digits are commonly appended to numbers such as barcodes and account identifiers. Recalculation can reveal human mistakes such as mistyped or transposed digits."},{"text":"Transmission errors.","correct":false,"explanation":"Transmission errors are normally detected using parity, checksums or other error-detection codes. Check digits are commonly intended to catch human input errors in identifiers and numbers."},{"text":"Encryption errors.","correct":false,"explanation":"Check digits do not verify whether encryption has been performed correctly. They are designed mainly to detect human input errors, including incorrect or transposed digits."},{"text":"Compression errors.","correct":false,"explanation":"Compression formats use their own integrity checks rather than ordinary check digits. Check digits are commonly used to detect human errors when entering or copying numbers."}]},{"id":"b4f96e69-0e00-40f1-aa10-75d282b25dc6","cardType":"basic","points":2,"front":"Using the notes’ rule, what check digit is added to 4729?","back":"8, making the total a multiple of 10.","mcqOptions":[{"text":"8, making the total a multiple of 10.","correct":true,"explanation":"The digits sum to $4+7+2+9=22$. Adding a check digit of 8 gives 30, which is the next multiple of 10."},{"text":"2, making the total a multiple of 10.","correct":false,"explanation":"Choosing 2 repeats the final digit of the digit sum rather than finding its complement. The digits total 22, so 8 is needed to reach 30."},{"text":"6, making the total a multiple of 10.","correct":false,"explanation":"Adding 6 to the correct digit sum of 22 gives 28, not a multiple of 10. The required complement is 8, producing a total of 30."},{"text":"1, making the total a multiple of 10.","correct":false,"explanation":"This uses only the final digit 9 and ignores the other digits. All digits must be summed to 22, requiring 8 to reach the next multiple of 10."}]},{"id":"6880cac6-c2d6-4fc3-8aba-00e0888d8cd9","cardType":"basic","points":1,"front":"Which method in the notes can sometimes correct errors rather than only detect them?","back":"Majority voting.","mcqOptions":[{"text":"Majority voting.","correct":true,"explanation":"Majority voting sends repeated copies and selects the value occurring most frequently. If only a minority of copies are corrupted, the original value can be recovered."},{"text":"Parity checking.","correct":false,"explanation":"A parity bit can indicate that an error has occurred but does not reveal which bit is wrong. Majority voting can sometimes correct an error by selecting the repeated majority value."},{"text":"Checksum validation.","correct":false,"explanation":"A checksum mismatch detects likely corruption but does not normally locate or repair it. Majority voting can sometimes correct errors by choosing the value appearing most often."},{"text":"Check digit validation.","correct":false,"explanation":"A check digit can reveal that an entered number is invalid but cannot determine the intended number. Majority voting can sometimes recover data from repeated copies."}]}]}],"examCountdown":{"examDate":"2027-06-07","paperLabel":"Paper 1"},"heading":"Information coding systems","title":"Information coding systems Flashcards","topbar":{"backHref":"/a-level/computer-science/aqa/flashcards"},"topicSidebar":"$L36"}]}],"topicId":"4b083ea6-05d6-5fcf-a45f-088c34534968","walled":"$L37"}],"$L38","$L39"]