Brocade Interview Questions and Answers for 7 years Experience
Home > Experience Archives > Brocade > Interview Question Set 7
Accenture
Adobe
Alcatel-Lucent
Alten Calsoft Lab
Amazon
Amdocs
Aricent
Arris
Broadcom Ltd
Brocade
CA Technologies
Capgemini
Cavium Networks
CenturyLink
Ciena
Cisco
Citrix
Cognizant
Comcast
CSC (DXC Technology)
Dell EMC
Deloitte
EFI
Ericsson
Extreme Network
Genpact
Gigamon
Global Edge
GlobalLogic
Goldman Sachs
Happiest Minds
HCL Technologies
Hewlett Packard Enterprise
IDS Infotech
Incedo
Infinite C S
IpInfusion
J.P. Morgan
Juniper Network
L&T Technology Services
MindTree
MosChip Semiconductor
NEC Technologies
NIIT Technologies
OLA
One Access
PayPal
Paytm
Qualcomm
Radisys
Redeem Software
Reliance Jio
Rolta India Limited
Samsung
Sasken
Siemens
Synopsys
Tavant Technologies
TCS
Tech Mahindra
Viasat
Wipro
XiLinx
C (37)
C++ (0)
DBMS (1)
Soft. Engineering (0)
Python (0)
Finite Automata (0)
SQL (55)
Java (24)
.NET (0)
WebMethod (0)
EDI (0)
Informatica (0)
Oracle Apps HRMS (0)
Operating System (17)
Data Structure (19)
PHP (0)
Unica (8)
Oracle Apex (7)
HR Question in TR (32)
Networking (56)
Hadoop (0)
HTML (0)
Oracle PLSQL (0)
DPDK (Data Plane Development Kit) (1)
Programming Qs. in TR (0)
First Round (F-2-F)
Second Round (F-2-F)
Third Round (F-2-F)
1 / 5
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
2 / 5
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
3 / 5
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
4 / 5
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
5 / 5
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
1 / 6
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
2 / 6
10
6 15
3 8 12 18
output:|------------------------------|
|-> 3->6->8->10->12->15->18----|
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
3 / 6
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
4 / 6
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
5 / 6
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
6 / 6
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
1 / 5
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!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
2 / 5
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
3 / 5
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
4 / 5
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!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
5 / 5
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!