Fwd: Two-Day Workshop on “Computational Complexity: Theory and Applications

[Sarita Visavalia]

---------- Forwarded message ----------
From: Sarita Visavalia <saritavis...@charusat.ac.in>
Date: Wed, 22 Oct 2014 14:33:31 +0530
Subject: Fwd: Two-Day Workshop on “Computational Complexity: Theory
and Applications
To: chintant...@gmail.com

---------- Forwarded message ----------
From: Sarita Visavalia <saritavis...@charusat.ac.in>
Date: Thu, 16 Oct 2014 16:15:42 +0530
Subject: Two-Day Workshop on “Computational Complexity: Theory and Applications
To: vijay radhe <visaval...@gmail.com>, vijay visavalia
<visaval...@yahoo.co.in>, Saroj Visavalia
<sarojvi...@gmail.com>, Tarjni Vyas <tarjn...@gmail.com>,
krutik...@gmail.com, Kruti N Khalpada - <knkha...@aits.edu.in>,
kamal sutaria <kamal....@gmail.com>

*Dear Sir/ Madam**,*


Department of Information Technology, Chandubhai S. Patel Institute of
Technology is pleased to announce a Two-Day Workshop on “*Computational
Complexity: Theory and Applications*”. It will be conducted at our campus,
CSPIT, CHARUSAT, Changa in Gujarat, India from *07-08 November, 2014.*


*About the Workshop:*

Advances in processing speed and memory have created opportunities for
computers to be used to solve problems of large size and complexity. The
art and science of computing is concerned with understanding how computers
can be used to solve problems. Given a problem, one of the goals of a
computer scientist is to develop an algorithm for solving a class of
problems on a computer effectively and efficiently. Different algorithms
can be used for the same problem, and we must decide which is best for the
problem at hand. The analysis of algorithms provides ways of estimating the
complexity of algorithms. The workshop emphasis on various paradigms and
approaches used to analyze and design algorithms.



*Course Content:*

· Algorithm Design Techniques (including Divide and Conquer, Dynamic
Programming and Greedy)

· Asymptotic Analysis

· Advanced Data Structures

· Graph Algorithms (including shortest paths, minimum spanning trees)

· NP-completeness and recent trends to deal with complex problems
(including approximation and fixed-parameter tractable algorithms)



*Who should attend?*

The faculty members from academic institutions, persons from the
industries, research scholars and the only post Graduate students can
participate in the program



*Registration Fee*

*Academia /Non IEEE Member/Industry*

*Rs. 750/-*

*IEEE Member/ Student*

*Rs. 500/-*


For More Information , Please find attached workshop brochure.


*Interested Post Graduate Students, Faculties and Professionals can
Register themselves by clicking on this:*

*http://www.charusat.ac.in/CharUSATUI/NewsAnnouncementList.aspx?Key=0*
<http://www.charusat.ac.in/CharUSATUI/NewsAnnouncementList.aspx?Key=0>

*Please Forward this mail to all your faculties and colleagues.*


Regards,

Team - CCTA

With Regards,


---
Sarita R. Visavalia,
Assistant Professor,
Department of IT,
CSPIT,
CHARUSAT - Changa.
O:02697 265123
M:9429181142



--
---
Sarita R. Visavalia,
Assistant Professor,
Department of IT,
CSPIT,
CHARUSAT - Changa.
O:02697 265123
M:9429181142



--
---
Sarita R. Visavalia,
Assistant Professor,
Department of IT,
CSPIT,
CHARUSAT - Changa.
O:02697 265123
M:9429181142

[Sarita Visavalia]

--
You received this message because you are subscribed to the Google Groups "10itgroup" group.
To unsubscribe from this group and stop receiving emails from it, send an email to 10itgroup+...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

--

***********
Regards,

Sarita R. Visavalia,
Assistant Professor,

Department of Information Technology,
CSPIT,
CHARUSAT - Changa.

02697-247500 Ext.:2123