<--- Back to Details
First PageDocument Content
Analysis of algorithms / Algorithm / Mathematical logic / Time complexity / Regular expression / P / Randomized algorithm / Median graph / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2011-04-04 11:42:17
Analysis of algorithms
Algorithm
Mathematical logic
Time complexity
Regular expression
P
Randomized algorithm
Median graph
Theoretical computer science
Computational complexity theory
Applied mathematics

CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 27 May 2010 This question paper has 5 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10

Add to Reading List

Source URL: www.cmi.ac.in

Download Document from Source Website

File Size: 52,26 KB

Share Document on Facebook

Similar Documents

Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014

Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014

DocID: 1rrqu - View Document

Spheres of Influence for More Effective Viral Marketing Yasir Mehmood Francesco Bonchi  David García-Soriano

Spheres of Influence for More Effective Viral Marketing Yasir Mehmood Francesco Bonchi David García-Soriano

DocID: 1riqm - View Document

Competitive Online Algorithms Susanne Albers Overview  arrive one by one and must be scheduled immediately

Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediately

DocID: 1ri9G - View Document

Computing the Width of a Point Set in 3-Spa
e Thomas Herrmann Institute for Theoreti
al Computer S
ien
e  Institute for Operations Resear
h

Computing the Width of a Point Set in 3-Spa e Thomas Herrmann Institute for Theoreti al Computer S ien e Institute for Operations Resear h

DocID: 1rhdY - View Document

Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN  By

Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN By

DocID: 1rdMz - View Document