Scribd
Upload
19 views4 pages

Min Thant Ko Ko

Uploaded by

min1137311
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views4 pages

Min Thant Ko Ko

Uploaded by

min1137311
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

[Assignment 1: Artificial Intelligence and

Search Algorithms]

[Min Thant Ko Ko]

[ID - 2404001]

[EG1004]
Min Thant Ko Ko ID - 2404001 EG 1004

Part 1: Introduction to AI and Intelligent


Agents
Artificial Intelligence is a machines. They are
made and act like human. They can lean like
human from experience, understand language and
make decisions.The example for AI used daily are
Social Media, Online Shopping and Banking.At
Social media there are many like TikTok use AI and
recommend videos on your watching time. At
Online shopping have Amazon and Alibaba use AI
and recommend products on your search history.
An Intelligent Agents is a computer program or
machine that can see what happening around it. It
uses the information it gets from the environment
to choose the best way to act. The key components
are Leaning.Some agents can lean from their
action and improve over time. They remember
past experiences to make better decisions in the
future.
Real world example of an intelligent agent is a
self-driving car.
The car use cameras to detect other car. The car
controls the steering, brakes, and speed to follow
its decisions.

Part 2: Search Fundamentals

Search algorithms are important in AI because they help


find the best to solve the problem. They allow use AI to
find the best answer without wasting too much time.

Sub-Part 2.1: Breadth-First Search (BFS)

Breadth First Search is an algorithm used to explore


nodes and edges.It starts at a source node and explores
all. Start at the source node. Visit all adjacent node. All
node are explored by visiting their adjacent nodes.

BFS is useful for solving real work problem like the path
in a social network. `BFS explores help people who are
directly connect to you and then move to their friends.

Sub-Part 2.2: Depth-First Search (DFS)

Depth-First Search (DFS) is a way to explore all the


nodes in a graph by following each beach as far as
possible before moving on to next beach. Pick a starting
node and mark it as visited. Move to one of its unvisited
adjacent nodes and mark the node as visited.

DFS is a great for problems where you need to explore all


possible paths or solution .DFS help start at the entrance,
move in a direction, continue moving, and Find the exit.

Part 3: Self-Reflection

https://www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-
graph/

https://www.programiz.com/dsa/graph-dfs#:~:text=Depth%20First
%20Search%20Example&text=We%20use%20an%20undirected
%20graph%20with%205%20vertices.&text=We%20start%20from
%20vertex%200,adjacent%20vertices%20in%20the
%20stack.&text=Next%2C%20we%20visit%20the%20element,go
%20to%20its%20adjacent%20nodes.

Conclusion

AI and intelligent agents are revolutionizing how machines


interact with the world. They learn from experience, make decisions,
and help us in areas like social media, shopping, and transportation.
Search algorithms like BFS and DFS are key tools in AI, helping to
explore data efficiently and solve complex problems. BFS works by
exploring level by level, while DFS dives deep into each path before
backtracking. Both methods are crucial in building smart systems
that improve our daily lives.

You might also like