answer string | choices dict | id string | kind string | lang string | question string | steps list | subject string | text string | topic string |
|---|---|---|---|---|---|---|---|---|---|
Stránky se načítají až při prvním přístupu. | null | cs_0451 | concept | cs | Co je stránkování na žádost? | [
"Start prázdný.",
"Fault načte.",
"Méně I/O."
] | computer_science | Answer: Líné načtení.
Steps:
1. Start prázdný.
2. Fault načte.
3. Méně I/O. | operating_systems |
An interface lists required methods without implementation. | null | cs_0452 | concept | en | What is an interface? | [
"Contract only.",
"Class fulfills.",
"Many can share."
] | computer_science | Answer: Required methods.
Steps:
1. Contract only.
2. Class fulfills.
3. Many can share. | oop |
In-place sorts use O(1) extra space by rearranging input. | null | cs_0453 | concept | en | What is in-place sorting? | [
"Swap inside.",
"Save memory.",
"Example: heap."
] | computer_science | Answer: No extra array.
Steps:
1. Swap inside.
2. Save memory.
3. Example: heap. | algorithms |
Iterations = 400. | null | cs_0454 | worked_example | en | Nested loops n=20 (case 4). Iterations? | [
"20x20.",
"=400.",
"400."
] | computer_science | Answer: 400.
Steps:
1. 20x20.
2. =400.
3. 400. | complexity |
Returns 8. | null | cs_0455 | worked_example | en | Enqueue 8,9 then dequeue (case 3). Returns? | [
"Front 8.",
"FIFO.",
"8."
] | computer_science | Answer: 8.
Steps:
1. Front 8.
2. FIFO.
3. 8. | data_structures |
2**6 je 64. | {
"A": "32",
"B": "128",
"C": "12",
"D": "64"
} | cs_0456 | multiple_choice | cs | Co vrátí 2**6? | [
"Mocnina dvou.",
"2**6=64.",
"Vyber možnost D."
] | computer_science | Answer: 64.
Steps:
1. Mocnina dvou.
2. 2**6=64.
3. Vyber možnost D.
Answer: (D) | python |
Join gives '5-6-7'. | null | cs_0457 | worked_example | en | What does [5,6,7].join('-') give? | [
"Join dash.",
"Parts.",
"'5-6-7'."
] | computer_science | Answer: '5-6-7'.
Steps:
1. Join dash.
2. Parts.
3. '5-6-7'. | javascript |
Sum is 45. | null | cs_0458 | worked_example | en | Sum 1..9 via SELECT. What value? | [
"n=9.",
"n(n+1)/2.",
"45."
] | computer_science | Answer: 45.
Steps:
1. n=9.
2. n(n+1)/2.
3. 45. | sql |
TCP opens SYN, SYN-ACK, ACK. | {
"A": "SYN, SYN-ACK, ACK",
"B": "SYN, ACK",
"C": "ACK, FIN",
"D": "SYN, FIN"
} | cs_0459 | multiple_choice | en | What is TCP open order (case 4)? | [
"Three steps.",
"In order.",
"Select option A."
] | computer_science | Answer: SYN, SYN-ACK, ACK.
Steps:
1. Three steps.
2. In order.
3. Select option A.
Answer: (A) | networking |
Max = 8. | null | cs_0460 | worked_example | en | Cross-join 2 and 4 rows (case 5). Max? | [
"2x4.",
"=8.",
"8."
] | computer_science | Answer: 8.
Steps:
1. 2x4.
2. =8.
3. 8. | databases |
Round-robin uses slices. | {
"A": "FIFO",
"B": "Round-robin",
"C": "LIFO",
"D": "Stack"
} | cs_0461 | multiple_choice | en | Which uses time slices (case 5)? | [
"Rotate tasks.",
"Fixed quantum.",
"Select option B."
] | computer_science | Answer: Round-robin.
Steps:
1. Rotate tasks.
2. Fixed quantum.
3. Select option B.
Answer: (B) | operating_systems |
B().x = 5. | null | cs_0462 | worked_example | en | Class A x=5, B(A) (case 3). B().x? | [
"A sets.",
"B inherits.",
"5."
] | computer_science | Answer: 5.
Steps:
1. A sets.
2. B inherits.
3. 5. | oop |
Bubble sort swaps adjacent. | {
"A": "Merge sort",
"B": "Binary search",
"C": "BFS",
"D": "Bubble sort"
} | cs_0463 | multiple_choice | en | Which swaps adjacent out-of-order (case 3)? | [
"Neighbor pairs.",
"Swap if wrong.",
"Select option D."
] | computer_science | Answer: Bubble sort.
Steps:
1. Neighbor pairs.
2. Swap if wrong.
3. Select option D.
Answer: (D) | algorithms |
Count = 2048. | null | cs_0464 | worked_example | en | Subsets of 11 items (case 5). Count? | [
"2^11.",
"=2048.",
"2048."
] | computer_science | Answer: 2048.
Steps:
1. 2^11.
2. =2048.
3. 2048. | complexity |
Open addressing probes other slots on collision. | null | cs_0465 | concept | en | What is open addressing? | [
"Hash spot.",
"Linear probe.",
"Fill gaps."
] | computer_science | Answer: Probe slots.
Steps:
1. Hash spot.
2. Linear probe.
3. Fill gaps. | data_structures |
'ab'*3 is 'ababab'. | null | cs_0466 | worked_example | en | What does 'ab'*3 give? | [
"Repeat.",
"3x.",
"'ababab'."
] | computer_science | Answer: 'ababab'.
Steps:
1. Repeat.
2. 3x.
3. 'ababab'. | python |
Math.ceil(3.2) je 4. | {
"A": "3",
"B": "5",
"C": "2",
"D": "4"
} | cs_0467 | multiple_choice | cs | Co vrátí Math.ceil(3.2)? | [
"Round up.",
"3.2 to 4.",
"Select option D."
] | computer_science | Answer: 4.
Steps:
1. Zaokrouhli nahoru.
2. 3,2 na 4.
3. Select option D.
Answer: (D) | javascript |
LIKE hledá text podle vzoru s % a _. | null | cs_0468 | concept | cs | Co je LIKE? | [
"% sekvence.",
"_ jeden znak.",
"Pozor case."
] | computer_science | Answer: Vzor textu.
Steps:
1. % sekvence.
2. _ jeden znak.
3. Pozor case. | sql |
Rate = 20. | null | cs_0469 | worked_example | en | RTT 50 ms (case 3). Serial req/s? | [
"1000 ms.",
"1000/50=20.",
"20."
] | computer_science | Answer: 20.
Steps:
1. 1000 ms.
2. 1000/50=20.
3. 20. | networking |
Replication copies data to replicas for safety and reads. | null | cs_0470 | concept | en | What is replication? | [
"Primary writes.",
"Replicas copy.",
"Failover ready."
] | computer_science | Answer: Copied data.
Steps:
1. Primary writes.
2. Replicas copy.
3. Failover ready. | databases |
Faults = 4. | null | cs_0471 | worked_example | en | 4 frames empty, refs 1..4 (case 1). Faults? | [
"All miss.",
"Count 4.",
"4."
] | computer_science | Answer: 4.
Steps:
1. All miss.
2. Count 4.
3. 4. | operating_systems |
super() calls parent. | {
"A": "Calls parent",
"B": "Creates child",
"C": "Deletes obj",
"D": "Copies list"
} | cs_0472 | multiple_choice | en | What does super() do (case 4)? | [
"Parent link.",
"Call method.",
"Select option A."
] | computer_science | Answer: Calls parent.
Steps:
1. Parent link.
2. Call method.
3. Select option A.
Answer: (A) | oop |
Moves = 31. | null | cs_0473 | worked_example | en | Hanoi 5 disks (case 3). Moves? | [
"2^5-1.",
"=31.",
"31."
] | computer_science | Answer: 31.
Steps:
1. 2^5-1.
2. =31.
3. 31. | algorithms |
Graph search costs O(V+E) visiting nodes and edges once. | null | cs_0474 | concept | en | What is Big-O of BFS and DFS? | [
"Each node.",
"Each edge.",
"Linear total."
] | computer_science | Answer: Nodes plus edges.
Steps:
1. Each node.
2. Each edge.
3. Linear total. | complexity |
Chaining stores colliding keys in per-slot lists. | null | cs_0475 | concept | en | What is chaining? | [
"Hash slot.",
"List chain.",
"Simple."
] | computer_science | Answer: Bucket lists.
Steps:
1. Hash slot.
2. List chain.
3. Simple. | data_structures |
Pickling serializes objects to bytes with pickle. | null | cs_0476 | concept | en | What is pickling? | [
"Dump to bytes.",
"Load back.",
"Keeps structure."
] | computer_science | Answer: Serialize objects.
Steps:
1. Dump to bytes.
2. Load back.
3. Keeps structure. | python |
A closure is a function remembering its outer scope variables. | null | cs_0477 | concept | en | What is a closure? | [
"Inner keeps outer.",
"Even after return.",
"State private."
] | computer_science | Answer: Remembered scope.
Steps:
1. Inner keeps outer.
2. Even after return.
3. State private. | javascript |
SELECT returns 90. | null | cs_0478 | worked_example | en | What does SELECT 9 * 10 return? | [
"Multiply.",
"9x10=90.",
"90."
] | computer_science | Answer: 90.
Steps:
1. Multiply.
2. 9x10=90.
3. 90. | sql |
DHCP přiděluje IP adresy automaticky. | null | cs_0479 | concept | cs | Co je DHCP? | [
"Objev.",
"Nabídka.",
"Obnova."
] | computer_science | Answer: Auto adresy.
Steps:
1. Objev.
2. Nabídka.
3. Obnova. | networking |
Count = 11. | null | cs_0480 | worked_example | en | INSERT 11 rows into empty (case 6). Count? | [
"Start 0.",
"Add 11.",
"11."
] | computer_science | Answer: 11.
Steps:
1. Start 0.
2. Add 11.
3. 11. | databases |
Výpadek je přístup na stránku mimo RAM. | null | cs_0481 | concept | cs | Co je výpadek stránky? | [
"Past kernelu.",
"Načti.",
"Pokračuj."
] | computer_science | Answer: Chybějící stránka.
Steps:
1. Past kernelu.
2. Načti.
3. Pokračuj. | operating_systems |
Balance = 170. | null | cs_0482 | worked_example | en | Balance 140, deposit(30) (case 4). Balance? | [
"Start 140.",
"Add 30.",
"170."
] | computer_science | Answer: 170.
Steps:
1. Start 140.
2. Add 30.
3. 170. | oop |
12 comparisons, not found. | null | cs_0483 | worked_example | en | Linear search 17 in 1..12 (case 4). Comparisons? | [
"Check 12.",
"None match.",
"12."
] | computer_science | Answer: 12.
Steps:
1. Check 12.
2. None match.
3. 12. | algorithms |
Ptá se zda rychlé ověření znamená rychlé řešení. | null | cs_0484 | concept | cs | Co je P vs NP? | [
"P řeší.",
"NP ověřuje.",
"Otevřené."
] | computer_science | Answer: Ověř vs řeš.
Steps:
1. P řeší.
2. NP ověřuje.
3. Otevřené. | complexity |
Red-black trees balance with color rules for O(log n). | null | cs_0485 | concept | en | What is a red-black tree? | [
"Red black.",
"Rotate fix.",
"Always log."
] | computer_science | Answer: Color balanced.
Steps:
1. Red black.
2. Rotate fix.
3. Always log. | data_structures |
d['a'] is 5. | null | cs_0486 | worked_example | en | If d={'a':5}, what is d['a']? | [
"Key a.",
"Value 5.",
"Result 5."
] | computer_science | Answer: 5.
Steps:
1. Key a.
2. Value 5.
3. Result 5. | python |
Result is 'hi6'. | null | cs_0487 | worked_example | en | What does 'Hi6'.toLowerCase() give? | [
"Lowercase.",
"'hi6'.",
"Result."
] | computer_science | Answer: 'hi6'.
Steps:
1. Lowercase.
2. 'hi6'.
3. Result. | javascript |
SELECT returns 17. | null | cs_0488 | worked_example | en | What does SELECT 34 / 2 return? | [
"Divide.",
"34/2=17.",
"17."
] | computer_science | Answer: 17.
Steps:
1. Divide.
2. 34/2=17.
3. 17. | sql |
DNS uses port 53. | {
"A": "22",
"B": "53",
"C": "21",
"D": "25"
} | cs_0489 | multiple_choice | en | Which port does DNS use? (set 5) | [
"Standard port.",
"DNS=53.",
"Select option B."
] | computer_science | Answer: 53.
Steps:
1. Standard port.
2. DNS=53.
3. Select option B.
Answer: (B) | networking |
A is Atomicity. | {
"A": "Consistency",
"B": "Isolation",
"C": "Durability",
"D": "Atomicity"
} | cs_0490 | multiple_choice | en | What is A in ACID (case 3)? | [
"ACID set.",
"A first.",
"Select option D."
] | computer_science | Answer: Atomicity.
Steps:
1. ACID set.
2. A first.
3. Select option D.
Answer: (D) | databases |
Roura spojuje výstup a vstup procesů. | null | cs_0491 | concept | cs | Co je roura (pipe)? | [
"Zápis.",
"Čtení.",
"Buffer."
] | computer_science | Answer: Spojený tok.
Steps:
1. Zápis.
2. Čtení.
3. Buffer. | operating_systems |
Overriding redefines a parent method in a child class. | null | cs_0492 | concept | en | What is method overriding? | [
"Same name.",
"Child wins.",
"Extends or replaces."
] | computer_science | Answer: Redefine method.
Steps:
1. Same name.
2. Child wins.
3. Extends or replaces. | oop |
5-disk needs 31 moves. | {
"A": "31",
"B": "15",
"C": "63",
"D": "25"
} | cs_0493 | multiple_choice | cs | Kolik tahů pro Hanoi s 5 disky? | [
"2^5-1.",
"32-1=31.",
"Select option A."
] | computer_science | Answer: 31.
Steps:
1. 2^5-1.
2. 32-1=31.
3. Select option A.
Answer: (A) | algorithms |
Steps = 6. | {
"A": "5",
"B": "7",
"C": "6",
"D": "64"
} | cs_0494 | multiple_choice | cs | Binární kroky pro n = 64? | [
"log2=6.",
"Halve.",
"Select option C."
] | computer_science | Answer: 6.
Steps:
1. log2=6.
2. Halve.
3. Select option C.
Answer: (C) | complexity |
Order 24,14. | null | cs_0495 | worked_example | en | Push 14,24 then pop twice (case 4). Order? | [
"Top 24.",
"Then 14.",
"24,14."
] | computer_science | Answer: 24,14.
Steps:
1. Top 24.
2. Then 14.
3. 24,14. | data_structures |
sum(range(5)) is 10. | null | cs_0496 | worked_example | en | What does sum(range(5)) return? | [
"0 to 4.",
"Sum=10.",
"Result 10."
] | computer_science | Answer: 10.
Steps:
1. 0 to 4.
2. Sum=10.
3. Result 10. | python |
Repeat gives 'ababab'. | null | cs_0497 | worked_example | en | What does 'ab'.repeat(3) give? | [
"Repeat.",
"3x.",
"'ababab'."
] | computer_science | Answer: 'ababab'.
Steps:
1. Repeat.
2. 3x.
3. 'ababab'. | javascript |
Result is 0. | null | cs_0498 | worked_example | en | Compute SELECT 18 % 3. | [
"Modulo.",
"18%3=0.",
"0."
] | computer_science | Answer: 0.
Steps:
1. Modulo.
2. 18%3=0.
3. 0. | sql |
NAT maps private addresses to one public address. | null | cs_0499 | concept | en | What is NAT? | [
"Many private.",
"One public.",
"Tracks ports."
] | computer_science | Answer: Address mapping.
Steps:
1. Many private.
2. One public.
3. Tracks ports. | networking |
PRIMARY KEY ensures unique rows. | {
"A": "PRIMARY KEY",
"B": "FOREIGN KEY",
"C": "INDEX",
"D": "VIEW"
} | cs_0500 | multiple_choice | en | Which ensures unique rows (case 4)? | [
"Unique id.",
"One per table.",
"Select option A."
] | computer_science | Answer: PRIMARY KEY.
Steps:
1. Unique id.
2. One per table.
3. Select option A.
Answer: (A) | databases |
Cycle = 60 ms. | null | cs_0501 | worked_example | en | Quantum 15 ms, 4 procs (case 2). Cycle? | [
"15x4.",
"=60.",
"60 ms."
] | computer_science | Answer: 60.
Steps:
1. 15x4.
2. =60.
3. 60 ms. | operating_systems |
Kompozice skládá objekt z částí. | null | cs_0502 | concept | cs | Co je kompozice? | [
"Má části.",
"Volnější.",
"Oproti dědění."
] | computer_science | Answer: Skládání.
Steps:
1. Má části.
2. Volnější.
3. Oproti dědění. | oop |
DP řeší podproblémy jednou a znovu je používá. | null | cs_0503 | concept | cs | Co je dynamické programování? | [
"Tabulka.",
"Zdola nahoru.",
"Optimální části."
] | computer_science | Answer: Znovu pododpovědi.
Steps:
1. Tabulka.
2. Zdola nahoru.
3. Optimální části. | algorithms |
About 11. | null | cs_0504 | worked_example | en | Binary steps n=2000 (case 6). About? | [
"log2.",
"~11.",
"11."
] | computer_science | Answer: 11.
Steps:
1. log2.
2. ~11.
3. 11. | complexity |
Both directions. | {
"A": "Forward only",
"B": "Random only",
"C": "Both directions",
"D": "No traversal"
} | cs_0505 | multiple_choice | cs | Jak chodí obousměrný seznam (případ 2)? | [
"Two links.",
"Both ways.",
"Select option C."
] | computer_science | Answer: Both directions.
Steps:
1. Two links.
2. Both ways.
3. Select option C.
Answer: (C) | data_structures |
max is 10. | null | cs_0506 | worked_example | en | What does max([7,10,8]) return? | [
"Compare three.",
"Largest 10.",
"Result 10."
] | computer_science | Answer: 10.
Steps:
1. Compare three.
2. Largest 10.
3. Result 10. | python |
Boolean([]) is true. | {
"A": "true",
"B": "false",
"C": "0",
"D": "1"
} | cs_0507 | multiple_choice | en | What does Boolean([]) give? | [
"Check falsy.",
"Result true.",
"Select option A."
] | computer_science | Answer: true.
Steps:
1. Check falsy.
2. Result true.
3. Select option A.
Answer: (A) | javascript |
LENGTH is 6. | null | cs_0508 | worked_example | en | Compute SELECT LENGTH('hello9'). | [
"Count chars.",
"'hello9'.",
"6."
] | computer_science | Answer: 6.
Steps:
1. Count chars.
2. 'hello9'.
3. 6. | sql |
10.6.0.1 je privátní. | {
"A": "8.8.6.1",
"B": "1.1.6.1",
"C": "10.6.0.1",
"D": "203.0.6.1"
} | cs_0509 | multiple_choice | cs | Která IP je privátní (sada 6)? | [
"Private ranges.",
"10.6.0.1 fits.",
"Select option C."
] | computer_science | Answer: 10.6.0.1.
Steps:
1. Privátní rozsahy.
2. 10.6.0.1 vyhovuje.
3. Select option C.
Answer: (C) | networking |
Returned = 3. | null | cs_0510 | worked_example | en | 17 rows, WHERE matches 3 (case 7). Returned? | [
"Total 17.",
"Match 3.",
"3."
] | computer_science | Answer: 3.
Steps:
1. Total 17.
2. Match 3.
3. 3. | databases |
Mutex ensures one. | {
"A": "Queue",
"B": "Array",
"C": "Mutex",
"D": "File"
} | cs_0511 | multiple_choice | en | What ensures one access (case 6)? | [
"Lock it.",
"One holder.",
"Select option C."
] | computer_science | Answer: Mutex.
Steps:
1. Lock it.
2. One holder.
3. Select option C.
Answer: (C) | operating_systems |
Area = 32. | null | cs_0512 | worked_example | en | Rectangle 8 by 4 (case 5). Area? | [
"8x4.",
"=32.",
"32."
] | computer_science | Answer: 32.
Steps:
1. 8x4.
2. =32.
3. 32. | oop |
factorial(10) is 3628800. | {
"A": "362880",
"B": "3628800",
"C": "3628900",
"D": "100"
} | cs_0513 | multiple_choice | en | What is factorial(10)? | [
"Multiply down.",
"Result 3628800.",
"Select option B."
] | computer_science | Answer: 3628800.
Steps:
1. Multiply down.
2. Result 3628800.
3. Select option B.
Answer: (B) | algorithms |
O(2^n) fastest. | {
"A": "O(n)",
"B": "O(n log n)",
"C": "O(n^2)",
"D": "O(2^n)"
} | cs_0514 | multiple_choice | en | Which grows fastest (case 3)? | [
"Exponential.",
"Beats poly.",
"Select option D."
] | computer_science | Answer: O(2^n).
Steps:
1. Exponential.
2. Beats poly.
3. Select option D.
Answer: (D) | complexity |
Heap backs it. | {
"A": "Stack",
"B": "Queue",
"C": "Array",
"D": "Heap"
} | cs_0515 | multiple_choice | en | What backs priority queue (case 3)? | [
"Need min.",
"Heap gives.",
"Select option D."
] | computer_science | Answer: Heap.
Steps:
1. Need min.
2. Heap gives.
3. Select option D.
Answer: (D) | data_structures |
Výjimka signalizuje chybu a řeší se try/except. | null | cs_0516 | concept | cs | Co je výjimka? | [
"Vznikne chyba.",
"Zachytí except.",
"Finally uklidí."
] | computer_science | Answer: Signál chyby.
Steps:
1. Vznikne chyba.
2. Zachytí except.
3. Finally uklidí. | python |
Destructuring unpacks arrays or objects into variables. | null | cs_0517 | concept | en | What is destructuring? | [
"const [a]=arr.",
"const {x}=obj.",
"Short code."
] | computer_science | Answer: Unpack values.
Steps:
1. const [a]=arr.
2. const {x}=obj.
3. Short code. | javascript |
Agregace spojí řádky v jednu hodnotu. | null | cs_0518 | concept | cs | Co je agregace? | [
"COUNT SUM AVG.",
"Mnoho na jednu.",
"S GROUP."
] | computer_science | Answer: Spojení řádků.
Steps:
1. COUNT SUM AVG.
2. Mnoho na jednu.
3. S GROUP. | sql |
Mask is 255.255.192.0. | null | cs_0519 | worked_example | en | What is mask for /18 (case 4)? | [
"Prefix 18.",
"Bits.",
"255.255.192.0."
] | computer_science | Answer: 255.255.192.0.
Steps:
1. Prefix 18.
2. Bits.
3. 255.255.192.0. | networking |
Optimistic locking checks versions at commit instead of locking. | null | cs_0520 | concept | en | What is optimistic locking? | [
"Read version.",
"Write if same.",
"Retry else."
] | computer_science | Answer: Version check.
Steps:
1. Read version.
2. Write if same.
3. Retry else. | databases |
A page fault occurs when accessed page is not in RAM. | null | cs_0521 | concept | en | What is a page fault? | [
"Trap kernel.",
"Load page.",
"Resume."
] | computer_science | Answer: Missing page.
Steps:
1. Trap kernel.
2. Load page.
3. Resume. | operating_systems |
Value = 12. | null | cs_0522 | worked_example | en | Counter 11, inc() (case 6). Value? | [
"Start 11.",
"Plus 1.",
"12."
] | computer_science | Answer: 12.
Steps:
1. Start 11.
2. Plus 1.
3. 12. | oop |
A heuristic is a practical rule trading optimality for speed. | null | cs_0523 | concept | en | What is a heuristic? | [
"Good enough.",
"No guarantee.",
"Guides search."
] | computer_science | Answer: Fast rule.
Steps:
1. Good enough.
2. No guarantee.
3. Guides search. | algorithms |
Heap insert and pop cost O(log n) by tree height. | null | cs_0524 | concept | en | What is Big-O of heap operations? | [
"Bubble path.",
"Height log.",
"Root fast."
] | computer_science | Answer: Log height.
Steps:
1. Bubble path.
2. Height log.
3. Root fast. | complexity |
Load = 0.64. | {
"A": "0.64",
"B": "0.74",
"C": "0.54",
"D": "0.89"
} | cs_0525 | multiple_choice | en | Load factor for 9 items in 14 slots? | [
"9/14.",
"=0.64.",
"Select option A."
] | computer_science | Answer: 0.64.
Steps:
1. 9/14.
2. =0.64.
3. Select option A.
Answer: (A) | data_structures |
114%5 is 4. | {
"A": "4",
"B": "0",
"C": "1",
"D": "5"
} | cs_0526 | multiple_choice | en | What does 114 % 5 give in Python? | [
"Remainder.",
"114%5=4.",
"Select option A."
] | computer_science | Answer: 4.
Steps:
1. Remainder.
2. 114%5=4.
3. Select option A.
Answer: (A) | python |
Math.max is 7. | {
"A": "5",
"B": "7",
"C": "6",
"D": "8"
} | cs_0527 | multiple_choice | en | What does Math.max(5,6,7) give? | [
"Compare three.",
"Largest 7.",
"Select option B."
] | computer_science | Answer: 7.
Steps:
1. Compare three.
2. Largest 7.
3. Select option B.
Answer: (B) | javascript |
MIN is 15. | null | cs_0528 | worked_example | en | Compute SELECT MIN of (15,18). | [
"Compare.",
"Smallest 15.",
"15."
] | computer_science | Answer: 15.
Steps:
1. Compare.
2. Smallest 15.
3. 15. | sql |
UDP je bez spojení. | {
"A": "TCP",
"B": "HTTP",
"C": "IP",
"D": "UDP"
} | cs_0529 | multiple_choice | cs | Co je bez spojení (případ 7)? | [
"No handshake.",
"UDP fits.",
"Select option D."
] | computer_science | Answer: UDP.
Steps:
1. Žádný handshake.
2. UDP vyhovuje.
3. Select option D.
Answer: (D) | networking |
B-tree indexes keep sorted keys for fast range search. | null | cs_0530 | concept | en | What is a B-tree index? | [
"Balanced tree.",
"Log search.",
"Range easy."
] | computer_science | Answer: Sorted index.
Steps:
1. Balanced tree.
2. Log search.
3. Range easy. | databases |
Virtual = 12 GB. | null | cs_0531 | worked_example | en | RAM 7 GB + swap 5 GB (case 3). Virtual? | [
"7+5.",
"=12.",
"12 GB."
] | computer_science | Answer: 12.
Steps:
1. 7+5.
2. =12.
3. 12 GB. | operating_systems |
__init__ constructs. | {
"A": "__len__",
"B": "__init__",
"C": "__add__",
"D": "__str__"
} | cs_0532 | multiple_choice | en | Which is constructor (case 5)? | [
"Init runs.",
"Sets fields.",
"Select option B."
] | computer_science | Answer: __init__.
Steps:
1. Init runs.
2. Sets fields.
3. Select option B.
Answer: (B) | oop |
Sorted = [6, 7, 8]. | null | cs_0533 | worked_example | en | Selection-sort [8, 6, 7] (case 5). Result? | [
"Min 6.",
"Swap.",
"[6, 7, 8]."
] | computer_science | Answer: [6, 7, 8].
Steps:
1. Min 6.
2. Swap.
3. [6, 7, 8]. | algorithms |
400 vs 160000. | null | cs_0534 | worked_example | en | O(n) vs O(n^2) n=400 (case 7). Steps? | [
"O(n)=400.",
"O(n^2)=160000.",
"Done."
] | computer_science | Answer: 400 vs 160000.
Steps:
1. O(n)=400.
2. O(n^2)=160000.
3. Done. | complexity |
Trie ukládá řetězce podle prefixů. | null | cs_0535 | concept | cs | Co je trie? | [
"Znakové uzly.",
"Sdílí začátek.",
"Konec slova."
] | computer_science | Answer: Prefixový strom.
Steps:
1. Znakové uzly.
2. Sdílí začátek.
3. Konec slova. | data_structures |
A metaclass is the class of a class controlling creation. | null | cs_0536 | concept | en | What is a metaclass? | [
"Type default.",
"Custom creation.",
"Rare use."
] | computer_science | Answer: Class of class.
Steps:
1. Type default.
2. Custom creation.
3. Rare use. | python |
Spread ... expands iterables into elements or args. | null | cs_0537 | concept | en | What is spread syntax? | [
"[...a,1].",
"Call f(...a).",
"Copy arrays."
] | computer_science | Answer: Expand items.
Steps:
1. [...a,1].
2. Call f(...a).
3. Copy arrays. | javascript |
SELECT 9+11 returns 20. | {
"A": "20",
"B": "19",
"C": "21",
"D": "22"
} | cs_0538 | multiple_choice | cs | Kterou hodnotu vrátí SELECT 9 + 11? | [
"Add.",
"9+11=20.",
"Select option A."
] | computer_science | Answer: 20.
Steps:
1. Add.
2. 9+11=20.
3. Select option A.
Answer: (A) | sql |
DHCP assigns IP addresses automatically to hosts. | null | cs_0539 | concept | en | What is DHCP? | [
"Discover.",
"Offer address.",
"Lease renews."
] | computer_science | Answer: Auto addresses.
Steps:
1. Discover.
2. Offer address.
3. Lease renews. | networking |
Eventual consistency promises replicas converge over time. | null | cs_0540 | concept | en | What is eventual consistency? | [
"Write anywhere.",
"Sync async.",
"Brief stale."
] | computer_science | Answer: Converge later.
Steps:
1. Write anywhere.
2. Sync async.
3. Brief stale. | databases |
CPUs = 12. | null | cs_0541 | worked_example | en | 6 cores, 2 threads each (case 4). Logical CPUs? | [
"6x2.",
"=12.",
"12."
] | computer_science | Answer: 12.
Steps:
1. 6x2.
2. =12.
3. 12. | operating_systems |
B().x = 9. | null | cs_0542 | worked_example | en | Class A x=9, B(A) (case 7). B().x? | [
"A sets.",
"B inherits.",
"9."
] | computer_science | Answer: 9.
Steps:
1. A sets.
2. B inherits.
3. 9. | oop |
factorial(6) = 720. | null | cs_0543 | worked_example | en | Compute factorial(6) (case 6). | [
"Expand.",
"Product.",
"720."
] | computer_science | Answer: 720.
Steps:
1. Expand.
2. Product.
3. 720. | algorithms |
5 items give 32 subsets. | {
"A": "32",
"B": "25",
"C": "16",
"D": "64"
} | cs_0544 | multiple_choice | en | How many subsets for 5 items? | [
"2^5.",
"=32.",
"Select option A."
] | computer_science | Answer: 32.
Steps:
1. 2^5.
2. =32.
3. Select option A.
Answer: (A) | complexity |
Load = 0.9. | null | cs_0545 | worked_example | en | 18 items in 20 slots (case 5). Load? | [
"18/20.",
"=0.9.",
"0.9."
] | computer_science | Answer: 0.9.
Steps:
1. 18/20.
2. =0.9.
3. 0.9. | data_structures |
x becomes [1, 2, 18]. | null | cs_0546 | worked_example | en | x=[1,2]; x.append(18). What is x? | [
"Start [1,2].",
"Append 18.",
"x=[1, 2, 18]."
] | computer_science | Answer: [1, 2, 18].
Steps:
1. Start [1,2].
2. Append 18.
3. x=[1, 2, 18]. | python |
Async/await writes promises as sequential code with pauses. | null | cs_0547 | concept | en | What is async/await? | [
"Async returns promise.",
"Await pauses.",
"Try/catch works."
] | computer_science | Answer: Sequential async.
Steps:
1. Async returns promise.
2. Await pauses.
3. Try/catch works. | javascript |
Sum is 120. | null | cs_0548 | worked_example | en | Sum 1..15 via SELECT. What value? | [
"n=15.",
"n(n+1)/2.",
"120."
] | computer_science | Answer: 120.
Steps:
1. n=15.
2. n(n+1)/2.
3. 120. | sql |
/13 has 524286 usable. | null | cs_0549 | worked_example | en | How many usable hosts in /13 (case 5)? | [
"Host bits 19.",
"2^19=524288.",
"Usable 524286."
] | computer_science | Answer: 524286.
Steps:
1. Host bits 19.
2. 2^19=524288.
3. Usable 524286. | networking |
Remain = 14. | null | cs_0550 | worked_example | en | Table has 18 rows, DELETE removes 4 (case 8). Remain? | [
"Start 18.",
"Minus 4.",
"14."
] | computer_science | Answer: 14.
Steps:
1. Start 18.
2. Minus 4.
3. 14. | databases |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.