Greedy A~gorithms
In Wall Street, that iconic movie of the 1980s, Michael Douglas gets up in
front of a room full of stockholders and proclaims, "Greed. is good. Greed
is right. Greed works." In this
On the Sum of Square Roots of Polynomials and related problems
Neeraj Kayal
Chandan Saha
December 8, 2010
Abstract
The sumPof square roots problem over integers is the task of deciding the sign of a n
Resume
Manjish Pal
Personal Information
Address : 072 Old Graduate College
88 College Road West
Princeton  08540
New Jersey, USA
Email:
Date of Birth:
Sex:
Nationality:
[email protected]
9 Novemb
The Sixth International Symposium on Operations Research and Its Applications (ISORA06)
Xinjiang, China, August 812, 2006
Copyright 2006 ORSC & APORCpp. 206211
An Optimal Bound for Sum of Square Roots
Theory of Computation
Assignment 2
Solution :1



(1) After removal of productions:


(2) After removal of unit productions:


(3) The Chomsky Normal form will be :

  
Solution
Theory of Computation
Assignment 2
Solution 1
(1) After removal of productions:
S ASA aBaSA ASS
A BS
Bb
(2) After removal of unit productions:
S ASA aBa AS SA
A b ASA aBa SA AS
Bb
(3) The
Yale University
Department of Computer Science
How close can
a+
Dana Angluin
Yale University
b be to an integer?
Sarah Eisenstat
Hopkins School
YALEU/DCS/TR1279
February 2004
How close can
a+
Dana An
Theory of Computation Home Assignment 2
Instructor: Bhanukiran Vinzamuri
Instructions: All questions must be answered. Electronic submissions using latex/doc
with automata designed using tools whereve
Theory of Computation Home Assignment 3
Instructor: Bhanukiran Vinzamuri
Instructions: All questions must be answered. Electronic submissions using latex/doc
clearly are only accepted. This assignment
Allpairs Shortest Paths
Allpairs Shortest Paths
The allpairs shortest paths problem asks how to find
the shortest paths between all possible pairs of nodes.
Can we already solve this problem?
Run B
DATA LINK LAYER PROTOCOLS
GATE2014
A bitstuffing based framing protocol uses an 8bit delimiter pattern of 01111110. If the output
bitstring after stuffing is 01111100101, then the input bitstring
HackingaGoogleInterviewPracticeQuestions
PersonA
Question:Substring
Writeaprogramtodeterminewhetheraninputstringxisasubstringofanother
inputstringy.(Forexample,"bat"isasubstringof"abate",butnotof"beat
STLContainers
&Iterators
Containers as a form of Aggregation
Fixed aggregation
Variable aggregation
An object is composed of a fixed set of component
objects
An object is composed of a variable set of
Digital Logic
Book Name :
Digital Design 
M. MORRIS MANO and MICHAEL D. CILETTI,
3rd edition
Chapter 1,2,3,4,5,6,7,9 have to read completely
IITM S srinivasan [1 to 30 ]
Video Lectures https:/www.you
Data Structure and Algorithms
Syllabus:
Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Searching, sorting, hashing. Asymptotic worst case time and space comple
A. To prepare for a competitive exam, the first and foremost thing is determination. It is like "If I
want to do it, I will do it, No matter how". An Exam is just like a battle, give your everything t
Automata
Syllabus:
Regular expressions and finite automata. Contextfree grammars and pushdown automata. Regular and contexfree langua
1. What Books to read :
Book Name :
1 Peter Linz An Introductio
Automata Theory  Midterm (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
[email protected]
1 Problems
1. Professor Chikovski wants to prove the conjecture, If B then C.
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Sc
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Sc
Assignment 2
September 1, 2016
Q1. Let A be a DFA and q a particular state of A, such that (q, a) = q for
all input symbols a. Show by induction on the length of the input that for all
input string w,
Theory of Computing
Assignment 1
September 1, 2016
1. Let f be a relations from R+ to R with f defined as f (x) = x where R+
is the set of all positive real numbers and R is the set of all real number