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.

##### 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.

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

No Discussion on this question yet!
Tags:

Amdocs Accenture

Question :: 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

No Discussion on this question yet!
Tags:

No Tags on this question yet!

Question :: 3
Given an unsorted array and an item K, write a program to get kth largest element.

No Discussion on this question yet!
Tags:

No Tags on this question yet!

Question :: 4
Given a sorted array and an item k, write a program to get a pair of items whose subtraction equal to K.

No Discussion on this question yet!
Tags:

No Tags on this question yet!

Question :: 5
Write a program to delete a node in single linklist, if address of that node is given.

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
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.