Related InterviewSolutions

• Which of the following statement is false?(A) A tree with n nodes has (n-1) edges.(B) A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results.(C) A complete binary tree with n internal nodes has (n+1) leaves.(D) The maximum number of nodes in a binary tree of height h is (2^(h+1) -1).
• Let A be a two dimensional array declared as follows:A: array [1 ... 10] [1 ... 15] of integer;Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location 100, what is the address of the element a[i][j] ?(A) 15i+ j+ 84(B) 15j+ i+ 84(C) 10i+ j+ 89(D) 10j+ i+ 89
• A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?(A) 6(B) 5(C) 4(D) 3
• Suppose we have a database consisting of the following three relations.FREQUENTS(student, parlor) giving the parlors each student visits.SERVES(parlor, ice-cream) indicating what kind of ice-creams each parlor serves.LIKES(student, ice-cream) indicating what ice-creams each parlor serves.(Assuming that each student likes at least one ice-cream and frequents at least one parlor)Express the following in SQL:Print the students that frequent at least one parlor that serves some ice-cream that they like.
• The string 1101 does not belong to the set represented by(A) 110* (0+1)(B) 1(0+1)* 101(C) (10)* (01)* (00+11)*(D) (00+(11)*0)*
• Let L be the set of all binary strings whose last two symbols are same. The number of states in the minimal state deterministic finite-state automaton accepting L is(A) 2(B) 5(C) 8(D) 3
• Which of the following is true?(A) Unless enabled, a CPU will not be able to process interrupts.(B) Loop instructions cannot be interrupted till they complete.(C) A processor checks for interrupts before executing a new instruction.(D) Only level triggered interrupts are possible in microprocessors.
• Design a synchronous counter to go through the following states:1, 4, 2, 3, 1, 4, 2, 3, 1, 4,………..
• Which of the following statement is false?(A) Every finite subset of a non-regular set is regular(B) Every subset of a regular set is regular(C) Every finite subset of a regular set is regular(D) The intersection of two regular sets is regular
• Which of the following algorithm design technique is used in finding all pairs of shortest distances in a graph?(A) Dynamic programming(B) Backtracking(C) Greedy(D) Divide and Conquer