case 1-429-946
May 13, 2010
Better Place: Charging into the Future?
In the fall of 2009 Shai Agassi was hoping that his success would continue. As the CEO and founder of
Better Place, Agassi had bet the family farm on widespread adoption of electric vehic
mm mm - in 1mm bum
N'IDVJ J'I WT :TIS'USJH 2010 N WDDKJD 687-2-5631 :UTIPTI Dn
137!) 3w :s'lN'Wi'ITI 51TH)!
mvnb nmwnn 53 by 1mm man 1351: by may: 0mm mam .mmns mt-mv mm m: 1mm :mtm
lmpmm
121w A4 391 nwwbwbt m3 nwrm; ms mamas my "mom 0w man: ]v_z~: .vxm e
Annexure 2
B.TECH COMPUTER SCIENCE & ENGINEERING
STUDY EVALUATION SCHEME
Summarized Scheme
Semester
L
T
P
CREDITS
TOTAL
MARKS
I
19
2
9
23
1150
II
16
3
9
20
1000
III
17
4
10
22
1100
IV
16
1
10
21
1050
V
17
2
10
24
1200
VI
17
1
10
24
1200
VII
15
0
8
21
1050
A Song of Ice and Fire
The Hedge Knight
A Tale of the Seven Kingdoms
GEORGE R. R. MARTIN
T
he spring rains had softened the ground, so Dunk had no trouble digging the grave. He chose
a spot on the western slope of a low hill, for the old man had always lo
A Song of Ice and Fire
The Sworn Sword
A Tale of the Seven Kingdoms
GEORGE R. R. MARTIN
I
n an iron cage at the crossroads, two dead men were rotting in the summer sun.
Egg stopped below to have a look at them. Who do you think they were, ser? His
mule Ma
A Song of Ice and Fire
The Mystery Knight
A Tale of the Seven Kingdoms
GEORGE R. R. MARTIN
A
light summer rain was falling as Dunk and Egg took their leave of Stoney Sept.
Dunk rode his old warhorse Thunder, with Egg beside him on his spirited young
palfr
CSE 2001: Introduction to the theory of computation
Assignment 5 (Released Dec 3, 2013)
Question 1
Prove that the following language is undecidable.
CF LT M = cfw_ M |M is a TM and L(M ) is a CFL
Solution:
We assume for the sake of contradiction that CF L
CSE 2001: Introduction to the theory of computation
Assignment 1 (Released Sept 12, 2013)
Question 1
Let L1 , L2 be languages over some alphabet . For each pair of languages below, say if they
are equal or if one is a subset of the other. Give reasons.
1.
CSE 2001: Introduction to the theory of computation
Assignment 3 (Released Oct 29, 2013)
Submission deadline: 3:45 pm (in the dropbox) or 4 pm (in class), Nov 7, 2013
Question 1
Prove that the following language over = cfw_a, b is not regular:
L1 = cfw_am
CSE 2001, Fall 2013
Assignment 2: Solutions
Question 1
[4 points] Suppose = cfw_a, b. Design a DFA for the language containing all words over that
begin and end with the same letter. Explain your design or argue it is correct.
Solution: We assume that is
CSE 2001: Introduction to the theory of computation
Assignment 1 (Released Sept 12, 2013)
Submission deadline: 3:45 pm (in the dropbox) or 4 pm (in class), September 26, 2012
1. The assignment can be handwritten or typed. It MUST be legible.
2. You must d
CSE 2001: Introduction to the theory of computation
Assignment 4 (Released Nov 21, 2013)
Submission deadline: 12 noon (in the dropbox or by email), Nov 29, 2013
Question 1
Ist the following language context-free? Is its complement context-free? Prove your
CSE 2001 First test - version 2
Fall 2013
Oct 17, 2013
Instructor: S. Datta
1. (2 points) Draw a DFA or NFA that accepts the language consisting of all words over the alphabet = cfw_0, 1
ending in 01 or 00. Add one or two sentences to your drawing to expl
CSE 2001 Second test - version 1
Fall 2013
November 19, 2013
Instructor: S. Datta
1. (4 points) Prove that the following language over = cfw_a, b is not regular.
L1 = cfw_ban ban |n = 1, 2, . . .
Solution:
Assume, for the sake of obtaining a contradiction
CSE 2001 First test - version 1
Fall 2013
Oct 17, 2013
Instructor: S. Datta
1. (2 points) Draw a DFA or NFA that accepts the language consisting of all words over the alphabet = cfw_0, 1
ending in 11 or 10. Add one or two sentences to your drawing to expl
CSE 2001 Second test - version 2
Fall 2013
November 19, 2013
Instructor: S. Datta
1. (3 points) Design a context-free grammar (CFG) for the following language over = cfw_a, b
L6 = cfw_am bn |m, n 0, m = 3n or n = 3m
Solution:
The CFG for L6a = cfw_am bn |
CSE 2001: Introduction to the theory of computation
Assignment 2 (Released Oct 3, 2013)
Submission deadline: 3:45 pm (in the dropbox) or 4 pm (in class), October 15, 2012
1. The assignment can be handwritten or typed. It MUST be legible.
2. You must do th
CSE 2001: Introduction to the theory of computation
Assignment 5 (Released Dec 3, 2013)
1. The assignment can be handwritten or typed. It MUST be legible.
2. You must do this assignment individually.
3. Submit this assignment only if you have read and und
CSE 2001: Introduction to the theory of computation
Assignment 4 (Released Nov 21, 2013)
Submission deadline: 12 noon (in the dropbox or by email), Nov 29, 2013
1. The assignment can be handwritten or typed. It MUST be legible.
2. You must do this assignm
CSE 2001: Introduction to the theory of computation
Assignment 3 (Released Oct 29, 2013)
Submission deadline: 3:45 pm (in the dropbox) or 4 pm (in class), Nov 7, 2013
1. The assignment can be handwritten or typed. It MUST be legible.
2. You must do this a