answer string | choices dict | id string | kind string | lang string | question string | steps list | subject string | text string | topic string |
|---|---|---|---|---|---|---|---|---|---|
Exception handling catches errors with try/except/finally blocks. | null | cs_0251 | concept | en | What is exception handling in Python? | [
"Try risky code.",
"Catch exceptions.",
"Finally cleans up."
] | computer_science | Answer: Catch errors safely.
Steps:
1. Try risky code.
2. Catch exceptions.
3. Finally cleans up. | python |
Default sort is lexicographic, so [10,2,1] sorts to 1,10,2. | {
"A": "1,2,10",
"B": "1,10,2",
"C": "10,1,2",
"D": "10,2,1"
} | cs_0252 | multiple_choice | en | What does [10,2,1].sort().join(',') give? | [
"Default string sort.",
"1 < 10 < 2.",
"Select option B."
] | computer_science | Answer: 1,10,2.
Steps:
1. Default string sort.
2. 1 < 10 < 2.
3. Select option B.
Answer: (B) | javascript |
SELECT 20 / 4 returns 5. | null | cs_0253 | worked_example | en | What does SELECT 20 / 4 return? | [
"Divide 20 by 4.",
"20 / 4 = 5.",
"Result is 5."
] | computer_science | Answer: 5.
Steps:
1. Divide 20 by 4.
2. 20 / 4 = 5.
3. Result is 5. | sql |
A /27 network has 30 usable hosts. | null | cs_0254 | worked_example | en | How many usable hosts in a /27 network? | [
"Host bits = 5.",
"Addresses = 32.",
"Usable = 32 - 2 = 30."
] | computer_science | Answer: 30.
Steps:
1. Host bits = 5.
2. Addresses = 32.
3. Usable = 32 - 2 = 30. | networking |
Index zrychluje vyhledávání v tabulce. | {
"A": "Zrychluje hledání",
"B": "Maže data",
"C": "Mění schéma",
"D": "Vypíná databázi"
} | cs_0255 | multiple_choice | cs | Co je databázový index? | [
"Index pomáhá.",
"Hledání rychlejší.",
"Vyber možnost A."
] | computer_science | Answer: Zrychluje hledání.
Steps:
1. Index pomáhá.
2. Hledání rychlejší.
3. Vyber možnost A.
Answer: (A) | databases |
A thread pool reuses a fixed set of threads for many tasks. | null | cs_0256 | concept | en | What is a thread pool? | [
"Create threads once.",
"Queue tasks.",
"Reuse workers."
] | computer_science | Answer: Reused workers.
Steps:
1. Create threads once.
2. Queue tasks.
3. Reuse workers. | operating_systems |
Rectangle(6, 7).area() is 42. | null | cs_0257 | worked_example | en | Rectangle 6 by 7, area = w*h. What is the area? | [
"w = 6, h = 7.",
"6 x 7 = 42.",
"Area = 42."
] | computer_science | Answer: 42.
Steps:
1. w = 6, h = 7.
2. 6 x 7 = 42.
3. Area = 42. | oop |
Kruskal builds a minimum spanning tree by adding cheapest edges. | {
"A": "Kruskal",
"B": "Bubble sort",
"C": "Binary search",
"D": "BFS"
} | cs_0258 | multiple_choice | en | Which finds a minimum spanning tree? | [
"Need MST.",
"Kruskal sorts edges.",
"Select option A."
] | computer_science | Answer: Kruskal.
Steps:
1. Need MST.
2. Kruskal sorts edges.
3. Select option A.
Answer: (A) | algorithms |
Logarithmic complexity halves work each step, like O(log n). | null | cs_0259 | concept | en | What is logarithmic complexity? | [
"Halve each step.",
"Few steps for big n.",
"Example: binary search."
] | computer_science | Answer: Halving each step.
Steps:
1. Halve each step.
2. Few steps for big n.
3. Example: binary search. | complexity |
K4 má 4x3/2 = 6 hran. | null | cs_0260 | worked_example | cs | Kolik hran má úplný graf K4? | [
"Vzorec n(n-1)/2.",
"4x3/2 = 6.",
"Hran je 6."
] | computer_science | Answer: 6.
Steps:
1. Vzorec n(n-1)/2.
2. 4x3/2 = 6.
3. Hran je 6. | data_structures |
Lambdas are anonymous one-line functions written as lambda x: expr. | null | cs_0261 | concept | en | What are Python lambda functions? | [
"No def needed.",
"Single expression.",
"Good for callbacks."
] | computer_science | Answer: Anonymous functions.
Steps:
1. No def needed.
2. Single expression.
3. Good for callbacks. | python |
typeof null is 'object' due to a legacy quirk. | {
"A": "object",
"B": "null",
"C": "undefined",
"D": "number"
} | cs_0262 | multiple_choice | en | What is typeof null in JavaScript? | [
"Legacy quirk.",
"Returns object.",
"Select option A."
] | computer_science | Answer: object.
Steps:
1. Legacy quirk.
2. Returns object.
3. Select option A.
Answer: (A) | javascript |
MAX of (3, 9, 5) is 9. | null | cs_0263 | worked_example | en | What does SELECT MAX(x) give for x in (3,9,5)? | [
"Compare values.",
"Largest is 9.",
"Result = 9."
] | computer_science | Answer: 9.
Steps:
1. Compare values.
2. Largest is 9.
3. Result = 9. | sql |
25 MB over 100 Mbps takes 2 seconds. | null | cs_0264 | worked_example | en | Link 100 Mbps, file 25 MB. How many seconds to transfer? | [
"25 MB = 200 Mb.",
"200 / 100 = 2.",
"Time = 2 s."
] | computer_science | Answer: 2 s.
Steps:
1. 25 MB = 200 Mb.
2. 200 / 100 = 2.
3. Time = 2 s. | networking |
A v ACID znamená atomicita. | {
"A": "Atomicita",
"B": "Konzistence",
"C": "Izolace",
"D": "Trvanlivost"
} | cs_0265 | multiple_choice | cs | Co znamená A v ACID? | [
"ACID vlastnosti.",
"A je atomicita.",
"Vyber možnost A."
] | computer_science | Answer: Atomicita.
Steps:
1. ACID vlastnosti.
2. A je atomicita.
3. Vyber možnost A.
Answer: (A) | databases |
A semaphore is a counter controlling access to shared resources. | null | cs_0266 | concept | en | What is a semaphore? | [
"Counter starts at N.",
"Wait decrements.",
"Signal increments."
] | computer_science | Answer: Access counter.
Steps:
1. Counter starts at N.
2. Wait decrements.
3. Signal increments. | operating_systems |
Counter at 10 after dec() is 9. | null | cs_0267 | worked_example | en | Counter value 10, dec() subtracts 1. What is the value? | [
"Start 10.",
"Minus 1.",
"Value = 9."
] | computer_science | Answer: 9.
Steps:
1. Start 10.
2. Minus 1.
3. Value = 9. | oop |
Quicksort picks a pivot and partitions around it. | {
"A": "Pivot",
"B": "Root",
"C": "Hash",
"D": "Queue"
} | cs_0268 | multiple_choice | en | What does quicksort pick to partition? | [
"Choose pivot.",
"Partition around.",
"Select option A."
] | computer_science | Answer: Pivot.
Steps:
1. Choose pivot.
2. Partition around.
3. Select option A.
Answer: (A) | algorithms |
Best-case analysis measures minimum cost over inputs of size n. | null | cs_0269 | concept | en | What is best-case analysis? | [
"Easiest input.",
"Minimum cost.",
"Rarely relied on."
] | computer_science | Answer: Minimum cost.
Steps:
1. Easiest input.
2. Minimum cost.
3. Rarely relied on. | complexity |
Load factor je 9/12 = 0.75. | null | cs_0270 | worked_example | cs | 9 prvků ve 12 slotech. Jaký je load factor? | [
"9 / 12.",
"Výpočet 0.75.",
"Load factor = 0.75."
] | computer_science | Answer: 0.75.
Steps:
1. 9 / 12.
2. Výpočet 0.75.
3. Load factor = 0.75. | data_structures |
The GIL allows only one thread to run Python bytecode at once. | null | cs_0271 | concept | en | What is the Python GIL? | [
"Global lock.",
"One bytecode thread.",
"Limits CPU parallelism."
] | computer_science | Answer: Global interpreter lock.
Steps:
1. Global lock.
2. One bytecode thread.
3. Limits CPU parallelism. | python |
'hi'.length is 2. | {
"A": "1",
"B": "2",
"C": "3",
"D": "0"
} | cs_0272 | multiple_choice | en | What does 'hi'.length give? | [
"Two letters.",
"Length 2.",
"Select option B."
] | computer_science | Answer: 2.
Steps:
1. Two letters.
2. Length 2.
3. Select option B.
Answer: (B) | javascript |
MIN of (8, 3, 6) is 3. | null | cs_0273 | worked_example | en | What does SELECT MIN(x) give for x in (8,3,6)? | [
"Compare values.",
"Smallest is 3.",
"Result = 3."
] | computer_science | Answer: 3.
Steps:
1. Compare values.
2. Smallest is 3.
3. Result = 3. | sql |
A /28 network has 14 usable hosts. | null | cs_0274 | worked_example | en | How many usable hosts in a /28 network? | [
"Host bits = 4.",
"Addresses = 16.",
"Usable = 16 - 2 = 14."
] | computer_science | Answer: 14.
Steps:
1. Host bits = 4.
2. Addresses = 16.
3. Usable = 16 - 2 = 14. | networking |
ORDER BY třídí výsledné řádky. | {
"A": "Třídí řádky",
"B": "Filtruje řádky",
"C": "Spojuje tabulky",
"D": "Maže řádky"
} | cs_0275 | multiple_choice | cs | Co dělá ORDER BY? | [
"ORDER BY řadí.",
"Podle sloupců.",
"Vyber možnost A."
] | computer_science | Answer: Třídí řádky.
Steps:
1. ORDER BY řadí.
2. Podle sloupců.
3. Vyber možnost A.
Answer: (A) | databases |
A zombie process has terminated but its parent has not reaped it yet. | null | cs_0276 | concept | en | What is a zombie process? | [
"Child exits.",
"Parent delays wait.",
"Entry lingers."
] | computer_science | Answer: Exited but unreaped.
Steps:
1. Child exits.
2. Parent delays wait.
3. Entry lingers. | operating_systems |
Balance 200 minus 70 leaves 130. | null | cs_0277 | worked_example | en | Account balance 200, withdraw(70). What is the balance? | [
"Start 200.",
"Subtract 70.",
"Balance = 130."
] | computer_science | Answer: 130.
Steps:
1. Start 200.
2. Subtract 70.
3. Balance = 130. | oop |
Huffman coding greedily merges the two least frequent symbols. | {
"A": "Huffman coding",
"B": "Bubble sort",
"C": "Binary search",
"D": "DFS"
} | cs_0278 | multiple_choice | en | Which is a greedy algorithm? | [
"Greedy picks best now.",
"Huffman merges least.",
"Select option A."
] | computer_science | Answer: Huffman coding.
Steps:
1. Greedy picks best now.
2. Huffman merges least.
3. Select option A.
Answer: (A) | algorithms |
NP contains problems verifiable in polynomial time. | null | cs_0279 | concept | en | What is complexity class NP? | [
"Check solutions fast.",
"Finding may be hard.",
"Example: SAT."
] | computer_science | Answer: Fast to verify.
Steps:
1. Check solutions fast.
2. Finding may be hard.
3. Example: SAT. | complexity |
Po dvou operacích dequeue zbude jen 9. | null | cs_0280 | worked_example | cs | Fronta je 7, 8, 9. Co zbude po dvou dequeue? | [
"Odeber 7.",
"Odeber 8.",
"Zbude 9."
] | computer_science | Answer: 9.
Steps:
1. Odeber 7.
2. Odeber 8.
3. Zbude 9. | data_structures |
Sets store unordered unique items with fast membership tests. | null | cs_0281 | concept | en | What are Python sets? | [
"No duplicates.",
"Unordered.",
"Fast in-checks."
] | computer_science | Answer: Unique unordered items.
Steps:
1. No duplicates.
2. Unordered.
3. Fast in-checks. | python |
Boolean(0) is false. | {
"A": "true",
"B": "false",
"C": "0",
"D": "undefined"
} | cs_0282 | multiple_choice | en | What does Boolean(0) give? | [
"0 is falsy.",
"Coerces to false.",
"Select option B."
] | computer_science | Answer: false.
Steps:
1. 0 is falsy.
2. Coerces to false.
3. Select option B.
Answer: (B) | javascript |
3 + 4 * 2 equals 11 by precedence. | null | cs_0283 | worked_example | en | What does SELECT 3 + 4 * 2 return? | [
"Multiply first: 8.",
"Add 3.",
"Result = 11."
] | computer_science | Answer: 11.
Steps:
1. Multiply first: 8.
2. Add 3.
3. Result = 11. | sql |
A /29 network has 6 usable hosts. | null | cs_0284 | worked_example | en | How many usable hosts in a /29 network? | [
"Host bits = 3.",
"Addresses = 8.",
"Usable = 8 - 2 = 6."
] | computer_science | Answer: 6.
Steps:
1. Host bits = 3.
2. Addresses = 8.
3. Usable = 8 - 2 = 6. | networking |
GROUP BY seskupuje řádky se stejnou hodnotou. | {
"A": "Seskupuje řádky",
"B": "Třídí řádky",
"C": "Maže řádky",
"D": "Vytváří tabulku"
} | cs_0285 | multiple_choice | cs | Co dělá GROUP BY? | [
"Stejné hodnoty.",
"Skupiny pro agregaci.",
"Vyber možnost A."
] | computer_science | Answer: Seskupuje řádky.
Steps:
1. Stejné hodnoty.
2. Skupiny pro agregaci.
3. Vyber možnost A.
Answer: (A) | databases |
Swapping moves processes between RAM and disk to free memory. | null | cs_0286 | concept | en | What is swapping? | [
"RAM is full.",
"Move process to disk.",
"Bring back later."
] | computer_science | Answer: RAM-disk exchange.
Steps:
1. RAM is full.
2. Move process to disk.
3. Bring back later. | operating_systems |
Point(3, 4).sum() is 7. | null | cs_0287 | worked_example | en | Point stores x, y with sum = x+y. What is Point(3,4).sum()? | [
"x = 3, y = 4.",
"3 + 4 = 7.",
"Sum = 7."
] | computer_science | Answer: 7.
Steps:
1. x = 3, y = 4.
2. 3 + 4 = 7.
3. Sum = 7. | oop |
Inorder traversal of a BST visits keys in sorted order. | {
"A": "Sorted",
"B": "Reverse",
"C": "Random",
"D": "Level"
} | cs_0288 | multiple_choice | en | What order does BST inorder give? | [
"Left, root, right.",
"Ascending keys.",
"Select option A."
] | computer_science | Answer: Sorted.
Steps:
1. Left, root, right.
2. Ascending keys.
3. Select option A.
Answer: (A) | algorithms |
Constant time O(1) costs the same regardless of input size. | null | cs_0289 | concept | en | What is constant time complexity? | [
"Fixed steps.",
"No growth.",
"Example: array index."
] | computer_science | Answer: Fixed cost.
Steps:
1. Fixed steps.
2. No growth.
3. Example: array index. | complexity |
Po dvou pop zbude jen 1. | null | cs_0290 | worked_example | cs | Zásobník je 1, 2, 3. Co zbude po dvou pop? | [
"Odeber 3.",
"Odeber 2.",
"Zbude 1."
] | computer_science | Answer: 1.
Steps:
1. Odeber 3.
2. Odeber 2.
3. Zbude 1. | data_structures |
Decorators wrap functions using @name above a definition. | null | cs_0291 | concept | en | What is a Python decorator? | [
"@ above def.",
"Wraps function.",
"Adds behavior."
] | computer_science | Answer: Function wrapper.
Steps:
1. @ above def.
2. Wraps function.
3. Adds behavior. | python |
'5' + 2 is '52' because plus concatenates strings. | {
"A": "'52'",
"B": "7",
"C": "5",
"D": "NaN"
} | cs_0292 | multiple_choice | en | What does '5' + 2 give in JavaScript? | [
"Plus prefers string.",
"Concat 5 and 2.",
"Select option A."
] | computer_science | Answer: '52'.
Steps:
1. Plus prefers string.
2. Concat 5 and 2.
3. Select option A.
Answer: (A) | javascript |
UPPER('hi') returns 'HI'. | null | cs_0293 | worked_example | en | What does SELECT UPPER('hi') return? | [
"Capitalize letters.",
"hi becomes HI.",
"Result = 'HI'."
] | computer_science | Answer: 'HI'.
Steps:
1. Capitalize letters.
2. hi becomes HI.
3. Result = 'HI'. | sql |
The /16 mask is 255.255.0.0. | null | cs_0294 | worked_example | en | What is the subnet mask for /16? | [
"16 ones.",
"Two octets full.",
"Mask = 255.255.0.0."
] | computer_science | Answer: 255.255.0.0.
Steps:
1. 16 ones.
2. Two octets full.
3. Mask = 255.255.0.0. | networking |
HAVING filtruje skupiny po agregaci. | {
"A": "Filtruje skupiny",
"B": "Třídí řádky",
"C": "Maže řádky",
"D": "Spojuje tabulky"
} | cs_0295 | multiple_choice | cs | Co dělá HAVING? | [
"Po GROUP BY.",
"Filtr agregací.",
"Vyber možnost A."
] | computer_science | Answer: Filtruje skupiny.
Steps:
1. Po GROUP BY.
2. Filtr agregací.
3. Vyber možnost A.
Answer: (A) | databases |
CPU scheduling decides which ready process runs next. | null | cs_0296 | concept | en | What is CPU scheduling? | [
"Many ready tasks.",
"Pick one.",
"Switch on events."
] | computer_science | Answer: Pick next process.
Steps:
1. Many ready tasks.
2. Pick one.
3. Switch on events. | operating_systems |
120 pages minus 30 read leaves 90. | null | cs_0297 | worked_example | en | Book has 120 pages, read 30. How many remain? | [
"Total 120.",
"Minus 30.",
"Remain = 90."
] | computer_science | Answer: 90.
Steps:
1. Total 120.
2. Minus 30.
3. Remain = 90. | oop |
Binary search requires sorted input to halve correctly. | {
"A": "Linear",
"B": "Binary",
"C": "BFS",
"D": "DFS"
} | cs_0298 | multiple_choice | en | Which search needs sorted input? | [
"Halving assumes order.",
"Binary needs sorted.",
"Select option B."
] | computer_science | Answer: Binary.
Steps:
1. Halving assumes order.
2. Binary needs sorted.
3. Select option B.
Answer: (B) | algorithms |
Quadratic O(n^2) grows with the square, typical of nested loops. | null | cs_0299 | concept | en | What is quadratic complexity? | [
"n by n work.",
"Grows fast.",
"Example: bubble sort."
] | computer_science | Answer: Square growth.
Steps:
1. n by n work.
2. Grows fast.
3. Example: bubble sort. | complexity |
Inorder dá 5, 10, 15. | null | cs_0300 | worked_example | cs | Kořen 10, levý 5, pravý 15. Co dá inorder? | [
"Levý 5.",
"Kořen 10.",
"Pravý 15."
] | computer_science | Answer: 5, 10, 15.
Steps:
1. Levý 5.
2. Kořen 10.
3. Pravý 15. | data_structures |
Keyword arguments are named parameters with defaults passed as name=value. | null | cs_0301 | concept | en | What are keyword arguments in Python? | [
"Define def f(a=1).",
"Call f(a=2).",
"Order flexible."
] | computer_science | Answer: Named parameters.
Steps:
1. Define def f(a=1).
2. Call f(a=2).
3. Order flexible. | python |
[1,2,3].includes(2) is true. | {
"A": "true",
"B": "false",
"C": "2",
"D": "undefined"
} | cs_0302 | multiple_choice | en | What does [1,2,3].includes(2) give? | [
"Search for 2.",
"Found.",
"Select option A."
] | computer_science | Answer: true.
Steps:
1. Search for 2.
2. Found.
3. Select option A.
Answer: (A) | javascript |
SELECT 9 * 9 returns 81. | null | cs_0303 | worked_example | en | What does SELECT 9 * 9 return? | [
"Multiply 9 by 9.",
"9 x 9 = 81.",
"Result is 81."
] | computer_science | Answer: 81.
Steps:
1. Multiply 9 by 9.
2. 9 x 9 = 81.
3. Result is 81. | sql |
A /23 network has 510 usable hosts. | null | cs_0304 | worked_example | en | How many usable hosts in a /23 network? | [
"Host bits = 9.",
"Addresses = 512.",
"Usable = 512 - 2 = 510."
] | computer_science | Answer: 510.
Steps:
1. Host bits = 9.
2. Addresses = 512.
3. Usable = 512 - 2 = 510. | networking |
Řádky filtruje klauzule WHERE. | {
"A": "WHERE",
"B": "ORDER BY",
"C": "GROUP BY",
"D": "JOIN"
} | cs_0305 | multiple_choice | cs | Která klauzule filtruje řádky? | [
"WHERE omezuje.",
"Před agregací.",
"Vyber možnost A."
] | computer_science | Answer: WHERE.
Steps:
1. WHERE omezuje.
2. Před agregací.
3. Vyber možnost A.
Answer: (A) | databases |
Multitasking runs multiple processes concurrently by rapid switching. | null | cs_0306 | concept | en | What is multitasking? | [
"Many processes.",
"CPU switches fast.",
"Appears parallel."
] | computer_science | Answer: Concurrent processes.
Steps:
1. Many processes.
2. CPU switches fast.
3. Appears parallel. | operating_systems |
5000 salary plus 500 bonus is 5500. | null | cs_0307 | worked_example | en | Employee salary 5000, bonus 500. What is total pay? | [
"Base 5000.",
"Add 500.",
"Total = 5500."
] | computer_science | Answer: 5500.
Steps:
1. Base 5000.
2. Add 500.
3. Total = 5500. | oop |
Bellman-Ford handles negative edges for single-source shortest paths. | {
"A": "Dijkstra",
"B": "Bellman-Ford",
"C": "Bubble sort",
"D": "DFS"
} | cs_0308 | multiple_choice | en | Which handles negative edges for shortest paths? | [
"Dijkstra needs non-negative.",
"Bellman-Ford relaxes.",
"Select option B."
] | computer_science | Answer: Bellman-Ford.
Steps:
1. Dijkstra needs non-negative.
2. Bellman-Ford relaxes.
3. Select option B.
Answer: (B) | algorithms |
Linear O(n) cost grows proportionally with input size. | null | cs_0309 | concept | en | What is linear complexity? | [
"One pass.",
"Double input, double time.",
"Example: linear search."
] | computer_science | Answer: Proportional growth.
Steps:
1. One pass.
2. Double input, double time.
3. Example: linear search. | complexity |
Délka pole je 4. | null | cs_0310 | worked_example | cs | Pole je [5,6,7,8]. Jaká je délka? | [
"Počítej prvky.",
"5, 6, 7, 8.",
"Délka = 4."
] | computer_science | Answer: 4.
Steps:
1. Počítej prvky.
2. 5, 6, 7, 8.
3. Délka = 4. | data_structures |
== compares values while is compares object identity. | null | cs_0311 | concept | en | How do == and is differ in Python? | [
"== checks equality.",
"is checks identity.",
"Small ints may share."
] | computer_science | Answer: Value versus identity.
Steps:
1. == checks equality.
2. is checks identity.
3. Small ints may share. | python |
0 == false is true under loose equality. | {
"A": "true",
"B": "false",
"C": "0",
"D": "TypeError"
} | cs_0312 | multiple_choice | en | What does 0 == false give in JavaScript? | [
"Loose coercion.",
"0 equals false.",
"Select option A."
] | computer_science | Answer: true.
Steps:
1. Loose coercion.
2. 0 equals false.
3. Select option A.
Answer: (A) | javascript |
10 % 3 returns 1. | null | cs_0313 | worked_example | en | What does SELECT 10 % 3 return? | [
"Divide 10 by 3.",
"Remainder 1.",
"Result = 1."
] | computer_science | Answer: 1.
Steps:
1. Divide 10 by 3.
2. Remainder 1.
3. Result = 1. | sql |
40 ms round-trip allows 25 serial requests per second. | null | cs_0314 | worked_example | en | Round-trip 40 ms. How many serial requests per second? | [
"1000 ms per second.",
"1000 / 40 = 25.",
"Rate = 25."
] | computer_science | Answer: 25.
Steps:
1. 1000 ms per second.
2. 1000 / 40 = 25.
3. Rate = 25. | networking |
JOIN spojuje řádky ze dvou tabulek. | {
"A": "Spojuje tabulky",
"B": "Maže řádky",
"C": "Třídí řádky",
"D": "Filtruje řádky"
} | cs_0315 | multiple_choice | cs | Co dělá JOIN? | [
"Dvě tabulky.",
"Spojení podle klíče.",
"Vyber možnost A."
] | computer_science | Answer: Spojuje tabulky.
Steps:
1. Dvě tabulky.
2. Spojení podle klíče.
3. Vyber možnost A.
Answer: (A) | databases |
A file descriptor is an integer handle for an open file. | null | cs_0316 | concept | en | What is a file descriptor? | [
"Open returns number.",
"Read/write use it.",
"Close frees it."
] | computer_science | Answer: Open-file handle.
Steps:
1. Open returns number.
2. Read/write use it.
3. Close frees it. | operating_systems |
60 plus 20 gives speed 80. | null | cs_0317 | worked_example | en | Car speed 60, accelerate(20). What is the speed? | [
"Start 60.",
"Add 20.",
"Speed = 80."
] | computer_science | Answer: 80.
Steps:
1. Start 60.
2. Add 20.
3. Speed = 80. | oop |
Memoization caches function results to avoid recomputation. | {
"A": "Caches results",
"B": "Sorts data",
"C": "Encrypts data",
"D": "Compresses data"
} | cs_0318 | multiple_choice | en | What does memoization do? | [
"Store outputs.",
"Reuse on repeat.",
"Select option A."
] | computer_science | Answer: Caches results.
Steps:
1. Store outputs.
2. Reuse on repeat.
3. Select option A.
Answer: (A) | algorithms |
Factorial O(n!) grows with permutations, exploding beyond n = 12. | null | cs_0319 | concept | en | What is factorial complexity? | [
"n! orderings.",
"Huge growth.",
"Example: TSP brute force."
] | computer_science | Answer: Permutation growth.
Steps:
1. n! orderings.
2. Huge growth.
3. Example: TSP brute force. | complexity |
Do K4 chybí 3 hrany. | null | cs_0320 | worked_example | cs | Graf má 4 vrcholy a 3 hrany. Kolik chybí do K4? | [
"K4 má 6 hran.",
"Máme 3.",
"Chybí 6 - 3 = 3."
] | computer_science | Answer: 3.
Steps:
1. K4 má 6 hran.
2. Máme 3.
3. Chybí 6 - 3 = 3. | data_structures |
*args collects extra positional arguments into a tuple. | null | cs_0321 | concept | en | What does *args do in Python? | [
"Variable inputs.",
"Tuple inside.",
"Loop over them."
] | computer_science | Answer: Variable arguments.
Steps:
1. Variable inputs.
2. Tuple inside.
3. Loop over them. | python |
typeof 42 is 'number'. | {
"A": "number",
"B": "string",
"C": "object",
"D": "undefined"
} | cs_0322 | multiple_choice | en | What is typeof 42? | [
"42 is numeric.",
"Type number.",
"Select option A."
] | computer_science | Answer: number.
Steps:
1. 42 is numeric.
2. Type number.
3. Select option A.
Answer: (A) | javascript |
LOWER('ABC') returns 'abc'. | null | cs_0323 | worked_example | en | What does SELECT LOWER('ABC') return? | [
"Lowercase each.",
"ABC to abc.",
"Result = 'abc'."
] | computer_science | Answer: 'abc'.
Steps:
1. Lowercase each.
2. ABC to abc.
3. Result = 'abc'. | sql |
A /20 network has 4094 usable hosts. | null | cs_0324 | worked_example | en | How many usable hosts in a /20 network? | [
"Host bits = 12.",
"Addresses = 4096.",
"Usable = 4096 - 2 = 4094."
] | computer_science | Answer: 4094.
Steps:
1. Host bits = 12.
2. Addresses = 4096.
3. Usable = 4096 - 2 = 4094. | networking |
Schéma je struktura tabulek a vztahů. | {
"A": "Struktura databáze",
"B": "Konkrétní data",
"C": "Index",
"D": "Dotaz"
} | cs_0325 | multiple_choice | cs | Co je databázové schéma? | [
"Popis struktury.",
"Tabulky a typy.",
"Vyber možnost A."
] | computer_science | Answer: Struktura databáze.
Steps:
1. Popis struktury.
2. Tabulky a typy.
3. Vyber možnost A.
Answer: (A) | databases |
A shell is a command interpreter between user and kernel. | null | cs_0326 | concept | en | What is a shell? | [
"Reads commands.",
"Runs programs.",
"Shows output."
] | computer_science | Answer: Command interpreter.
Steps:
1. Reads commands.
2. Runs programs.
3. Shows output. | operating_systems |
Off toggled becomes on. | null | cs_0327 | worked_example | en | Light is off, toggle() flips state. What is the state? | [
"Start off.",
"Flip.",
"State = on."
] | computer_science | Answer: on.
Steps:
1. Start off.
2. Flip.
3. State = on. | oop |
BFS visits level by level. | {
"A": "DFS",
"B": "BFS",
"C": "Inorder",
"D": "Postorder"
} | cs_0328 | multiple_choice | en | Which traversal is level order? | [
"Level by level.",
"Queue-based BFS.",
"Select option B."
] | computer_science | Answer: BFS.
Steps:
1. Level by level.
2. Queue-based BFS.
3. Select option B.
Answer: (B) | algorithms |
Average-case analysis measures expected cost over an input distribution. | null | cs_0329 | concept | en | What is average-case analysis? | [
"Assume distribution.",
"Average costs.",
"Example: quicksort."
] | computer_science | Answer: Expected cost.
Steps:
1. Assume distribution.
2. Average costs.
3. Example: quicksort. | complexity |
Klíč 23 patří na slot 3. | null | cs_0330 | worked_example | cs | Hash tabulka má 10 slotů. Kam patří klíč 23? | [
"23 % 10 = 3.",
"Slot 3.",
"Výsledek je 3."
] | computer_science | Answer: 3.
Steps:
1. 23 % 10 = 3.
2. Slot 3.
3. Výsledek je 3. | data_structures |
**kwargs collects extra keyword arguments into a dict. | null | cs_0331 | concept | en | What does **kwargs do in Python? | [
"Named extras.",
"Dict inside.",
"Access by key."
] | computer_science | Answer: Named extras dict.
Steps:
1. Named extras.
2. Dict inside.
3. Access by key. | python |
'a,b,c'.split(',') has length 3. | {
"A": "1",
"B": "2",
"C": "3",
"D": "0"
} | cs_0332 | multiple_choice | en | What does 'a,b,c'.split(',').length give? | [
"Split into 3.",
"Length counts.",
"Select option C."
] | computer_science | Answer: 3.
Steps:
1. Split into 3.
2. Length counts.
3. Select option C.
Answer: (C) | javascript |
SELECT 5 + 5 + 5 returns 15. | null | cs_0333 | worked_example | en | What does SELECT 5 + 5 + 5 return? | [
"Add first two: 10.",
"Add 5.",
"Result = 15."
] | computer_science | Answer: 15.
Steps:
1. Add first two: 10.
2. Add 5.
3. Result = 15. | sql |
A /22 network has 1022 usable hosts. | null | cs_0334 | worked_example | en | How many usable hosts in a /22 network? | [
"Host bits = 10.",
"Addresses = 1024.",
"Usable = 1024 - 2 = 1022."
] | computer_science | Answer: 1022.
Steps:
1. Host bits = 10.
2. Addresses = 1024.
3. Usable = 1024 - 2 = 1022. | networking |
VIEW je uložený dotaz vystupující jako tabulka. | {
"A": "Uložený dotaz",
"B": "Fyzická tabulka",
"C": "Index",
"D": "Klíč"
} | cs_0335 | multiple_choice | cs | Co je pohled (VIEW)? | [
"Dotaz uložen.",
"Chová se jako tabulka.",
"Vyber možnost A."
] | computer_science | Answer: Uložený dotaz.
Steps:
1. Dotaz uložen.
2. Chová se jako tabulka.
3. Vyber možnost A.
Answer: (A) | databases |
A device driver is software that controls a hardware device. | null | cs_0336 | concept | en | What is a device driver? | [
"Talks to hardware.",
"Exposes interface.",
"Kernel loads it."
] | computer_science | Answer: Hardware control software.
Steps:
1. Talks to hardware.
2. Exposes interface.
3. Kernel loads it. | operating_systems |
100 plus 25 is 125. | null | cs_0337 | worked_example | en | Player score 100, add(25). What is the score? | [
"Start 100.",
"Add 25.",
"Score = 125."
] | computer_science | Answer: 125.
Steps:
1. Start 100.
2. Add 25.
3. Score = 125. | oop |
Topological sort needs a directed acyclic graph. | {
"A": "DAG",
"B": "Cyclic graph",
"C": "Unsorted list",
"D": "Stack"
} | cs_0338 | multiple_choice | en | Which graph allows topological sort? | [
"No cycles allowed.",
"DAG works.",
"Select option A."
] | computer_science | Answer: DAG.
Steps:
1. No cycles allowed.
2. DAG works.
3. Select option A.
Answer: (A) | algorithms |
Linearithmic O(n log n) is typical of efficient sorts. | null | cs_0339 | concept | en | What is linearithmic complexity? | [
"n times log n.",
"Efficient sorting.",
"Example: merge sort."
] | computer_science | Answer: n log n growth.
Steps:
1. n times log n.
2. Efficient sorting.
3. Example: merge sort. | complexity |
Maximum je 4 kroky. | null | cs_0340 | worked_example | cs | Binární vyhledávání v 16 prvcích. Kolik kroků maximálně? | [
"log2(16) = 4.",
"Půlení čtyřikrát.",
"Maximum 4 kroky."
] | computer_science | Answer: 4.
Steps:
1. log2(16) = 4.
2. Půlení čtyřikrát.
3. Maximum 4 kroky. | data_structures |
Modules are .py files with reusable definitions imported elsewhere. | null | cs_0341 | concept | en | What are Python modules? | [
"File with code.",
"Import it.",
"Reuse functions."
] | computer_science | Answer: Reusable files.
Steps:
1. File with code.
2. Import it.
3. Reuse functions. | python |
Math.floor(3.9) is 3. | {
"A": "3",
"B": "4",
"C": "3.9",
"D": "NaN"
} | cs_0342 | multiple_choice | en | What does Math.floor(3.9) give? | [
"Round down.",
"3.9 to 3.",
"Select option A."
] | computer_science | Answer: 3.
Steps:
1. Round down.
2. 3.9 to 3.
3. Select option A.
Answer: (A) | javascript |
ABS(-7) returns 7. | null | cs_0343 | worked_example | en | What does SELECT ABS(-7) return? | [
"Absolute value.",
"Remove sign.",
"Result = 7."
] | computer_science | Answer: 7.
Steps:
1. Absolute value.
2. Remove sign.
3. Result = 7. | sql |
Broadcast for 192.168.1.0/24 is 192.168.1.255. | null | cs_0344 | worked_example | en | What is the broadcast for 192.168.1.0/24? | [
"Last octet host.",
"All ones = 255.",
"Broadcast .255."
] | computer_science | Answer: 192.168.1.255.
Steps:
1. Last octet host.
2. All ones = 255.
3. Broadcast .255. | networking |
COUNT(*) počítá řádky. | {
"A": "Počítá řádky",
"B": "Maže řádky",
"C": "Třídí řádky",
"D": "Spojuje tabulky"
} | cs_0345 | multiple_choice | cs | Co dělá COUNT(*)? | [
"Agregace počtu.",
"Všechny řádky.",
"Vyber možnost A."
] | computer_science | Answer: Počítá řádky.
Steps:
1. Agregace počtu.
2. Všechny řádky.
3. Vyber možnost A.
Answer: (A) | databases |
IPC lets processes exchange data via pipes, sockets, or shared memory. | null | cs_0346 | concept | en | What is interprocess communication? | [
"Processes isolated.",
"Need channels.",
"Pipes or sockets."
] | computer_science | Answer: Data exchange channels.
Steps:
1. Processes isolated.
2. Need channels.
3. Pipes or sockets. | operating_systems |
2 items plus 3 gives 5. | null | cs_0347 | worked_example | en | Cart has 2 items, add 3. How many items? | [
"Start 2.",
"Add 3.",
"Total = 5."
] | computer_science | Answer: 5.
Steps:
1. Start 2.
2. Add 3.
3. Total = 5. | oop |
Hash lookup averages O(1). | {
"A": "Hash lookup",
"B": "Binary search",
"C": "Bubble sort",
"D": "Merge sort"
} | cs_0348 | multiple_choice | en | Which averages O(1)? | [
"Direct hashing.",
"Constant average.",
"Select option A."
] | computer_science | Answer: Hash lookup.
Steps:
1. Direct hashing.
2. Constant average.
3. Select option A.
Answer: (A) | algorithms |
A reduction transforms one problem into another to compare hardness. | null | cs_0349 | concept | en | What is a reduction? | [
"Map instances.",
"Preserve answers.",
"Prove hardness."
] | computer_science | Answer: Problem transformation.
Steps:
1. Map instances.
2. Preserve answers.
3. Prove hardness. | complexity |
Maximum je v kořenu, tedy 10. | null | cs_0350 | worked_example | cs | Max-halda je [10,8,9]. Kde je maximum? | [
"Kořen je 10.",
"Děti menší.",
"Maximum je 10."
] | computer_science | Answer: 10.
Steps:
1. Kořen je 10.
2. Děti menší.
3. Maximum je 10. | data_structures |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.