Adobe Interview Questions and Answers for 2 years Experience
Home > Experience Archives > Adobe > Interview Question Set 1
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)
1 / 6
|
|
|
Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
Amdocs Accenture
2 / 6
temple, 1 priest have x number of flower and y flower in first temple, there is a pond that double the remaining flowers and again y flower in second temple and double the remaining flowers and after third temple priest have zero flower.
(A) tells values of x and y
(B) Generate equation to calculate x nad y and give nxt value.
(c) general equation for n number of temple and pond increment flower m number of times
|
|
|
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:
There will be three scenario, depending upon the address of node is given
1. if the node is head
2. if the node in middle or any position i.e one node is next to it.
3. if the given node is last node.
1. if the node is head
head = node->next;
free (node)
2. if the node in middle or any position i.e one node is next to it.
copy the next node information to given node and delete the next node.
node->data = node->next->data;
node->next=node->next->next;
free(node->next)
3. if the given node is last node.
In single linked list operation not possible.
There will be three scenario, depending upon the address of node is given
1. if the node is head
2. if the node in middle or any position i.e one node is next to it.
3. if the given node is last node.
1. if the node is head
head = node->next;
free (node)
2. if the node in middle or any position i.e one node is next to it.
copy the next node information to given node and delete the next node.
node->data = node->next->data;
node->next=node->next->next;
free(node->next)
3. if the given node is last node.
In single linked list operation not possible.
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!