HCL Technologies Interview Questions and Answers for 5 years Experience
Home > Experience Archives > HCL Technologies > Interview Question Set
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)
Second Round (Telephonic)
1 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
2 / 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 / 18
|
|
|
Answer:
RB-Trees are, as well as AVL trees, self-balancing. Both of them provide O(log n) lookup and insertion performance.
In respect to searching AVL tree is efficient then Red-Black Tree because they are more rigidly balanced.. The path from the root to the deepest leaf in an AVL tree is at most ~1.44 lg(n+2), while in red black trees it's at most ~2 lg (n+1).
But if your application required frequent insertions and deletions, then Red Black trees should be preferred over AVL tree.
RB-Trees are, as well as AVL trees, self-balancing. Both of them provide O(log n) lookup and insertion performance.
In respect to searching AVL tree is efficient then Red-Black Tree because they are more rigidly balanced.. The path from the root to the deepest leaf in an AVL tree is at most ~1.44 lg(n+2), while in red black trees it's at most ~2 lg (n+1).
But if your application required frequent insertions and deletions, then Red Black trees should be preferred over AVL tree.
Please Login First :
Tags:
No Tags on this question yet!
4 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
5 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
6 / 18
struct
{
unsigned int x;
unsigned int y;
char d;
char p;
unsigned int z;
}
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
7 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
8 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
9 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
10 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
11 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
12 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
13 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
14 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
15 / 18
A) When both host are in same subnet.
B) When Host are in different subnet.
C) What if replace both router to switch explain scenario (A) and (B).
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
16 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
17 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
18 / 18
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
- HCL Technologies Interview Question Set 1
- HCL Technologies Interview Question Set 2
- HCL Technologies Interview Question Set 3
- HCL Technologies Interview Question Set 4
- HCL Technologies Interview Question Set 5
- HCL Technologies Interview Question Set 6
- HCL Technologies Interview Question Set 7
- HCL Technologies Interview Question Set 8
- HCL Technologies Interview Question Set 9
- HCL Technologies Interview Question Set 10