UGC NET-JRF QUALIFIED
HTET QUALIFIED
Pursuing Ph.D (CSE)
M.Tech( CSE) 2016
B.Tech (CSE) 2014
Diploma (IT) 2011

Neeraj 

This Course covers Topics related to planning in artificial intelligence will discussed in this course with the help of algorithm and examples.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

Hindi

(Hindi) Planning : Artificial Intelligence for GATE (CS and IT)

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Fundamentals of planning explained in this lecture.

Lecture 1: Planning Introduction (in Hindi)

Components of classical planning and practical planning explained with examples.

Lecture 2: Components of Planning System (in Hindi)

In this lesson types of planning explain and also discussed about the PDDL1.0.

Lecture 3: Planning Types and its Language (in Hindi)

Explain how domain predicate represented in the STRIPS.

Lecture 4: Strips (in Hindi)

Most important points explain in this lesson. Action predicate and derivation explained in detail.

Lecture 4.1: Action Predicate in Strips (in Hindi)

Type of state space search explain in detail.

Lecture 4.2 Types of State Space in Strips (in Hindi)

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course will cover Artificial Neural Networks in just 60 Minutes with full package.

(Hindi) Artificial Neural Networks in 60 Minutes

This course has discussed Sorting Algorithms with Complexities, working and some FAQs. The course will be beneficial for Engineering students and GATE aspirants.

(Hindi) Short Tricks to Remember Complexities of Sorting Algorithms

This course will cover dynamic Programming solution for Matrix Chain Multiplication and Longest Common Subsequence.

(Hindi) Dynamic Programming : MCM & LCS

This course will cover Asymptotic Analysis Of Algorithms with short notes targeted for GATE Aspirants.

(Hindi) Asymptotic Analysis Of Algorithms in 40 Minutes - GATE 2019

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

(Hindi) Searching Algorithms : Linear , Binary & Interpolation Search - GATE CS/IT

This course will cover 100 Short Tricks To Learn Complexities of Algorithms Easily. This Course is beneficial for  GATE (CS and IT) aspirants.

Lessons

6 lessons • 1h 20m

Invalid Date

NaN

Lecture 1: Planning Introduction (in Hindi)

Invalid Date

NaN

Lecture 2: Components of Planning System (in Hindi)

Invalid Date

NaN

Lecture 3: Planning Types and its Language (in Hindi)

Invalid Date

NaN

Lecture 4: Strips (in Hindi)

Invalid Date

NaN

Lecture 4.1: Action Predicate in Strips (in Hindi)

Invalid Date

NaN

Lecture 4.2 Types of State Space in Strips (in Hindi)