TCS Company

22-24 QUESTIONS ARE FROM M4MATHS...
thanks m4maths.
becoz of u i am placed in tcs

Read Solution (Total 3)

singhkaushik86@gmail.com
12 years agoHelpfull: Yes(0) No(0)

plz send me those quest and ans to my id:sampathms89@gmail.com
12 years agoHelpfull: Yes(0) No(0)
pls snd those questions to my mail yalamarthyrajitha@gmail.com
12 years agoHelpfull: Yes(0) No(0)

TCS Other Question

got placed...4 ques were from dis site...thanks to m4... Consider an equilateral triangle of side length n, which is divided into unit triangles, as
shown. Let f(n) be the number of paths from the triangle in the top row to the middle
triangle in the bottom row, such that adjacent triangles in our path share a common
edge and the path never travels up (from lower row to a higher row) or revisits a
triangle. An example of one such path is illustrated below for n = 5. Determine the
value of f(2005)