answer string | choices dict | id string | kind string | lang string | question string | steps list | subject string | text string | topic string |
|---|---|---|---|---|---|---|---|---|---|
Faults = 5. | null | cs_0551 | worked_example | en | 5 frames empty, refs 1..5 (case 5). Faults? | [
"All miss.",
"Count 5.",
"5."
] | computer_science | Answer: 5.
Steps:
1. All miss.
2. Count 5.
3. 5. | operating_systems |
Balance = 230. | null | cs_0552 | worked_example | en | Balance 180, deposit(50) (case 8). Balance? | [
"Start 180.",
"Add 50.",
"230."
] | computer_science | Answer: 230.
Steps:
1. Start 180.
2. Add 50.
3. 230. | oop |
Backtracking zkouší a vrací neúspěšné cesty. | null | cs_0553 | concept | cs | Co je backtracking? | [
"Krok.",
"Rekurze.",
"Zpět při failu."
] | computer_science | Answer: Zkus a vrať.
Steps:
1. Krok.
2. Rekurze.
3. Zpět při failu. | algorithms |
Iterations = 343. | {
"A": "49",
"B": "343",
"C": "98",
"D": "56"
} | cs_0554 | multiple_choice | cs | Trojnásobné smyčky n = 7. Kolik iterací? | [
"7^3.",
"=343.",
"Select option B."
] | computer_science | Answer: 343.
Steps:
1. 7^3.
2. =343.
3. Select option B.
Answer: (B) | complexity |
Edges = 28. | null | cs_0555 | worked_example | en | Edges in K8 (case 6). Count? | [
"n(n-1)/2.",
"=28.",
"28."
] | computer_science | Answer: 28.
Steps:
1. n(n-1)/2.
2. =28.
3. 28. | data_structures |
Monkey patching changes code at runtime by rebinding names. | null | cs_0556 | concept | en | What is monkey patching? | [
"Rebind attr.",
"Affects later calls.",
"Use sparingly."
] | computer_science | Answer: Runtime change.
Steps:
1. Rebind attr.
2. Affects later calls.
3. Use sparingly. | python |
NaN means not-a-number from invalid numeric results. | null | cs_0557 | concept | en | What is NaN? | [
"0/0 gives.",
"NaN != NaN.",
"Check isNaN."
] | computer_science | Answer: Invalid number.
Steps:
1. 0/0 gives.
2. NaN != NaN.
3. Check isNaN. | javascript |
A subquery is a SELECT nested inside another query. | null | cs_0558 | concept | en | What is a subquery? | [
"Inner runs.",
"Outer uses.",
"In WHERE or FROM."
] | computer_science | Answer: Nested SELECT.
Steps:
1. Inner runs.
2. Outer uses.
3. In WHERE or FROM. | sql |
ARP maps IP to MAC. | {
"A": "IP to MAC",
"B": "IP to port",
"C": "MAC to IP",
"D": "Port to MAC"
} | cs_0559 | multiple_choice | en | What does ARP map (case 8)? | [
"LAN lookup.",
"IP to MAC.",
"Select option A."
] | computer_science | Answer: IP to MAC.
Steps:
1. LAN lookup.
2. IP to MAC.
3. Select option A.
Answer: (A) | networking |
INSERT adds rows. | {
"A": "SELECT",
"B": "INSERT",
"C": "DELETE",
"D": "UPDATE"
} | cs_0560 | multiple_choice | cs | Co přidává řádky (případ 5)? | [
"Write op.",
"INSERT fits.",
"Select option B."
] | computer_science | Answer: INSERT.
Steps:
1. Write op.
2. INSERT fits.
3. Select option B.
Answer: (B) | databases |
Kernel manages. | {
"A": "Shell",
"B": "App",
"C": "Driver",
"D": "Kernel"
} | cs_0561 | multiple_choice | en | What manages resources (case 7)? | [
"Core role.",
"CPU mem.",
"Select option D."
] | computer_science | Answer: Kernel.
Steps:
1. Core role.
2. CPU mem.
3. Select option D.
Answer: (D) | operating_systems |
Area = 48. | null | cs_0562 | worked_example | en | Rectangle 6 by 8 (case 9). Area? | [
"6x8.",
"=48.",
"48."
] | computer_science | Answer: 48.
Steps:
1. 6x8.
2. =48.
3. 48. | oop |
Moves = 31. | null | cs_0563 | worked_example | en | Hanoi 5 disks (case 7). Moves? | [
"2^5-1.",
"=31.",
"31."
] | computer_science | Answer: 31.
Steps:
1. 2^5-1.
2. =31.
3. 31. | algorithms |
Steps = 10. | {
"A": "9",
"B": "11",
"C": "10",
"D": "1024"
} | cs_0564 | multiple_choice | en | Binary steps for n = 1024? | [
"log2=10.",
"Halve.",
"Select option C."
] | computer_science | Answer: 10.
Steps:
1. log2=10.
2. Halve.
3. Select option C.
Answer: (C) | complexity |
Returns 12. | null | cs_0565 | worked_example | en | Enqueue 12,13 then dequeue (case 7). Returns? | [
"Front 12.",
"FIFO.",
"12."
] | computer_science | Answer: 12.
Steps:
1. Front 12.
2. FIFO.
3. 12. | data_structures |
sorted([7, 5, 10]) is [5, 7, 10]. | {
"A": "[10, 7, 5]",
"B": "[5, 7, 10]",
"C": "[7, 5, 10]",
"D": "[5, 10, 7]"
} | cs_0566 | multiple_choice | en | What does sorted([7, 5, 10]) give? | [
"Sort ascending.",
"Result [5, 7, 10].",
"Select option B."
] | computer_science | Answer: [5, 7, 10].
Steps:
1. Sort ascending.
2. Result [5, 7, 10].
3. Select option B.
Answer: (B) | python |
[6,7].length je 2. | {
"A": "1",
"B": "3",
"C": "2",
"D": "0"
} | cs_0567 | multiple_choice | cs | Co vrátí [6,7].length? | [
"Two items.",
"Length 2.",
"Select option C."
] | computer_science | Answer: 2.
Steps:
1. Dva prvky.
2. Délka je 2.
3. Select option C.
Answer: (C) | javascript |
SELECT returns 240. | null | cs_0568 | worked_example | en | What does SELECT 15 * 16 return? | [
"Multiply.",
"15x16=240.",
"240."
] | computer_science | Answer: 240.
Steps:
1. Multiply.
2. 15x16=240.
3. 240. | sql |
Subnets = 4. | null | cs_0569 | worked_example | en | Split /20 into /22 (case 6). How many subnets? | [
"Bits 2.",
"2^2=4.",
"4."
] | computer_science | Answer: 4.
Steps:
1. Bits 2.
2. 2^2=4.
3. 4. | networking |
Index speeds reads. | {
"A": "Deletes data",
"B": "Drops table",
"C": "Speeds reads",
"D": "Stops DB"
} | cs_0570 | multiple_choice | en | What is an index for (case 6)? | [
"Lookup aid.",
"Faster.",
"Select option C."
] | computer_science | Answer: Speeds reads.
Steps:
1. Lookup aid.
2. Faster.
3. Select option C.
Answer: (C) | databases |
Demand paging loads pages only when first accessed. | null | cs_0571 | concept | en | What is demand paging? | [
"Start empty.",
"Fault loads.",
"Less I/O."
] | computer_science | Answer: Lazy load.
Steps:
1. Start empty.
2. Fault loads.
3. Less I/O. | operating_systems |
Abstraktní třída nelze vytvořit a žádá metody. | null | cs_0572 | concept | cs | Co je abstraktní třída? | [
"Nelze make.",
"Potomek doplní.",
"Vynucuje API."
] | computer_science | Answer: Nedokončená.
Steps:
1. Nelze make.
2. Potomek doplní.
3. Vynucuje API. | oop |
A* picks paths by cost plus estimated remaining distance. | null | cs_0573 | concept | en | What is A* search? | [
"g cost so far.",
"h estimate.",
"Best first."
] | computer_science | Answer: Cost plus guess.
Steps:
1. g cost so far.
2. h estimate.
3. Best first. | algorithms |
O(2^n) fastest. | {
"A": "O(n)",
"B": "O(n log n)",
"C": "O(n^2)",
"D": "O(2^n)"
} | cs_0574 | multiple_choice | cs | Co roste nejrychleji (případ 7)? | [
"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 |
K8 has 28 edges. | {
"A": "27",
"B": "28",
"C": "29",
"D": "64"
} | cs_0575 | multiple_choice | en | How many edges in K8? | [
"n(n-1)/2.",
"=28.",
"Select option B."
] | computer_science | Answer: 28.
Steps:
1. n(n-1)/2.
2. =28.
3. Select option B.
Answer: (B) | data_structures |
len([6, 7, 8, 9]) is 4. | {
"A": "3",
"B": "5",
"C": "4",
"D": "6"
} | cs_0576 | multiple_choice | en | What does len([6, 7, 8, 9]) give? | [
"Count items.",
"List has {c}.",
"Select option C."
] | computer_science | Answer: 4.
Steps:
1. Count items.
2. List has {c}.
3. Select option C.
Answer: (C) | python |
'x' + 10 je 'x10'. | {
"A": "'10x'",
"B": "'11'",
"C": "10",
"D": "'x10'"
} | cs_0577 | multiple_choice | cs | Co vrátí 'x' + 10? | [
"String concat.",
"Result 'x10'.",
"Select option D."
] | computer_science | Answer: 'x10'.
Steps:
1. Spojení řetězců.
2. Výsledek je 'x10'.
3. Select option D.
Answer: (D) | javascript |
SELECT returns 19. | {
"A": "18",
"B": "19",
"C": "20",
"D": "21"
} | cs_0578 | multiple_choice | en | Which value does SELECT 25 - 6 return? | [
"Subtract.",
"25-6=19.",
"Select option B."
] | computer_science | Answer: 19.
Steps:
1. Subtract.
2. 25-6=19.
3. Select option B.
Answer: (B) | sql |
Time = 6 s. | null | cs_0579 | worked_example | en | Download 120 MB at 20 MB/s (case 7). Seconds? | [
"Size 120.",
"Rate 20.",
"6 s."
] | computer_science | Answer: 6.
Steps:
1. Size 120.
2. Rate 20.
3. 6 s. | networking |
CAP says pick two of consistency, availability, partition tolerance. | null | cs_0580 | concept | en | What is CAP theorem? | [
"Network splits.",
"Choose side.",
"Tradeoff."
] | computer_science | Answer: Pick two.
Steps:
1. Network splits.
2. Choose side.
3. Tradeoff. | databases |
Cycle = 60 ms. | null | cs_0581 | worked_example | en | Quantum 15 ms, 4 procs (case 6). Cycle? | [
"15x4.",
"=60.",
"60 ms."
] | computer_science | Answer: 60.
Steps:
1. 15x4.
2. =60.
3. 60 ms. | operating_systems |
Encapsulation bundles. | {
"A": "Loop",
"B": "Sort",
"C": "Encapsulation",
"D": "Search"
} | cs_0582 | multiple_choice | cs | Co spojuje data a metody (případ 6)? | [
"Hide inside.",
"One unit.",
"Select option C."
] | computer_science | Answer: Encapsulation.
Steps:
1. Hide inside.
2. One unit.
3. Select option C.
Answer: (C) | oop |
Steps = 5. | {
"A": "4",
"B": "6",
"C": "5",
"D": "32"
} | cs_0583 | multiple_choice | en | Binary search steps for n = 32? | [
"log2(32)=5.",
"Halve 5x.",
"Select option C."
] | computer_science | Answer: 5.
Steps:
1. log2(32)=5.
2. Halve 5x.
3. Select option C.
Answer: (C) | algorithms |
Hash worst case degrades to O(n) with many collisions. | null | cs_0584 | concept | en | What is Big-O of hash worst case? | [
"All one slot.",
"Scan list.",
"Rare good hash."
] | computer_science | Answer: Collision pile.
Steps:
1. All one slot.
2. Scan list.
3. Rare good hash. | complexity |
Order 28,18. | null | cs_0585 | worked_example | en | Push 18,28 then pop twice (case 8). Order? | [
"Top 28.",
"Then 18.",
"28,18."
] | computer_science | Answer: 28,18.
Steps:
1. Top 28.
2. Then 18.
3. 28,18. | data_structures |
The walrus := assigns and returns a value in one step. | null | cs_0586 | concept | en | What is the walrus operator? | [
"Syntax :=.",
"Use in if.",
"Saves line."
] | computer_science | Answer: Assign and return.
Steps:
1. Syntax :=.
2. Use in if.
3. Saves line. | python |
Undefined means missing while null means intentional empty. | null | cs_0587 | concept | en | What is undefined versus null? | [
"No value yet.",
"Null assigned.",
"Both falsy."
] | computer_science | Answer: Missing versus empty.
Steps:
1. No value yet.
2. Null assigned.
3. Both falsy. | javascript |
SELECT returns 81. | {
"A": "80",
"B": "82",
"C": "81",
"D": "18"
} | cs_0588 | multiple_choice | cs | Kterou hodnotu vrátí SELECT 9 * 9? | [
"Multiply.",
"9x9=81.",
"Select option C."
] | computer_science | Answer: 81.
Steps:
1. Multiply.
2. 9x9=81.
3. Select option C.
Answer: (C) | sql |
Rate = 20. | null | cs_0589 | worked_example | en | RTT 50 ms (case 8). Serial req/s? | [
"1000 ms.",
"1000/50=20.",
"20."
] | computer_science | Answer: 20.
Steps:
1. 1000 ms.
2. 1000/50=20.
3. 20. | networking |
A znamená atomicitu. | {
"A": "Consistency",
"B": "Isolation",
"C": "Durability",
"D": "Atomicity"
} | cs_0590 | multiple_choice | cs | Co je A v ACID (případ 7)? | [
"ACID set.",
"A first.",
"Select option D."
] | computer_science | Answer: Atomicity.
Steps:
1. Sada ACID.
2. A je první.
3. Select option D.
Answer: (D) | databases |
Virtual = 16 GB. | null | cs_0591 | worked_example | en | RAM 11 GB + swap 5 GB (case 7). Virtual? | [
"11+5.",
"=16.",
"16 GB."
] | computer_science | Answer: 16.
Steps:
1. 11+5.
2. =16.
3. 16 GB. | operating_systems |
Subtypes must work wherever their parent type works. | null | cs_0592 | concept | en | What is the Liskov principle? | [
"Same contract.",
"No surprises.",
"Behavior keeps."
] | computer_science | Answer: Safe substitute.
Steps:
1. Same contract.
2. No surprises.
3. Behavior keeps. | oop |
16 comparisons, not found. | null | cs_0593 | worked_example | en | Linear search 21 in 1..16 (case 8). Comparisons? | [
"Check 16.",
"None match.",
"16."
] | computer_science | Answer: 16.
Steps:
1. Check 16.
2. None match.
3. 16. | algorithms |
It asks whether fast checking implies fast solving. | null | cs_0594 | concept | en | What is P versus NP about? | [
"P solves fast.",
"NP checks fast.",
"Open question."
] | computer_science | Answer: Check versus solve.
Steps:
1. P solves fast.
2. NP checks fast.
3. Open question. | complexity |
Both directions. | {
"A": "Forward only",
"B": "Random only",
"C": "Both directions",
"D": "No traversal"
} | cs_0595 | multiple_choice | cs | Jak chodí obousměrný seznam (případ 6)? | [
"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 |
Type hints annotate expected types without enforcing them. | null | cs_0596 | concept | en | What are type hints? | [
"Syntax x: int.",
"Checked by tools.",
"Docs help."
] | computer_science | Answer: Type annotations.
Steps:
1. Syntax x: int.
2. Checked by tools.
3. Docs help. | python |
18%4 is 2. | {
"A": "2",
"B": "3",
"C": "0",
"D": "4"
} | cs_0597 | multiple_choice | en | What does 18 % 4 give in JavaScript? | [
"Remainder.",
"18%4=2.",
"Select option A."
] | computer_science | Answer: 2.
Steps:
1. Remainder.
2. 18%4=2.
3. Select option A.
Answer: (A) | javascript |
LIKE matches text patterns with % and _. | null | cs_0598 | concept | en | What is LIKE for? | [
"% any run.",
"_ one char.",
"Case varies."
] | computer_science | Answer: Pattern match.
Steps:
1. % any run.
2. _ one char.
3. Case varies. | sql |
ARP maps IP addresses to MAC addresses on LAN. | null | cs_0599 | concept | en | What is ARP? | [
"Who has IP.",
"Reply MAC.",
"Cache it."
] | computer_science | Answer: IP to MAC.
Steps:
1. Who has IP.
2. Reply MAC.
3. Cache it. | networking |
Replikace kopíruje data na více serverů. | null | cs_0600 | concept | cs | Co je replikace? | [
"Primár píše.",
"Repliky čtou.",
"Bezpečnost."
] | computer_science | Answer: Kopie dat.
Steps:
1. Primár píše.
2. Repliky čtou.
3. Bezpečnost. | databases |
Segmentation splits memory by logical units like code and stack. | null | cs_0601 | concept | en | What is segmentation? | [
"Variable sizes.",
"Base plus limit.",
"External gaps."
] | computer_science | Answer: Logical units.
Steps:
1. Variable sizes.
2. Base plus limit.
3. External gaps. | operating_systems |
Inheritance reuses. | {
"A": "Loop",
"B": "Recursion",
"C": "Sorting",
"D": "Inheritance"
} | cs_0602 | multiple_choice | en | Which reuses parent behavior (case 7)? | [
"Child extends.",
"Gets methods.",
"Select option D."
] | computer_science | Answer: Inheritance.
Steps:
1. Child extends.
2. Gets methods.
3. Select option D.
Answer: (D) | oop |
Bubble sort swaps adjacent. | {
"A": "Merge sort",
"B": "Binary search",
"C": "BFS",
"D": "Bubble sort"
} | cs_0603 | multiple_choice | cs | Co prohazuje sousedy (případ 7)? | [
"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 |
Iterations = 400. | null | cs_0604 | worked_example | en | Nested loops n=20 (case 8). Iterations? | [
"20x20.",
"=400.",
"400."
] | computer_science | Answer: 400.
Steps:
1. 20x20.
2. =400.
3. 400. | complexity |
Heap backs it. | {
"A": "Stack",
"B": "Queue",
"C": "Array",
"D": "Heap"
} | cs_0605 | multiple_choice | en | What backs priority queue (case 7)? | [
"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 |
17//4 is 4. | {
"A": "5",
"B": "3",
"C": "6",
"D": "4"
} | cs_0606 | multiple_choice | en | What does 17 // 4 give in Python? | [
"Floor divide.",
"17//4=4.",
"Select option D."
] | computer_science | Answer: 4.
Steps:
1. Floor divide.
2. 17//4=4.
3. Select option D.
Answer: (D) | python |
Math.floor(8.7) is 8. | null | cs_0607 | worked_example | en | What does Math.floor(8.7) give? | [
"Round down.",
"8.7 to 8.",
"8."
] | computer_science | Answer: 8.
Steps:
1. Round down.
2. 8.7 to 8.
3. 8. | javascript |
BETWEEN filters values within an inclusive range. | null | cs_0608 | concept | en | What is BETWEEN? | [
"Low and high.",
"Includes ends.",
"Numbers or dates."
] | computer_science | Answer: Inclusive range.
Steps:
1. Low and high.
2. Includes ends.
3. Numbers or dates. | sql |
ICMP carries control messages like ping and errors. | null | cs_0609 | concept | en | What is ICMP? | [
"Echo ping.",
"Errors back.",
"No ports."
] | computer_science | Answer: Control messages.
Steps:
1. Echo ping.
2. Errors back.
3. No ports. | networking |
A stored procedure is saved server-side logic run by call. | null | cs_0610 | concept | en | What is a stored procedure? | [
"Stored code.",
"Called often.",
"Less roundtrip."
] | computer_science | Answer: Saved logic.
Steps:
1. Stored code.
2. Called often.
3. Less roundtrip. | databases |
FIFO evicts oldest. | {
"A": "FIFO",
"B": "LIFO",
"C": "LRU",
"D": "Random"
} | cs_0611 | multiple_choice | cs | Co vyhazuje nejstarší (případ 8)? | [
"Queue order.",
"Oldest first.",
"Select option A."
] | computer_science | Answer: FIFO.
Steps:
1. Queue order.
2. Oldest first.
3. Select option A.
Answer: (A) | operating_systems |
Value = 16. | null | cs_0612 | worked_example | en | Counter 15, inc() (case 10). Value? | [
"Start 15.",
"Plus 1.",
"16."
] | computer_science | Answer: 16.
Steps:
1. Start 15.
2. Plus 1.
3. 16. | oop |
A property exposes a method as attribute access with @property. | null | cs_0613 | concept | en | What is a property? | [
"Getter defined.",
"Access no parens.",
"Setter optional."
] | computer_science | Answer: Method as attribute.
Steps:
1. Getter defined.
2. Access no parens.
3. Setter optional. | python |
9+19 is 28. | null | cs_0614 | worked_example | en | What does 9 + 19 give in JavaScript? | [
"Add.",
"=28.",
"28."
] | computer_science | Answer: 28.
Steps:
1. Add.
2. =28.
3. 28. | javascript |
CASE returns values by conditional branches. | null | cs_0615 | concept | en | What is a CASE expression? | [
"WHEN checks.",
"THEN gives.",
"ELSE default."
] | computer_science | Answer: Conditional value.
Steps:
1. WHEN checks.
2. THEN gives.
3. ELSE default. | sql |
TCP opens SYN, SYN-ACK, ACK. | {
"A": "SYN, ACK",
"B": "SYN, SYN-ACK, ACK",
"C": "ACK, FIN",
"D": "SYN, FIN"
} | cs_0616 | multiple_choice | cs | Jaké je pořadí TCP (případ 9)? | [
"Three steps.",
"In order.",
"Select option B."
] | computer_science | Answer: SYN, SYN-ACK, ACK.
Steps:
1. Three steps.
2. In order.
3. Select option B.
Answer: (B) | networking |
PRIMARY KEY ensures unique rows. | {
"A": "PRIMARY KEY",
"B": "FOREIGN KEY",
"C": "INDEX",
"D": "VIEW"
} | cs_0617 | multiple_choice | en | Which ensures unique rows (case 8)? | [
"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 |
Round-robin uses slices. | {
"A": "FIFO",
"B": "Round-robin",
"C": "LIFO",
"D": "Stack"
} | cs_0618 | multiple_choice | en | Which uses time slices (case 9)? | [
"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 |
super() calls parent. | {
"A": "Calls parent",
"B": "Creates child",
"C": "Deletes obj",
"D": "Copies list"
} | cs_0619 | multiple_choice | en | What does super() do (case 8)? | [
"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 |
18%5 je 3. | {
"A": "3",
"B": "4",
"C": "0",
"D": "5"
} | cs_0620 | multiple_choice | cs | Co vrátí 18 % 5 v Pythonu? | [
"Zbytek.",
"18%5=3.",
"Vyber možnost A."
] | computer_science | Answer: 3.
Steps:
1. Zbytek.
2. 18%5=3.
3. Vyber možnost A.
Answer: (A) | python |
Join gives '10-11-12'. | null | cs_0621 | worked_example | en | What does [10,11,12].join('-') give? | [
"Join dash.",
"Parts.",
"'10-11-12'."
] | computer_science | Answer: '10-11-12'.
Steps:
1. Join dash.
2. Parts.
3. '10-11-12'. | javascript |
MAX je 12. | {
"A": "10",
"B": "11",
"C": "13",
"D": "12"
} | cs_0622 | multiple_choice | cs | Kterou hodnotu dá SELECT MAX z (10,12,11)? | [
"Compare.",
"Largest 12.",
"Select option D."
] | computer_science | Answer: 12.
Steps:
1. Porovnej.
2. Největší je 12.
3. Select option D.
Answer: (D) | sql |
DNS uses port 53. | {
"A": "22",
"B": "21",
"C": "53",
"D": "25"
} | cs_0623 | multiple_choice | en | Which port does DNS use? (set 10) | [
"Standard port.",
"DNS=53.",
"Select option C."
] | computer_science | Answer: 53.
Steps:
1. Standard port.
2. DNS=53.
3. Select option C.
Answer: (C) | networking |
Max = 24. | null | cs_0624 | worked_example | en | Cross-join 6 and 4 rows (case 9). Max? | [
"6x4.",
"=24.",
"24."
] | computer_science | Answer: 24.
Steps:
1. 6x4.
2. =24.
3. 24. | databases |
CPUs = 8. | null | cs_0625 | worked_example | en | 4 cores, 2 threads each (case 8). Logical CPUs? | [
"4x2.",
"=8.",
"8."
] | computer_science | Answer: 8.
Steps:
1. 4x2.
2. =8.
3. 8. | operating_systems |
B().x = 13. | null | cs_0626 | worked_example | en | Class A x=13, B(A) (case 11). B().x? | [
"A sets.",
"B inherits.",
"13."
] | computer_science | Answer: 13.
Steps:
1. A sets.
2. B inherits.
3. 13. | oop |
N-tice je neměnný uspořádaný záznam. | null | cs_0627 | concept | cs | Co je n-tice? | [
"Pořadí drží.",
"Nelze měnit.",
"Příklad: (1,2)."
] | computer_science | Answer: Neměnný záznam.
Steps:
1. Pořadí drží.
2. Nelze měnit.
3. Příklad: (1,2). | python |
Result is 'hi11'. | null | cs_0628 | worked_example | en | What does 'Hi11'.toLowerCase() give? | [
"Lowercase.",
"'hi11'.",
"Result."
] | computer_science | Answer: 'hi11'.
Steps:
1. Lowercase.
2. 'hi11'.
3. Result. | javascript |
UNION dedupes combined rows while UNION ALL keeps all. | null | cs_0629 | concept | en | What is UNION versus UNION ALL? | [
"Both stack.",
"UNION unique.",
"ALL faster."
] | computer_science | Answer: Dedupe versus keep.
Steps:
1. Both stack.
2. UNION unique.
3. ALL faster. | sql |
A firewall filters packets by rules to block threats. | null | cs_0630 | concept | en | What is a firewall? | [
"Allow list.",
"Deny rest.",
"Stateful tracks."
] | computer_science | Answer: Packet filter.
Steps:
1. Allow list.
2. Deny rest.
3. Stateful tracks. | networking |
Count = 15. | null | cs_0631 | worked_example | en | INSERT 15 rows into empty (case 10). Count? | [
"Start 0.",
"Add 15.",
"15."
] | computer_science | Answer: 15.
Steps:
1. Start 0.
2. Add 15.
3. 15. | databases |
Faults = 3. | null | cs_0632 | worked_example | en | 3 frames empty, refs 1..3 (case 9). Faults? | [
"All miss.",
"Count 3.",
"3."
] | computer_science | Answer: 3.
Steps:
1. All miss.
2. Count 3.
3. 3. | operating_systems |
A static method needs no instance or class state. | null | cs_0633 | concept | en | What is a static method? | [
"Decorator static.",
"Call via class.",
"Utility fn."
] | computer_science | Answer: No self.
Steps:
1. Decorator static.
2. Call via class.
3. Utility fn. | oop |
A shallow copy copies outer container but shares nested objects. | null | cs_0634 | concept | en | What is a shallow copy? | [
"Copy top.",
"Nested shared.",
"Use copy()."
] | computer_science | Answer: Outer copy.
Steps:
1. Copy top.
2. Nested shared.
3. Use copy(). | python |
JSON.stringify converts values to JSON text. | null | cs_0635 | concept | en | What is JSON.stringify? | [
"Object in.",
"String out.",
"Inverse parse."
] | computer_science | Answer: To JSON text.
Steps:
1. Object in.
2. String out.
3. Inverse parse. | javascript |
COALESCE returns the first non-NULL argument. | null | cs_0636 | concept | en | What is COALESCE? | [
"Scan args.",
"Skip NULL.",
"Default last."
] | computer_science | Answer: First non-NULL.
Steps:
1. Scan args.
2. Skip NULL.
3. Default last. | sql |
172.16.11.1 je privátní. | {
"A": "8.8.11.1",
"B": "1.1.11.1",
"C": "203.0.11.1",
"D": "172.16.11.1"
} | cs_0637 | multiple_choice | cs | Která IP je privátní (sada 11)? | [
"Private ranges.",
"172.16.11.1 fits.",
"Select option D."
] | computer_science | Answer: 172.16.11.1.
Steps:
1. Privátní rozsahy.
2. 172.16.11.1 vyhovuje.
3. Select option D.
Answer: (D) | networking |
A trigger runs automatically on row changes. | null | cs_0638 | concept | en | What is a trigger? | [
"On insert.",
"On update.",
"Keeps rules."
] | computer_science | Answer: Auto action.
Steps:
1. On insert.
2. On update.
3. Keeps rules. | databases |
Mutex ensures one. | {
"A": "Queue",
"B": "Array",
"C": "Mutex",
"D": "File"
} | cs_0639 | multiple_choice | en | What ensures one access (case 10)? | [
"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 |
__init__ constructs. | {
"A": "__len__",
"B": "__init__",
"C": "__add__",
"D": "__str__"
} | cs_0640 | multiple_choice | en | Which is constructor (case 9)? | [
"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 |
2**7 is 128. | {
"A": "64",
"B": "128",
"C": "256",
"D": "14"
} | cs_0641 | multiple_choice | en | What does 2**7 give? | [
"Power of two.",
"2**7=128.",
"Select option B."
] | computer_science | Answer: 128.
Steps:
1. Power of two.
2. 2**7=128.
3. Select option B.
Answer: (B) | python |
A callback is a function passed to run later. | null | cs_0642 | concept | en | What is a callback? | [
"Pass fn.",
"Called back.",
"Async or sync."
] | computer_science | Answer: Later function.
Steps:
1. Pass fn.
2. Called back.
3. Async or sync. | javascript |
NULL means unknown so comparisons yield unknown, not true. | null | cs_0643 | concept | en | How does NULL compare? | [
"NULL = NULL unknown.",
"Use IS NULL.",
"Filter carefully."
] | computer_science | Answer: Unknown logic.
Steps:
1. NULL = NULL unknown.
2. Use IS NULL.
3. Filter carefully. | sql |
NAT mapuje privátní adresy na veřejnou. | null | cs_0644 | concept | cs | Co je NAT? | [
"Mnoho na jednu.",
"Sleduje porty.",
"Šetří IP."
] | computer_science | Answer: Mapování adres.
Steps:
1. Mnoho na jednu.
2. Sleduje porty.
3. Šetří IP. | networking |
INSERT adds rows. | {
"A": "SELECT",
"B": "INSERT",
"C": "DELETE",
"D": "UPDATE"
} | cs_0645 | multiple_choice | cs | Co přidává řádky (případ 9)? | [
"Write op.",
"INSERT fits.",
"Select option B."
] | computer_science | Answer: INSERT.
Steps:
1. Write op.
2. INSERT fits.
3. Select option B.
Answer: (B) | databases |
A bootloader loads the kernel at power-on. | null | cs_0646 | concept | en | What is a bootloader? | [
"Firmware runs.",
"Load kernel.",
"Jump entry."
] | computer_science | Answer: Start loader.
Steps:
1. Firmware runs.
2. Load kernel.
3. Jump entry. | operating_systems |
A class method receives the class as first argument. | null | cs_0647 | concept | en | What is a class method? | [
"Decorator class.",
"Factory use.",
"Alt constructor."
] | computer_science | Answer: Gets cls.
Steps:
1. Decorator class.
2. Factory use.
3. Alt constructor. | oop |
Result is [11, 12, 13]. | null | cs_0648 | worked_example | en | What does list(range(11,14)) give? | [
"From 11.",
"To 13.",
"[11, 12, 13]."
] | computer_science | Answer: [11, 12, 13].
Steps:
1. From 11.
2. To 13.
3. [11, 12, 13]. | python |
Uzávěr je funkce pamatující si vnější proměnné. | null | cs_0649 | concept | cs | Co je uzávěr? | [
"Vnitřní drží.",
"Po návratu.",
"Soukromý stav."
] | computer_science | Answer: Pamatuje okolí.
Steps:
1. Vnitřní drží.
2. Po návratu.
3. Soukromý stav. | javascript |
SELECT 13+15 returns 28. | {
"A": "28",
"B": "27",
"C": "29",
"D": "30"
} | cs_0650 | multiple_choice | cs | Kterou hodnotu vrátí SELECT 13 + 15? | [
"Add.",
"13+15=28.",
"Select option A."
] | computer_science | Answer: 28.
Steps:
1. Add.
2. 13+15=28.
3. Select option A.
Answer: (A) | sql |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.