CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

2-mark answers:

1. What is OLTP?
OLTP (Online Transaction Processing) refers to a system that manages real-time transaction
data, ensuring fast, accurate, and consistent processing. It is used in applications like banking
and e-commerce.

2. What is OLAP?
OLAP (Online Analytical Processing) is a data processing system that enables complex
queries and multidimensional analysis for business intelligence and decision-making.

3. Define ETL tools.

ETL (Extract, Transform, Load) tools are used to extract data from multiple sources,
transform it into a suitable format, and load it into a data warehouse for analysis.

4. What is a data mart?

A data mart is a subset of a data warehouse focused on a specific business function,
department, or user group for easy access to relevant data.

5. Define Data Frames.

Data Frames are data structures used in programming languages like Python (Pandas) and R,
consisting of rows and columns similar to a database table.

6. What is a Data Mart?

(Repeated question, see answer to Q4.)

7. What is Robotics?
Robotics is the branch of technology that deals with the design, construction, and operation
of robots to automate tasks typically performed by humans.

8. Define Spark.
Apache Spark is an open-source big data processing framework that enables fast, distributed
computing with support for machine learning, SQL, and real-time data streaming.

9. Define artificial intelligence.

Artificial Intelligence (AI) is a branch of computer science that enables machines to simulate
human intelligence, including learning, reasoning, and decision-making.

10. List any two applications of a data warehouse.

• Business intelligence and reporting

• Customer relationship management (CRM)

11. List any two applications of artificial intelligence.

• Chatbots and virtual assistants

• Autonomous vehicles

12. What is data integration?

Data integration is the process of combining data from multiple sources to provide a unified
and consistent view for analysis and decision-making.

1
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

13. What is RDD?

RDD (Resilient Distributed Dataset) is the fundamental data structure in Apache Spark,
enabling fault-tolerant, parallel processing of large datasets.

14. Define Ridge.

Ridge (Ridge Regression) is a machine learning technique that helps prevent overfitting in
linear regression by adding a penalty (L2 regularization) to the model.

4-mark answers

1. Describe the Architecture of Data Warehouse and Applications

A Data Warehouse (DW) is a system designed to store, integrate, and analyze large amounts of
structured data from various sources to support decision-making processes. It follows a three-tier
architecture:

1. Bottom Tier – Data Source Layer

This layer is responsible for extracting data from multiple sources, including:

• Operational Databases (e.g., MySQL, Oracle, SQL Server)

• Flat Files (e.g., CSV, XML, JSON)

• External Data Sources (e.g., APIs, third-party providers)

• Cloud Storage (e.g., AWS S3, Google Cloud Storage)

The data is extracted using ETL (Extract, Transform, Load) processes, where it is cleaned,
transformed, and loaded into the data warehouse.

2. Middle Tier – Data Storage and Processing Layer

This is the core of the data warehouse, where processed data is stored and structured for analytical
queries.

• Data Storage: The data is organized using:

o Star Schema (simpler, better performance)

o Snowflake Schema (more normalized, reduces redundancy)

• Data Processing: This layer supports OLAP (Online Analytical Processing) for
multidimensional analysis.

• Metadata Management: Stores definitions, rules, and business logic for understanding data
relationships.

3. Top Tier – Business Intelligence & Applications Layer

This layer is used for querying, reporting, and visualizing data.

• BI (Business Intelligence) Tools like Tableau, Power BI, Looker.

• Dashboards & Reports for analytics.

• Data Mining & Machine Learning for trend analysis and predictions.

2
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

Applications of Data Warehousing

• Business Intelligence & Analytics – Helps organizations make data-driven decisions.

• Financial Reporting – Analyzes revenues, fraud detection, and financial risk.

• Customer Relationship Management (CRM) – Tracks customer interactions and behaviors.

• Supply Chain Management – Optimizes inventory, logistics, and vendor relationships.

2. Explain Briefly the Various Components of Spark

Apache Spark is an open-source, distributed computing system used for big data processing and
analytics. It is known for its speed, scalability, and ease of use.

Major Components of Apache Spark:

1. Spark Core

o The foundation of Spark.

o Handles memory management, scheduling, fault tolerance, and distributed

computing.

o Provides APIs in Java, Scala, Python, and R.

2. Spark SQL

o Provides SQL-based querying for structured data.

o Supports integration with databases and data warehouses.

o Used in big data analytics and data warehousing.

3. Spark Streaming

o Enables real-time data processing.

o Integrates with Apache Kafka, Flume, and HDFS.

o Used in applications like fraud detection and social media analytics.

4. MLlib (Machine Learning Library)

o Provides machine learning algorithms such as classification, regression, clustering.

o Supports recommendation systems and anomaly detection.

5. GraphX

o A graph processing engine for analyzing large-scale graphs.

o Used in social network analysis and fraud detection.

6. Cluster Managers

o Spark runs on multiple cluster managers, including:

▪ Standalone Mode (default)

3
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

▪ Apache Mesos

▪ Hadoop YARN

▪ Kubernetes

3. Explain the Three Important Artificial Intelligence Techniques

Artificial Intelligence (AI) uses various techniques to simulate human intelligence. The three major AI
techniques are:

1. Machine Learning (ML)

• A subset of AI that enables machines to learn from data.

• Three types:

o Supervised Learning – Uses labeled data (e.g., email spam detection).

o Unsupervised Learning – Finds patterns without labels (e.g., customer

segmentation).

o Reinforcement Learning – Learns through trial and error (e.g., robotics, self-driving
cars).

2. Expert Systems

• Mimic human decision-making using if-then rules.

• Example: Medical diagnosis systems, where the system suggests treatments based on
symptoms.

3. Natural Language Processing (NLP)

• Enables machines to understand, process, and generate human language.

• Used in applications like:

o Chatbots (Siri, Alexa, Google Assistant)

o Language translation (Google Translate)

o Sentiment analysis (social media monitoring)

4. What Are the Differences Between OLTP and OLAP?

OLTP (Online Transaction Processing) and OLAP (Online Analytical Processing) serve different
purposes in data management.

Feature OLTP (Online Transaction Processing) OLAP (Online Analytical Processing)

Supports business intelligence and

Purpose Handles real-time transactions
analytics

4
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

Feature OLTP (Online Transaction Processing) OLAP (Online Analytical Processing)

Data Type Raw transactional data Historical, aggregated data

Query
Simple (INSERT, UPDATE, DELETE) Complex (JOINs, GROUP BY, aggregation)
Complexity

Response Time Fast (Milliseconds) Slower (Seconds to Minutes)

Data Volume Small (Few MBs to GBs) Large (GBs to TBs or more)

Highly normalized (reduces

Normalization Denormalized (optimized for queries)
redundancy)

Performance Optimized for fast transactions Optimized for complex analytical queries

Storage Relational databases (MySQL, Data warehouses (Amazon Redshift,

Structure PostgreSQL, Oracle) Google BigQuery)

ATM transactions, e-commerce,

Example Sales analysis, financial reporting
booking systems

Conclusion

• OLTP systems are designed for day-to-day transaction processing (e.g., banking, retail).

• OLAP systems are optimized for analytical processing, helping businesses make better
decisions.

5. Differentiate Between MOLAP and HOLAP

MOLAP (Multidimensional OLAP) and HOLAP (Hybrid OLAP) are two types of OLAP (Online Analytical
Processing) systems used for data analysis in a data warehouse.

Feature MOLAP (Multidimensional OLAP) HOLAP (Hybrid OLAP)

Stores pre-aggregated data in Uses a combination of MOLAP cubes and

Storage
multidimensional cubes. relational databases.

Query Very fast due to pre-calculated Balances performance and storage

Performance aggregations. efficiency.

Limited scalability due to storage Can handle large datasets by storing detail
Data Volume
constraints. data in relational databases.

Requires more time to preprocess More flexible, as it can switch between pre-
Processing Time
and aggregate data. aggregated data and detailed data.

5
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

Feature MOLAP (Multidimensional OLAP) HOLAP (Hybrid OLAP)

Best for quick, complex queries in Best for applications that require both high
Use Case
smaller datasets. performance and scalability.

Microsoft Analysis Services (SSAS)

Example SAP BW (Business Warehouse)
MOLAP

Summary

• MOLAP is faster but requires more storage.

• HOLAP is a hybrid approach that provides a balance between speed and scalability.

6. Describe Techniques of Data Mining

Data mining is the process of extracting hidden patterns and insights from large datasets. The most
common data mining techniques include:

1. Classification

• Categorizes data into predefined groups.

• Example: Spam detection (emails classified as spam or not spam).

2. Clustering

• Groups similar data points together based on shared characteristics.

• Example: Customer segmentation in marketing.

3. Association Rule Mining

• Identifies relationships between different items.

• Example: Market Basket Analysis – "Customers who buy bread often buy butter."

4. Regression Analysis

• Predicts numerical values based on past data.

• Example: Stock price prediction.

5. Anomaly Detection

• Identifies unusual patterns in data.

• Example: Fraud detection in banking.

6. Decision Trees

• A tree-like model for decision-making.

• Example: Used in medical diagnosis to suggest treatments based on symptoms.

7. Neural Networks

6
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

• Mimics human brain functioning for deep pattern recognition.

• Example: Facial recognition systems.

7. What Are the Disadvantages of 'Hill Climbing' in Artificial Intelligence?

Hill Climbing is an AI search algorithm used to find an optimal solution by incrementally improving a
candidate solution.

Disadvantages of Hill Climbing

1. Local Maxima Problem

o The algorithm may get stuck in a suboptimal solution instead of finding the global
best solution.

2. Plateau Problem

o In flat regions of the search space, the algorithm may stop making progress.

3. Ridges Problem

o Narrow paths that require movement in multiple directions can cause difficulty in
finding the best path.

4. No Backtracking

o Hill Climbing does not remember past states, so it cannot recover if it gets stuck.

5. Sensitive to Initial State

o The final solution depends on where the search starts.

Example

• In robotics, hill climbing may result in the robot getting stuck in a small hole instead of
reaching the destination.

8. What Are the Disadvantages of Depth First Search (DFS)?

DFS is a search algorithm that explores a path deep into a graph before backtracking.

Disadvantages of DFS

1. Can Get Stuck in Infinite Loops

o If the graph has cycles, DFS may revisit nodes infinitely.

2. Not Always Optimal

o DFS does not guarantee the shortest path.

3. Memory Usage in Deep Graphs

o If the tree or graph is deep, DFS uses a large amount of stack space (risk of stack
overflow).

7
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

4. Explores Unnecessary Paths

o DFS may waste time exploring irrelevant paths.

Example

• In maze solving, DFS may go down the wrong path and backtrack multiple times, making it
inefficient.

9. Write the Advantages of Bidirectional Search

Bidirectional Search is an AI search algorithm that runs two simultaneous searches:

• One from the start node to the goal.

• One from the goal node to the start.

Advantages of Bidirectional Search

1. Faster than Unidirectional Search

o The search space is reduced exponentially, making it faster than BFS or DFS.

2. Efficient Memory Usage

o Since the search expands from both sides, fewer nodes are stored in memory.

3. Guaranteed Optimal Solution

o If using BFS in both directions, Bidirectional Search finds the shortest path.

4. Reduces Computational Cost

o Instead of searching the entire space, it meets in the middle, significantly reducing
time complexity.

Example Use Case

• GPS Navigation Systems: When finding the shortest route, bidirectional search can reduce
search time by working from both the current location and the destination.

10. Explain Breadth First Search (BFS) Technique of Artificial Intelligence

BFS is a graph traversal algorithm used in AI to explore all possible solutions level by level.

How BFS Works

1. Start from the root node.

2. Explore all its immediate child nodes.

3. Move to the next level and repeat until the goal is found.

Characteristics of BFS

• Uses a queue (FIFO) structure.

8
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

• Finds the shortest path in an unweighted graph.

• Time Complexity: O(V + E) (where V = vertices, E = edges).

• Space Complexity: Can be high, as it stores all nodes at a level.

Example Use Case

• Social Network Connections: BFS can find the shortest link between two people.

11. How is Apache Spark Different from MapReduce?

Both Apache Spark and MapReduce are used for big data processing, but Spark is much faster.

Feature Apache Spark MapReduce (Hadoop)

Processing Slower because it reads from disk

100x faster due to in-memory computing.
Speed between stages.

Computing
In-memory computing. Disk-based computing.
Type

Ease of Use Simpler APIs in Python, Scala, Java, R. Complex Java-based code.

Iterative
Best for ML & AI (fast iterations). Not efficient for iterative tasks.
Processing

Failure Uses RDDs (Resilient Distributed

Uses checkpointing but is slower.
Recovery Datasets) for fault tolerance.

Real-time analytics, AI, ML, and Batch processing (log processing,

Best Used For
streaming data. large-scale indexing).

Conclusion

• Spark is ideal for real-time processing and machine learning.

• MapReduce is better for traditional batch processing.

12. Explain Any Four Uses of Data Warehouse

A Data Warehouse stores historical data for analytics. It is widely used in various industries.

1. Business Intelligence & Reporting

• Companies use BI tools (Tableau, Power BI) to generate insights from stored data.

2. Financial Analysis & Fraud Detection

• Banks use data warehouses to detect suspicious transactions and risk assessment.

3. Customer Relationship Management (CRM)

9
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

• E-commerce platforms use data warehousing to analyze customer buying behavior.

4. Healthcare & Medical Research

• Hospitals analyze patient history to improve treatment plans.

13. What Are the Major Steps Involved in the ETL Process?

ETL (Extract, Transform, Load) is the process of moving data from various sources into a data
warehouse.

Step 1: Extract

• Data is collected from multiple sources:

o Databases (MySQL, SQL Server)

o APIs (Web Services)

o Flat files (CSV, JSON, XML)

Step 2: Transform

• Data is cleaned, standardized, and processed.

• Operations include:

o Removing duplicates

o Data validation (correcting errors)

o Data aggregation (summarization)

Step 3: Load

• The transformed data is stored in a data warehouse for analysis.

Example

• Retail Company ETL Process:

o Extracts sales data from POS systems.

o Transforms raw data into structured reports.

o Loads the final reports into a business intelligence dashboard.

14. Missionaries and Cannibals Problem Statement and Solution

Problem Statement

The Missionaries and Cannibals problem is a classic AI problem that involves three missionaries and
three cannibals trying to cross a river using a boat. The boat can hold at most two people at a time.

Rules & Constraints:

• The boat cannot cross the river without at least one person onboard.

10
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

• If at any point the number of cannibals is greater than the missionaries on either side of the
river, the cannibals will eat the missionaries.

Solution (State Representation & Moves)

Each state can be represented as (M, C, B) where:

• M = Number of missionaries on the left side.

• C = Number of cannibals on the left side.

• B = Position of the boat (left or right).

Solution Path (One Possible Solution)

1. Move (M2, C3, Right) - (Two missionaries cross)

2. Move (M2, C3, Left) - (One missionary returns)

3. Move (M2, C1, Right) - (Two cannibals cross)

4. Move (M3, C1, Left) - (One cannibal returns)

5. Move (M0, C1, Right) - (Two missionaries cross)

6. Move (M1, C1, Left) - (One missionary returns)

7. Move (M1, C0, Right) - (Two cannibals cross)

8. Move (M3, C0, Left) - (One cannibal returns)

9. Move (M0, C0, Right) - (Two missionaries cross)

Final State: (0,0,Right) → Everyone has crossed safely!

15. Explain Graph Mining in Brief

What is Graph Mining?

Graph mining is a data mining technique used to analyze and extract patterns from graph-based
structures. It is used in applications like social networks, fraud detection, and web page ranking.

Key Techniques in Graph Mining:

1. Frequent Subgraph Mining – Identifies recurring patterns in graphs (e.g., social network
friendships).

2. Link Prediction – Predicts future connections in a network (e.g., friend suggestions in

Facebook).

3. Community Detection – Groups similar nodes into clusters (e.g., customer segmentation).

4. Anomaly Detection – Identifies unusual patterns (e.g., credit card fraud).

Example Applications:

• Google PageRank Algorithm (analyzes web pages).

11
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

• Social Network Analysis (identifies influencers in Twitter, LinkedIn).

• Biological Network Analysis (studying protein interactions).

16. What is a Heuristic Function?

A heuristic function (h(n)) is used in AI search algorithms to estimate the cost of reaching the goal
from a given node. It helps in optimizing search algorithms like A and Greedy Search*.

Example:

In the A algorithm*, the total cost is calculated as:

f(n)=g(n)+h(n)f(n) = g(n) + h(n)
Where:

• g(n) = Cost from start node to current node.

• h(n) = Heuristic estimate from current node to goal.

Real-World Example:

• In a GPS Navigation System, the heuristic function estimates the remaining distance to the
destination using a straight-line distance (Euclidean distance).

17. Write Any Four Applications of Data Mining

Data Mining is used to discover patterns and trends from large datasets.

1. Fraud Detection (Banking & Finance)

• Identifies suspicious transactions using anomaly detection techniques.

• Example: Credit card fraud detection using AI.

2. Healthcare & Medical Diagnosis

• Helps in predicting diseases based on medical records.

• Example: AI-assisted cancer detection.

3. E-commerce & Recommendation Systems

• Predicts customer preferences using association rule mining.

• Example: Amazon product recommendations ("Customers who bought this also bought...").

4. Social Media Analytics

• Sentiment analysis helps businesses understand customer opinions.

• Example: Twitter analyzing trending topics using AI.

Graph Search Techniques: BFS, DFS, and Bidirectional Search

12
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

Graph search algorithms are used in Artificial Intelligence (AI) and Computer Science to traverse or
search through graphs and trees.

1. Breadth-First Search (BFS)

What is BFS?

• BFS is a level-order traversal technique where all nodes at the current depth level are
explored before moving to the next level.

• It is implemented using a queue (FIFO – First In, First Out).

How BFS Works

1. Start from the initial node (root).

2. Enqueue the node and mark it as visited.

3. Dequeue a node from the front and explore its unvisited neighbors.

4. Add the neighbors to the queue.

5. Repeat until the queue is empty.

Example (BFS Traversal of a Graph)

Given Graph:

/\

B C

/\ \

D E F

BFS Order: A → B → C → D → E → F

Characteristics of BFS

✔ Finds the shortest path in an unweighted graph.

✔ Guarantees completeness (will always find a solution if one exists).
Consumes more memory (as it stores multiple nodes in the queue).
Not efficient for deep graphs.

Use Cases

• Shortest path problems (e.g., GPS navigation).

• Social network friend suggestions.

• Web crawling (Google search engine).

13
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

2. Depth-First Search (DFS)

What is DFS?

• DFS explores as deep as possible before backtracking.

• It uses a stack (LIFO – Last In, First Out) for traversal.

How DFS Works

1. Start from the root node and push it onto the stack.

2. Pop the top node, explore its unvisited neighbors, and push them onto the stack.

3. Repeat until all nodes are visited or the goal is found.

Example (DFS Traversal of a Graph)

Given Graph:

/\

B C

/\ \

D E F

DFS Order: A → B → D → E → C → F

Characteristics of DFS

✔ Uses less memory than BFS (does not store all nodes at a level).
✔ Works well with deep graphs.
✔ Good for topological sorting (dependency graphs).
Does not guarantee the shortest path.
Can get stuck in infinite loops if cycles exist.

Use Cases

• Maze solving algorithms.

• Solving puzzles (like Sudoku).

• Detecting cycles in graphs.

3. Bidirectional Search

What is Bidirectional Search?

• Two simultaneous BFS searches:

1. One from the start node.

2. One from the goal node.

14
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

• The search stops when both searches meet in the middle.

How Bidirectional Search Works

1. Start BFS from both the initial node and goal node.

2. Expand both frontiers level by level.

3. When they meet at a common node, the path is found.

Example (Finding Shortest Path)

Graph:

A -- B -- C -- D -- E -- F

• Start BFS from A (→ direction).

• Start BFS from F (← direction).

• They meet at C, so path A → B → C → D → E → F is found faster.

Characteristics of Bidirectional Search

✔ Reduces search space (O(2^(d/2)) instead of O(2^d)).

✔ Finds the shortest path faster than BFS or DFS alone.
✔ Efficient for large graphs.
Requires extra memory (stores two search trees).
Complex implementation (handling two searches simultaneously).

Use Cases

• Pathfinding in AI (e.g., GPS, Chess AI).

• Robot motion planning.

• Network routing algorithms.

Comparison Table: BFS vs. DFS vs. Bidirectional Search

Feature BFS DFS Bidirectional Search

Two Queues (for forward &

Data Structure Queue (FIFO) Stack (LIFO)
backward search)

Always finds a
Completeness If the graph is finite Always finds a solution
solution

Finds the shortest May not find the

Optimality Finds the shortest path
path shortest path

High (stores all Low (stores only

Memory Usage Lower than BFS
nodes at a level) the depth path)

15
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

Feature BFS DFS Bidirectional Search

Shortest path, Deep graphs, Large graphs, shortest path

Best for
unweighted graphs topological sorting problems

Complexity (Worst
O(V + E) O(V + E) O(2^(d/2))
Case)

1. Water Jug Problem in Artificial Intelligence

Problem Statement

Given two jugs with capacities X liters and Y liters, and an unlimited water supply, the goal is to
measure exactly Z liters using the jugs.

Example:

Jugs: (5-liter & 3-liter jugs)

Target: Measure 4 liters

State Representation (X, Y)

• (X, Y) represents the water level in the 5L and 3L jugs, respectively.

Valid Operations

1. Fill a Jug → Completely fill a jug.

2. Empty a Jug → Completely empty a jug.

3. Pour Water → Transfer water from one jug to another until the receiving jug is full or the
pouring jug is empty.

Solution (Using BFS/DFS)

1. (0,0) → Fill 5L Jug → (5,0)

2. (5,0) → Pour 5L into 3L Jug → (2,3)

3. (2,3) → Empty 3L Jug → (2,0)

4. (2,0) → Pour 2L into 3L Jug → (0,2)

5. (0,2) → Fill 5L Jug → (5,2)

6. (5,2) → Pour 5L into 3L Jug → (4,3) [Solution Found]

Diagram Representation

(0,0) → (5,0) → (2,3) → (2,0) → (0,2) → (5,2) → (4,3)

✔ AI Approach: Solved using search algorithms (BFS/DFS).

2. Snowflake Schema

16
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

Definition:

The Snowflake Schema is a type of database schema used in data warehousing, where a central fact
table is connected to multiple dimension tables, which are further normalized into sub-dimensions.

Characteristics:

✔ Highly normalized (removes redundant data).

✔ Reduces storage costs.
✔ Requires complex joins (slower query performance).

Example Diagram:

Time_Dim Location_Dim

| |

V V

Fact_Table → Product_Dim → Supplier_Dim

✔ Used in: Banking, e-commerce, and healthcare databases.

3. ETL Process

Definition:

ETL (Extract, Transform, Load) is a process in data warehousing to collect, process, and store data.

Steps in ETL Process:

1. Extract: Fetch data from multiple sources (Databases, APIs, CSV files).

2. Transform: Clean, format, and structure data (e.g., removing duplicates, converting formats).

3. Load: Store processed data into a data warehouse.

Diagram Representation:

Source Data → Extract → Transform → Load → Data Warehouse

✔ Used in: Business intelligence, data analytics, machine learning.

4. Means-End Analysis (MEA) in Artificial Intelligence

Definition:

MEA is a heuristic search strategy that breaks down a large problem into smaller sub-problems by
reducing the difference between the current state and the goal state.

Steps in MEA:

1. Identify the current state.

2. Compare it with the goal state.

17
 CA - 601 : RECENT TRENDS IN INFORMATION TECHNOLOGY

3. Determine the differences.

4. Apply operators/actions to minimize the differences.

5. Repeat until the goal is achieved.

Example: (Robot Navigation)

Goal: Move a robot from (A) to (B).

1. Identify the difference between A and B.

2. Apply actions like Move Forward, Turn Left, or Turn Right.

3. Continue adjusting until reaching (B).

✔ Used in: Problem-solving, game AI (e.g., Chess, Robotics).

18