Description : ……………… clause is an additional filter that is applied to the result. A) Select B) Group-by C) Having D) Order by
Last Answer : C) Having
Description : …………….. is the complex search criteria in the where clause. A) Substring B) Drop Table C) Predict D) Predicate
Last Answer : D) Predicate
Description : State weather the following statement is true or false for EJB. 1. EJB exists in the middle-tier 2. EJB specifies an execution environment 3. EJB supports transaction processing A) 1-true, 2. true, 3. true B) 1- ... false, 3. true C) 1- false, 2- false, 3- false D) 1-true, 2-true, 3-false
Last Answer : A) 1-true, 2. true, 3. true
Description : In XML, DOCTYPE declaration specifies to include a reference to ............ file. (A) Document Type Definition (B) Document Type Declaration (C) Document Transfer Definition (D) Document Type language
Last Answer : (A) Document Type Definition
Description : Which one of the following statements is incorrect ? (A) Pareto analysis is a statistical method used for analyzing causes, and is one of the primary tools for quality management. (B) Reliability of ... (D) In white-box testing, the test cases are decided from the specifications or the requirements.
Last Answer : (D) In white-box testing, the test cases are decided from the specifications or the requirements.
Description : System.in.read() is being used, the program must specify the .................. clause. A) throws.java.out.IOException B) throws.java.in.IOException C) throws.java.io.IOException D) throws.java.io.InException
Last Answer : C) throws.java.io.IOException
Description : In snapshot, …………………. clause tells oracle how long to wait between refreshes. A) Complete B) Force C) Next D) Refresh
Last Answer : D) Refresh
Description : ‘AS’ clause is used in SQL for (A) Selection operation. (B) Rename operation. (C) Join operation. (D) Projection operation.
Last Answer : (B) Rename operation.
Description : Which one of the following is true? (A) The resolvent of two Horn clauses is not a Horn clause. (B) The resolvent of two Horn clauses is a Horn Clause. (C) If we resolve a negated goal G against a ... negated goal G against a fact or rule A to get clause C then C has positive literal or null goal.
Last Answer : (B) The resolvent of two Horn clauses is a Horn Clause.
Description : Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query
Last Answer : (B) PROLOG is a Strongly Typed Language.
Description : A horn clause is ...................... (A) A clause in which no variables occur in the expression (B) A clause that has at least one negative literal (C) A disjunction of a number of literals (D) A clause that has at most one positive literal
Last Answer : (D) A clause that has at most one positive literal
Description : Which of the following is characteristic of an MIS? (A) Provides guidance in identifying problems, finding and evaluating alternative solutions, and selecting or comparing alternatives. (B) Draws on ... Has as its goal the efficiency of data movement and processing and interfacing different TPS.
Last Answer : (B) Draws on diverse yet predictable data resources to aggregate and summarize data.
Description : Discuss the significance of having clause with group by statement with suitable example. -Technology
Last Answer : Sometimes we do not want to see the whole output produced by a statement with Group By clause. We want to see the output only for those groups which satisfy some condition. It means we want ... the total amount of all type of transactions, it will only display the total of credit transactions only.
Description : The employee information of an Organization is stored in the relation: Employee (name, sex, salary, deptname) Consider the following SQL query Select deptname from Employee Where sex = M' ... D) Average salary of male employees in a department is more than average salary of the organization.
Last Answer : (D) Average salary of male employees in a department is more than average salary of the organization.
Description : The STUDENT information in a university is stored in the relation STUDENT (Name, Sex, Marks, DEPT_Name) Consider the following SQL Query SELECT DEPT_Name from STUDENT where SEX='M' group by ... The average marks of students is more than the average marks of male students in the University
Last Answer : (B) The average marks of male students is more than the average marks of the students in the University
Description : Consider the following ORACLE relations: R(A,B,C) = {, , , , ,< 3,1,4>} S(B,C,D) = {, , , , } Consider the following two SQL queries SQ1 and SQ2: SQ1: SELECT R.B, AVG(S.B) FROM R, S WHERE R.A = S.C AND S.D ... tuples returned by SQ2 then (A) M=4, N=2 (B) M=5, N=3 (C) M=2, N=2 (D) M=3, N=3
Last Answer : (A) M=4, N=2
Description : What is the difference between linear and binary search?
Last Answer : A: Linear search does not require the array to be sorted, whereas, binary search requires that the array be sorted. Linear search checks for the search item in a linear fashion from the beginning cell till the end, ... tell what is control variable in your loop. So if your loop is for(int i = 1; i
Description : When does Binary search fail?
Last Answer : A: When the array is not sorted.
Description : In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1
Last Answer : D) [log2n]+1
Description : State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True
Last Answer : D) True, True
Description : In ……………, search start at the beginning of the list and check every element in the list. A) Linear search B) Binary search C) Hash Search D) Binary Tree search
Last Answer : A) Linear search
Description : The number of comparisons done by sequential search is ……………… A) (N/2)+1 B) (N+1)/2 C) (N-1)/2 D) (N+2)/2
Last Answer : B) (N+1)/2
Description : Match the following. a) Completeness i) How long does it take to find a solution b) Time Complexity ii) How much memory need to perform the search. c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in ... , b-ii, c-iii C) a-iii, b-i, c-ii D) a-i, b-iii, c-ii
Last Answer : C) a-iii, b-i, c-ii
Description : A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called A) AVL tree B) Red-black tree C) Lemma tree D) None of the above
Last Answer : A) AVL tree
Description : The ..................... is essentially used to search for patterns in target string. A) Like Predicate B) Null Predicate C) In Predicate D) Out Predicate
Last Answer : A) Like Predicate
Description : The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search
Last Answer : (B) Constraint satisfaction
Description : Which one of the following is not an informed search technique? (A) Hill climbing search (B) Best first search (C) A* search (D) Depth first search
Last Answer : (D) Depth first search
Description : Given an open address hash table with load factor a < 1, the expected number of probes in a successful search is (A) Atmost 1/α ln (1-α/α) (B) Atmost 1/α ln (1/1-α) (C) Atleast 1/α ln (1/1-α) (D) Atleast 1/α ln (α/1-α)
Last Answer : (B) Atmost 1/α ln (1/1-α)
Description : In alpha-beta pruning, ............... is used to cut off the search at maximizing level only and ................. is used to cut off the search at minimizing level only. (A) alpha, beta (B) beta, alpha (C) alpha, alpha (D) beta, beta
Last Answer : (B) beta, alpha
Description : ................ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. (A) Best first search (B) Goal stack planning (C) Alpha-beta pruning procedure (D) Min-max search
Last Answer : (C) Alpha-beta pruning procedure
Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm
Last Answer : (C) Greedy best first search algorithm
Description : Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can't cause right path to be ... Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above
Last Answer : (C) Dynamic programming principle can be used to discard redundant partial paths.
Description : What does the following command do? grep −vn abc x (A) It will print all of the lines in the file x that match the search string abc (B) It will print all of the lines in file x that do not ... (D) It will print the specific line numbers of the file x in which there is a match for string abc
Last Answer : (A) It will print all of the lines in the file x that match the search string “abc”
Description : The average case occurs in the Linear Search Algorithm when: (A) The item to be searched is in some where middle of the Array (B) The item to be searched is not in the array (C) The item to be searched is in the last of the array (D) The item to be searched is either in the last or not in the array
Last Answer : (A) The item to be searched is in some where middle of the Array
Description : Level order Traversal of a rooted Tree can be done by starting from root and performing: (A) Breadth First Search (B) Depth first search (C) Root search (D) Deep search
Last Answer : (A) Breadth First Search
Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)
Last Answer : (D) (a), (b) , (c) and (d)
Description : The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)
Last Answer : Answer: D
Description : In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp. It shows which of the following depth first forest? (A ... {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}
Last Answer : Answer: A
Description : Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, ... 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364
Last Answer : (C) 926, 203, 912, 241, 913, 246, 364
Description : Consider the following binary search tree: If we remove the root node, which of the node from the left subtree will be the new root? (A) 11 (B) 12 (C) 13 (D) 16
Last Answer : (D) 16
Description : The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is (A) O(lg n) (B) O(n lg n) (C) O(n) (D) O(n2 )
Last Answer : (C) O(n)
Description : What is the best method to go for the game playing problem? (1) Optimal Search (2) Random Search (3) Heuristic Search (4) Stratified Search
Last Answer : (3) Heuristic Search
Description : Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)
Last Answer : (2) O(log n)
Description : In a paging system, it takes 30 ns to search translation Look-aside Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70%, the effective memory access time is: (1) 48 ns (2) 147 ns (3) 120 ns (4) 84 ns
Last Answer : Answer: 2
Description : Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) ... used to find the components of a graph. (1) A (2) B (3) C (4) D
Description : The order of a leaf node in a B+ tree is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ............ (1) 16 (2) 63 (3) 64 (4) 65
Last Answer : Answer: All
Description : Which of the following condition is true for an object used as a function argument. i) A copy of the entire objects is passed to the function. ii) Only the address of the object is transferred to the function. A) Only i B) Only ii C) Both i and ii D) None of them
Last Answer : C) Both i and ii
Description : To accept 100 different values into the array we require A) Loop B) If condition C) Function D) Structure
Last Answer : A) Loop
Description : …………… is a condition in which there is a set of concurrent processes, only one of which is able to access a given resource or perform a given function at any time. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation
Last Answer : A) Mutual Exclusion
Description : Match the following mechanisms for interrupting the execution of a process and their uses. i) Interrupt a) Call to an operating system function ii) Trap b) Reaction to an asynchronous external event iii) Supervisor Call c) Handling of a error ... -a, iii-b C) i-b, ii-c, iii-a D) i-a, ii-c, iii-b
Last Answer : C) i-b, ii-c, iii-a