D684 Introduction to Computer Science - Set 1 - Part 1

Correct Answer: Batch processing system

Batch processing systems execute automated tasks sequentially without user interaction, making them ideal for processing large volumes of similar transactions efficiently.
Option a is incorrect because real-time systems prioritize immediate response times for critical operations, not high-volume sequential processing without user interaction.
Option b is incorrect because time-sharing systems are designed to support multiple interactive users simultaneously, not automated sequential transaction processing.
Option d is incorrect because virtual memory is a memory management technique that extends RAM using disk space, not an operating system type.

Correct Answer: Maintaining the program

The maintenance phase occurs after deployment when bugs are fixed and updates are made while the system remains in production use.
Option a is incorrect because testing happens before deployment to identify bugs in a controlled environment, not after the system is operational.
Option c is incorrect because planning the logic occurs early in development when designing the program structure, not after deployment.
Option d is incorrect because understanding the problem is the initial phase where requirements are gathered, not when fixing post-deployment issues.

Correct Answer: Round Robin

Round Robin allocates fixed time slices to each process, ensuring fair resource distribution among multiple users in time-sharing systems.
Option a is incorrect because First-Come First-Served can cause long wait times for users arriving later, creating unfair resource distribution.
Option b is incorrect because Shortest-Job-Next favors shorter processes and can starve longer processes, leading to unfair user treatment.
Option d is incorrect because non-preemptive scheduling allows processes to monopolize the CPU until completion, preventing fair simultaneous access.

Correct Answer: Object-oriented programming

Object-oriented programming uses encapsulation and abstraction to hide implementation details while providing clear interfaces through classes and methods.
Option a is incorrect because imperative programming focuses on step-by-step instructions without built-in mechanisms for hiding implementation details effectively.
Option c is incorrect because logic programming uses facts and rules for inference, not specifically designed for hiding implementation details.
Option d is incorrect because assembly programming is low-level and exposes hardware details rather than hiding implementation complexity from users.

Correct Answer: Binary search

Binary search divides sorted data in half repeatedly, making it exponentially faster than sequential methods for large sorted datasets.
Option a is incorrect because sequential search examines each element one by one, which is extremely slow for millions of records.
Option c is incorrect because bubble sort is a sorting algorithm that arranges data, not a search method for finding specific records.
Option d is incorrect because linear search is another name for sequential search, which is inefficient for large sorted datasets.

Correct Answer: Queue structure

Queue structures follow first-in-first-out principle, ensuring orders are processed in the exact sequence they were received by customers.
Option a is incorrect because stacks follow last-in-first-out principle, which would process the most recent order first, disrupting fairness.
Option c is incorrect because binary trees are hierarchical structures used for efficient searching and sorting, not sequential order processing.
Option d is incorrect because linked lists provide dynamic storage but don't inherently guarantee first-in-first-out processing order without additional logic.

Correct Answer: Lexical analysis

Lexical analysis is the compilation stage where source code is scanned for syntax errors before translation to machine code begins.
Option a is incorrect because runtime execution occurs after compilation when the program is running, not during syntax error detection.
Option c is incorrect because machine code generation happens after syntax verification, when valid source code is converted to executable format.
Option d is incorrect because program maintenance involves updating deployed software, not detecting syntax errors during initial code translation.

Correct Answer: Interpreted language only

Interpreted languages execute line-by-line allowing immediate testing and feedback during development, ideal for rapid prototyping despite slower execution.
Option a is incorrect because compiled languages require full compilation before testing, slowing the prototyping cycle despite faster final execution.
Option c is incorrect because assembly language is low-level and complex, making it unsuitable for rapid prototyping and immediate feedback.
Option d is incorrect because machine code is binary instructions that processors execute directly, not a development language for prototyping.

Correct Answer: Thrashing

Thrashing occurs when excessive paging activity between RAM and disk consumes system resources, severely degrading overall performance.
Option a is incorrect because memory leaks involve programs failing to release allocated memory, not excessive swapping between memory and disk.
Option c is incorrect because cache misses occur when requested data isn't in cache memory, not related to excessive page swapping.
Option d is incorrect because buffer overflow is a security vulnerability where data exceeds allocated buffer space, not a paging issue.

Correct Answer: Wide Area Network

Wide Area Networks connect geographically separated locations like different cities, providing secure communication channels between distant offices.
Option a is incorrect because Local Area Networks only connect devices within a single building or campus, not across different cities.
Option c is incorrect because bus topology is a network arrangement pattern using a single cable, not a network type for geographic connections.
Option d is incorrect because star topology is a network arrangement with a central hub, not a network type for connecting cities.

Correct Answer: Real-time processing

Real-time processing ensures predictable and guaranteed response times, critical for emergency systems where delays could be life-threatening.
Option a is incorrect because high throughput focuses on processing many tasks quickly, not guaranteeing specific response times for critical operations.
Option c is incorrect because memory efficiency optimizes storage usage but doesn't guarantee the predictable timing required for emergency responses.
Option d is incorrect because user-friendly interfaces improve usability but don't ensure the guaranteed response times emergency systems require.

Correct Answer: Devising a plan

Devising a plan involves breaking down complex problems into manageable components and determining the approach to solve each part.
Option a is incorrect because understanding the problem involves identifying requirements and constraints, not breaking it into manageable components yet.
Option c is incorrect because executing the plan means implementing the solution that was already broken down, not the decomposition itself.
Option d is incorrect because reviewing the solution occurs after implementation to verify correctness, not during problem decomposition planning.

Correct Answer: Stack structure

Stack structures follow last-in-first-out principle, perfect for managing items used in reverse order of their collection or addition.
Option a is incorrect because queues follow first-in-first-out principle, which would use power-ups in collection order, not reverse order.
Option c is incorrect because arrays provide indexed access but don't inherently support last-in-first-out behavior without additional programming logic.
Option d is incorrect because tree structures organize data hierarchically for searching and sorting, not for reverse-order item management.

Correct Answer: Selection sort

Selection sort repeatedly finds the minimum element from the unsorted portion and moves it to the beginning of the sorted portion.
Option a is incorrect because bubble sort compares and swaps adjacent elements repeatedly, not specifically finding and moving minimum values.
Option c is incorrect because insertion sort inserts each element into its correct position among previously sorted elements, not finding minimums.
Option d is incorrect because quick sort uses a pivot element to partition data recursively, not by finding and moving minimum values.

Correct Answer: TCP protocol

TCP protocol provides reliable transmission with error checking and retransmission of lost packets, ensuring complete data delivery.
Option a is incorrect because UDP protocol is faster but doesn't guarantee delivery or retransmit lost packets, making it unreliable.
Option c is incorrect because DNS protocol translates domain names to IP addresses, not responsible for reliable data packet transmission.
Option d is incorrect because DHCP protocol automatically assigns IP addresses to devices, not related to reliable data transmission.

Correct Answer: Abstraction

Abstraction hides complex implementation details while providing simple interfaces, like hiding fingerprint matching complexity from developers using it.
Option a is incorrect because inheritance involves deriving properties and behaviors from parent classes, not hiding implementation complexity from users.
Option b is incorrect because polymorphism allows treating different objects uniformly through common interfaces, not specifically hiding implementation details.
Option d is incorrect because compilation is the process of translating source code to machine code, not an object-oriented programming principle.

Correct Answer: Waiting state

Processes enter waiting state when they need resources like I/O operations from storage devices and cannot continue execution.
Option a is incorrect because running state means the process is actively executing on the CPU, not waiting for external resources.
Option b is incorrect because ready state means the process can execute but is waiting for CPU allocation, not waiting for I/O.
Option d is incorrect because terminated state means the process has completed execution entirely, not temporarily waiting for resources.

Correct Answer: Linked list

Linked lists allow dynamic insertions and deletions at any position while maintaining element order through node references and pointers.
Option a is incorrect because static arrays have fixed size and require shifting elements for insertions or deletions, reducing flexibility.
Option c is incorrect because hash tables provide fast lookups using keys but don't maintain insertion order or support positional access.
Option d is incorrect because binary heaps maintain specific ordering properties for priority queues, not general-purpose ordered item management.

Correct Answer: Polymorphism

Polymorphism allows different payment methods to share common interfaces while implementing their specific processing logic uniquely and independently.
Option a is incorrect because encapsulation bundles data with methods but doesn't specifically enable different implementations of common interfaces.
Option c is incorrect because recursion is a programming technique where functions call themselves, not related to interface implementation.
Option d is incorrect because compilation translates source code to machine code, not an OOP concept for designing flexible interfaces.

Correct Answer: Boot process

The boot process initializes computer hardware and loads the operating system from permanent storage into main memory during startup.
Option a is incorrect because paging process involves moving memory pages between RAM and disk during normal operation, not system initialization.
Option c is incorrect because swap process exchanges memory contents between RAM and disk for virtual memory, not initial system loading.
Option d is incorrect because cache process involves storing frequently accessed data in fast memory, not loading the operating system.