STREET TECH BOYS

🔘 Components Required 1)Arduino Mega Board 2)Wheels 3)Geared Motors 4)Bread Board 5)Motor Driver 5) 5 IR sensors 6)Jumper Wires 7)Wheel We use IR sensor for detecting robot path Line sensors IR sensor active =1(when white color) IR sensor deactivate=0(when black color) consider five IR sensors 01111      = line off to left 10111      = line little to left 11011      = middle of the line 11101      = line little to right 11110      = line off to right 🔘 intersection and turn handling 1) turning left and turning right Get IR sensors read if (read=11000)      turn right if (read=00011)      turn left 2) T junction or Four way How to decide where it is "T" or "FOUR way" 👀??? ➧when  all sensors are  become "11111" ➧then we can give one inch move to robot ➧after we can read IR sensors   if  ("00000"

Generally,network base on their  geographical span.It can be as small as distance between your mobile phone and its Bluetooth headphone and as large as the internet itself, covering the whole geographical world.  Personal Area Network A Personal Area Network (PAN) is smallest network which is very personal to a user. This may include Bluetooth enabled devices or infra-red enabled devices. PAN has connectivity range up to 10 meters. PAN may include wireless computer keyboard and mouse, Bluetooth enabled headphones, wireless printers, and TV remotes.  Local Area Network(LAN) A computer network spanned inside a building and operated under single administrative system is generally terned as . Local Area Network(LAN) .Usually, LAN covers an organization offices, schools, colleges or universities. Number of systems connected in LAN may vary from as least as two to as much as 16 million. LAN provides a useful way of sharing the resourc

Boyer Moore String Search Algorithm Boyer-Moore string search algorithm was developed by Robert S. Boyer and J Strother Moore in 1977. Concept of Boyer-Moore Algorithm Scan From right to left Bad character rule Good Suffix shift rule There is a preprocess in this algorithm. It's create a table with last occurrence of  pattern characters Example :                  Pattern : a b a c a b                               0 1 2 3 4 5                                     Table Note: If character not in pattern ,                                                T[i] = -1 Look at the table and find the last occurrence  "a" ( T[i] )   "j" is index of character in pattern compare with text.  if  T[i] < j   is true shift by   j - T[i] else if T[i] < j  is false Then shift by one. else if T[i] = -1  Then shift by while whole pattern pass that character.   Pattern : a b a c a b   Text : a b a c a a b a d a c a b