Report :
In the one day Guest Lecture on “Algorithm Design” ,Mr.M.Chandra Sekhar Was Delivered Briefing of the subject of designing and analyzing the algorithm basics covered and Branch and Bound &NP Problems, Backtracking, General method, applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles, Branch and Bound General method, applications – Travelling sales person problem,0/1 knapsack problem- LC Branch and Bound solution, FIFO Branch and Bound solution.NP-Hard and NP-Complete problems, Basic concepts, non deterministic algorithms, NP – Hard and NP Complete classes, Cook‘s theorem the following topics are covered. Student felt good about the lecture.
Data Structures is a subject of primary importance to the discipline of Computer Science and Engineering. It is a logical and mathematical model of sorting and organizing data in a particular way in a computer, required for designing and implementing efficient algorithms and program development. Different kinds of data structures like arrays, linked lists, stacks, queues, etc.. are suited to different kinds of applications. Some specific data structures are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of data, such as large databases and internet indexing services. Nowadays, various programming languages like C,C++ and Java are used to implement the concepts of Data Structures.
Guest Lecture Coordinator HOD Principal
Date of Event : 30/09/2017
No of Participants : 110
Participants : II & III CSE Students
Venue : Seminar Hall, Room No. 305, Block-II, CMR Engineering
College
