Week_9_Lec17_18.pptx Overview of Deep Learning

Searching algorithms are methods used to retrieve information stored within data structures, such as arrays, lists, or databases. They can be classified into two main categories: linear search, which examines each element sequentially, and binary search, which divides the data into halves to quickly locate the target value in a sorted list. These algorithms are fundamental in computer science for efficient data retrieval and play a crucial role in optimizing the performance of various applications and systems.

1. Searching Algorithms 03/10 Search algorithms in AI are used to find solutions to problems by exploring possible states and transitions between them. These algorithms can be categorized into two main types: Informed (heuristic) search Uninformed (blind) search.

2. 05/10 Breadth-First Search (BFS) In BFS, you systematically explore all possible paths starting from the initial state (your current location) and expanding outward level by level. You visit adjacent states before moving to deeper levels of the search tree. Uninformed Algorithms

3. Applications in SE 06/10 Social Networking : Finding Connections In social networking platforms like Facebook or LinkedIn, BFS can be used to find connections between users. Starting from a user's profile, BFS can explore the network of friends or connections, identifying mutual friends or potential contacts within a certain number of degrees of separation. Web Crawling: Indexing webpages Search engines use web crawlers to index web pages and gather information about the structure of the web. BFS can be employed to crawl the web systematically, starting from a set of seed URLs and exploring links on each page to discover and index new web pages.

4. Applications in SE 07/10 Shortest Path in Unweighted Graphs BFS can be used to find the shortest path between two nodes in an unweighted graph. For example, in a transportation network represented as a graph where nodes are locations and edges are roads or connections between locations, BFS can find the shortest route between two locations without considering weights or distances. Network Routing: Broadcasting Messages In computer networks, BFS can be used for broadcasting messages or data packets to all nodes in the network.

5. Graph (Weighted/ Unweighted graph) 08/10 In computer science and mathematics, a graph is a data structure that consists of a set of nodes (vertices) connected by edges. Graphs are used to model pairwise relationships between objects. Here's a detailed definition: Graph: A graph 𝐺 G is an ordered pair ( 𝑉 , 𝐸 ) (V,E) comprising: V, a set of vertices or nodes., 𝐸 , a set of edges, where each edge is a pair (𝑢, 𝑣 ) ( u,v ) that connects two vertices 𝑢 u and 𝑣 v.

6. 09/10 Graph Summary