Info View Practice Test

Transcription

1 Info View Practice Test Merge sort uses? [A] Divide and conquer strategy [C] Heuristic search [B] Backtracking approach [D] Greedy approach 2. The postfix expression for * + a b - c d is? [A] ab + cd - * [B] ab cd + - * [C] ab + cd * - [D] ab + - cd * 3. An IP address is a numeric quantity that identifies - [A] a network adapter to other devices on the network [B] the manufacturer of a computer [C] the physical location of a computer [D] none of the above 4. The memory address of fifth element of an array can be calculated by the formula a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memorycell for the array b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array c. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array d. None of above 5. Which of the following is not a limitation of binary search algorithm? a. must use a sorted array b. requirement of sorted array is expensive when a lot of insertion and deletions are needed c. there must be a mechanism to access middle element directly d. binary search algorithm is not efficient when the data elements are more than When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return a.faekcdbhg b. FAEKCDHGB c. EAFKHDCBG d. FEAKDCHBG 7. The in order traversal of tree will yield a sorted listing of elements of tree in a. Binary trees b. Binary search trees c. Heaps d. None of above 8. The depth of a complete binary tree is given by a. Dn = n log2n b. Dn = n log2n+1 c. Dn = log2n d. Dn = log2n+1 9. Which of the following data structure can't store the non-homogeneous data elements? a. Arrays b. Records c. Pointers d. None 10. Merging k sorted tables into a single sorted table is called... A. k way merging B. k th merge C. k+1 merge D. k-1 merge

2 11. If the number of record to be sorted large and the key is short, then... sorting can be efficient. A. Merge B. Heap C. Radix D. Bubble 12. P Sorting a file F usually refers to sorting F with respect to a particular key called... A. Basic key B. Primary key C. Starting key D. Index key 13. The postfix expression for * + a b - c d is? a. ab + cd - * b. ab cd + - * c.ab + cd * - d.ab + - cd * 14. A binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is? a.log2n b.n 1 c.n d.2n 15. The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is? A.3 B.9 C.7 D Which of the following is useful in traversing a given graph by breadth first search? [A] Stack [B] Set [C] List [D] Queue 17. Which of the following statement is true? [A] Optimal binary search tree construction can be performed efficiently using dynamicprogramming. [B] Breath first search cannot be used to find converted components of a graph. [C] Given the prefix and post fix walks over a binary tree.the binary tree cannot be uniquely constructe [D] Depth first search can be used to find connected components of a graph. 18. Given two sorted lists of size m and n respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be? [A] mn [B] max(m,n) [C] min(m,n) [D] m+n What is the result of the following operation Top (Push (S, X)) [A] X [B] null [C] s [D] none of these 20. Queue can be used to implement? [A] quick sort [B] merge sort [C] heap sort [D] insertion sort The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is? [A] 3 [B] 9 [C] 7 [D] Sparse matrices have? [A] no zero [B] many zero [C] higher dimenstion [D] none 23.. To represent hierarchical relationship between elements, Which data structure is suitable? A) Dequeue B) Priority C) Tree D) Graph

3 24. A... is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out. A) Queue linked list B) Stacks linked list C) Both of them D) Neither of them 25. Finding the location of the element with a given value is: a. Traversal b. Search c. Sort d. None of above 26. In Java, an abstract class cannot be sub-classed. a.true b.false 27. Which of these statements are not legal. Select the correct answers. A. int arr[][] = new int[5][5]; B. int[]arr[] = new int[5][5]; C. int[] arr = new int[5][]; D. int[] arr = new int[][5]; 28. What happens when the following code is compiled and run. Select the one correct answer. for(int i = 1; i < 3; i++) for(int j = 3; j >= 1; j--) assert i!=j : i;" The class compiles and runs, but does not print anything. A. The number 1 gets printed with AssertionError B. The number 2 gets printed with AssertionError C. The number 3 gets printed with AssertionError 29. Which is true about an anonymous inner class? A. It can extend exactly one class and implement exactly one interface. B. It can extend exactly one class and can implement multiple interfaces. C. It can implement multiple interfaces regardless of whether it also extends a class. 30. Which is true about a method-local inner class? A. It must be marked final. B. It can be marked abstract. C. It can be marked public. D. It can be marked static. 31. Which statement is true about a static nested class? A. You must have a reference to an instance of the enclosing class in order to instantiate it. B. It does not have access to nonstatic members of the enclosing class. C. It's variables and methods must be static. D. It must extend the enclosing class.

4 32. Which constructs an anonymous inner class instance? A. Runnable r = new Runnable() { }; B. Runnable r = new Runnable(public void run() { }); C. Runnable r = new Runnable { public void run(){}}; D. System.out.println(new Runnable() {public void run() { }}); 33. What is the value of "d" after this line of code has been executed? double d = Math.round ( Math.random() ); A. 2 B. 3 C. 4 D Which of the following would compile without error? A. int a = Math.abs(-5); B. int b = Math.abs(5.0); C. int c = Math.abs(5.5F); D. int d = Math.abs(5L); 35. What allows the programmer to destroy an object x? A. x.delete() B. x.finalize() C. Runtime.getRuntime().gc() D. Only the garbage collection system can destroy an object. 36. What will happen when you attempt to compile and run this code? public class MyMain { public static void main(string argv) { System.out.println("Hello world"); } } A. The compiler will complain that main is a reserved word and cannot be used for a class B. The code will compile and when run will print out "Hello world" C. The code will compile but will complain at run time that no constructor is defined D. The code will compile but will complain at run time that main is not correctly defined 37. Which of the following are not Java modifiers? A. public B. private C. friendly D. transient

5 38. Why might you define a method as native? A. To get to access hardware and language (c/c++) that Java does not know about B. To define a new data type such as an unsigned integer C. To write local method which can not be executed remotely D. To overcome the limitation of the private scope of a method 39. You want to loop through an array and stop when you come to the last element. Being a good java programmer and forgetting everything you ever knew about C/C++ you know that arrays contain information about their size. Which of the following can you use? A. myarray.length(); B. myarray.length; C. myarray.size D. myarray.size(); 40. How do you indicate where a component will be positioned using Flowlayout? A. North, South,East,West B. Assign a row/column grid reference C. Pass a X/Y percentage parameter to the add method D. Do nothing, the FlowLayout will position the component 41. How do you change the current layout manager for a container A. Use the setlayout method B. Once created you cannot change the current layout manager of a component C. Use the setlayoutmanager method D. Use the updatelayout method 42. Which of the following are not fields of the GridBagConstraints class? A. ipadx B.fill C.insets D.width 43. Which statements are correct about the anchor field? A. It is a field of the GridBagLayout manager for controlling component placement B. It is a field of the GridBagConstraints class for controlling component placement C. A valid setting for the anchor field is GridBagConstraints.SOUTH D. The anchor field controls the height of components added to a container 44. Is the following statement true or false? When using the GridBagLayout manager, each new component requires a new instance of the GridBagConstraints class. A. TRUE B.FALSE 45. Which most closely matches a description of a Java Map? A. A vector of arrays for a 2D geographic representation B. A class for containing unique array elements C. A class for containing unique vector elements D. An interface that ensures that implementing classes cannot contain duplicate keys