Computer Algorithms Data structures

20. Write routines to manage a heap using an existing array.

21. Implement an algorithm to take an array and return one with only unique elements in it.

22. Implement an algorithm that takes two strings as input, and returns the intersection of the two, with each letter represented at most once. Now speed it up. Now test it.

23. Given that you are receiving samples from an instrument at a constant rate, and you have constant storage space, how would you design a storage algorithm that would allow me to get a representative readout of data, no matter when I looked at it? In other words, representative of the behavior of the system to date.

24. Implement an algorithm to print out all files below a given root node.

25. Given that you are receiving samples from an instrument at a constant rate, and you have constant storage space, how would you design a storage algorithm that would allow me to get a representative readout of data, no matter when I looked at it? In other words, representative of the behavior of the system to date.

26. How would you find a cycle in a linked list?

27. Give me an algorithm to shuffle a deck of cards, given that the cards are stored in an array of ints.

28. The following asm block performs a common math function, what is it?
cwd xor ax, dx
sub ax, dx

29. Imagine this scenario:
I/O completion ports are communictaions ports which take handles to files, sockets, or any other I/O. When a Read or Write is submitted to them, they cache the data (if necessary), and attempt to take the request to completion. Upon error or completion, they call a user-supplied function to let the users application know that that particular request has completed. They work asynchronously, and can process an unlimited number of simultaneous requests. Design the implementation and thread models for I/O completion ports. Remember to take into account multi-processor machines.

30. Write a function that takes in a string parameter and checks to see whether or not it is an integer, and if it is then return the integer value.

31. Write a function to print all of the permutations of a string.

32. Write a function to print the Fibonacci numbers.

33. Write a function to copy two strings, A and B. The last few bytes of string A overlap the first few bytes of string B.

34. How would you write qsort?

35. How would you print out the data in a binary tree, level by level, starting at the top?