Latest MIT Fresher Jobs Interview
Paper Pattern: 23 March 2011
Company Name: Mit
Type: Fresher, Job Interview
Interview Paper Pattern.
Q 1. Which of the following is true?
A O(1) < O(n) < O(log n) < O(n log n) < O(n2 )
B O(1) < O(log n) < O(n) < O(n2) < O(n log n)
C O(1) < O(n) < O(n log n) < O(log n) < O(n2 )
D O(1) < O(log n) < O(n log n) < O(n2)
Q 2. The ideal data structure to handle backtracking is?
D Linked list
Q 3. Which of the following sorting algorithms does not have worst case running time of O(n2) ?
A Merge Sort
B Quick Sort
C Bubble Sort
D Insertion Sort
Q 4. The following operations are performed on a stack :
push(10), push(20), pop, push(10), push(20), pop, pop, pop, push(20),pop. The sequence of values popped out are
A 20, 10, 20, 10, 20
B 20, 20, 10, 10, 20
C 10, 20, 20, 10, 20
D 20, 20, 10, 20, 10
Q 5. In a memory system, read access takes 100 ns and write access takes 80 ns. If 60% of the access requests are reads, what is the average access time of the memory ?
A 3 ns
B 92 ns
C 108 ns
D 88 ns
Q 6. Which one of the following is the most suitable data structure for applications involving frequent additions and deletions of data elements ?
C Linear lists
D Linked list
Q 7. Consider the C language code given below.
a = b;
b = -46;
b = -23;
*a = -34;
What are the values of b, b at the end.
A -34, -24
B -46, -22
C -34, -22
D -46, -23
Q 8. Which of the following shell variable is used to return the process ID of the current shell?
Q 9. The system call that is key to multitasking in UNIX is:
Q 10. When a binary tree is traversed in preorder and inorder, the labels of the nodes are printed as below.
Preorder : A B C D E F G H
In order : B C A E G F D H
In what order the nodes appear if the same binary is traversed in post-order?
Option A C B G F E H D A
B C B E G F H D A
C C B F G E D H A
D Can’t be decided unless tree representation is given