JOB HUNTING AND INTERVIEWING (Business English): vacancies, CV and cover letter, interviews, evaluating results;

Following the acitities in the paper manual you go through all the steps of the hiring procedure from the stage of searching for the suitable vacancy or creating one to the stage of being hired and looking through necessary documentation with settling all vital questions and problems. While learning how to apply for a job the needed documentation is being written and sometimes during the interview stage you have a chance to be interviewed by native speakers from related fields. A lot of attention is paid to the interview procedure where you train to interview each other, prepare questions and practical tasks. Moreover, an interesting part of the interviewing process is connected with checking logical and abstract thinking, when one uses a lot of interesting logical and other difficult and non-typical interview questions and tasks.

TASK 1. In this part of the electronic manual you are to follow one of the links with the CV and you are to evaluate the chosen CV according to the information you know concerning the type, parts, style, dos and don'ts of the CV from the main manual for this English course (pages 75-93).

Links:

TASK 2. Have a look at the questions asked during a typical IT interview, try to think about your answers and choose three best questions and answer in audio form, send it to the teacher.


Logic questions

1. 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 ?
2. You're given an array containing both positive and negative integers and required to find the subarray with the largest sum (O(N) a la KBL). Write a routine in C for the above.
3. Given an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like.
4. 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.
5. How many points are there on the globe where by walking one mile south, one mile east and one mile north you reach the place where you started.
6. 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.
7. A version of the "There are three persons X Y Z, one of which always lies"..
8. There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner.. what is the probability that they don't collide.
9. If you are on a boat and you throw out a suitcase, Will the level of water increase.
10. There are 4 men who want to cross a bridge. They all begin on the same side. You have 17 minutes to get all of them across to the other side. It is night. There is one flashlight. A maximum of two people can cross at one time. Any party who crosses, either 1 or 2 people, must have the flashlight with them. The flashlight must be walked back and forth, it cannot be thrown, etc. Each man walks at a different speed. A pair must walk together at the rate of the slower mans pace.
Man 1:1 minute to cross; Man 2: 2 minutes to cross; Man 3: 5 minutes to cross; Man 4: 10 minutes to cross

11. You have 5 jars of pills. Each pill weighs 10 gram, except for contaminated pills contained in one jar, where each pill weighs 9 gm. Given a scale, how could you tell which jar had the contaminated pills in just one measurement?
12. One train leaves Los Angeles at 15 MPH heading for New York. Another train leaves from New York at 20mph heading for Los Angeles on the same track. If a bird, flying at 25mph, leaves from Los Angeles at the same time as the train and flies back and forth between the two trains until they collide, how far will the bird have traveled?
13. Imagine that you have 26 constants, labelled A through Z. Each constant is assigned a value in the following way: A = 1; the rest of the values equal their position in the alphabet (B corresponds to the second position so it equals 2, C = 3, etc.) raised to the power of the preceeding constant value. So, B = 2 ^ (A's value), or B = 2^1 = 2. C = 3^2 = 9. D = 4^9, etc., etc. Find the exact numerical value to the following equation:
(X - A) * (X - B) * (X - C) * ... * (X - Y) * (X - Z)

14. You have 12 balls. All of them are identical except one, which is either heavier or lighter than the rest - it is either hollow while the rest are solid, or solid while the rest are hollow. You have a simple two-armed scale, and are permitted three weighings. Can you identify the odd ball, and determine whether it is hollow or solid.


Programming questions that require thinking

1. Write a routine to draw a circle (x ** 2 + y ** 2 = r ** 2) without making use of any floating point computations at all.
2. Given only putchar (no sprintf, itoa, etc.) write a routine putlong that prints out an unsigned long in decimal.
3. Give a one-line C expression to test whether a number is a power of 2. [No loops allowed - it's a simple test.]
4. Give a very good method to count the number of ones in a 32 bit number. (caution: looping through testing each bit is not a solution).
5. What are the different ways to say, the value of x can be either a 0 or a 1.
36 I was given two lines of assembly code which found the absolute value of a number stored in two's complement form. I had to recognize what the code was doing.
7. Give a fast way to multiply a number by 7.
8. Write an efficient algo and C code to shuffle a pack of cards.. this one was a feedback process until we came up with one with no extra storage.
9. A real life problem - A square picture is cut into 16 sqaures and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.
10. Consider the base -2 representation of numbers. (-2 instead of usual +2). Give the condition for a number represented in this form to be positive? Also, if P(A, B) is a function that takes two 0-1 strings A,B in this representation, when can we say that P(A,B) returns the sum of these two numbers?
11. Given an expression tree with no parentheses in it, write the program to give equivalent infix expression with parentheses inserted where necessary.
12. Given a maze with cheese at one place and a mouse at some entrance, write a program to direct the mouse to cheese correctly. (Assume there is a path). Following primitives are given: moveforward, turnright, turnleft, iswall?, ischeese?, eatcheese.
13. Give me an algorithm and C code to find the subarray with the largest sum given an array containing both positive and negative integers.
14. Write a function that returns the factorial of a number.
15. Write a function that computes the nth number in the Fibonacci sequence.
16. Write an implementation of strlen().
17. Switch the integer values stored in two registers without using any additional memory.
18. Given two strings S1 and S2. Delete from S2 all those characters which occur in S1 also and finally create a clean S2 with the relevant characters deleted.
19. Write a small lexical analyzer - interviewer gave tokens. expressions like "a*b" etc.
20. Write a routine that prints out a 2-D array in spiral order!
21. How is the readers-writers problem solved? - using semaphores/ada .. etc.
22. Write code for reversing a linked list.
23. Write, efficient code for extracting unique elements from a sorted list of array. e.g. (1, 1, 3, 3, 3, 5, 5, 5, 9, 9, 9, 9) -> (1, 3, 5, 9).


Microsoft question

1. 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 ?
2. You're given an array containing both positive and negative integers and required to find the subarray with the largest sum (O(N) a la KBL). Write a routine in C for the above.
3. Given an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like.[I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
4. Write a routine to draw a circle (x ** 2 + y ** 2 = r ** 2) without making use of any floating point computations at all. [ This one had me stuck for quite some time and I first gave a solution that did have floating point computations ].
5. Given only putchar (no sprintf, itoa, etc.) write a routine putlong that prints out an unsigned long in decimal. [ I gave the obvious solution of taking % 10 and / 10, which gives us the decimal value in reverse order. This requires an array since we need to print it out in the correct order. The interviewer wasn't too pleased and asked me to give a solution which didn't need the array ].
6. Give a one-line C expression to test whether a number is a power of 2. [No loops allowed - it's a simple test.]
7. 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.
8. How many points are there on the globe where by walking one mile south, one mile east and one mile north you reach the place where you started.
9. Give a very good method to count the number of ones in a 32 bit number. (caution: looping through testing each bit is not a solution).
10. What are the different ways to say, the value of x can be either a 0 or a 1. Apparently the if then else solution has a jump when written out in assembly. if (x == 0) y=0 else y =x
11. (a-1) xor a == 0 - What does this do?
12. How can you print singly linked list in reverse order? (it's a huge list and you cant use recursion)
13. How can you find out if there is a loop in a very long list?
14. A character set has 1 and 2 byte characters. One byte characters have 0 as the first bit. You just keep accumulating the characters in a buffer. Suppose at some point the user types a backspace, how can you remove the character efficiently. ( Note: You cant store the last character typed because the user can type in arbitrarily many backspaces)
15. How would you reverse the bits of a number with log N arithmetic operations, where N is the number of bits in the integer (eg 32,64..)
16. Whats the simples way to check if the sum of two unsigned integers has resulted in an overflow.
17. Induction on i:1..n: Maintain the subarray with largest sum and suffix with largest sum and then update both after adding the i+1th element...
18. Sum of the numbers or copy i into A[i] so on till conflict.
19. Update deltaY while incrementing x. Have to multiply so that the deltay is not a floating pt number.
20. Find the largest 10**n less than given number, then div etc.
21. Infinite.
22. Shivku said this question is garbled thru ages.
23. reverse the pointers till you reach the end and print-and-reverse as you return.
24. Have two 'threads' one at twice the speed of the other traversing the list and see if at anytime they meet.
25. Scan the bytes backward till you reach one with the first bit set to 0. Now this is either a one byte character or the second byte of a two byte one. Either way it marks a Character boundary. Start from there an scan forward to find what the last character is.
26. Flip adjacent bits, then flip adjacent 2 bit sets, then 4-bits and so on. Each of this swap can be done in constant time using appropriate masks and shifts.
27. if (a+b) < a or (a+b) < b then overflow has occurred


Data structures and algorithms questions

1. Write a function and the node data structure to visit all of the nodes in a binary tree.
2. You know what a queue is .... Implement a queue class with Java. What is the cost of enqueue and dequeue? Can you improve this? What if the queue is full (I was using an looping array)? What kind of mechanism would you use to increase its size?
3. Give an algorithm that calculates the distance between two text strings (only operations you can have are: delete, add, and change, one by one).
4. Given the definition of a sequence (5 4 7 6 is, but 1 2 4 5 is not), write an algorithm to check if an arbitrary array is a sequence or not. Once I figured out a solution, I was asked to do a space and time complexity analysis.
5. Describe a situation where concurrent access would lead to inconsistency in your application. How would you solve this problem?
6. You are given a list of n numbers from 1 to n-1, with one of the numbers repeated. Devise a method to determine which number is repeated.
7. Write an algorithm to detect loop in a linked list.
8. Given the time, devise an algorithm to calculate the angle between the hour and minute hands of an analog clock.
9. Devise an algorithm for detecting whether a given string is a palindrome (spelled the same way forwards and backwards). For example, "A man, a plan, a canal, Panama."
10. Given an eight-bit bitmap graphics file, devise an algorithm to convert the file into a two-bit ASCII approximation.
11. Reverse a linked list.
12. Insert in a sorted list
13. First some definitions for this problem: a) An ASCII character is one byte long and the most significant bit in the byte is always '0'. b) A Kanji character is two bytes long. The only characteristic of a Kanji character is that in its first byte the most significant bit is '1'. Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
14. Delete an element from a doubly linked list.
15. Write a function to find the depth of a binary tree.
16. Assuming that locks are the only reason due to which deadlocks can occur in a system. What would be a foolproof method of avoiding deadlocks in the system.
17. Besides communication cost, what is the other source of inefficiency in RPC?
18. Ways of optimizing symbol table storage in compilers.
19. A walk-through through the symbol table functions, lookup() implementation etc - The interv. was on the Microsoft C team.
20. Given an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
21. Given an array of characters. How would you reverse it. ? How would you reverse it without using indexing in the array.
22. Given a sequence of characters. How will you convert the lower case characters to upper case characters. ( Try using bit vector - sol given in the C lib -> typec.h)
23. Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
24. Do a breadth first traversal of a tree.
25. Given a list of numbers ( fixed list) Now given any other list, how can you efficiently find out if there is any element in the second list that is an element of the first list (fixed list).
26. What is a balanced tree
27. How would you find a cycle in a linked list? Try to do it in O(n) time. Try it using a constant amount of memory.
28. Implement an algorithm to reverse a doubly linked list.
29. 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.
30. The Web can be modeled as a directed graph. Come up with a graph traversal algorithm. Make the algorithm non-recursive and breadth-first.
31. How would you implement a hash table ? How do you deal with collisions?
32. How would you find a cycle in a linked list? Try to do it in O(n) time. Try it using a constant amount of memory.
33. Given a history of URLs, how would you determine if a particular URL had been seen before?
34. Since pages can have multiple URLs pointing to them, how can you make sure you've never seen the same CONTENT before?
35. Write a function to print all of the permutations of a string.
36. Come up with the plan on how to traverse a graph, as well as to quickly determine if a given URL is one of the million or so you've previously seen.
37. The Web can be modeled as a directed graph. Come up with a graph traversal algorithm. Make the algorithm non-recursive and breadth-first.
38. Implement an algorithm to reverse a singly linked list. (with and without recursion)
39. Implement an algorithm to reverse a doubly linked list.
40. Implement an algorithm to insert in a sorted list.
41. Delete an element from a doubly linked list.
42. 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.
43. Implement an algorithm to sort an array.
44. Given a sequence of characters, how will you convert the lower case characters to upper case characters?
45. Write a routine that prints out a 2-D array in spiral order.
46. Count the number of set bits in a number without using a loop.
47. Give me an algorithm and C code to shuffle a deck of cards, given that the cards are stored in an array of ints. Try to come up with a solution that does not require any extra space.
48. 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.
49. How would you print out the data in a binary tree, level by level, starting at the top?
50. Given an array of characters which form a sentence of words, give an efficient algorithm to reverse the order of the words in it.
51. Write a function to find the depth of a binary tree.
52. Given a list of numbers ( fixed list) Now given any other list, how can you efficiently find out if there is any element in the second list that is an element of the first list (fixed list).
53. How would you implement a queue from a stack?
54. Write a funtion that finds repeating characters in a string.
55. Write a routine to reverse a series of numbers without using an array.


From CSRI

1. Write a function to check if two rectangles defined as below overlap or not.
2. struct rect {
3. int top, bot, left, right;
4. } r1, r2;
5. Write a program to print the elements of a very long linked list in ascending order. There may be duplicates in the list. You cannot modify the list or create another one. Memory is tight, speed is not a problem.
6. Write a function to reverse a singly linked list, given number of links to reverse.
7. Write a function to convert an int to a string.
8. Some weird problem on vector calculus with some transformation matrices being applied - need paper and pencil to describe it.
9. Given ships travel between points A and B, one every hour leaving from both ends (simultaneously), how many ships are required (minimum), if the journey takes 1hr 40 mts. How many ships does each ship encounter in its journey, and at what times?
10. Write a SetPixel(x, y) function, given a pointer to the bitmap. Each pixel is represented by 1 bit. There are 640 pixels per row. In each byte, while the bits are numbered right to left, pixels are numbered left to right. Avoid multiplications and divisions to improve performance.
11. How do you represent an n-ary tree? Write a program to print the nodes of such a tree in breadth first order.
12. Write the 'tr' program of UNIX. Invoked as
tr -str1 -str2.
It reads stdin and prints it out to stdout, replacing every occurance of str1[i] with str2[i]. eg.
tr -abc -xyz
to be and not to be <- input
to ye xnd not to ye <- output

C syntax, semantics and simple programming questions

1. What does the term cast refer to? Why is it used?
2. In arithmetic expressions, to what data type will the C compiler promote a character?
3. What is the difference between a statement and a block?
4. Increment the variable next three different ways.
5. How is a comment formed in C.
6. Can comments be nested?
7. From the standpoint of programming logic, what is the difference between a loop with the test at the top, and a loop where the test is at the bottom?
8. Specify the skeletons of two C loops with the test at the top.
9. Specify a C loop with the test at the bottom.
10. What is the switch statement?
11. What does a break statement do? Which control structures use it?
12. In a loop, what is the difference between a break and continue statement?
13. Where may variables be defined in C?
14. What is the difference between a variable definition and a variable declaration?
15. What is the purpose of a function prototype?
16. What is type checking?
17. To what does the term storage class refer?
18. List C's storage classes and what they signify.
19. State the syntax for the printf() and scanf() functions. State their one crucial difference with respect to their parameters.
20. With respect to function parameter passing, what is the difference between call-by-value and call-by-reference? Which method does C use?
21. What is a structure and a union in C?
22. Define a structure for a simple name/address record.
23. What does the typedef keyword do?
24. Use typedef to make a short-cut way to declare a pointer to the nameAddr structure above. Call it addrPtr.
25. Declare a variable with addrPtr called address.
26. Assuming the variable address above, how would one refer to the city portion of the record within a C expression?
27. What is the difference between: #include and #include "stdio.h"
28. What is #ifdef used for?
29. How do you define a constant in C?
30. Why can't you nest structure definitions?
31. Can you nest function definitions?
32. What is a forward reference?
33. What are the following and how do they differ: int, long, float and double?
34. Define a macro called SQR which squares a number.
35. Is it possible to take the square-root of a number in C. Is there a square-root operator in C?
36. Using fprintf() print a single floating point number right-justified in a field of 20 spaces, no leading zeros, and 4 decimal places. The destination should be stderr and the variable is called num.
37. What is the difference between the & and && operators and the | and || operators?
38. What is the difference between the -> and . operators?
39. What is the symbol for the modulus operator?
40. From the standpoint of logic, what is the difference between the fragment:
41. if (next < max)
42. next++;
43. else
44. next = 0;
and the fragment:
next += (next < max)? (1):(-next);

45. What does the following fragment do?
while((d=c=getch(),d)!=EOF&&(c!='\t'||c!=' '||c!='\b')) *buff++ = ++c;

46. Is C case sensitive (ie: does C differentiate between upper and lower case letters)?
47. Specify how a filestream called inFile should be opened for random reading and writing. the file's name is in fileName.
48. What does fopen() return if successful. If unsuccessful?
49. What is the void data type? What is a void pointer?
50. Declare a pointer called fnc which points to a function that returns an unsigned long.
51. Declare a pointer called pfnc which points to a function that returns a pointer to a structure of type nameAddr.
52. It is possible for a function to return a character, an integer, and a floating point number. Is it possible for a function to return a structure? Another function?
53. What is the difference between an lvalue and an rvalue?
54. Given the decimal number 27, how would one express it as a hexadecimal number in C?
55. What is malloc()?
56. What is the difference between malloc() and calloc()?
57. What kind of problems was C designed to solve?
58. write C code for deleting an element from a linked listy traversing a linked list efficient way of elimiating duplicates from an array
59. Declare a void pointer
60. Make the pointer aligned to a 4 byte boundary in a efficient manner
61. What is a far pointer (in DOS)
62. Write an efficient C code for 'tr' program. 'tr' has two command line arguments. They both are strings of same length. tr reads an input file, replaces each character in the first string with the corresponding character in the second string. eg. 'tr abc xyz' replaces all 'a's by 'x's, 'b's by 'y's and so on.
63. Write C code to implement strtok() 'c' library function.
64. Implement strstr(), strcpy(), strtok() etc
65. Reverse a string.
66. Given a linked list which is sorted, how will you insert in sorted way.
67. Write a function that allocates memory for a two-dimensional array of given size (parameter x & y)
68. Write source code for printHex(int i) in C/C++
69. Write a function that finds the last instance of a character in a string.


C++ syntax, semantics and concepts questions

1. What is an object in C++?
2. What is a message?
3. What is a class?
4. What is an instance?
5. What is a super-class?
6. What is inheritance?
7. To what does message protocol refer?
8. What is polymorphism?
9. What are instance variables?
10. What are class variables?
11. What is a method?
12. In C++ what is a constructor? A destructor?
13. Compare and contrast C and C++.
14. What is operator overloading?
15. What is cin and cout?
16. Contrast procedural and object oriented programming.
17. How do you link a C++ program to C functions?
18. Explain the scope resolution operator.
19. What are the differences between a C++ struct and C++ class?
20. How many ways are there to initialize an int with a constant?
21. How does throwing and catching exceptions differ from using setjmp and longjmp?

22. What is a default constructor?
23. What is a conversion constructor?
24. What is the difference between a copy constructor and an overloaded assignment operator?
25. When should you use multiple inheritance?
26. What is a virtual destructor?
27. Explain the ISA and HASA class relationships. How would you implement each in a class design?
28. When is a template a better solution than a base class?
29. What is the result of compiling this program in a C compiler? in a C++ compiler?
30. int __ = 0;
31. main() {
32. int ___ = 2;
33 printf("%d\n", ___ + __);
34. }

35. What is the difference between C and C++ ? Would you prefer to use one over the other ?
36. What are the access privileges in C++ ? What is the default access level ?
37. What is data encapsulation ?
38. What is inheritance ?
39. What is multiple inheritance ? What are it's advantages and disadvantages ?
40. What is polymorphism?
41. What do the keyword static and const signify ?
42. How is memory allocated/deallocated in C ? How about C++ ?
43. What is UML ?
44. What is the difference between a shallow copy and a deep copy ?
45. What are the differences between new and malloc?
46. What is the difference between delete and delete[]?
47. What are the differences between a struct in C and in C++?
48. What are the advantages/disadvantages of using #define?
49. What are the advantages/disadvantages of using inline and const?
50. What is the difference between a pointer and a reference?
51. When would you use a pointer? A reference?
52. What does it mean to take the address of a reference?
53. What does it mean to declare a function or variable as static?
54. What is the order of initalization for data?
55. What is name mangling/name decoration?
56. What kind of problems does name mangling cause?
57. How do you work around them?
58. What is a class?
59. What are the differences between a struct and a class in C++?
60. What is the difference between public, private, and protected access?
61. For class CFoo { }; what default methods will the compiler generate for you>?
62. How can you force the compiler to not generate them?
63. What is the purpose of a constructor? Destructor?
64. What is a constructor initializer list?
65. When must you use a constructor initializer list?
66. What is a: Constructor? Destructor? Default constructor? Copy constructor? Conversion constructor?
67. What does it mean to declare a... member function as virtual? member function as static? member varible as static? destructor as static?
68. Can you explain the term "resource acqusition is initialization?"
69. What is a "pure virtual" member function?
70. What is the difference between public, private, and protected inheritance?
71. What is virtual inheritance?
72. What is placement new?
73. What is the difference between operator new and the new operator?
74. What is exception handling?
75. Explain what happens when an exception is thrown in C++.
76. What happens if an exception is not caught?
77. What happens if an exception is throws from an object's constructor?
78. What happens if an exception is throws from an object's destructor?
79. What are the costs and benefits of using exceptions?
80. When would you choose to return an error code rather than throw an exception?
81. What is a template?
82. What is partial specialization or template specialization?
83. How can you force instantiation of a template?
84. What is an iterator?
85. What is an algorithm (in terms of the STL/C++ standard library)?
86. What is std::auto_ptr?
87. What is wrong with this statement? std::auto_ptr ptr(new char[10]);
88. It is possible to build a C++ compiler on top of a C compiler. How would you do this?
89. What output does the following code generate? Why? What output does it generate if you make A::Foo() a pure virtual function?
90. What output does this program generate as shown? Why?
91. C++ ( what is virtual function ? what happens if an error occurs in constructor or destructor. Discussion on error handling, templates, unique features of C++. What is different in C++, ( compare with unix).
92. I was given a c++ code and was asked to find out the bug in that. The bug was that he declared an object locally in a function and tried to return the pointer to that object. Since the object is local to the function, it no more exists after returning from the function. The pointer, therefore, is invalid outside.


Questions for ANSI-Knowledgeable Applicants

1. What is a mutable member?
2. What is an explicit constructor?
3. What is the Standard Template Library?
4. Describe run-time type identification.
5. What problem does the namespace feature solve?
6. Are there any new intrinsic (built-in) data types?


Design

1. Draw a class diagram (UML) for a system. (They described the system in plain english).
2. Which do you prefer, inheritance or delegation? Why?
3. What is the difference between RMI and IIOP?


Java questions

1. http://www.javaprepare.com/quests/question.html


Misc. Questions (Design pattern, HTTP, OOP, SQL)

1. What's the difference between SQL, DDL, and DML?
2. What's a join? An inner join? An outer join?
3. Describe HTTP.
4. What's a design pattern?
5. Can you explain the singleton, vistor, facade, or handle class design pattern?
6. When you do an ls -l, describe in detail everything that comes up on the screen.
7. Tell me three ways to find an IP address on a Unix box.
8. Write a bubble sort.
9. Write a linked list.
10. Describe an object.
11. What does object-oriented mean to you.
12. Can you explain what a B tree is?
13. What's the difference between UDP and TCP?
14. What is ICMP?
15. What's the difference between a stack and a Queue?
16. Do you know anything about the protection rings in the PC architecture?
17. How much hardware/Assembler/Computer Architecture experience do you have.
18. Explain final, finalize, and finally. When the finalize is invoked? How does GC work? etc.
19. What is your experience with Servlet and JSP?
20. What is the Prototype design pattern?
21. In a system that you are designing and developing, a lot of small changes are expected to be committed at the end of a method call (persisted to the DB). If you don't want to query the database frequently. what would you do?
22. Give an example in which you will combine several design patterns, and explain how the system can benefit from that.
23. Why would you apply design patterns (benefits)?
24. What is a two-phase commit?
25. What will happen if one of your web-server or appserver crashs during its execution?
26. What are various problems unique to distributed databases
27. Describe the file system layout in the UNIX OS
28. what is disk interleaving
29. why is disk interleaving adopted
30. given a new disk, how do you determine which interleaving is the best
31. give 1000 read operations with each kind of interleaving determine the best interleaving from the statistics
32. draw the graph with performace on one axis and 'n' on another, where 'n' in the 'n' in n-way disk interleaving. (a tricky question, should be answered carefully)
33. Design a memory management scheme.
34. What sort of technique you would use to update a set of files over a network, where a server contains the master copy.


General questions

1. How did you get into computer science?
2. What kind of technical publications (print or online) do you read on a regular basis?
3. What was the last book you read (does not have to be job related!)
4. If you could recommend one resource (book, web site, etc.) to a new software developer just out of school, what would it be?
5. What was the most interesting project that you worked on?
6. What was the most challenging project that you worked on?
7. If you could have any job in the world, what would it be?
8. Tell me about your favorite class.
9. Tell me about your favorite project [with lots of follow-up questions].
10. Tell me about a something you did that was unsuccessful, a project or class that didn't go well.
11. Do you prefer a structured or unstructured working environment.
12. A chemist calls you up and says his Netscape isn't working. What's wrong and how do you find out?
13. How do you prioritize multiple projects?
14. Tell me about previous jobs?
15. What are your greatest strengths and weaknesses?
16. Tell us about yourself.
17. Where would you like to be in five years?
18. How do you see yourself fitting in to this company?
19. Do you have any questions for me?
20. Why did you leave your last job.
21. Did you finance your own education?
22. Are you good with people?
23. Have you experience working on a group project?
24. How well do you know the windows menus?
25. What was the hardest program error for you to find and correct?
26. What did you find hardest when working with others in a project?
27. What is a tool or system that you learned on your own? i.e. not in a class room?
28. As a developer, would you prefer to use application server? Why?
29. 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).
30. Tradeoff between time spent in testing a product and getting into the market first.
31. What to test for given that there isn't enough time to test everything you want to.
32. Why do u think u are smart.
33. Questions on the projects listed on the Resume.
34. Do you want to know any thing about the company.( Try to ask some relevant and interesting question).
35. How long do u want to stay in USA and why?
36. What are your geographical preference?
37. What are your expectations from the job.