Which AI topics are most important for exams?

Search algorithms (BFS, DFS, A*), minimax with alpha-beta pruning, FOPL and resolution, agent types with PEAS and Bayes' theorem are asked most often.

Do these AI notes cover machine learning?

Only a short overview. They focus on the classic AI syllabus of agents, search, logic, uncertainty and planning. Use the separate machine learning notes for algorithms such as regression and decision trees.

Are these AI handwritten notes free?

Yes. Fill in the short form on this page and the PDF downloads right away. There is no fee for the notes.

Are these official university notes?

No. They are original revision notes written by the Uncodemy trainer team in a handwritten style. They are not issued or approved by AKTU or any other university, and they do not replace your prescribed textbook or your teacher's class notes.

Which university syllabus do they follow?

They follow the common Artificial Intelligence syllabus taught in most Indian B.Tech CSE and IT, BCA and MCA programmes. Unit order, names and depth differ between universities such as AKTU, IPU, VTU and others, so tick the topics against your own university syllabus before you start revising.

Can I print these notes?

Yes. Print them for personal study, write your own examples in the margins and carry the formula and diagram pages into your last revision before the exam.

Artificial Intelligence Handwritten Notes PDF

Key takeaways

Search algorithms, alpha-beta pruning and resolution are the units where most long answers come from.
Compare search strategies in a table: complete, optimal, time and space.
Each section has exam tips and formula boxes, and the last page lists the most asked practice questions.
These are original Uncodemy revision notes, not official university notes; check your own syllabus.

About these AI handwritten notes

This page offers Uncodemy's Artificial Intelligence notes as a free handwritten-style PDF. Artificial Intelligence is the study of agents that perceive their environment and act to reach goals, using search, logic and probability. The notes are written in short points with neat tables, labelled diagrams, boxed formulas and exam tips, so you can revise a full unit in one sitting instead of reading a long textbook chapter.

Please note: these are original Uncodemy revision notes. They follow the common syllabus that most Indian universities share for this subject, but they are not official university notes. Check your own university syllabus and add anything it lists that is missing here.

What's inside the AI notes

The PDF is arranged in 8 sections plus a final page of most asked practice questions. The sections follow the usual unit order of a Artificial Intelligence syllabus, so you can map them to your own units quickly. Here is what each section covers.

Introduction to AI

Definitions of AI, the Turing test and the four approaches (thinking or acting, humanly or rationally), with the history and main application areas.

Intelligent agents

Agent and environment, PEAS description, simple reflex, model-based, goal-based, utility-based and learning agents, and environment types such as observable, deterministic and episodic.

Problem solving and uninformed search

State space formulation, then BFS, DFS, uniform cost, depth-limited and iterative deepening search compared on completeness, optimality, time and space.

Informed (heuristic) search

Greedy best-first and A* search, admissible and consistent heuristics, and local search such as hill climbing with its plateau and local maxima problems.

Adversarial search (games)

Game trees, the minimax algorithm and alpha-beta pruning, with a worked tree that shows which branches are cut off.

Knowledge representation and logic

Propositional logic, first-order predicate logic, converting English sentences to FOPL, clause form and proof by resolution, plus semantic nets and frames.

Reasoning under uncertainty

Probability basics, Bayes' theorem and Bayesian networks, showing how an agent reasons when facts are not certain.

Planning, expert systems and learning

Planning ideas, forward and backward chaining, the architecture of an expert system and a short overview of how machines learn.

Most asked questions (practice)

Ten exam-style questions, from defining AI and agents to solving alpha-beta trees and resolution proofs.

How to use handwritten notes to revise AI

AI papers mix theory with hand-solved traces, so use the notes for both: read the definitions, then redo every worked example on paper.

Redraw the search tree for BFS, DFS and A* on the same small graph until you can trace each one without notes.
Practise one minimax tree with alpha-beta pruning each day and mark the pruned branches clearly.
Write five English sentences, convert them to FOPL and clause form, and prove a goal by resolution.
Keep the agent types and environment properties on one sheet for quick recall in short answers.

A simple three-pass method works well with handwritten notes. In the first pass, read one section and underline only what you do not already know. In the second pass, close the notes and write the definitions, diagrams and steps for that section on a blank sheet, then compare and correct in a different colour. In the third pass, a day or two later, answer two or three exam-style AI questions in timed conditions using only memory. Add your own examples and doubts in the margins so the PDF becomes your personal revision copy.

Formulas, diagrams and definitions to memorise

A* evaluation function f(n) = g(n) + h(n), and the meaning of an admissible heuristic (never overestimates the true cost).
Complexity of BFS and DFS in terms of branching factor b and depth d, in one comparison table.
The alpha-beta rule: prune when alpha is greater than or equal to beta.
Steps to convert a sentence into clause form: remove implications, move negation inwards, standardise variables, skolemise, drop universal quantifiers, distribute.
Bayes' theorem P(A|B) = P(B|A) P(A) / P(B), and the block diagram of an expert system.

Common mistakes that cost marks

Forgetting to show alpha and beta values at each node, so the examiner cannot see why a branch was pruned.
Calling a heuristic admissible without checking that it never overestimates.
Skipping skolemisation or standardising variables apart in resolution proofs.
Writing PEAS without a concrete task; always name the agent, such as a vacuum cleaner or taxi.

Exam focus: AI topics that carry the most marks

In most university AI papers, search and logic carry the bulk of the marks, while agents and expert systems are common theory questions.

Uninformed and informed search, especially A* with an admissible heuristic.
Minimax and alpha-beta pruning numericals.
FOPL conversion and resolution proofs.
Agent types with PEAS for a given task, and Bayes' theorem problems.

Typical long questions

Define AI and explain the Turing test and the four approaches to AI.
Explain the types of agents and write the PEAS description for an automated taxi.
Compare BFS, DFS and iterative deepening search.
Explain A* search and prove when it is optimal.
Solve a game tree using minimax with alpha-beta pruning.
Convert given sentences to FOPL and prove a query by resolution.
Explain the architecture of an expert system.

Marks per question change between universities and years, so confirm the pattern on a recent official paper. In long answers, start with a definition, add a labelled diagram or table, explain the steps and finish with an example or comparison. Underline the key term in each answer and leave a line between steps, because examiners mark faster when the structure is easy to see.

A 7-day revision plan for AI

Day 1: Introduction to AI, Intelligent agents.
Day 2: Problem solving and uninformed search, Informed (heuristic) search.
Day 3: Adversarial search (games), Knowledge representation and logic.
Day 4: Reasoning under uncertainty.
Day 5: Planning, expert systems and learning.
Day 6: redo the numericals: an A* trace, an alpha-beta tree, a resolution proof and one Bayes' theorem problem.
Day 7: answer the most asked practice questions at the end of the notes from memory, then solve one official previous year paper in three hours and mark the units that cost you time.

Keep a single sheet of formulas, definitions and diagrams from the notes for the last hour before the exam, and do not start new topics on the final day.

Who these notes are for

B.Tech CSE, IT and AI-ML students preparing for the semester AI exam.
BCA and MCA students who have Artificial Intelligence as a core or elective paper.
Students starting machine learning who want a clear base in search, logic and probability.
Freshers revising AI fundamentals before technical interviews for data and AI roles.

The notes are a revision aid, not a first textbook. If a AI topic is new to you, learn it from your prescribed book or class lectures first, then come back to the notes to compress and revise it. For practice, pair them with the Artificial Intelligence Important Questions PDF page and your university's official previous year papers. If your syllabus has a topic that is not covered here, you can ask for it through the handwritten notes request page linked below.

Download Artificial Intelligence Handwritten Notes PDF