Name - Aastha Jain

Roll no. - 21/413

Branch - Information technology
Batch - G1
 ASSIGNMENT - 1

1. What is learning? Explain different types of learning.

Learning is “a process that leads to change, which occurs as a result
of experience and increases the potential for improved performance
and future learning”. There are three general categories of learning
that artificial intelligence (AI)/machine learning utilizes to actually
learn. They are Supervised Learning, Unsupervised Learning and
Reinforcement learning.
• Supervised Learning: It describes a class of problem that
involves using a model to learn a mapping between input
examples and the target variable. The machine has a “teacher”
who guides it by providing sample inputs along with the desired
output. The machine then maps the inputs and the outputs.
This is similar to how we teach very young children with picture
books.
• Unsupervised Learning: It describes a class of problems that
involves using a model to describe or extract relationships in
data. This is the most important and most difficult type of
learning and would be better titled Predictive Learning. In this
case the machine is not given any labels for its inputs and
needs to “figure out” the structure on its own. This is similar to
how babies learn early in life. For example they learn that if an
object in space is not supported it will fall
• Reinforcement Learning: It describes a class of problems where
an agent operates in an environment and must learn to operate
using feedback. This plays a relatively minor role in training AI
and is similar to training an animal. When the animal displays a
desired behaviour it is given a reward. Reinforcement learning
is defined as a computer program interacts with a dynamic
environment in which it must perform a certain goal (such as
 driving a vehicle), without a teacher explicitly telling it whether
it has come close to its goal.

2. What is data analytics? Explain various steps involved in it.

Data analysis is the process of cleaning, changing, and processing raw
data, and extracting actionable, relevant information that helps
businesses make informed decisions. The procedure helps reduce
the risks inherent in decision-making by providing useful insights and
statistics, often presented in charts, images, tables, and graphs. It
involves gathering all the information, processing it, exploring the
data, and using it to find patterns and other insights. The process
consists of:
• Data Requirement Gathering: Ask yourself why you’re doing
this analysis, what type of data analysis you want to use, and
what data you are planning on analyzing.
• Data Collection: Guided by the requirements you’ve identified,
it’s time to collect the data from your sources. Sources include
case studies, surveys, interviews, questionnaires, direct
observation, and focus groups. Make sure to organize the
collected data for analysis.
• Data Cleaning: Not all of the data you collect will be useful, so
it’s time to clean it up. This process is where you remove white
spaces, duplicate records, and basic errors. Data cleaning is
mandatory before sending the information on for analysis.
• Data Analysis: Here is where you use data analysis software
and other tools to help you interpret and understand the data
and arrive at conclusions. Data analysis tools include Excel,
Python, R, Looker, Rapid Miner, Chartio, Metabase, Redash,
and Microsoft Power BI.
• Data Interpretation: Now that you have your results, you need
to interpret them and come up with the best courses of action,
based on your findings.
 • Data Visualization: Data visualization is a fancy way of saying,
“graphically show your information in a way that people can
read and understand it.” You can use charts, graphs, maps,
bullet points, or a host of other methods. Visualization helps
you derive valuable insights by helping you compare datasets
and observe relationships.

3. Explain DFS and BFS with example.

DFS is an algorithm for finding or traversing graphs or trees in depth-

ward direction. The execution of the algorithm begins at the root
node and explores each branch before backtracking. It uses a stack
data structure to remember, to get the subsequent vertex, and to
start a search, whenever a dead-end appears in any iteration. The full
form of DFS is Depth-first search.
BFS is an algorithm that is used to graph data or searching tree or
traversing structures. The algorithm efficiently visits and marks all
the key nodes in a graph in an accurate breadthwise fashion. This
algorithm selects a single node (initial or source point) in a graph and
then visits all the nodes adjacent to the selected node. Once the
algorithm visits and marks the starting node, then it moves towards
the nearest unvisited nodes and analyses them. Once visited, all
nodes are marked. These iterations continue until all the nodes of
the graph have been successfully visited and marked. The full form of
BFS is the Breadth-first search.
4. What is Turing test? Explain.
The Turing test, originally called the imitation game by Alan Turing in
1950, is a test of a machine's ability to exhibit intelligent behaviour
equivalent to, or indistinguishable from, that of a human. Turing
proposed that a human evaluator would judge natural language
conversations between a human and a machine designed to
generate human-like responses. The evaluator would be aware that
one of the two partners in conversation was a machine, and all
participants would be separated from one another. The conversation
would be limited to a text-only channel, such as a computer
keyboard and screen, so the result would not depend on the
machine's ability to render words as speech. [3] If the evaluator could
not reliably tell the machine from the human, the machine would be
said to have passed the test. The test results would not depend on
the machine's ability to give correct answers to questions, only on
how closely its answers resembled those a human would give.
Since the creation of the Turing test, more modern approaches have
evolved in an attempt to better detect humans and machines. These
variations of the Turing test are continually evolving to maintain
relevance during technological advancements.
• The Reverse Turing Test aims to have a human trick a
computer into having the computer believe it is not
interrogating a human.
• The Total Turing Test incorporates perceptual abilities and the
person being question's ability to manipulate objects.
• The Marcus Test has test subjects view media and respond to
questions about the content consumed.
• The Lovelace Test 2.0 has test subjects create art and examines
their ability to do so.
 • The Minimum Intelligent Signal test asks test subjects only
binary questions (i.e. only true/false or yes/no answers are
allowed).

5. What is Graph and types of graphs?

A graph data structure is made up of a finite and potentially mutable
set of vertices (also known as nodes or points), as well as a set of
unordered pairs for an undirected graph or a set of ordered pairs for
a directed graph. These pairs are recognized as edges, links, or lines in
a directed graph but are also known as arrows or arcs. The vertices
could be internal graph elements or external items represented by
integer indices or references.
So depending upon the position of these nodes and vertices, there are
different types of graphs, such as:
Null Graph
The Null Graph is also known as the order zero graph. The term "null
graph" refers to a graph with an empty edge set. In other words, a null
graph has no edges, and the null graph is present with only isolated
vertices in the graph.

Trivial Graph
A graph is called a trivial graph if it has only one vertex present in it.
The trivial graph is the smallest possible graph that can be created
with the least number of vertices that is one vertex only.
Non-Directed Graph
A graph is called a non-directed graph if all the edges present between
any graph nodes are non-directed. By non-directed edges, we mean
the edges of the graph that cannot be determined from the node it is
starting and at which node it is ending. All the edges for a graph need
to be non-directed to call it a non-directed graph. All the edges of a
non-directed graph don't have any direction.
Directed Graph
Another name for the directed graphs is digraphs. A graph is called a
directed graph or digraph if all the edges present between any vertices
or nodes of the graph are directed or have a defined direction. By
directed edges, we mean the edges of the graph that have a direction
to determine from which node it is starting and at which node it is
ending.
Connected Graph
For a graph to be labelled as a connected graph, there must be at least
a single path between every pair of the graph's vertices. In other
words, we can say that if we start from one vertex, we should be able
to move to any of the vertices that are present in that particular graph,
which means there exists at least one path between all the vertices of
the graph.

Disconnected Graph
A graph is said to be a disconnected graph where there does not exist
any path between at least one pair of vertices. In other words, we can
say that if we start from any one of the vertices of the graph and try
to move to the remaining present vertices of the graph and there
exists not even a single path to move to that vertex, then it is the case
of the disconnected graph. If any one of such a pair of vertices doesn't
have a path between them, it is called a disconnected graph.