MADHAV INSTITUTE OF TECHNOLOGY AND SCIENCE,

GWALIOR

(A Govt. Aided UGC Autonomous & NAAC Accredited Institute,

Affiliated to R.G.P.V, Bhopal)

Department of Information Technology

Class - IT 3rd Year

Subject: Compiler Design (160611)

Aditya Joshi
0901IT201002
COURSE OUTCOMES:

 I have learned the concepts of finite automata and context free grammar.
 I have understood the basic concept of working of compiler.
 I have learned various parsing techniques and their comparison.
 compare various code generation and code optimization techniques.
 I have analyzed different tools and techniques for designing a compiler.
 I have an idea about various phases of compiler.
Unsupervised Learning - Definition

 Unsupervised machine learning is a type

of machine learning where an algorithm
is trained on a dataset without any
specific target variable or labelled data.
In other words, the algorithm is given a
set of inputs and asked to find patterns
or structure in the data without any
guidance or supervision.
  The goal of unsupervised learning is to
discover hidden patterns or structures in the
Unsupervised data that can help in making predictions or
identifying new insights. Some common
Learning - Goal examples of unsupervised learning algorithms
include clustering, anomaly detection, and
dimensionality reduction.
  Unsupervised learning is widely used in fields
such as data mining, pattern recognition, and
natural language processing. One of the main
Unsupervised advantages of unsupervised learning is that it
can be used to find patterns in large datasets
Learning - that might be too difficult or time-consuming
for humans to identify on their own. However,
Overview because unsupervised learning is not guided by
a specific target variable, it can sometimes
produce results that are difficult to interpret or
may not be useful for a specific task.