Interview Questions and Answers :: Adobe
Home > Experience Archives > Adobe > Interview Question Set 1
First Round (F2F)
1. Write a program to convert Fahrenheit to centigrade and test that program and tell an exact value to test all most all scenario.



Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
Amdocs Accenture
2. There were two puzzle, I am not able to to recall second one.
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
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. Given an unsorted array and an item K, write a program to get kth largest element.



Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
4. Given a sorted array and an item k, write a program to get a pair of items whose subtraction equal to K.



Answer:
No Discussion on this question yet!
No Discussion on this question yet!
Please Login First :
Tags:
No Tags on this question yet!
5. Write a program to delete a node in single linklist, if address of that node is given.



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. Write a Program to sort the number 100001110101 in one traverse.



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