does anyone know which programming language is used to make applications like those used in shops and malls where the sales assistant will enter name of a product and all its details will come up and whn someone makes a purchase the details will go to a database , i need to know which language is used and also which platform is used ,thanks in advance
Notice from electric ink:
Please read the rules. The What Is..? forum is for answering a common question or telling everybody about what interesting fact you learnt today. Warned and moved.
Implement a Queue using a stack. No restriction on space complexity. One possible Solutions a
costly procedure... 1. Use a temp stack 2. Insertion into queue - Push the element into the
original stack 3. Deletion from queue - Pop all the elements from stack into a temp stack
- pop out the first element from the temp stack - pop all the remaining elements back to the
original stack What is a queue? QUOTE A queue is a particular kind of collection in which
the entities in the collection are kept in order and the principal (or only) operation....
A binary tree having a loop is known as a threaded binary tree. Have a look at the attachment to
have an idea of a threaded binary tree.... A's right child is B and B's left child is A.
Write an algorithm to find out whether the given tree is a threaded binary tree. Look for time
and space complexity.....
Construct an expression tree for the expression (a || /cool.gif" style="vertical-align:middle"
emoid="B)" border="0" alt="cool.gif" /> && (c || d) After constructing the tree convert the tree to
correspond to the associative property of the given expression. Eg: (1 + 2) * ( 3 + 4) = (1 * 3) +
(1 * 4) + (2 * 3) + (2 * 4) Similar to that, from the constructed expression tree, construct a new
expression tree such that inorder traversal of the new tree will be associative value of the given
expression Inorder traversal of the new tree should be (a && c) || (a && d) || (....
Given an array of elements with many numbers occurring even number of times and two numbers
occurring odd number of times. Find out the two numbers that occur odd number of times. example:
Elements in array -- 14433446 The expected result is 1 and 6 One solution 1. Find max of the
array 2. Hash Function : element/max value 3. Repeat to all elements... 4. Find frequency... yo will
get the 2 elements with odd frequency. but this is not the optimal.... Do find more solutions to
this and post it. Look for time and space complexity. Another Solution one more s....
Consider a string with any number of elements occurring any number of time. Rearrange the string
in such a way that the alphabet with most occurrence occurs in the followed by the next most
occurring alphabet and so on... It should also be seen that the alphabets should occur frequency
number of times. Example: Input : abcdaeghzabcdbhb Output : bbbbaaaccddhhegz ....
Given two singly linked lists with both of them merging at some point. Find the position at which
they merge. Eg: 1->30->50->65->2->59 88->46->65->2->59
The above two linked lists merge at 65. Find this node where they merge.. Question
Courtesy: Antony(Friend) One possible Answer A simple answer would be to find the length of
both the linked lists and have two pointers, one for each linked list. Move (difference in lengths)
steps in the longer linked lists and then start moving both the pointers by one every t....
Write an algorithm to check whether a given string is palindrome or not in time complexity O(n)
What is a palindrome?? QUOTE A palindrome is a word, phrase, number or other sequence of units
that has the property of reading the same in either direction (the adjustment of punctuation and
spaces between words is generally permitted). Composing literature in palindromes is an example of
constrained writing. The word "palindrome" was coined from Greek roots palin
(πάλιν; "back") and dromos (δρóμος; "way,
direction") by....
Give an algorithm to reverse a linked list with a time complexity of O(n) and minimal space
complexity. What is a linked list? Search trap17.com. i Have already answered this question in
one of my older questions. Solution 1 Here is one simple solution... CODE Void
ReverseList(node* head) { node *temp,*current,*result; temp=null; result=null;
current=head; while(current!=null) { temp=current->next;
current->next=result; result=current; current=temp; } head=result;
The above was suggested by m....
Given two binary trees, find out whether a tree is structurally same to the other. Structurally same
means that the two trees look alike or a tree looks alike a subtree of the other tree. Look for
time and space complexity. Some more for readers What is a binary tree? QUOTE A binary
tree is made of nodes, where each node contains a "left" pointer, a "right" pointer, and a data
element. The "root" pointer points to the topmost node in the tree. The left and right pointers
recursively point to smaller "subtrees" on either side. A null pointer represents a binary....
Given a linked list, find the 5th last element with Time complexity O(n) and minimal space
complexity. Note: If you know the answer and if you feel it is simple also please post the
answers so that others will come to know about the answers. What is a linked list?? /* this is for
your further reference and reading */ QUOTE In computer science, a linked list is one of the
fundamental data structures, and can be used to implement other data structures. It consists of a
sequence of nodes, each containing arbitrary data fields and one or two references ("links") po....
Given a binary tree, write an algorithm to find its mirror image with minimal time and space
complexities. Note: If you know the answer and if you feel it is simple also please post the
answers so that others will come to know about the answers. This question was sent by my friend
through mail. Solutions Suggested Sol 1 CODE void PrintMirror(node *root) {
if(node!=NULL) PrintMirror(root->right); Printf(root->data);
PrintMirror(root->left); } In case of implementation using array 2i+1 stores left child
of ith node and 2i+2 store....
Question 1 Reply the solutions if you have any so that we can discuss... Given an array of n
elements (containing only positive numbers) and sum, X. Find the first two elements in the array
that sum upto X eg: Array of elements - {2, 3,1000, 200, 51, 88, 29, 49, 65, 40, 98, 12, 3}
Sum - 100. The answer for the above sample is 51, 49. There are other possiblities
also, but the first two numbers summing upto the given sum, 100 should be taken. How will you do
this with minimal space and time complexities? Question 2 Given two nodes of ....
Hello, I'm currently developing a social-networking site in ColdFusion and several aspects of
the site require me to return a limited number of records for display (e.g. displaying the last 3
news items in the left-hand column on the front page, etc.). I currently only have a small SQL
"cheet sheet" and what my ColdFusion reference book tells me, and I cannot find anything anywhere
about limiting the data returned from a SELECT statement to the last X number of records. Any help
is appreciated! Thanks, zeeman48....
After U.S. students earlier this month made their worst showing in the 29-year history of the ACM
International Collegiate Programming Contest, Patterson and others are wondering whether the United
States does enough to encourage programming talent. The top U.S. school finished in a tie for 17th
place. Students from China's Shanghai Jiao Tong University took the top honors, continuing a
gradual ascendance of Asian and Eastern European schools during the past decade or so. The last time
a U.S. institution won the world championship was in 1997. whole story at cnet ....
Posting here, because it seemed the best place for it. If you do some programming yourself you
might want to check out this site, it's really quite funny: http://www.99-bottles-of-beer.net//
It has 621 variants of a program that writes the song "99 bottles of beer", in loads of different
programming languages. Everything from PHP to Java (OO variant) to Fromage . I think the Java
one is funny, it's OO to the extreme /tongue.gif" style="vertical-align:middle" emoid=":P"
border="0" alt="tongue.gif" /> Also check out Whitespace, that's always a nice ....
Looking for data, collecting, program, found, registers
