Ananthi Palanisamy

pointers in c programming pointer in c programming null pointer pointer to pointer pointer basics pointer initialization pointer declaration pointers for string manipulati iterated hill climbing​ aicte atal faculty development program fdp no objection certificate noc real time examples of ai.​ environment agents what is ai pointer and string array of strings pointers and 2d array pointers and 1d array array of pointers returning an array from functi passing an array to a function dangling pointer generic pointer pointers : introduction other file handling function manipulating file position reading and writing binary fil text and binary file file error handling file read/write function bfs breadth first search heuristic functions heuristic search model-based reflex agent​ simple reflex agent agent function percept sequence percept agent turing test acting rationally​ acting humanly​ thinking ​ rationally​ thinking humanly​ artificial intelligence common sense intelligence human vs computer string handling functions string pointers name of the program string initialization string declaration string basics​ pointer and functions 2d array to a pointer id array to a pointer dereferencing a pointer pass by value pass by referenc parameter passing in pointer name of the organization (from date – to date) training and learning profile update void pointer aicte atal nc noobjection certificate knowledge file pointers and buffers opening and closing files file handling user defined datatype bit fileds enumerated data type enum union passing arrays as arguments to arrays of structure arrays as structure members nested structures attributes of structure declaring a structure defining a structure structure basics structure two darray of string divide and conquer convex hull problem closest pair string matching sequential search bubble sort brute force:selection algorithm visualization. empirical analysis non-recursive algorithms recursive mathematical analysis theta omega big oh asymptotic notations propertie asymptotic notations analysis framework fundamentals of the analysis o important problem types aicte training and learning hamiltonian circuit problem n-queens problem backtracking huffman trees and codes. dijkstra’s algorithm kruskal’s algorithm prim’s algorithm greedy technique memory functions knapsack problem optimal binary search trees floyd’s warshall’s dynamic programming strassen’s matrix mul multiplication of large int binary tree traversals quick sort local maxima ocal maxima​ random walk hill climbing mutation recombination selection ga based methods for tsp​ travelling sales problem genetic algorithm simulated annealing participant escaping local maxima​ recursive best first search admissibility of a* algorithm a* informed search search strategies​ uninformed dfs character oriented functions merge sort problem solving fundamentals of algorithmic algorithm game tree games n- queens​ constraint satisfaction proble plan space planning goal stack planning backward state space planning​ forward state space planning​ strips domain​ limitation of search​ b* serach​ algorithm alpha beta​ algorithm minimax​ game playing algorithm​ board games closed problem​