Note 1

Take Note:

Take a note while surfing.





Note With Ink

Give your Note a Colorful Tag.




Easy to Access

Stay on same information and in Sync wherever you are.

Note 2

Take Note:

Organize your information,It may take Shape.





Think With Ink

Differ your Content by Color.




Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3

Take Note:

Don't Let information to miss,Because it take shape





Note With Ink

Simple an Easy Way to take a note.




Easy to Access

Get the same in next visit.

Interview Questions and Answers :: Brocade

Home > Experience Archives > Brocade > Interview Question Set 7
First Round (F-2-F) Second Round (F-2-F) Third Round (F-2-F) First Round (F-2-F) Second Round (F-2-F) Third Round (F-2-F) First Round (F-2-F) Second Round (F-2-F) Third Round (F-2-F)
  • 1. N number of element("ab", "zb", "cd", "wx", "ab","gv","cd",..."ab", ...."cd") stored in a contagious memory. Element size is 2 byte character.
    Remove the alternate repeated elements(("ab", "zb", "cd", "wx", "--","gv","--",..."ab", ...."cd")).
    Write an algorithm should meat time complexity O(1) and space complexity constant.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 2. Reverse ever alternate node in a link list. mean List: 1->2->3->4->5->6-> after reverse 2->1->4->3->6->5->
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 3. Explain L2 Learning packets indication to CPU.
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 4. N step staircases are there where you can claim 1 or 2 step at time. How many possible way to reach you a top.
    Solution:
    > if N = 1 , Possible way(1) = 1
    > if N = 2 , Possible way(2) = (1,1) (2)
    > if N = 3 , Possible way(3) = (1,1,1) (2,1) (1,2)
    > if N = 4 , Possible way(5) = (1,1,1,1)(2,1,1) (1,2,1) (1,1,2) (2,2)
    > if N = 5 , Possible way(8) = (1,1,1,1,1) (2,1,1,1)(1,2,1,1) (1,1,2,1) (1,1,1,2) (2,2,1) (2,1,2) (1,2,2)
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

  • 5. How do you stop learning per VLAN bases? Where do you apply in pipeline?
  • Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!