Jump to content
Urch Forums

widespread

Members
  • Posts

    6
  • Joined

Converted

  • My Tests
    No

widespread's Achievements

Newbie

Newbie (1/14)

1

Reputation

  1. hi tanviwell 1200 in fine scorewhat i can say is that if u are able to crack >750 in agre and take my word u are thru top 20 univ with a possible schol tooso prepare for 4 nov and besteezping me if u have any doubtsbyies
  2. @pavel beut great man congrats may u too achieve the same feat let god be with u cheers
  3. @pavaulbaut and pankaj man u people have sone serious knowledge well starting off , i am not able to figure out how u poeple are majking those recursions (T(1)......) , if u could plz tell how areu generalizing it it willbe a great helpwell regarding the 1 st qustion the code is right as it is only asked bout the probabiltywelll @ pankaj chawla , how did u deduce that formula (1*1(n+1)........) , couldnt get it well thanks guys for the help u really sorted out my problemscheers
  4. no dude never heard that but wait tilll other people pour in reveiws
  5. 12) In Bubble Sort for(i=0; i if A > A[i+1] swap the 2 Find the probability that an exchange will take place during the i th pass. a) n/2 b) 1/(i+1) c) i/(i+1) d) 1/i how are these question solved?????????? 10 and 13 10) S->A A->AA | 0 How many derivations of 00000 possible a) 5 b) 14 c) 24 d) 29 e) 54 13) Find the number of 10 digit sequences belonging to { 0,1}* such that each sequence starts with 01 and/or ends with 01 a) 512 b) 448 c) 478 11) Which will increase most slowly as n --> infinity a) n raised to 5/4 b) n raised to (1+ 16/log n) c) n raised to (1+2/sqrt(log n)) d) n(log n) / log n*log n what is the fast methods to prove a regular grammar like this one because the one pumping lemma is very difficult to prove ???????(Q 15) 15) A = { 0^n 1^m | n which option are incorrect i) A U B is regular ii) A intersection B is regular iii) Both A and B are regular a) i only b) ii only c) iii only d) i & ii only e) i & iii only and if anybody plz tell me which good book to refer for automata i nedd that desperately cheers
  6. 12) In Bubble Sort for(i=0; i if A > A[i+1] swap the 2 Find the probability that an exchange will take place during the i th pass. a) n/2 b) 1/(i+1) c) i/(i+1) d) 1/i how are these question solved?????????? 10 and 13 10) S->A A->AA | 0 How many derivations of 00000 possible a) 5 b) 14 c) 24 d) 29 e) 54 13) Find the number of 10 digit sequences belonging to { 0,1}* such that each sequence starts with 01 and/or ends with 01 a) 512 b) 448 c) 478 11) Which will increase most slowly as n --> infinity a) n raised to 5/4 b) n raised to (1+ 16/log n) c) n raised to (1+2/sqrt(log n)) d) n(log n) / log n*log n what is the fast methods to prove a regular grammar like this one because the one pumping lemma is very difficult to prove ???????(Q 15) 15) A = { 0^n 1^m | n which option are incorrect i) A U B is regular ii) A intersection B is regular iii) Both A and B are regular a) i only b) ii only c) iii only d) i & ii only e) i & iii only and if anybody plz tell me which good book to refer for automata i nedd that desperately cheers
×
×
  • Create New...