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.


Please wait...

Interview Questions and Answers :: Brocade

Home > Experience Archives > Brocade > Interview Question Set 6
First Round (F-2-F) Second Round (F-2-F)
    Question :: 1
    Tell me about yourself.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 2
    Briefly explain about current project and about your role in it?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 3
    What is LLDP? Why do you need it?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 4
    How do you let a peer know about congestion? What is PAUSE frame?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 5
    Can you explain more about congestion notification?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 6
    He ask me to design like, if you had to write a protocol stack from scratch, than what will be your approach towards the design. Will you have any interface between the protocol and the hardware?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 7
    What are the major difference between process and threads? Do threads share memory space?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 8
    How do you store a routing table? What data structure would you use?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 9
    He give me scenario like if a routing table had 3 Billion routes, what approach would you use to display it?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 10
    Write a program to reverse the words in a string and print it.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 11
    Write the syntax of a pointer to a function with return type float taking two integer arguments.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 12
    Now he modified the question like write the syntax of a function pointer with return type float taking two integer arguments.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 13
    Write a function to display binary value of a decimal number

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 14
    Provide me a real time example, which you have used at work, of singly and doubly linked list. Explain your answer and why you prefer it.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 15
    What is the worst case time complexity of a binary search?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 16
    Why is the time complexity of binary search O (log n)?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

First Round (F-2-F) Second Round (F-2-F)