Computer Programmer Interview Questions

Question 1 of 76

Insert in a sorted list.

***Note: We do not have professional answers for this career***
User Answers

15 Computer Programmer User Answer Examples

  1. 1.

    Insert in a sorted list.

  2. 2.

    What is a balanced tree?

  3. 3.

    What types of high speed CMOS circuits have you designed?

  4. 4.

    Under what circumstances can one delete an element from a singly linked list in constant time?

  5. 5.

    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.

  6. 6.

    What types of CMOS memories have you designed? What were their size? Speed? Configuration Process technology?

  7. 7.

    If I told you we were willing to invest $5 million in a start up of your choice, what business would you start? Why?

  8. 8.

    Are you willing to work overtime, nights, weekends?

  9. 9.

    Why is disk interleaving adopted?

  10. 10.

    What are various problems unique to distributed database?

  11. 11.

    Linked list manipulation.

  12. 12.

    Write C code for (a) deleting an element from a linked list (b) traversing a linked list.

  13. 13.

    What is the tradeoff between time spent in testing a product and getting into the market first.

  14. 14.

    For a bit manipulation C has some operators. Write a function rotate(m,n) that returns the value of integer m rotated to the right by n positions.

  15. 15.

    How would go about finding out where to find a book in a library. (You don't know how exactly the books are organized beforehand).

  16. 16.

    Write a routine that prints out a 2-D array in spiral order!

  17. 17.

    What is a far pointer (in DOS)?

  18. 18.

    Explain the operation considering a two processor computer system with a cache for each processor. What are the main issues associated with multiprocessor caches and how might you solve it?

  19. 19.

    How do you represent an n-ary tree? Write a program to print the nodes of such a tree in breadth first order.

  20. 20.

    Write a program to print a binary tree such that the root is printed in the middle of its left and right sub-trees.

  21. 21.

    What is the scope of a static function in C?

  22. 22.

    What is disk interleaving?

  23. 23.

    What do you test for given that there isn't enough time to test everything you want to?

  24. 24.

    What are the total number of lines written in C/C++? What is the most complicated/valuable program written in C/C++?

  25. 25.

    For a single computer processor computer system, what is the purpose of a processor cache and describe its operation?

  26. 26.

    A real life problem - A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.

  27. 27.

    If you could gather all of the computer manufacturers in the world together into one room and then tell them one thing that they would be compelled to do, what would it be?

  28. 28.

    Draw the graph with performance on one axis and 'n' on another, where 'n' in the 'n' in n-way disk interleaving. (a tricky question, should be answered carefully).

  29. 29.

    You have been assigned to design Bill Gates bathroom. Naturally, cost is not a consideration. You may not speak to Bill.

  30. 30.

    Be honest, do you really want this position? Why?

  31. 31.

    Write a function of factorial using C language.

  32. 32.

    Print an integer using only putchar. Try doing it without using extra storage.

  33. 33.

    Are you familiar with the term MESI?

  34. 34.

    Are you familiar with VHDL and/or Verilog?

  35. 35.

    Give a fast way to multiply a number by 7.

  36. 36.

    Describe the file system layout in the UNIX OS.

  37. 37.

    In UNIX, are the files allocated contiguous blocks of data?

  38. 38.

    Given a new disk, how do you determine which interleaving is the best a) give 1000 read operations with each kind of interleaving determine the best interleaving from the statistics?

  39. 39.

    What is a volatile variable?

  40. 40.

    What is the difference between 'malloc' and 'calloc'?

  41. 41.

    Given a singly linked list, determine whether it contains a loop or not.

  42. 42.

    Given a singly linked list, print out its contents in reverse order. Can you do it without using any extra space?

  43. 43.

    Given a binary tree with nodes, print out the values in pre-order/in-order/post-order without using any extra space.

  44. 44.

    What is the simples way to check if the sum of two unsigned integers has resulted in an overflow.

  45. 45.

    How do you use RSA for both authentication and secrecy?

  46. 46.

    Two capacitors are connected in a parallel through a switch. C1=1uF, C2=0.25uF. Initially the switch is open, C1 is charged to 10V. What happens if we close the switch?

  47. 47.

    Are you familiar with the term snooping?

  48. 48.

    Explain the difference between write through and write back cache.

  49. 49.

    Are you a team player?

  50. 50.

    Describe a finite state machine that will detect three consecutive coin tosses (of one coin) that results in heads.

  51. 51.

    Do you mind if I eat this delicious oreo blizzard right in front of you?

  52. 52.

    In what cases do you need to double clock a signal before presenting it to a synchronous state machine?

  53. 53.

    You have a driver that drives a long signal & connects to an input device. At the input device there is either overshoot, undershoot or signal threshold violations, what can be done to correct this problem?

  54. 54.

    Have you studied busses? What types?

  55. 55.

    Have you studied pipelining? List the 5 stages of a 5 stage pipeline. Assuming 1 clock per stage, what is the latency of an instruction in a 5 stage machine? What is the throughput of this machine?

  56. 56.

    What is the difference between = and == in C?

  57. 57.

    How many bit combinations are there in a byte?

  58. 58.

    What work have you done on a full chip Clock and Power distribution? What process technology and budgets were used?

  59. 59.

    What transistor level design tools are you proficient with? What types of designs were they used on?

  60. 60.

    What products have you designed that have entered high volume production? What was your role in the silicon evaluation/product ramp? What tools did you use?

  61. 61.

    If not into production, how far did you follow the design and why did it fail to make production?

  62. 62.

    In a X's and 0's game (i.e. TIC TAC TOE) if you write a program for this give a fast way to generate the moves by the computer. I mean this should be the fastest way possible.

  63. 63.

    Use recursion to write a function of factorial.

  64. 64.

    Write a function to reverse the words in a sentence, for example 'This is a test' becomes 'test a is This'.

  65. 65.

    You have a linked list. How can you tell that there is no cycling in it?

  66. 66.

    How would you write a program to search a file on the hard drive?

  67. 67.

    What is the difference between basic building blocks in C and C++?

  68. 68.

    For C++ developers the most frequent question is 'What is virtual distructor and when do you need to use it?

  69. 69.

    There is a sequence of random integers, for example 34, 12, -2, 0... Within this sequence you need to find a subsequence with the biggest sum of the numbers?

  70. 70.

    What operation will take longer time... to add two bytes? to add two floats? to add byte and float?

  71. 71.

    How do you convert a decimale number to binary (C, PERL)?

  72. 72.

    There are two integers a and b. How to exchange the contents of them without using a third one?

  73. 73.

    Give a one-line C expression to test whether a number is a power of 2. [No loops allowed - it's a simple test.

  74. 74.

    Given an array of characters which form a sentence of words, give an efficient algorithm to reverse the order of the words (not characters) in it.

  75. 75.

    Give a very good method to count the number of ones in a 'n' (e.g. 32) bit number.

  76. 76.

    Reverse a linked list.