Class P and NP Problem and Turing Machine

 Successful completion of Guest Lecture on Theory of Computation ( Turing Machine,Class P and NP problems)

Date: 29th September 2015

Venue: TSSM BSCOER College, narhe, Pune

Attended by: Around 75 participants(TE students Computer Engineering department)

Resource Person:
  Rajesh Kulkarni, HOD Computer Engineering, JSPM NTC Narhe, Pune/ Consultant Business Canvas

Session Contents:Turing Machine, Class P,  Class NP, NP-hard, NP-complete, Polynomial time, searching Algorithms, Sorting Algorithms, Clique Problem, Deterministic Algorithms, Turing machine, Directed graph, Tractable and Intractable Problems,        Dynamic Programming, Hamiltonian path, Exponential Algorithm, Reducible Problems, Halting Problem, Satisfiability Problems, Vertex Cover Problem, Independent set

Class P and NP problems

Successful completion of Guest Lecture on Theory of Computation (Class P and NP problems)

Date: 25^th September 2015
 

Venue: RSCOE College, Tathawade, Pune

Attended by: Around 75 participants(TE students Computer Engineering department)
 

Resource Person:

  Rajesh Kulkarni, HOD Computer Engineering, JSPM NTC Narhe, Pune/ Consultant Business Canvas
 
Session Contents: Class P,  Class NP, NP-hard, NP-complete, Polynomial time, searching Algorithms, Sorting Algorithms, Clique Problem, Deterministic Algorithms, Turing machine, Directed graph, Tractable and Intractable Problems,        Dynamic Programming, Hamiltonian path, Exponential Algorithm, Reducible Problems, Halting Problem, Satisfiability Problems, Vertex Cover Problem, Independent set