What is Software Testing -Software Testing is the process of evaluating and verifying that a

software application meets its expected requirements and is free of defects. It helps ensure
the quality, reliability, and performance of software.

Define test strategy -A Test Strategy is a high-level document that defines the approach,
objectives, resources, and schedule for software testing activities. It outlines the testing
scope, tools, methodologies, and risk management strategies.

List technique for Software Testing- Black Box ,Testing White Box Testing ,Gray Box
Testing, Unit Testing ,Integration Testing ,System Testing ,Acceptance Testing ,Regression
Testing ,Performance Testing ,Security Testing.

Define Whitebox Testing-White Box Testing (also known as structural testing) is a testing
technique where the internal structure, code, and logic of the software are examined. It
requires knowledge of the code and is mainly used for unit testing.

Define Blackbox Testing- Black Box Testing is a software testing technique where the tester
does not need to know the internal code structure. It focuses on verifying the functionality of
the software by providing inputs and checking outputs.

Define Cyclomatic complexity- Cyclomatic Complexity is a software metric used to

measure the complexity of a program by calculating the number of independent paths in the
program’s control flow graph. It helps in determining the minimum number of test cases
required.

What is the purpose of VVA BVA- It is used to identify defects and errors in software by
testing input values on the boundaries of the allowable ranges. The goal of boundary
value analysis is to find any issues which may arise due to incorrect assumptions about the
system behavior.

Define data flow testing- Data Flow Testing is a white-box testing technique that examines
the flow of data within a program to identify potential issues such as uninitialized variables,
redundant computations, and incorrect data handling.

Define STLC- STLC is a process that defines di erent stages of software testing. The key
phases include: 1. Requirement Analysis
2. Test Planning
3. Test Case Development
4. Test Environment Setup
5. Test Execution
6. Test Closure

List any two objectives of Software testing-

1. To ensure that the software meets its functional and non-functional requirements.
2. To identify and fix defects to improve software quality.
Define Software matric- A Software Metric is a standard of measurement used to quantify
software attributes such as complexity, quality, and performance.

Define verification and validation

Verification: Ensures the software is being developed correctly (reviews, inspections,
walkthroughs).
Validation: Ensures the software meets customer expectations and requirements
(actual testing).

What is measurement- Measurement in software testing refers to the process of quantifying

attributes related to software quality, performance, and e iciency.

List level for testing –1. Unit Testing

2. Integration Testing
3. System Testing
4. Acceptance Testing

What is purpose of load testing- Load Testing evaluates a system’s performance under
expected and peak loads to identify bottlenecks and ensure stability.

Compare Alpha and Beta testing –

Feature Alpha Testing Beta Testing
Conducted
Internal Testers End-users
By
In-house, simulated
Environment Real-world environment
environment
Gather user feedback before
Objective Identify early defects
release
Stage Before beta testing Before final release

Define performance testing- Performance Testing evaluates the speed, responsiveness, and
stability of a system under various conditions.

Define test plan - A Test Plan is a document that outlines the scope, objectives, approach,
resources, and schedule for software testing.

Define Web application -A Web Application is a software application that runs on web
browsers using the internet, typically developed using HTML, CSS, and JavaScript.
Deadlock – Deadlock is a situation where two or more processes are stuck, each
waiting for a resource held by another.

When Deadlock Occurs – Deadlock occurs when processes hold resources and wait
indefinitely for resources held by others.

Necessary Conditions for Deadlocks – Mutual exclusion, hold and wait, no

preemption, and circular wait.

Safety Algorithm – A method to check whether a system is in a safe state to avoid

deadlock.

Purpose of Safety Resource Algorithm – It ensures that resource allocation does not
lead to deadlock by checking safe states.

System Model – A system model represents processes, resources, and their

interactions in a computing environment.

Deadlock Detection – The process of identifying deadlocks in a system by analyzing

resource allocation and process states.

Deadlock Avoidance – A strategy that ensures resource allocation does not lead to
deadlock by keeping the system in a safe state.

Killing Process in Deadlocks – Terminating one or more processes to break the

deadlock and release resources.

Methods for Deadlock Recovery – Process termination, resource preemption, and

rollback mechanisms.

Banker’s Algorithm in Deadlocks – It prevents deadlocks by only granting resources if

they keep the system in a safe state.

Sequence of Resource Utilization – Request resource → Use resource → Release

resource.

Wait-for-Graph – A directed graph showing which processes are waiting for resources
held by other processes.

Justification for Avoiding Deadlocks – Deadlocks freeze system resources, causing

ine iciency and potential data loss, so they must be avoided.

Safe and Unsafe States – A safe state allows resource allocation without deadlock,
while an unsafe state risks leading to deadlock.

Safe Sequence – An order in which processes can execute safely without causing
deadlock.
Starvation in Deadlocks – Starvation occurs when a process waits indefinitely because
higher-priority processes keep getting resources first.

File – A file is a collection of related data stored on a computer with a specific name.

File Attribute – A file attribute is information about a file, such as its name, size, type,
and permissions.

File Structure – File structure refers to the way data is organized within a file for easy
access and storage.

File Operation – A file operation is an action performed on a file, like opening, reading,
writing, or deleting it.

Acyclic Graph – An acyclic graph is a graph that has no cycles, meaning it does not loop
back to itself.

Free Space Management – Free space management keeps track of unused storage
space in a system.

Purpose of File System – The file system organizes, stores, retrieves, and manages files
e iciently on storage devices.

Directory – A directory is a folder that stores files and other directories in an organized
way.

Types of Directories – Single-level, two-level, tree-structured, acyclic graph, and

general graph directories.

False – An acyclic graph does not have cycles, but it allows directories to share files and
subdirectories.

Bit Vector – A bit vector is a sequence of bits used to track free and allocated storage
blocks.

File Allocation – File allocation is the method of storing files on disk using di erent
strategies like contiguous, linked, or indexed allocation.

Justification – A newly created directory has two automatic entries: . (current

directory) and .. (parent directory).

Basic File Operations – Open, read, write, close, delete, rename, and move.

Justification – In a single-level directory, all files are stored in one root directory without
subdirectories, making file organization simple but less e icient.
File Access Methods – Sequential access, direct access, and indexed access.
File System Management – It is the process of handling files and directories e iciently
for storage, access, and retrieval.

Purpose of Linked List in Free Space Management – It helps track free storage blocks
by linking them together, reducing fragmentation and improving allocation e iciency.

Disk Scheduling – Disk scheduling is the process of deciding the order in which disk I/O
requests are processed to improve e iciency.

Disk Management – Disk management handles the storage, organization, and retrieval
of data on a disk, including formatting and partitioning.

Rotational Latency – Rotational latency is the time taken for the disk platter to rotate
and position the desired sector under the read/write head.

Sector and Tracks in Hard Disks – A sector is the smallest storage unit on a disk, and a
track is a circular path on a disk where data is stored.

Purpose of SCAN – SCAN moves the disk arm back and forth like an elevator to serve all
requests in one direction before reversing.

Disk Scheduling Algorithm – A method used to determine the order of disk I/O
requests to reduce seek time and improve performance.

Purpose of Disk Scheduling – It minimizes seek time and improves the e iciency of
reading and writing data on a disk.

LOOK – LOOK is a modified version of SCAN that moves only as far as the last request in
each direction before reversing.

Bad Blocks – Bad blocks are damaged areas on a disk that cannot store data properly
due to physical or logical defects.

Disk Formatting – Disk formatting is the process of preparing a storage device for data
storage by setting up a file system.

Justification for SCAN as an Elevator Algorithm – SCAN works like an elevator by

moving in one direction, serving requests, then reversing when it reaches the last
request.

C-LOOK – C-LOOK is a variant of LOOK where the disk arm moves in one direction to the
last request, then jumps back to the first request without servicing requests on the way
back.

Distributed System – A distributed system is a collection of computers working

together as a single unit to share resources and process tasks.
Distributed Operating System – A distributed operating system manages multiple
computers as if they are a single system, coordinating processes and resources.

System Architecture – System architecture is the structure that defines how di erent
components of a system interact and function together.

Grid – A grid is a network of computers working together to perform large-scale

computations by sharing resources.

Design Goals for Distributed System – Transparency, scalability, fault tolerance,

resource sharing, and security.

Types of Distributed Systems – Client-server, peer-to-peer (P2P), grid computing,

cloud computing, and cluster computing.

P2P Architecture – A peer-to-peer (P2P) architecture allows computers (peers) to share

resources without relying on a central server.

NFS (Network File System) – NFS is a protocol that allows remote file access over a
network as if they were local.

SOA (Service-Oriented Architecture) – SOA is a design approach where software

services communicate over a network to perform tasks.

Web-based Distributed Systems – These are systems that use the internet to connect
and operate distributed applications across multiple devices.

Cluster – A cluster is a group of computers working together as a single system to

provide better performance and reliability.

Sensor Network – A sensor network is a group of small devices (sensors) that collect
and transmit data wirelessly.

Object-based Architectures – These architectures use objects as fundamental units of

communication and processing in a distributed system.

Resource-centered Architecture Style – It is a design approach where resources (such

as web pages or services) are the main focus of interaction.

Cloud – The cloud is a network of remote servers that store, manage, and process data
over the internet.

Example of Hybrid Cloud – A company using both private cloud storage for sensitive
data and public cloud services for general computing.
Mobile Computing – Mobile computing allows users to access data and applications
from anywhere using portable devices and wireless networks.