D684 Introduction to Computer Science - Set 3 - Part 1

Correct Answer: Triple redundancy

Triple redundancy uses three systems voting on decisions, allowing correct operation even if one system fails or gives incorrect output.
Option a is incorrect because load balancing distributes work across systems for performance, not voting on critical decisions for safety.
Option c is incorrect because data mirroring duplicates information for backup but doesn't involve voting on operational decisions.
Option d is incorrect because failover clustering switches to backup systems after failure, not simultaneous voting for fault tolerance.

Correct Answer: Trie structure

Trie structures efficiently store and retrieve word sequences, enabling fast prefix-based predictions for keyboard word suggestions and completions.
Option a is incorrect because binary trees don't efficiently handle prefix matching needed for word prediction in keyboard applications.
Option c is incorrect because stack structures use last-in-first-out ordering, unsuitable for analyzing word sequence patterns and predictions.
Option d is incorrect because queue structures use first-in-first-out ordering, not designed for prefix-based word prediction lookups.

Correct Answer: Defensive programming

Defensive programming anticipates potential failures and includes safeguards, critical for safety in battery management systems controlling vehicle power.
Option a is incorrect because event-driven programming responds to events but doesn't specifically emphasize safety checks and failure handling.
Option c is incorrect because extreme programming is an agile development methodology, not specifically focused on safety-critical code.
Option d is incorrect because literate programming emphasizes documentation and readability, not specifically safety and error handling practices.

Correct Answer: Distributed database

Distributed databases maintain synchronized data across multiple locations while allowing independent operation at each site when needed.
Option a is incorrect because centralized databases require constant connectivity and create single points of failure for all locations.
Option c is incorrect because flat file databases lack the sophistication for multi-location synchronization and concurrent access control.
Option d is incorrect because in-memory databases optimize for speed but don't address multi-location data distribution and synchronization.

Correct Answer: Predictable timing

Predictable timing ensures consistent frame delivery intervals, preventing the irregular updates that cause motion sickness in VR.
Option a is incorrect because maximum throughput focuses on total work completed, not the consistent timing VR requires.
Option b is incorrect because minimum latency reduces delays but doesn't guarantee the consistent frame intervals preventing motion sickness.
Option d is incorrect because fair allocation distributes resources equally but doesn't ensure predictable frame timing for VR comfort.

Correct Answer: Rule-based programming

Rule-based programming explicitly defines conditional logic for complex tax rules, making regulations manageable and updateable as laws change.
Option b is incorrect because aspect-oriented programming handles cross-cutting concerns like logging, not complex conditional business rules.
Option c is incorrect because generic programming creates reusable type-independent code, not specialized tax rule processing logic.
Option d is incorrect because concurrent programming handles parallel execution, not the complex conditional logic of tax rules.

Correct Answer: Pessimistic locking

Pessimistic locking prevents access while one editor works, ensuring no conflicts when multiple editors attempt simultaneous article modifications.
Option a is incorrect because optimistic locking allows concurrent edits then detects conflicts later, risking lost work for editors.
Option c is incorrect because read locking prevents reading during updates but doesn't prevent multiple simultaneous write attempts.
Option d is incorrect because table locking is too broad, blocking all articles when only one needs protection from conflicts.

Correct Answer: Dynamic adaptation

Dynamic adaptation allows algorithms to adjust solutions based on changing conditions like missed turns or sudden road closures.
Option a is incorrect because completeness guarantees finding solutions if they exist but doesn't address rapid recalculation needs.
Option b is incorrect because optimality finds best solutions but doesn't specifically handle real-time route adjustments quickly.
Option d is incorrect because space efficiency minimizes memory usage but doesn't ensure quick adaptation to route changes.

Correct Answer: Graph structure

Graph structures naturally represent social connections as nodes and edges, enabling efficient analysis of relationships and mutual connections.
Option a is incorrect because array structures store sequential data but can't efficiently represent complex interconnected social relationships.
Option c is incorrect because heap structures maintain priority ordering for extraction, not designed for relationship network analysis.
Option d is incorrect because list structures store linear sequences, inefficient for analyzing interconnected social network relationships.

Correct Answer: Machine learning

Machine learning algorithms identify patterns in user behavior to automatically adjust schedules without explicit programming of preferences.
Option b is incorrect because hard coding requires programmers to explicitly define all behaviors, preventing automatic preference learning.
Option c is incorrect because batch processing handles groups of tasks at scheduled times, not learning from user patterns.
Option d is incorrect because manual configuration requires users to explicitly set preferences rather than automatic learning.

Correct Answer: Accountability

Accountability ensures every action is traceable to specific individuals, critical for controlled substance regulatory compliance and security.
Option a is incorrect because availability ensures system access but doesn't provide the audit trails required for controlled substances.
Option c is incorrect because scalability handles growth but doesn't address the tracking requirements for controlled substance management.
Option d is incorrect because portability enables system movement between platforms, unrelated to controlled substance audit requirements.

Correct Answer: Spatial partitioning

Spatial partitioning divides space into regions, checking collisions only between objects in nearby regions, dramatically reducing computational requirements.
Option a is incorrect because linear search checks every object pair sequentially, too slow for thousands of real-time collision checks.
Option c is incorrect because random sampling might miss collisions, unacceptable for game physics requiring accurate collision detection.
Option d is incorrect because exhaustive checking tests all possible pairs, computationally impossible for real-time gaming with many objects.

Correct Answer: Small buffers

Small buffers reduce the time between input and output, minimizing latency for real-time audio synthesis and musician responsiveness.
Option a is incorrect because large buffers increase latency by accumulating more data before processing, causing perceptible delays.
Option c is incorrect because variable buffers create unpredictable latency, disrupting the timing musicians need for performance.
Option d is incorrect because no buffers would cause audio dropouts and clicks, making smooth audio synthesis impossible.

Correct Answer: Kiosk mode

Kiosk mode restricts system access to specific applications only, preventing students from accessing unauthorized resources during examinations.
Option a is incorrect because process isolation separates running programs but doesn't prevent launching other applications during exams.
Option c is incorrect because guest accounts limit permissions but still allow access to various applications and websites.
Option d is incorrect because safe mode is for troubleshooting with minimal drivers, not restricting application access during exams.

Correct Answer: Matching algorithm

Matching algorithms optimize pairings between sets based on criteria like distance and route compatibility for ride-sharing efficiency.
Option a is incorrect because sorting algorithms order elements but don't optimize pairings between drivers and passengers.
Option c is incorrect because compression algorithms reduce data size, unrelated to matching drivers with passengers for rides.
Option d is incorrect because encryption algorithms secure data but don't solve the driver-passenger pairing optimization problem.

Correct Answer: Stream processing

Stream processing handles continuous data flows in real-time, processing sensor readings immediately as they arrive without accumulation delays.
Option b is incorrect because batch processing accumulates data before processing, causing unacceptable delays for real-time sensor monitoring.
Option c is incorrect because manual processing requires human intervention, impossible for thousands of readings per second.
Option d is incorrect because offline processing happens after data collection, not suitable for immediate sensor response requirements.

Correct Answer: Write-once storage

Write-once storage prevents modification after initial writing, ensuring document versions remain unaltered for legal compliance requirements.
Option b is incorrect because cache storage optimizes access speed but allows modifications, not suitable for legal document integrity.
Option c is incorrect because temporary storage is designed for short-term use and deletion, inappropriate for legal document retention.
Option d is incorrect because volatile storage loses data when power fails, unacceptable for permanent legal document preservation.

Correct Answer: Graphics processor

Graphics processors excel at parallel mathematical transformations on large datasets, ideal for weather radar signal processing computations.
Option a is incorrect because sound cards process audio signals, not the complex mathematical transformations for weather pattern analysis.
Option b is incorrect because network cards handle data transmission between systems, not mathematical signal processing transformations.
Option d is incorrect because storage controllers manage disk operations, not the parallel computations needed for radar processing.

Correct Answer: Tree structure

Tree structures organize messages hierarchically with replies as children, naturally representing conversation threads and message relationships.
Option a is incorrect because flat structures can't represent the parent-child relationships between messages and their replies.
Option c is incorrect because ring structures connect elements circularly, not suitable for hierarchical message thread organization.
Option d is incorrect because mesh structures create multiple interconnections, overly complex for simple message threading needs.

Correct Answer: Deterministic programming

Deterministic programming produces identical outputs for identical inputs, ensuring robots perform exact welding sequences consistently every time.
Option a is incorrect because adaptive programming changes behavior based on conditions, potentially varying the welding sequence unpredictably.
Option c is incorrect because probabilistic programming includes randomness, incompatible with precision welding requirements for manufacturing.
Option d is incorrect because heuristic programming uses approximations and rules of thumb, not exact precision for welding.