Professional Documents
Culture Documents
AISC
Fundamental Concepts Intelligent Systems, Founda6on and Applica6on of AI, Current Trends in AI
Intelligent Agents Agent v/s SoDware Program Ra6onal Agent and PEAS Descrip6on Classifica6on of
Agents, Working of an Agent Single and Mul6-Agent System Performance Evalua6on of Agents,
Architecture of Agent
Heuris6c Search Techniques Heuris6c search technique: Generate and Test, Hill Climbing, Best-first
search, A* Algo, Problem reduc6on, Constraint sa6sfac6on, Means-ends analysis
Proposi6onal and Predicate Logic Proposi6onal and Logic operators, Simplifica6on laws, Predicate
Calculus: Limita6ons of Proposi6onal Logic, Quan6fiers: Existen6al and Universal Domain Constraints
Nested Quan6fiers, Seman6cs for predicate calculus, Inference rules, Resolu6on principle
REMOVED TOPICS IN AISC- NLP, Swarm algorithm, colony op@miza@on, Large Language Model,
Explainable AI
ACD
• Introduc6on to Formal Language • Difference between formal and natural languages
• Three basic concepts – language, grammar, and automata • Difference between a* and a+.
Chomsky Hierarchy of Grammar and Formal Languages • Explana6on of rules of being in type 0, type
1. • Accep6ng devices, names of grammars and languages
Chomsky Hierarchy of Grammar and Formal Languages • Explana6on of rules of being in type 2, type
3. Accep6ng devices, names of grammars and languages
Design of Determinis6c Finite Automata (DFA): • Block diagram, 5 tuples defini6on and acceptance of
a string by DFA • Design: Even/odd number of a’s. • Design: Even/odd numbers of a’s and b’s.
Design of DFA contd.: • Design: Substring “ab” (Homework: “aba”, “abba”) • Design: Star6ng with
“ab” (Homework: “aba”, “abba”)
Design of DFA contd.: • Design: Ending with “ab” (Homework: “aba”, “abba”) • Design: Ending with
“abaa” (Homework: “abb”, “abab”)
Design of DFA contd.: • Design: Binary numbers divisible by 3. (Homework: divisible by 4, 5) • Design:
Sum of digits in w ε {0,1,2}* divisible by 3. (Homework: sum of digits divisible by 4, 5)
Design of DFA contd.: • Design: Number of occurrences of the substring “ab” in w = the number of
occurrences of the substring “ba” in w. w ε {a,b}* (Homework: Design: L = {w : n a(w) mod 3 > n b(w)
mod 3, w ε {a,b}*})
Minimiza6on of DFA • Equivalence state par66oning rule • At least 2 examples in class (Homework: 2
DFA minimiza6on problems.)
Design of FA with output (Mealy machine): • Block diagram, defini6on using 7 tuples, transi6on
diagram and transi6on table of Mealy machines • Design: Generate output 1 when the panern
“abba” is found (Homework: 1’s and 2’s complement computa6on)
Design of FA with output (Moore machine): • Block diagram, 7 – tuple defini6on, transi6on diagram
and transi6on table of Moore machines • Design: Moore machine to match the panern “abba”,
(Homework: panern “aba”, “abaa”)
Mealy machine to Moore machine conversion • Any 2 in-class examples (Homework: any 2 Mealy to
Moore conversion)
Moore machine to Mealy machine conversion • Any 2 in-class examples (Homework: any 2 Moore to
Mealy conversion)
• NFA to DFA conversion. Show 2 examples in class. (Homework: two examples) • Introduce NFA with
null moves
• Removal of null moves/ 𝜖-moves/ λ – moves from NFA. • Conversion of λ-NFA to DFA by subset
construc6on method (Homework: two examples)
• Regular Expressions – introduc6on and iden66es • Simplifica6on of some regular expressions using
iden66es
Wri6ng regular expressions for: • Strings having substrings, start with panern, end in panern, fixed
length, etc. (Around 4-5 regular expressions should be demonstrated) (Homework: 20 – 25 regular
expressions from exercises of text/reference book)
Finite Automata to Regular expression using Arden’s theorem. • Two examples in class (Homework:
two ques6ons from textbook)
Regular expression to finite automata using Thomson’s construc6on. • Two examples in class
(Homework: two examples from text/reference books)
• Finite automata to regular grammar • Regular grammar to finite automata Two of each types in
class Examples (Homework: two ques6ons of each types)
Iden6fying non-regular languages: Pumping Lemma for regular languages • Pumping Lemma
statement • 2 Examples to demonstrate applica6on of pumping lemma (Homework: two ques6ons
for applica6on of pumping lemma)
Closure proper6es of Regular Languages: • Union, intersec6on, set difference, complement, reversal,
star closure. • Proof of each property either by logic/drawing FA
Context Free Grammars: • Parse Trees • LeDmost, rightmost deriva6ons • Explana6on of senten6al
forms
• Removal of unit produc6ons Conversion of CFG into CNF (Show 2 examples in class) (Homework: 2
ques6ons for simplifica6on and 2 ques6ons for CNF conversion)
Removal of leD factors and leD recursions (Show 2 examples of each in class)
Conversion of CFG into GNF Show 1 example in class (Homework: 2 ques6ons to convert into GNF)
Pumping Lemma for CFGs • Pumping Lemma statement • 2 Examples to demonstrate applica6on of
pumping lemma (Homework: two ques6ons for applica6on of pumping lemma)
Push Down Automata • DPDA • Block diagram, defini6on, acceptance • PDA transi6on diagram and
table representa6on • Instantaneous Descrip6ons (ID)
• NPDA • Design: L = {anbn | n > 0} • Design: L = {a2nbn | n > 0} (Homework: • L = {anb2n | n > 0} • L
= {anb3n+2 | n > 0} )
• Design: L = {wcwR | w ε {a,b}*} • Design: L = {aibjc i | i,j > 0} (Homework: • L = {aibjck | k = i+j, i, j, k
>0} • L = {aibjcjdi | i,j > 0} )
Conversion of PDA to CFG • Explain rules of conversion • Demonstrate with two examples in class
(Homework: Two exercise ques6ons from textbook)
Conversion of CFG to PDA • Explain rules of conversion • Demonstrate with two examples in class
(Homework: Two exercise ques6ons from textbook)
Turing Machines • Block diagram • Difference with other machines • Transi6on diagram and table
representa6on • Types of Turing Machines
Turing Machines design • Turing machine as a language acceptor • Turing machine as transducers •
At least two examples in class demonstra6on (Homework: Three ques6ons from text book exercises)
• Proper6es of recursive languages • Proper6es of Recursively Enumerable Languages
Introduc6on to compilers, types of compilers, cross compilers, difference between interpreters and
compilers.
Phases of compilers • Intermediate code generator • Code op6mizer • Machine dependent code
generator
CN
Network Layer: Network layer design issues, routing algorithms, congestion control
algorithms, Quality of service, MPLS. Classful addressing, Sub-netting, Classless addressing,
variable length blocks, address allocation; Protocols: ARP & DHCP: Introduction, Packet
Format, message types, IPV4 header format, fragmentation, options, checksum. ICMP:
Message format, message types. Dynamic routing protocols: RIP, OSPF & BGP, Multicasting
Protocol.
Application Layer: DNS: Name space, domain resource records, Electronic Mail: SMTP,
POP, IMAP, MIME, HTTP, HTTPS, SNMP.
Network Security: Security Goals, Attacks, Attack prevention techniques, Firewall, IDS,
DMZ, IPsec.
Introduc6on: Algorithm Defini6on and Criteria of Algorithms, Itera6ve and Recursive Algorithms.
Performance Analysis: Priori and Posteriori Analysis, Asympto6c Nota6ons, Time & Space Complexity
– Hands-on, Mathema6cal Analysis of Recursive Techniques, Mathema6cal Analysis of non-recursive
techniques.
Solving Recurrence Rela6ons: Subs6tu6on Method, Itera6ve Method, Recursive Tree Method,
Master Method.
Divide and Conquer: Introduc6on, Binary Search, Finding Maximum and Minimum, Selec6on sort,
Inser6on Sort, Bubble Sort, and their Analysis, QA-Discussions, Merge Sort and Analysis, QA-
Discussions, Quick Sort and Analysis, Randomized Quick Sort, Integer Mul6plica6on.
Graph Search Algorithm: Graph Representa6on, Graph Search Algorithm - BFS/ DFS.
Greedy Strategy: Introduc6on, Knapsack Problem, Job Sequencing with deadline, Op6mal Merge
tape, Huffman Coding, Spanning Trees - MST (Prim’s and Kruskal’s Algorithm), Union and Find
Opera6on (Set and Disjoint Set), Op6mal Merge Panerns, Dijkstra’s Algorithm-SSSP.
Branch and Bound: Introduc6on, FIFO, and LC Branch and Bound, Branch and bound – 0/1 Knapsack
Problem, Branch & Bound – TSP.
String Matching: Naïve String Matching, Rabin Karp Algorithm, Knuth-Morris-Pran (KMP) Algorithm.
Complexity Classes: NP, NP-Complete, and NP-Hard Problems, Cook’s Theorem, Polynomial-6me
reduc6ons, Sa6sfiability, Reduc6on from Sa6sfiability to Vertex Cover.