Phd IIT

Question

1 ) The length of the longest word that can be accepted by any DFA which satisfies the following two properties is ---(i)-----

i )  It has 4 states

ii )  It  does not  accept  any word of length 8 or 9 or 10 or 11 or 12 ?

2 )  A  1 Mbyte file needs to be transferred from computer A to computer B over a 1Mbps  link  with  a one way propagation delay of  10 ms. The total time taken to transfer  the file ( in sec ) is -----------

3 ) Assume  a  TCP  connection uses  packet  size 1kB  and it uses  slow  start to grow  the window . The number of RTTs  it takes  for the window size to exceed 4 MB is -----------------

Comments

vaibhav singh 3 sir 

post it as a question then you will get  better option 

---

sir i did not know brute force method if it is simple then tell me also

Brute force means, listing out all possibilites and check one by one, without any logic!

 

what is the length of the shortest string not in the language for regular expression 1*(0+10)*1*

for this question, check the strings of length 0, then length 1, then length 2,.... this type of solving we called Brute-Force.

 

i am looking for any other better option

in the exam, they give small examples only, where ever it takes too much time... one more method MK commented on the question !

---

@shaik masthan please explain the last part(question)?