The session was planned with an intension of giving deep exposure in to the course also covering prescribed university syllabusHe started at I:30P.M with an introduction of resource person Mr. Mahendar Jinukala with experience of 10 years in dealing with Computer Science related subjects. He Ratified by JNTUH on 14.02.2017 as a Assistant Professor in B.Tech, Computer Science and Engineering. He also co-ordinated for many events like placement drive. Tech festevent and Experience of working in Exam section. He is working as an Assistant Professor in MRCET, Hyderabad from 03-04-2015 to till date also Worked as an Assistant Professor in Amina Institute of Technology, from 03-01- 2013 to 31-03-2015 and Worked as an IT Associate in Institute for Electronic Governance (IT & C Dept., Govt. of AP) from 30-06-2008 to 31-01-2010. He handled subjects like C Programming, Programming in C++., Database management system, perating System, Programming in C & Data structures, Object oriented programming through JAVA, Web Technologies, Design and Analysis of Algorithms, Database systems, Python Programming, Software Testing Methodology, Linux Programming, Software EngineeringHe has also given inputs on how to practically import the packages and apply efficiently thereby utilizing the code reusability feature of server-side Database connectivity.
The speaker has discussed about the Basics concepts of backtracking techniques. He also discussed queens problems followed by real-time applications.
Topics addressed in Guest Lecture:
- Introduction to Backtracking- what is Backtracking and it's usages discussed.
- Technique to solve problems using backtracking- Some of the techniques to solve Knight's tour problem,
Rat in a Maze, Subset Sum, m-Coloring Problem are discussed with their process
- Queens problem- Discussed solving of n-queens problem without applying bounding function and
also with applying bounding
Real-time applications of Backtracking techniques- Backtracking can be used to solve puzzles or problems include: Puzzles such as eight queens puzzle, crosswords, verbal arithmetic, Sudoku , and Peg Solitaire
- Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally, one piece at a time, removing those solutions that fail to satisfy the constraints of the problem at any point in time (by time, here, is referred to the time elapsed till reaching any level of the search tree). Backtracking can also be said as an improvement to the brute force approach. So basically, the idea behind the backtracking technique is that it searches for a solution to a problem among all the available options.
- There are three types of problems in backtracking —
- Decision Problem — In this, we search for a feasible solution.
- Optimization Problem — In this, we search for the best solution.
- Enumeration Problem — In this, we find all feasible solutions.
- There are three types of problems in backtracking —
For example, consider the SudoKo solving Problem, we try filling digits one by one. Whenever we find that current digit cannot lead to a solution, we remove it (backtrack) and try next digit. This is better than naive approach (generating all possible combinations of digits and then trying every combination one by one) as it drops a set of permutations whenever it backtracks
