Write the code/algorithm for function "int* minChangeMac(int cents, int* cDenoms, int* cCounter)" where minChangeMac converts cents into elements of cDenoms and returns a pointer to an array cCounter such that sum of elements in cCounter array is the minimum possible number. example 1: if cents = 56 and cDenoms = [25, 10, 5, 1] then cCounter = [2, 0, 1, 1] example 2: if cents = 31 and cDenoms = [25, 10, 1] then cCounter should be [0, 3, 1] and not [1, 0, 6]

This topic is not about answering a question ... instead it is about discussing various ways in which any of this questions can be tackled! And guys for your info its not an Home Work Assignment ... They are just some topics I found! And btw Nobody needs to discuss about all ... if you CAN dare to discuss any one of them, thats more than enough

Data Structures 1. Which case you will use an array / Linked list? 2. Find the second maximum in an array? (Fastest way / better methodology) 3. How many comparisons you need to find second maximum? 4. How does a Binary search work? 5. How will you merge these two arrays? Write the program Array: A 1 18 22 43 Array: B 3 4 6 20 34 46 55 Output Array: C 1 3 4 6 18 20 22 34 43 46 55 6. How do u create Hashtable in C? 7. What is hash collision? 8. What is the output of the following c program #define calc(x) { 2*x} a=2; b=3; printf calc(a+b); printf calc(b+a); 9. Algo to find the 2nd max value in an array. 10. What is the difference between signed int and unsigned int? 11. Consider a singular link list with ‘N’ elements. One of the nodes doesn’t point to the next consecutive node instead it points to some other node in the beginning, thus leading into an infinite loop. How will you detect that there was an infinite loop and find the node that lead to the infinite loop. 12. Consider two stacks; Stack A and Stack B. Implement a Queue using these 2 stacks. (Need to implement Push & Pull) 13. Under what circumstances can one delete an element from a singly linked list in constant time? 14. Given a singly linked list, determine whether it contains a loop or not. 15. Given a singly linked list, print out its contents in reverse order. Can you do it without using any extra space? ANS. Start reversing the list. Do this again, printing the contents. 16. Given a binary tree with nodes, print out the values in pre-order/in-order/post-order without using any extra space. 17. Reverse a singly linked list recursively. The function prototype is node * reverse (node *) ; 18. Given a singly linked list, find the middle of the list. HINT. Use the single and double pointer jumping. Maintain two pointers, initially pointing to the head. Advance one of them one node at a time. And the other one, two nodes at a time. When the double reaches the end, the single is in the middle. This is not asymptotically faster but seems to take less steps than going through the list twice. 19. Given a rectangular (cuboidal for the puritans) cake with a rectangular piece removed (any size or orientation), how would you cut the remainder of the cake into two equal halves with one straight cut of a knife ? 20. You're given an array containing both positive and negative integers and required to find the sub-array with the largest sum (O(N) a la KBL). Write a routine in C for the above. 21. Given an array

Thanks for the help!

No ... I found these questions somewhere on the web!

Can someone please answer the below questions? :confused: Thanks in advance!: ===== 1. How do you ensure data consistency with mulitple threads. 2. How do you implement a single linked with multiple threads accessing and updating the same. What are the different ways to do it. What is best for performance? 3. Write code for inserting into singly linked list, taking into consideration that multiple threads can call the same function concurrently. ======= 1. Implement Singleton design pattern. 2. Update the above code keeping in mind the multiple threads can use this class. 3. And change the solution such a way that we get best performance. 4. Discuss algorithm and write code for reversing the words in a string. 5. Come up with an algorithm for the above problem such a way that we don't use extra space. ============ 1. If there is a string with only characters 'a' & 'b' in it and given a decode pattern as below aaa - 1 aba - 2 bbb - 3 Create a new string from the input string and above pattern in which all the instances of pattern above would be replaced with the appropriate decode value in the new string. For example, if the input string is aaaababbbaa the output would be 123aa. 2. Networking questions. Difference between TCP, UDP and why should one use UDP. 3. What is multicast. 4. How does data send and receive work in UDP. How much data can application send at one shot with UDP and how does it work with TCP?

Thanks for your timely help Laxman!:)

Thanks for your help Kumar! Today I got some new things to learn!

Can one of you please post frequently asked Interview questions (with answers) for Multithreaded programming in C++/VC++ Thanks in advance!

Hi, I am trying write a generic dll/component in VC++ that could add a skin functionality to any application. For example Win Xp SKins, Vista Skins, etc. For applications that may also run on mobile devices. I am not sure where/how to start! Thanks! http://www.appface.com

Hi There, I am working on a project where I have a standalone desktop application written in VC7. This app can also be embedded into other applications through the OCX control of this app. Now I also have a test app written in VB8 which embedds the Ocx control. I have everything in place up and running. Now I want to add a functionality to my OCX control to enable/disable Right Click. I am stuck in here and not able to move forward. Plz Help Me! Thanks in Advance ... Aryan