To Download An Fe Application Form & Departmental Approval Form: Fill & Download for Free

JNCASR always annually floats their program "Summer Research Fellowship Program", commonly known as SRFP, somewhere around 25 November. The application are invited for roughly about a month. The details of the program can be found by following the link below:JNCASRThe application form could be downloaded from the website or you can also ask from the FE section through mailing them.Deadline: 19 December, 2014Result Declaration: April 1, 2015Hurry up..!!!P.S. : I am already in JNCASR doing a winter internship and I am simply loving it. The faculties present over here are some of the top notches of the nation and the quality of research done here is no less than that in foreign institutes. Coming over to JNCASR is worth it.

I would strongly recommend that you study programming logic. The material of that topic is extremely vital to understanding algorithms and is independent of any particular programming language. Yet, it is an invaluable way to learn the how to understand a problem and devise instructions to solve it.I can provide you with a little information on types of algorithms along with a few related resources.Check out this free online book: Data Structures and Algorithms with Object-Oriented Design Patterns in C#, by BrunoR. PreissCheck out this link for Khan Academy’s series of free instructional videoson algorithms.Also, this link to a complete set of lecture notes, with examples, on Design and Analysis of Algorithms.Here’s the list of the various topics of the Khan Academy videos on algorithms:What are algorithms and why should you care? We'll start with an overviewof algorithms and then discuss two games that you could use an algorithm to solve more efficiently - the number guessing game and a route-finding game.Khan AcademyLearn about binary search, a way to efficiently search an array of items by halving the search space each time.Khan AcademyLearn how to use asymptotic analysis to describe the efficiency of an algorithm, and how to use asymptotic notation (Big O,Big-Theta, and Big-Omega)to more precisely describe the efficiency.Khan AcademyLearn selection sort, a simple algorithm for sorting an array of values, and see why it isn't the most efficient algorithm.Khan AcademyLearn insertion sort, another simple but not very efficient way to sort an array of values.Khan AcademyLearn the concept of recursion, a technique that is often used in algorithms. See how to use recursion to calculate factorial and powers of a number, plus to generate art.Khan AcademyUse the recursive technique to solve the Towers of Hanoi, a classic mathematical puzzle and one reportedly faced by monks in a temple.Khan AcademyLearn merge sort, a more efficient sorting algorithm that relies heavily on the power of recursion to repeatedly sort and merge sub-arrays.Khan AcademyLearn quick sort, another efficient sorting algorithm that uses recursion to more quickly sort an array of values.Khan AcademyLearn how to describe graphs, with their edges, vertices,and weights, and see different ways to store graph data, with edge lists,adjacency matrices, and adjacency lists.Khan AcademyLearn how to traverse a graph using breadth-first-search to find a particular node or to make sure you've visited all the notes, traversing one layer at a time.Khan AcademyIdeas of how you could continue your learning journey in algorithms.Below are the topics for online lecture notes for Design and Analysis of Algorithms:Algorithms Lecture Notes1. Introduction2. Mathematics for AlgorithmicSetsFunctions and RelationsVector sand MatricesLinear Inequalities and Linear Equations3. Greedy AlgorithmsKnapsack ProblemO-I KnapsackFractional KnapsackActivity Selection ProblemHuffman's CodesMinimum Spanning TreeKruskal's AlgorithmPrim's AlgorithmDijkstra's Algorithm4. Divide&Conquer Algorithms5. Dynamic ProgrammingMatrix-chain MultiplicationKnapsack Problem DP SolutionActivity Selection Problem DP Solution6. Amortized AnalysisAggregate MethodAccounting MethodPotential MethodDynamic Table7. Hash Table8. Binary Search Tree9. Graph AlgorithmsBreadth-First Search (BFS)Depth-First Search (DFS)Topological SortStrongly Connected ComponentsEuler TourGeneric Minimum Spanning TreeKruskal's AlgorithmPrim's AlgorithmSingle Source Shortest PathDijkstra's AlgorithmBellman-Ford Algorithm10. String MatchingNaïve String MatchingKnuth-Morris-Pratt AlgorithmBoyer-Moore Algorithm11. SortingBubble SortInsertion SortSelection SortShell SortHeap SortMerge SortQuick Sort12. Linear-Time SortingCounting SortRadix SortBucket Sort13. Computational Geometry14. Computational ComplexityInformation-Theoretic ArgumentAdversary ArgumentNP-Completeness And Reduction15. Approximate AlgorithmsVertex CoverThe Traveling Salesman Problem16. Linear Programming17. AppendixI. ParabolaII. Tangent18. Codes19. ReferencesAlgorithm Home PageDictionary of Algorithms & Data Structures -- NISTDictionary of Algorithms &Data Structures -- FOLDOCOn-line Encyclopedia of Integer SequencesGlossary (Design& Analysis of Algorithms).Algorithms and Data Structures BooksBooks by Don Knuth (and links to papers)BooksAlgorithm Design - Foundations, Analysis & Internet Examples by Michael T. Goodrich and Roberto TamassiaData Structures and Algorithms in Java by Michael T. Goodrich and Roberto TamassiaData Structures and Algorithms in C++ by Michael T. Goodrich, Roberto Tamassia and David M. MountIntroduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford SteinOnline Learning Center -- CLR chapters overview and PowerPoint slidesJournalsAlgorithmica: Home | Electronic Access via OhioLink (Dec.98 -Present) | Print Issues at Math lib.Journal of Algorithms: Home | Electronic Access via OhioLink (Jan.93 - Present)Journal of Graph Algorithms & Applications -- An electronic journal available via WWW. All papers freely available in PostScript and PDF.LinksAlgorithmist, The -- dedicated to anything algorithms - from the practical realm, to the theoretical realm.Algorithms Course Material on the NetAlgorithms in the Real World course by Guy E. BlellochAlgorithmic Solutions (formerly LEDA Library) -- a library of the data types and algorithms ( number types and linear algebra, basic data types, dictionaries, graphs, geometry, graphics).Analysis of Algorithms Lectures at Princeton -- Applets & Demos based on CLR.Collected Algorithms(CALG) of the ACMComplete Collection of Algorithm Animations (CCAA)Data Structures And Number Systems -- by Brian Brown.Function Calculator by Xiao GangFAQ - Com.graphics.algorithms -- maintained by Joseph O'RourkeGame Theory NetGrail Project -- A symbolic computation environment for finite-state machines, regular expressions, and finite languages.Java Applets Center by R.MukundanLecture Notes by Diane CookLecture Notes for Graduate Algorithms by Samir KhullerMaze classification and algorithms -- A short description of mazes and how to create them. Definition of different maze types and their algorithms.Priority Queues -- Electronic bibliography on priority queues (heaps). Links to downloadable reports, researchers' home pages, and software.Softpanorama Vitual Library /AlgorithmsTernary Search Trees -- Algorithm for search. PDF file and examples in C.Traveling Salesman -- bibliography and software links.ComputatabilityAlgorithms and Complexity -- A downloadable textbook by Herbert S. Wilf.Blackbox - a SAT Technology Planning System -- Black box is a planning system that works by converting problems specified in STRIPS notation into Boolean satisfiability problems, and then solving the problems with a variety of state-of-the-art satisfiability engines.Bibliographic Database for Computability Theory -- Extensive bibliography on computability and recursion theory, maintained by Peter Cholak.Compendium of NP Optimization Problems -- This is a preliminary version of the catalog of NP optimization problems.Computability and Complexity -- An online course on complexity.Computational Complexity and Statistical Physics -- Santa Fe, New Mexico, USA; 4--6 September 2001.Complexity International -- journal for scientific papers dealing with any area of complex systems research.Computability Theory -- Directory of researchers working in computability theory, and list of open problems.ECCC - Electronic Colloquium on Computational Complexity -- The Electronic Colloquium on Computational Complexity is a new forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity. The Electronic Colloquium on Computational Complexity (ECCC) welcomes papers, short notes and surveys with relevance to the theory of computation.Hypercomputation Research Network -- The study of computation beyond that defined by the Turing machine, also known as super-Turing, non-standard or non-recursive computation. Links to people, resources and discussions.IEEE Conference on Computational Complexity -- This conference started as "Structure in Complexity Theory" in 1986. It recently acquired the new name "Conference on Computational Complexity", which was used for the first time in 1996. CTI, DePaul University, Chicago IL; 18--21 June 2001.SAT Live! -- A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.Roberto Bayardo's Resources -- Includes the relsat SAT solver and related papers.Problem Solving Environments Home Page -- This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.SATLIB - The Satisfiability Library -- A collection of benchmark problems, solvers, and tools. One strong motivation for creating SATLIB is to provide a uniform test-bed for SAT solvers as well as a site for collecting SAT problem instances, algorithms, and empirical characterisations of the algorithms' performance.Stas Busygin's NP-Completeness Page -- A proposal for solving NP-hard problems.QuantumComputingCentre for Quantum Computation -- Based at Oxford University. Well designed site, with a large amount of information available.D-Wave Systems, Inc. -- D-Wave Systems (Home) is a portal to the state of the art in the design of quantum computers, operating systems, algorithms, hardware, superconductors, and quantum physics.id Quantique -- Site Of id Quantique, Inc. Products include a quantum random number generator, and a quantum cryptography system.MagicQ Technologies Inc. -- The home site of the first start up company devoted entirely to quantum computing. No patents or products to date, but of interest by virtue of being first off the block.Quantum Architecture Research Center -- The home page of a team formed by Frederic Chong, Isaac Chuang, and John Kubiatowicz, the three top experimentalists in quantum computing.Quantum Computation Archive This site contains both technical papers and links to QC reports in the media.Quantum Computer Emulator (QCE) -- A Windows based simulator of quantum computer hardware. Provides an environment to execute quantum algorithms under realistic experimental conditions.Quantum Computer Physics Laboratory of IPT Russian Academy of Sciences -- "Quantum Computer" seminar program. Staff, contact info, research papers.Quantum Computing At The Max Plank Institute -- Provides an overview of quantum computer related research taking place at the Max Plank Institute. The primary focus is ion trap based computing. Selected reprints are available.Quantum Computing with Electron Spins in Quantum Dots -- A detailled study of using electron spins for quantum computation. Several possible implementations are discussed.Quantum Informatics at the University of Aarhus -- Performs research on quantum computing with an emphasis on quantum cryptography.AlgorithmsGraham's scan (Convex Hull Algorithm) (Applet)Line Sweeping Algorithm (Applet)Max Flow (Applet)SkipList (Applet)Stable Marriage (Applet)GraphAlgorithmsSocietiesand OrganizationsNumerical Algorithms Group (NAG)GeometryLine Sweeping AlgorithmGraham Scan and Gift WrappingGraham's Scan (Convex Hull Algorithm)Qhull-- The Quick Hull Algorithm.

Hello,Syllabus for Chhattisgarh Pre Pharmacy TestCG PPHT SyllabusThe syllabus will be comprised of Physics, Chemistry, Biology & Mathematics. The complete syllabus are given here:Physics:Units and dimensions, Dimensional analysis, S.I. Units, motion in two dimensions.Acceleration due to gravity and its variation. Universal law of gravitation, geostationary satellites, escape velocity.Hooke’s law, Young’s modulus, shear and bulk modulus, surface energy and surface tension, kinetic theory of gases, gas laws, kinetic energy and temperature.Heat conduction in one dimension. convection and radiation. Stefan’s law and Newton’s law of cooling.Periodic motion, simple harmonic motion, Oscillations due to spring. Wave motion principle of superposition. progressive and stationary waves, beats, and Doppler effect.Wave nature of light. Interference, Young’s double slit experiment, velocity of light and Doppler’s effect in light.Bohr model of the atom, Hydrogen spectrum, Composition of nucleus, atomic masses and isotopes, radioactivity, laws of radioactive decay, decay constant, half life and mean life, Mass-energy relation, fission, X-Ray: properties and uses.Electric current, Ohm’s law, Kirchoff’s laws, resistances in series and parallel, temperature dependence of resistance, wheat stone bridge, potentiometer.Electromagnetic induction induced emf Faraday’s law. Lenz’s law, self, and mutual inductance. Alternating currents impedance and reactance growth and decay of current in L-R circuit, elementary idea of dynamo and transformer.ChemistryStructure of Atom, Chemical bond, Solutions, Solid State, Nuclear chemistry, Chemical equilibrium, Thermochemistry and Thermodynamics, Chemical Kinetic, Electrochemistry, Surface chemistry,Principles of metallurgical operations: Furnaces, ore concentration, extraction, purification metallurgies of Na, Al, Fe, Cu, Ag, Zn and Pb and their properties.Chemical periodicity: s,p,d. and I-block elements, Periodic Table, periodicity, atomic and ionic radii valency, ionization energy, electron affinity, electronegativity, metallic character.Comparative study of elements: Comparative, study of the following families of elements: (i) Alkali metals (ii) Alkaline earth metals (iii) Nitrogen family (iv) Oxygen family (v) Halogens (vi) Noble gases.Transition metals : Electronic configuration of 3rd-Metal ions, oxidation states, other general characteristic properties, potassium permanganate, potassium dichromate.Co-ordination compounds: Simple nomenclature, bonding and stability, classification and bonding in organometallics.Chemical analysis: Chemistry involved is simple inorganic qualitative analysis: calculations based on acid-base titrimetry.Mathematics:Algebra, Trigonometry, Co-Ordinate Geometry of Three Dimensions, Integral Calculus, Co-ordinate Geometry of Two Dimensions, Differential Calculus, Vector Algebra, Statistics, Differential Equations, Numerical Methods, Information Technology.Biology:Botany: Structural Organisation of cell, Mendel’s Laws of inheritance, Monohybrid and dihydrid cross, Difference between prokaryote and Eukaryotes, Five kingdom classification, Elementary knowlege of Microsporogenesis, Tissue and tissue systems, Enzymes and growth hormones with reference to their classification, Role of plants in human welfare, etc.Zoology: Multicellularity-Structure And Functions of Animal Life, Developmental Biology And Genetics, Taxonomy Evolution Economic Zoology, Origin of Life, Structure and physiology of different organ systems of Human body-skin, Endocrine system with special reference to various Endocrine glands of man and Hormonal co- ordination Vitamin & minerals, Economic Zoology‘ Sericulture, etc.CG PPHT Exam Dates 2018Students can check here the official exam schedule of CG PPHT entrance exam 2018:EventsDates (Announced)Submission of application form15th March 2018Last date to fill the form5th April 2018 (11:59 AM)Downloading of admit card starts from23rd April 2018Date of Exam3rd May 2018 (2:00 PM to 5:15 PM) (Revised)Result Declaration1st week of June 2018Counselling Starts from2nd week of June 2018.Prepare all topics. plan a schedule for studying, revision, self testing and if possible check previous paper format also.All the best.more doubts / queries mail me oncherry.22kanna